asd

LiveArchive/WhosTheBoss.cpp

@@ -44,8 +44,11 @@ typedef long double ld;
 const int MAXN = 300010;
 int T, M, Q, id, sal, ta;
 vector<int> graph[MAXN];
+
 int parent[MAXN] = {-1};
-map<int, int> i_id, id_i;
+
+int i_id[MAXN];
+int id_i[MAXN];
 
 int dp[MAXN];
 
@@ -69,27 +72,51 @@ struct employee {
     }
 };
 
-vector<employee> ve;
+employee ve[MAXN];
+
+inline void fastRead_int(int &x) {
+    register int c = getchar_unlocked();
+
+    x = 0;
+
+    int neg = 0;
+
+    for (; ((c<48 || c>57) && c != '-'); c = getchar_unlocked());
+
+    if (c=='-') {
+        neg = 1;
+        c = getchar_unlocked();
+    }
+
+    for ( ; c>47 && c<58 ; c = getchar_unlocked()) {
+        x = (x<<1) + (x<<3) + c - 48;
+    }
+
+    if (neg) {
+        x = -x;
+    }
+}
 
 int main(void) {
-    scanf("%d", &T);
-    for( ; T-- ; ) {
-        scanf("%d%d", &M, &Q);
-        ve.clear();
-        i_id.clear();
-        i_id.clear();
+    fastRead_int(T);
+    for( ; T-- ; ) {
+        fastRead_int(M);
+        fastRead_int(Q);
+
         REP(i, M) {
             graph[i].clear();
             parent[i] = -1;
         }
-        REP(i, M) {
-            scanf("%d%d%d", &id, &sal, &ta);
+        REP(i, M) {
+            fastRead_int(id);
+            fastRead_int(sal);
+            fastRead_int(ta);
             i_id[i] = id;
             id_i[id] = i;
-            ve.push_back(employee(i, sal, ta));
+            ve[i] = employee(i, sal, ta);
         }
 
-        sort(ve.begin(), ve.end());
+        sort(ve, ve + M);
 
         int root = ve[0].id;
         for(int i = 1; i < M; i++) {
@@ -102,8 +129,8 @@ int main(void) {
             }
         }
         dfs(root);
-        REP(i, Q) {
-            scanf("%d", &id);
+        REP(i, Q) {
+            fastRead_int(id);
             id = id_i[id];
             int boss = parent[id], go = dp[id]-1;
             boss = i_id[boss];

SPOJPL/DQuery.cpp

@@ -0,0 +1,86 @@
+#include <iostream>
+#include <string>
+#include <sstream>
+#include <vector>
+#include <set>
+#include <map>
+#include <list>
+#include <queue>
+#include <stack>
+#include <memory>
+#include <iomanip>
+#include <numeric>
+#include <functional>
+#include <new>
+#include <algorithm>
+#include <cmath>
+#include <cstring>
+#include <cstdlib>
+#include <cstdio>
+#include <climits>
+#include <cctype>
+#include <ctime>
+
+#define REP(i, n) for(int (i) = 0; i < n; i++)
+#define FOR(i, a, n) for(int (i) = a; i < n; i++)
+#define FORR(i, a, n) for(int (i) = a; i <= n; i++)
+#define for_each(q, s) for(typeof(s.begin()) q=s.begin(); q!=s.end(); q++)
+#define sz(n) n.size()
+#define pb(n) push_back(n)
+#define all(n) n.begin(), n.end()
+
+template<typename T> T gcd(T a, T b) {
+    if(!b) return a;
+    return gcd(b, a % b);
+}
+template<typename T> T lcm(T a, T b) {
+    return a * b / gcd(a, b);
+}
+
+template<typename T> void chmin(T& a, T b) { a = (a > b) ? b : a; }
+template<typename T> void chmax(T& a, T b) { a = (a < b) ? b : a; }
+int in() { int x; scanf("%d", &x); return x; }
+
+using namespace std;
+
+typedef long long Int;
+typedef unsigned uint;
+
+const int MAXN = 30002;
+int N, Q;
+int arry[MAXN];
+
+int tree[4 * MAXN];
+
+void build(int node, int l, int r) {
+    if (l > r) {
+        return;
+    } else if (l == r) {
+        tree[node] = arry[l];
+    } else {
+        int m = (l + r) / 2;
+
+        build(2 * node, l, m);
+        build(2 * node + 1, m + 1, r);
+
+        tree[node] =
+    }
+}
+
+int main(void) {
+    N = in();
+
+    for (i = 0; i < N; i++) arry[i] = in();
+
+    build(1, 0, N - 1);
+
+    Q = in();
+
+    for ( ; Q--; ) {
+        a = in();
+        b = in();
+
+
+    }
+    return 0;
+}

SPOJPL/MaximumSum.cpp

@@ -0,0 +1,154 @@
+#include <iostream>
+#include <string>
+#include <sstream>
+#include <vector>
+#include <set>
+#include <map>
+#include <list>
+#include <queue>
+#include <stack>
+#include <memory>
+#include <iomanip>
+#include <numeric>
+#include <functional>
+#include <new>
+#include <algorithm>
+#include <cmath>
+#include <cstring>
+#include <cstdlib>
+#include <cstdio>
+#include <climits>
+#include <cctype>
+#include <ctime>
+
+#define REP(i, n) for(int (i) = 0; i < n; i++)
+#define FOR(i, a, n) for(int (i) = a; i < n; i++)
+#define FORR(i, a, n) for(int (i) = a; i <= n; i++)
+#define for_each(q, s) for(typeof(s.begin()) q=s.begin(); q!=s.end(); q++)
+#define sz(n) n.size()
+#define pb(n) push_back(n)
+#define all(n) n.begin(), n.end()
+
+template<typename T> T gcd(T a, T b) {
+    if(!b) return a;
+    return gcd(b, a % b);
+}
+template<typename T> T lcm(T a, T b) {
+    return a * b / gcd(a, b);
+}
+
+template<typename T> void chmin(T& a, T b) { a = (a > b) ? b : a; }
+template<typename T> void chmax(T& a, T b) { a = (a < b) ? b : a; }
+int in() { int x; scanf("%d", &x); return x; }
+
+using namespace std;
+
+typedef long long Int;
+typedef unsigned uint;
+
+const int MAXN = 100003;
+
+const int INF = 1010110;
+
+struct data {
+    int a, b;
+
+    data() {
+
+    }
+
+    data(int _a, int _b) {
+        a = _a;
+        b = _b;
+    }
+};
+
+int N, Q;
+int arry[MAXN];
+data tree[4 * MAXN];
+
+data combine(data a, data b) {
+    data ans;
+
+    int as[4] = {a.a, a.b, b.a, b.b}; sort(as, as + 4);
+
+    ans.a = as[3];
+    ans.b = as[2];
+
+    return ans;
+}
+
+void build(int node, int l, int r) {
+    if (l == r) {
+        tree[node] = data(arry[l], 0);
+    } else {
+        int m = (l + r) / 2;
+
+        build(2 * node, l, m);
+        build(2 * node + 1, m + 1, r);
+
+        tree[node] = combine(tree[2 * node], tree[2 * node + 1]);
+    }
+}
+
+int ans;
+
+data query(int node, int l, int r, int bound_l, int bound_r) {
+    if (bound_l > bound_r) {
+        return data(-INF, -INF);
+    } else if (l >= bound_l && r <= bound_r) {
+        return tree[node];
+    } else {
+        int m = (l + r) / 2;
+
+        data a = query(2 * node, l, m, bound_l, min(m, bound_r));
+        data b = query(2 * node + 1, m + 1, r, max(m + 1, bound_l), bound_r);
+
+        return combine(a, b);
+    }
+}
+
+void update(int node, int l, int r, int pos, int v) {
+    if (l > r) {
+        return;
+    } else if (l == r) {
+        tree[node].a = v;
+    } else {
+        int m = (l + r) / 2;
+
+        if (pos <= m) {
+            update(2 * node, l, m, pos, v);
+        } else {
+            update(2 * node + 1, m + 1, r, pos, v);
+        }
+
+        tree[node] = combine(tree[2 * node], tree[2 * node + 1]);
+    }
+}
+
+int main(void) {
+    int a, b, i;
+    char kind;
+
+    for ( ; scanf("%d", &N) == 1; ) {
+        for (i = 0; i < N; i++) {
+            arry[i] = in();
+        }
+
+        build(1, 0, N - 1);
+
+        Q = in();
+
+        for ( ; Q--; ) {
+            scanf(" %c%d%d", &kind, &a, &b);
+
+            if (kind == 'Q') {
+                data ans = query(1, 0, N - 1, a - 1, b - 1);
+                printf("%d\n", ans.a + ans.b);
+            } else {
+                update(1, 0, N - 1, a - 1, b);
+            }
+        }
+    }
+    return 0;
+}

SPOJPL/i.in

@@ -1,7 +1,9 @@
-4
-1 2 3 4
-4
-1 1 3
-0 3 -3
-1 2 4
-1 3 3
+5
+1 2 3 4 5
+6
+Q 2 4
+Q 2 5
+U 1 6
+Q 1 5
+U 1 7
+Q 1 5