oj.uz

답안 #151160

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
151160 2019-09-01T22:52:38 Z thecodingwizard Birthday gift (IZhO18_treearray) C++11
100 / 100
 1503 ms 75164 KB 
//#pragma GCC optimize ("O3")
//#pragma GCC target ("sse4")

#include <bits/stdc++.h>

#include <utility>

using namespace std;

template<class T> using min_heap = priority_queue<T, vector<T>, greater<T>>;

#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define F0R1(i, a) for (int i=1; i<=(a); i++)
#define FORd(i, a, b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i, a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto& a : x)
#define MIN(a, b) a = min(a, b)
#define MAX(a, b) a = max(a, b)

#define INF 1000000010
#define LL_INF 4500000000000000000LL
#define LSOne(S) (S & (-S))
#define EPS 1e-9
#define pA first
#define pB second
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define PI acos(-1.0)
// #define MOD (int)(2e+9+11)
#define MOD (int)(1e+9+7)
#define SET(vec, val, size) for (int i = 0; i < size; i++) vec[i] = val;
#define SET2D(arr, val, dim1, dim2) F0R(i, dim1) F0R(j, dim2) arr[i][j] = val;
#define SET3D(arr, val, dim1, dim2, dim3) F0R(i, dim1) F0R(j, dim2) F0R(k, dim3) arr[i][j][k] = val;
#define SET4D(arr, val, dim1, dim2, dim3, dim4) F0R(i, dim1) F0R(j, dim2) F0R(k, dim3) F0R(l, dim4) arr[i][j][k][l] = val;

#define lb lower_bound
#define ub upper_bound
#define sz(x) (int)x.size()
#define beg(x) x.begin()
#define en(x) x.end()
#define all(x) beg(x), en(x)
#define resz resize
#define SORT(vec) sort(all(vec))
#define RSORT(vec) sort(vec.rbegin(),vec.rend())

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int, int> ii;
typedef pair<int, ii> iii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vl;

// @formatter:off
// Source: Benq (https://github.com/bqi343/USACO) [Modified]
namespace input {
    template<class T> void re(complex<T>& x);
    template<class T1, class T2> void re(pair<T1,T2>& p);
    template<class T> void re(vector<T>& a);
    template<class T, size_t SZ> void re(array<T,SZ>& a);
    template<class T> void reA(T A[], int sz);

    template<class T> void re(T& x) { cin >> x; }
    void re(double& x) { string t; re(t); x = stod(t); }
    void re(ld& x) { string t; re(t); x = stold(t); }
    template<class Arg, class... Args> void re(Arg& first, Args&... rest) {
        re(first); re(rest...);
    }

    template<class T1, class T2> void re(pair<T1,T2>& p) { re(p.pA,p.pB); }
    template<class T> void re(vector<T>& a) { F0R(i,sz(a)) re(a[i]); }
    template<class T, size_t SZ> void re(array<T,SZ>& a) { F0R(i,SZ) re(a[i]); }
    template<class T> void reA(T A[], int sz) { F0R(i, sz) re(A[i]); }

    void setupIO(const string &PROB = "") {
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
        if (PROB.length() != 0) {
            ifstream infile(PROB + ".in");
            if (infile.good()) {
                freopen((PROB + ".in").c_str(), "r", stdin);
                freopen((PROB + ".out").c_str(), "w", stdout);
            }
        }
    }
}
using namespace input;

namespace output {
    template<class T1, class T2> void prD(const pair<T1,T2>& x);
    template<class T, size_t SZ> void prD(const array<T,SZ>& x);
    template<class T> void prD(const vector<T>& x);
    template<class T> void prD(const set<T>& x);
    template<class T1, class T2> void prD(const map<T1,T2>& x);

    template<class T1, class T2> void pr(const pair<T1,T2>& x);
    template<class T, size_t SZ> void pr(const array<T,SZ>& x);
    template<class T> void pr(const vector<T>& x);
    template<class T> void pr(const set<T>& x);
    template<class T1, class T2> void pr(const map<T1,T2>& x);

    template<class T> void prD(const T& x) { cout << x; }
    template<class Arg, class... Args> void prD(const Arg& first, const Args&... rest) {
        prD(first); prD(rest...);
    }

    template<class T1, class T2> void prD(const pair<T1,T2>& x) {
        prD("{",x.pA,", ",x.pB,"}");
    }
    template<class T> void prDContain(const T& x) {
        prD("{");
        bool fst = 1; for (const auto& a: x) prD(!fst?", ":"",a), fst = 0; // const needed for vector<bool>
        prD("}");
    }
    template<class T, size_t SZ> void prD(const array<T,SZ>& x) { prDContain(x); }
    template<class T> void prD(const vector<T>& x) { prDContain(x); }
    template<class T> void prD(const set<T>& x) { prDContain(x); }
    template<class T1, class T2> void prD(const map<T1,T2>& x) { prDContain(x); }

    void psD() { prD("\n"); }
    template<class Arg> void psD(const Arg& first) {
        prD(first); psD(); // no space at end of line
    }
    template<class Arg, class... Args> void psD(const Arg& first, const Args&... rest) {
        prD(first," "); psD(rest...); // print w/ spaces
    }


    template<class T> void pr(const T& x) { cout << x; }
    template<class Arg, class... Args> void pr(const Arg& first, const Args&... rest) {
        pr(first); pr(rest...);
    }

    template<class T1, class T2> void pr(const pair<T1,T2>& x) {
        pr(x.pA, " ", x.pB);
    }
    template<class T> void prContain(const T& x) {
        bool fst = 1; for (const auto& a: x) pr(!fst?" ":"",a), fst = 0; // const needed for vector<bool>
    }
    template<class T, size_t SZ> void pr(const array<T,SZ>& x) { prContain(x); }
    template<class T> void pr(const vector<T>& x) { prContain(x); }
    template<class T> void pr(const set<T>& x) { prContain(x); }
    template<class T1, class T2> void pr(const map<T1,T2>& x) { prContain(x); }

    void ps() { pr("\n"); }
    template<class Arg> void ps(const Arg& first) {
        pr(first); ps(); // no space at end of line
    }
    template<class Arg, class... Args> void ps(const Arg& first, const Args&... rest) {
        pr(first," "); ps(rest...); // print w/ spaces
    }
}
using namespace output;
// @formatter:on

/* ============================ */

int n, m, q;
set<int> A[200001], B[200001];
vi adj[200001];
vi C;
int p[200001][18];
int depth[200001];

void dfs(int u, int pa, int d) {
    depth[u] = d;
    p[u][0] = pa;
    trav(v, adj[u]) {
        if (v != pa) dfs(v, u, d + 1);
    }
}

void build() {
    dfs(1, 1, 1);

    FOR(j, 1, 18) {
        F0R1(i, n) {
            p[i][j] = p[p[i][j-1]][j-1];
        }
    }
}

int lca(int x, int y) {
    if (depth[x] > depth[y]) return lca(y, x);
    F0Rd(i, 18) {
        if (depth[p[y][i]] >= depth[x]) y = p[y][i];
    }
    if (x == y) return x;
    F0Rd(i, 18) {
        if (p[x][i] != p[y][i]) {
            x = p[x][i]; y = p[y][i];
        }
    }
    return p[x][0];
}

int main() {
    setupIO();

    re(n, m, q);
    F0R(i, n - 1) {
        int a, b; re(a, b);
        adj[a].pb(b); adj[b].pb(a);
    }
    build();
    F0R(i, m) {
        int x; re(x);
        A[x].insert(i+1);
        C.pb(x);
        if (i > 0) B[lca(C[i], C[i-1])].insert(i);
    }
    F0R(i, q) {
        int cmd; re(cmd);
        if (cmd == 1) {
            int k, v; re(k, v);
            A[C[k-1]].erase(k);
            A[v].insert(k);
            if (k > 1) B[lca(C[k-1], C[k-2])].erase(k - 1);
            if (k < m) B[lca(C[k-1], C[k])].erase(k);
            C[k-1] = v;
            if (k > 1) B[lca(C[k-1], C[k-2])].insert(k - 1);
            if (k < m) B[lca(C[k-1], C[k])].insert(k);
        } else {
            int l, r, v; re(l, r, v);
            auto it = A[v].lb(l);
            if (it != A[v].end() && *it <= r) {
                ps(*it, *it);
            } else {
                it = B[v].lb(l);
                if (it != B[v].end() && *it + 1 <= r) {
                    ps(*it, *it + 1);
                } else {
                    ps(-1, -1);
                }
            }
        }
    }
}

Compilation message

treearray.cpp: In function 'void input::setupIO(const string&)':
treearray.cpp:86:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
                 freopen((PROB + ".in").c_str(), "r", stdin);
                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
treearray.cpp:87:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
                 freopen((PROB + ".out").c_str(), "w", stdout);
                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 23800 KB n=5
2 Correct 23 ms 23800 KB n=100
3 Correct 23 ms 23928 KB n=100
4 Correct 23 ms 23800 KB n=100
5 Correct 24 ms 23800 KB n=100
6 Correct 23 ms 23928 KB n=100
7 Correct 24 ms 23800 KB n=100
8 Correct 24 ms 23896 KB n=100
9 Correct 23 ms 23904 KB n=100
10 Correct 24 ms 23928 KB n=100
11 Correct 24 ms 23800 KB n=100
12 Correct 24 ms 23800 KB n=100
13 Correct 24 ms 23928 KB n=100
14 Correct 23 ms 23928 KB n=100
15 Correct 23 ms 23800 KB n=100
16 Correct 23 ms 23800 KB n=100
17 Correct 23 ms 23928 KB n=100
18 Correct 23 ms 23800 KB n=100
19 Correct 23 ms 23928 KB n=100
20 Correct 23 ms 23856 KB n=100
21 Correct 23 ms 23800 KB n=100
22 Correct 24 ms 23928 KB n=100
23 Correct 24 ms 23932 KB n=100
24 Correct 24 ms 23800 KB n=100
25 Correct 23 ms 23800 KB n=100
26 Correct 23 ms 23928 KB n=12
27 Correct 23 ms 23800 KB n=100

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 23800 KB n=5
2 Correct 23 ms 23800 KB n=100
3 Correct 23 ms 23928 KB n=100
4 Correct 23 ms 23800 KB n=100
5 Correct 24 ms 23800 KB n=100
6 Correct 23 ms 23928 KB n=100
7 Correct 24 ms 23800 KB n=100
8 Correct 24 ms 23896 KB n=100
9 Correct 23 ms 23904 KB n=100
10 Correct 24 ms 23928 KB n=100
11 Correct 24 ms 23800 KB n=100
12 Correct 24 ms 23800 KB n=100
13 Correct 24 ms 23928 KB n=100
14 Correct 23 ms 23928 KB n=100
15 Correct 23 ms 23800 KB n=100
16 Correct 23 ms 23800 KB n=100
17 Correct 23 ms 23928 KB n=100
18 Correct 23 ms 23800 KB n=100
19 Correct 23 ms 23928 KB n=100
20 Correct 23 ms 23856 KB n=100
21 Correct 23 ms 23800 KB n=100
22 Correct 24 ms 23928 KB n=100
23 Correct 24 ms 23932 KB n=100
24 Correct 24 ms 23800 KB n=100
25 Correct 23 ms 23800 KB n=100
26 Correct 23 ms 23928 KB n=12
27 Correct 23 ms 23800 KB n=100
28 Correct 24 ms 23928 KB n=500
29 Correct 24 ms 24060 KB n=500
30 Correct 24 ms 23928 KB n=500
31 Correct 25 ms 23928 KB n=500
32 Correct 25 ms 23928 KB n=500
33 Correct 24 ms 23928 KB n=500
34 Correct 24 ms 23928 KB n=500
35 Correct 25 ms 23928 KB n=500
36 Correct 24 ms 23960 KB n=500
37 Correct 25 ms 23928 KB n=500
38 Correct 25 ms 23928 KB n=500
39 Correct 23 ms 23928 KB n=500
40 Correct 24 ms 23928 KB n=500
41 Correct 24 ms 23924 KB n=500
42 Correct 24 ms 23928 KB n=500
43 Correct 24 ms 23928 KB n=500
44 Correct 25 ms 24056 KB n=500
45 Correct 25 ms 23928 KB n=500
46 Correct 25 ms 23928 KB n=500
47 Correct 24 ms 23928 KB n=500
48 Correct 25 ms 23928 KB n=500
49 Correct 24 ms 23928 KB n=500
50 Correct 25 ms 23928 KB n=500
51 Correct 24 ms 23928 KB n=500
52 Correct 24 ms 23928 KB n=500
53 Correct 25 ms 23928 KB n=500
54 Correct 24 ms 23928 KB n=500
55 Correct 24 ms 23932 KB n=278
56 Correct 25 ms 23928 KB n=500
57 Correct 25 ms 23928 KB n=500
58 Correct 24 ms 23928 KB n=500

Subtask #3
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 23800 KB n=5
2 Correct 23 ms 23800 KB n=100
3 Correct 23 ms 23928 KB n=100
4 Correct 23 ms 23800 KB n=100
5 Correct 24 ms 23800 KB n=100
6 Correct 23 ms 23928 KB n=100
7 Correct 24 ms 23800 KB n=100
8 Correct 24 ms 23896 KB n=100
9 Correct 23 ms 23904 KB n=100
10 Correct 24 ms 23928 KB n=100
11 Correct 24 ms 23800 KB n=100
12 Correct 24 ms 23800 KB n=100
13 Correct 24 ms 23928 KB n=100
14 Correct 23 ms 23928 KB n=100
15 Correct 23 ms 23800 KB n=100
16 Correct 23 ms 23800 KB n=100
17 Correct 23 ms 23928 KB n=100
18 Correct 23 ms 23800 KB n=100
19 Correct 23 ms 23928 KB n=100
20 Correct 23 ms 23856 KB n=100
21 Correct 23 ms 23800 KB n=100
22 Correct 24 ms 23928 KB n=100
23 Correct 24 ms 23932 KB n=100
24 Correct 24 ms 23800 KB n=100
25 Correct 23 ms 23800 KB n=100
26 Correct 23 ms 23928 KB n=12
27 Correct 23 ms 23800 KB n=100
28 Correct 24 ms 23928 KB n=500
29 Correct 24 ms 24060 KB n=500
30 Correct 24 ms 23928 KB n=500
31 Correct 25 ms 23928 KB n=500
32 Correct 25 ms 23928 KB n=500
33 Correct 24 ms 23928 KB n=500
34 Correct 24 ms 23928 KB n=500
35 Correct 25 ms 23928 KB n=500
36 Correct 24 ms 23960 KB n=500
37 Correct 25 ms 23928 KB n=500
38 Correct 25 ms 23928 KB n=500
39 Correct 23 ms 23928 KB n=500
40 Correct 24 ms 23928 KB n=500
41 Correct 24 ms 23924 KB n=500
42 Correct 24 ms 23928 KB n=500
43 Correct 24 ms 23928 KB n=500
44 Correct 25 ms 24056 KB n=500
45 Correct 25 ms 23928 KB n=500
46 Correct 25 ms 23928 KB n=500
47 Correct 24 ms 23928 KB n=500
48 Correct 25 ms 23928 KB n=500
49 Correct 24 ms 23928 KB n=500
50 Correct 25 ms 23928 KB n=500
51 Correct 24 ms 23928 KB n=500
52 Correct 24 ms 23928 KB n=500
53 Correct 25 ms 23928 KB n=500
54 Correct 24 ms 23928 KB n=500
55 Correct 24 ms 23932 KB n=278
56 Correct 25 ms 23928 KB n=500
57 Correct 25 ms 23928 KB n=500
58 Correct 24 ms 23928 KB n=500
59 Correct 28 ms 24312 KB n=2000
60 Correct 29 ms 24484 KB n=2000
61 Correct 28 ms 24388 KB n=2000
62 Correct 29 ms 24312 KB n=2000
63 Correct 28 ms 24312 KB n=2000
64 Correct 29 ms 24408 KB n=2000
65 Correct 28 ms 24312 KB n=2000
66 Correct 27 ms 24440 KB n=2000
67 Correct 28 ms 24312 KB n=2000
68 Correct 29 ms 24312 KB n=2000
69 Correct 27 ms 24312 KB n=2000
70 Correct 26 ms 24312 KB n=2000
71 Correct 28 ms 24312 KB n=2000
72 Correct 27 ms 24312 KB n=2000
73 Correct 28 ms 24440 KB n=2000
74 Correct 28 ms 24312 KB n=1844
75 Correct 27 ms 24312 KB n=2000
76 Correct 29 ms 24312 KB n=2000
77 Correct 28 ms 24312 KB n=2000
78 Correct 28 ms 24312 KB n=2000
79 Correct 27 ms 24312 KB n=2000
80 Correct 28 ms 24440 KB n=2000
81 Correct 28 ms 24312 KB n=2000
82 Correct 28 ms 24312 KB n=2000
83 Correct 27 ms 24312 KB n=2000
84 Correct 32 ms 24312 KB n=2000
85 Correct 27 ms 24312 KB n=2000
86 Correct 28 ms 24384 KB n=2000
87 Correct 28 ms 24312 KB n=2000
88 Correct 28 ms 24440 KB n=2000
89 Correct 27 ms 24316 KB n=2000
90 Correct 28 ms 24440 KB n=2000
91 Correct 27 ms 24312 KB n=2000

Subtask #4
44.0 / 44.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 23800 KB n=5
2 Correct 23 ms 23800 KB n=100
3 Correct 23 ms 23928 KB n=100
4 Correct 23 ms 23800 KB n=100
5 Correct 24 ms 23800 KB n=100
6 Correct 23 ms 23928 KB n=100
7 Correct 24 ms 23800 KB n=100
8 Correct 24 ms 23896 KB n=100
9 Correct 23 ms 23904 KB n=100
10 Correct 24 ms 23928 KB n=100
11 Correct 24 ms 23800 KB n=100
12 Correct 24 ms 23800 KB n=100
13 Correct 24 ms 23928 KB n=100
14 Correct 23 ms 23928 KB n=100
15 Correct 23 ms 23800 KB n=100
16 Correct 23 ms 23800 KB n=100
17 Correct 23 ms 23928 KB n=100
18 Correct 23 ms 23800 KB n=100
19 Correct 23 ms 23928 KB n=100
20 Correct 23 ms 23856 KB n=100
21 Correct 23 ms 23800 KB n=100
22 Correct 24 ms 23928 KB n=100
23 Correct 24 ms 23932 KB n=100
24 Correct 24 ms 23800 KB n=100
25 Correct 23 ms 23800 KB n=100
26 Correct 23 ms 23928 KB n=12
27 Correct 23 ms 23800 KB n=100
28 Correct 24 ms 23928 KB n=500
29 Correct 24 ms 24060 KB n=500
30 Correct 24 ms 23928 KB n=500
31 Correct 25 ms 23928 KB n=500
32 Correct 25 ms 23928 KB n=500
33 Correct 24 ms 23928 KB n=500
34 Correct 24 ms 23928 KB n=500
35 Correct 25 ms 23928 KB n=500
36 Correct 24 ms 23960 KB n=500
37 Correct 25 ms 23928 KB n=500
38 Correct 25 ms 23928 KB n=500
39 Correct 23 ms 23928 KB n=500
40 Correct 24 ms 23928 KB n=500
41 Correct 24 ms 23924 KB n=500
42 Correct 24 ms 23928 KB n=500
43 Correct 24 ms 23928 KB n=500
44 Correct 25 ms 24056 KB n=500
45 Correct 25 ms 23928 KB n=500
46 Correct 25 ms 23928 KB n=500
47 Correct 24 ms 23928 KB n=500
48 Correct 25 ms 23928 KB n=500
49 Correct 24 ms 23928 KB n=500
50 Correct 25 ms 23928 KB n=500
51 Correct 24 ms 23928 KB n=500
52 Correct 24 ms 23928 KB n=500
53 Correct 25 ms 23928 KB n=500
54 Correct 24 ms 23928 KB n=500
55 Correct 24 ms 23932 KB n=278
56 Correct 25 ms 23928 KB n=500
57 Correct 25 ms 23928 KB n=500
58 Correct 24 ms 23928 KB n=500
59 Correct 28 ms 24312 KB n=2000
60 Correct 29 ms 24484 KB n=2000
61 Correct 28 ms 24388 KB n=2000
62 Correct 29 ms 24312 KB n=2000
63 Correct 28 ms 24312 KB n=2000
64 Correct 29 ms 24408 KB n=2000
65 Correct 28 ms 24312 KB n=2000
66 Correct 27 ms 24440 KB n=2000
67 Correct 28 ms 24312 KB n=2000
68 Correct 29 ms 24312 KB n=2000
69 Correct 27 ms 24312 KB n=2000
70 Correct 26 ms 24312 KB n=2000
71 Correct 28 ms 24312 KB n=2000
72 Correct 27 ms 24312 KB n=2000
73 Correct 28 ms 24440 KB n=2000
74 Correct 28 ms 24312 KB n=1844
75 Correct 27 ms 24312 KB n=2000
76 Correct 29 ms 24312 KB n=2000
77 Correct 28 ms 24312 KB n=2000
78 Correct 28 ms 24312 KB n=2000
79 Correct 27 ms 24312 KB n=2000
80 Correct 28 ms 24440 KB n=2000
81 Correct 28 ms 24312 KB n=2000
82 Correct 28 ms 24312 KB n=2000
83 Correct 27 ms 24312 KB n=2000
84 Correct 32 ms 24312 KB n=2000
85 Correct 27 ms 24312 KB n=2000
86 Correct 28 ms 24384 KB n=2000
87 Correct 28 ms 24312 KB n=2000
88 Correct 28 ms 24440 KB n=2000
89 Correct 27 ms 24316 KB n=2000
90 Correct 28 ms 24440 KB n=2000
91 Correct 27 ms 24312 KB n=2000
92 Correct 992 ms 66668 KB n=200000
93 Correct 1503 ms 70360 KB n=200000
94 Correct 1334 ms 73800 KB n=200000
95 Correct 881 ms 66580 KB n=200000
96 Correct 886 ms 66648 KB n=200000
97 Correct 1429 ms 69628 KB n=200000
98 Correct 868 ms 66724 KB n=200000
99 Correct 1113 ms 66028 KB n=200000
100 Correct 925 ms 66560 KB n=200000
101 Correct 1492 ms 74928 KB n=200000
102 Correct 585 ms 67640 KB n=200000
103 Correct 583 ms 67516 KB n=200000
104 Correct 580 ms 67560 KB n=200000
105 Correct 581 ms 67460 KB n=200000
106 Correct 573 ms 67244 KB n=200000
107 Correct 591 ms 67444 KB n=200000
108 Correct 1066 ms 66328 KB n=200000
109 Correct 1047 ms 66348 KB n=200000
110 Correct 1059 ms 66232 KB n=200000
111 Correct 882 ms 66548 KB n=200000
112 Correct 1394 ms 74068 KB n=200000
113 Correct 1429 ms 69540 KB n=200000
114 Correct 934 ms 66536 KB n=200000
115 Correct 1471 ms 67348 KB n=200000
116 Correct 862 ms 66408 KB n=200000
117 Correct 1375 ms 74360 KB n=200000
118 Correct 1406 ms 68272 KB n=200000
119 Correct 845 ms 66224 KB n=200000
120 Correct 1324 ms 74820 KB n=200000
121 Correct 1356 ms 74728 KB n=200000
122 Correct 1325 ms 75164 KB n=200000
123 Correct 581 ms 66848 KB n=200000
124 Correct 314 ms 36916 KB n=25264