oj.uz

답안 #752660

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
752660 2023-06-03T11:34:53 Z 이동현(#9968) Diversity (CEOI21_diversity) C++17
64 / 100
 7000 ms 8608 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#define mi(x, y) (x = min(x, y))
#define ma(x, y) (x = max(x, y))
using namespace std;

const int NS = (int)3e5 + 4, TS = 150014, QS = 50004;
int n, q, B;
long long t2[TS], t4[TS];
int t1[TS], t3[TS];
int a[NS];
int stkn;
int fir[NS], ed[NS], cnt[NS], pos[NS], stk[NS];
long long out[QS];

struct Data{
    int l, r, id;
    Data(){}
    bool operator<(const Data&R)const{
        return (l / B < R.l / B) || (l / B == R.l / B && r < R.r);
    }
}que[QS];

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    memset(ed, -1, sizeof(ed));
    register int i, j;
    int n, q;
    cin >> n >> q;
    //n = 300000, q = 50000;
    for(i = 1; i <= n; ++i){
        cin >> a[i];
        //a[i] = i;
    }
    for(i = 1; i <= q; ++i){
        cin >> que[i].l >> que[i].r;
        //que[i].l = i, que[i].r = i * 6;
        que[i].id = i;
    }

    B = 300;
    sort(que + 1, que + q + 1);
    int l = 1, r = 0;
    long long ans = 0, szans = 0;
    auto upd = [&](int p, int v, int osz){
        --p;
        //cout << p << ' ' << v << ' ' << osz << endl;
        //cout << fir[2] << ' ' << fir[3] << endl;

        szans += (osz + (v > 0 ? v : 0)) * v;
        ans += (osz + (v > 0 ? v : 0)) * v;
        if(p % 2){
            long long t1a = 0, t2a = 0, t3a = 0, t4a = 0;
            long long t1p = 0, t2p = 0;
            for(i = TS - 1; i > 0; i -= (i & -i)){
                t1a += t1[i], t2a += t2[i], t3a += t3[i], t4a += t4[i];
            }
            for(i = p / 2 + 1; i > 0; i -= (i & -i)){
                t1p += t1[i], t2p += t2[i];
            }
            t1a -= osz, t1p -= osz, t2a -= osz * (p / 2), t2p -= osz * (p / 2);

            szans += v * (t3a + t1a);
            //cout << ans << ' ' << szans << ' ' << t3a << ' ' << t4a << endl;
            ans += 2 * v * t3a + (p / 2) * v * t3a + t4a * v;
            ans += v * t1a + ((p / 2) * v * t1p - t2p * v) - ((p / 2) * v * (t1a - t1p) - (t2a - t2p) * v);

            for(i = p / 2 + 1; i < TS; i += (i & -i)){
                t1[i] += v;
                t2[i] += v * (p / 2);
            }
        }
        else{
            long long t1a = 0, t2a = 0, t3a = 0, t4a = 0;
            long long t3p = 0, t4p = 0;
            for(i = TS - 1; i > 0; i -= (i & -i)){
                t1a += t1[i], t2a += t2[i], t3a += t3[i], t4a += t4[i];
            }
            for(i = p / 2 + 1; i > 0; i -= (i & -i)){
                t3p += t3[i], t4p += t4[i];
            }
            t3a -= osz, t3p -= osz, t4a -= osz * (p / 2), t4p -= osz * (p / 2);

            //cout << "SDF" << ' ' << t1a << ' ' << t2a << ' ' << t3a << ' ' << t4a << ' ' << t3p << ' ' << t4p << endl;

            szans += v * (t1a + t3a);
            ans += 2 * v * t1a + (p / 2) * v * t1a + t2a * v;
            ans += v * t3a + ((p / 2) * v * t3p - t4p * v) - ((p / 2) * v * (t3a - t3p) - (t4a - t4p) * v);

            for(i = p / 2 + 1; i < TS; i += (i & -i)){
                t3[i] += v;
                t4[i] += v * (p / 2);
            }
        }

        //cout << ans << ' ' << szans << endl;
    };
    auto add = [&](int val){
        if(!cnt[val]) pos[val] = ++stkn, stk[stkn] = val;
        int ch1 = pos[val], osz = cnt[val];
        if(cnt[val] && stk[fir[cnt[val]]] != val){
            int nxt = stk[fir[cnt[val]]];
            ch1 = pos[nxt];
            swap(stk[pos[val]], stk[pos[nxt]]);
            swap(pos[val], pos[nxt]);
        }
        ++fir[cnt[val]];
        ++cnt[val];
        if(fir[cnt[val]] > ed[cnt[val]]) fir[cnt[val]] = ed[cnt[val]] = pos[val];
        else ++ed[cnt[val]];

        upd(ch1, 1, osz);
    };
    auto del = [&](int val){
        int ch1 = pos[val], osz = cnt[val];
        if(cnt[val] && stk[ed[cnt[val]]] != val){
            int nxt = stk[ed[cnt[val]]];
            ch1 = pos[nxt];
            swap(stk[pos[val]], stk[pos[nxt]]);
            swap(pos[val], pos[nxt]);
        }
        --ed[cnt[val]];
        --cnt[val];
        if(fir[cnt[val]] > ed[cnt[val]]) fir[cnt[val]] = ed[cnt[val]] = pos[val];
        else --fir[cnt[val]];

        upd(ch1, -1, osz);

        if(!cnt[val]) stk[stkn] = 0, --stkn, pos[val] = 0;
    };
    for(int i = 1; i <= q; ++i){
        while(r < que[i].r){
            ++r;
            add(a[r]);
        }
        while(l > que[i].l){
            --l;
            add(a[l]);
        }
        while(r > que[i].r){
            del(a[r]);
            --r;
        }
        while(l < que[i].l){
            del(a[l]);
            ++l;
        }

        out[que[i].id] = ans - szans * stkn + (long long)stkn * (que[i].r - que[i].l + 1) * (que[i].r - que[i].l + 2) / 2;
    }

    for(i = 1; i <= q; ++i){
        cout << out[i] << '\n';
    }
    
    return 0;
}

Compilation message

diversity.cpp: In function 'int main()':
diversity.cpp:31:18: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister]
   31 |     register int i, j;
      |                  ^
diversity.cpp:31:21: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister]
   31 |     register int i, j;
      |                     ^
diversity.cpp:31:21: warning: unused variable 'j' [-Wunused-variable]

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1492 KB Output is correct
2 Correct 1 ms 1620 KB Output is correct
3 Correct 1 ms 1576 KB Output is correct
4 Correct 1 ms 1620 KB Output is correct
5 Correct 1 ms 1620 KB Output is correct
6 Correct 1 ms 1620 KB Output is correct
7 Correct 1 ms 1620 KB Output is correct
8 Correct 1 ms 1620 KB Output is correct
9 Correct 1 ms 1620 KB Output is correct
10 Correct 1 ms 1620 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1620 KB Output is correct
2 Correct 1 ms 1620 KB Output is correct
3 Correct 3 ms 1620 KB Output is correct
4 Correct 23 ms 2136 KB Output is correct
5 Correct 35 ms 2740 KB Output is correct
6 Correct 62 ms 2988 KB Output is correct
7 Correct 53 ms 3404 KB Output is correct
8 Correct 53 ms 2960 KB Output is correct
9 Correct 61 ms 3060 KB Output is correct
10 Correct 61 ms 3132 KB Output is correct
11 Correct 51 ms 3012 KB Output is correct
12 Correct 52 ms 3020 KB Output is correct
13 Correct 51 ms 2944 KB Output is correct
14 Correct 50 ms 3108 KB Output is correct
15 Correct 56 ms 3096 KB Output is correct

Subtask #3
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1620 KB Output is correct
2 Correct 1 ms 1620 KB Output is correct
3 Correct 3 ms 1620 KB Output is correct
4 Correct 23 ms 2136 KB Output is correct
5 Correct 35 ms 2740 KB Output is correct
6 Correct 62 ms 2988 KB Output is correct
7 Correct 53 ms 3404 KB Output is correct
8 Correct 53 ms 2960 KB Output is correct
9 Correct 61 ms 3060 KB Output is correct
10 Correct 61 ms 3132 KB Output is correct
11 Correct 51 ms 3012 KB Output is correct
12 Correct 52 ms 3020 KB Output is correct
13 Correct 51 ms 2944 KB Output is correct
14 Correct 50 ms 3108 KB Output is correct
15 Correct 56 ms 3096 KB Output is correct
16 Correct 1 ms 1620 KB Output is correct
17 Correct 1 ms 1620 KB Output is correct
18 Correct 3 ms 1620 KB Output is correct
19 Correct 22 ms 2100 KB Output is correct
20 Correct 35 ms 2480 KB Output is correct
21 Correct 57 ms 3028 KB Output is correct
22 Correct 52 ms 2980 KB Output is correct
23 Correct 52 ms 2972 KB Output is correct
24 Correct 53 ms 3004 KB Output is correct
25 Correct 51 ms 2992 KB Output is correct
26 Correct 54 ms 2992 KB Output is correct
27 Correct 51 ms 2948 KB Output is correct
28 Correct 52 ms 3148 KB Output is correct
29 Correct 56 ms 2900 KB Output is correct
30 Correct 52 ms 2940 KB Output is correct

Subtask #4
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1620 KB Output is correct
2 Correct 1 ms 1620 KB Output is correct
3 Correct 3 ms 1620 KB Output is correct
4 Correct 23 ms 2136 KB Output is correct
5 Correct 35 ms 2740 KB Output is correct
6 Correct 62 ms 2988 KB Output is correct
7 Correct 53 ms 3404 KB Output is correct
8 Correct 53 ms 2960 KB Output is correct
9 Correct 61 ms 3060 KB Output is correct
10 Correct 61 ms 3132 KB Output is correct
11 Correct 51 ms 3012 KB Output is correct
12 Correct 52 ms 3020 KB Output is correct
13 Correct 51 ms 2944 KB Output is correct
14 Correct 50 ms 3108 KB Output is correct
15 Correct 56 ms 3096 KB Output is correct
16 Correct 1 ms 1620 KB Output is correct
17 Correct 1 ms 1620 KB Output is correct
18 Correct 3 ms 1620 KB Output is correct
19 Correct 22 ms 2100 KB Output is correct
20 Correct 35 ms 2480 KB Output is correct
21 Correct 57 ms 3028 KB Output is correct
22 Correct 52 ms 2980 KB Output is correct
23 Correct 52 ms 2972 KB Output is correct
24 Correct 53 ms 3004 KB Output is correct
25 Correct 51 ms 2992 KB Output is correct
26 Correct 54 ms 2992 KB Output is correct
27 Correct 51 ms 2948 KB Output is correct
28 Correct 52 ms 3148 KB Output is correct
29 Correct 56 ms 2900 KB Output is correct
30 Correct 52 ms 2940 KB Output is correct
31 Correct 2 ms 1620 KB Output is correct
32 Correct 1 ms 1620 KB Output is correct
33 Correct 1 ms 1620 KB Output is correct
34 Correct 3 ms 1620 KB Output is correct
35 Correct 4 ms 1620 KB Output is correct
36 Correct 3 ms 1748 KB Output is correct
37 Correct 9 ms 1888 KB Output is correct
38 Correct 9 ms 1876 KB Output is correct
39 Correct 19 ms 2072 KB Output is correct
40 Correct 35 ms 2388 KB Output is correct
41 Correct 51 ms 2860 KB Output is correct
42 Correct 54 ms 2856 KB Output is correct
43 Correct 55 ms 2860 KB Output is correct
44 Correct 64 ms 2772 KB Output is correct
45 Correct 55 ms 2852 KB Output is correct
46 Correct 62 ms 2868 KB Output is correct
47 Correct 54 ms 2864 KB Output is correct
48 Correct 52 ms 2868 KB Output is correct
49 Correct 62 ms 2892 KB Output is correct
50 Correct 59 ms 2856 KB Output is correct
51 Correct 51 ms 2772 KB Output is correct
52 Correct 54 ms 2856 KB Output is correct
53 Correct 52 ms 2892 KB Output is correct
54 Correct 52 ms 2860 KB Output is correct
55 Correct 65 ms 2860 KB Output is correct
56 Correct 54 ms 2876 KB Output is correct
57 Correct 55 ms 2768 KB Output is correct
58 Correct 52 ms 2804 KB Output is correct
59 Correct 53 ms 2860 KB Output is correct
60 Correct 53 ms 2812 KB Output is correct

Subtask #5
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1492 KB Output is correct
2 Correct 1 ms 1620 KB Output is correct
3 Correct 1 ms 1576 KB Output is correct
4 Correct 1 ms 1620 KB Output is correct
5 Correct 1 ms 1620 KB Output is correct
6 Correct 1 ms 1620 KB Output is correct
7 Correct 1 ms 1620 KB Output is correct
8 Correct 1 ms 1620 KB Output is correct
9 Correct 1 ms 1620 KB Output is correct
10 Correct 1 ms 1620 KB Output is correct
11 Correct 1 ms 1620 KB Output is correct
12 Correct 1 ms 1620 KB Output is correct
13 Correct 3 ms 1620 KB Output is correct
14 Correct 23 ms 2136 KB Output is correct
15 Correct 35 ms 2740 KB Output is correct
16 Correct 62 ms 2988 KB Output is correct
17 Correct 53 ms 3404 KB Output is correct
18 Correct 53 ms 2960 KB Output is correct
19 Correct 61 ms 3060 KB Output is correct
20 Correct 61 ms 3132 KB Output is correct
21 Correct 51 ms 3012 KB Output is correct
22 Correct 52 ms 3020 KB Output is correct
23 Correct 51 ms 2944 KB Output is correct
24 Correct 50 ms 3108 KB Output is correct
25 Correct 56 ms 3096 KB Output is correct
26 Correct 1 ms 1620 KB Output is correct
27 Correct 1 ms 1620 KB Output is correct
28 Correct 3 ms 1620 KB Output is correct
29 Correct 22 ms 2100 KB Output is correct
30 Correct 35 ms 2480 KB Output is correct
31 Correct 57 ms 3028 KB Output is correct
32 Correct 52 ms 2980 KB Output is correct
33 Correct 52 ms 2972 KB Output is correct
34 Correct 53 ms 3004 KB Output is correct
35 Correct 51 ms 2992 KB Output is correct
36 Correct 54 ms 2992 KB Output is correct
37 Correct 51 ms 2948 KB Output is correct
38 Correct 52 ms 3148 KB Output is correct
39 Correct 56 ms 2900 KB Output is correct
40 Correct 52 ms 2940 KB Output is correct
41 Correct 2 ms 1620 KB Output is correct
42 Correct 1 ms 1620 KB Output is correct
43 Correct 1 ms 1620 KB Output is correct
44 Correct 3 ms 1620 KB Output is correct
45 Correct 4 ms 1620 KB Output is correct
46 Correct 3 ms 1748 KB Output is correct
47 Correct 9 ms 1888 KB Output is correct
48 Correct 9 ms 1876 KB Output is correct
49 Correct 19 ms 2072 KB Output is correct
50 Correct 35 ms 2388 KB Output is correct
51 Correct 51 ms 2860 KB Output is correct
52 Correct 54 ms 2856 KB Output is correct
53 Correct 55 ms 2860 KB Output is correct
54 Correct 64 ms 2772 KB Output is correct
55 Correct 55 ms 2852 KB Output is correct
56 Correct 62 ms 2868 KB Output is correct
57 Correct 54 ms 2864 KB Output is correct
58 Correct 52 ms 2868 KB Output is correct
59 Correct 62 ms 2892 KB Output is correct
60 Correct 59 ms 2856 KB Output is correct
61 Correct 51 ms 2772 KB Output is correct
62 Correct 54 ms 2856 KB Output is correct
63 Correct 52 ms 2892 KB Output is correct
64 Correct 52 ms 2860 KB Output is correct
65 Correct 65 ms 2860 KB Output is correct
66 Correct 54 ms 2876 KB Output is correct
67 Correct 55 ms 2768 KB Output is correct
68 Correct 52 ms 2804 KB Output is correct
69 Correct 53 ms 2860 KB Output is correct
70 Correct 53 ms 2812 KB Output is correct
71 Correct 10 ms 1876 KB Output is correct
72 Correct 11 ms 2004 KB Output is correct
73 Correct 9 ms 1876 KB Output is correct
74 Correct 10 ms 1876 KB Output is correct
75 Correct 11 ms 1908 KB Output is correct
76 Correct 20 ms 2180 KB Output is correct
77 Correct 20 ms 2172 KB Output is correct
78 Correct 19 ms 2132 KB Output is correct
79 Correct 18 ms 2132 KB Output is correct
80 Correct 19 ms 2132 KB Output is correct
81 Correct 41 ms 2552 KB Output is correct
82 Correct 50 ms 2652 KB Output is correct
83 Correct 49 ms 2644 KB Output is correct
84 Correct 36 ms 2652 KB Output is correct
85 Correct 40 ms 2588 KB Output is correct
86 Correct 37 ms 2880 KB Output is correct
87 Correct 37 ms 2876 KB Output is correct
88 Correct 38 ms 2808 KB Output is correct
89 Correct 43 ms 2764 KB Output is correct
90 Correct 41 ms 2876 KB Output is correct
91 Correct 58 ms 5076 KB Output is correct
92 Correct 56 ms 5124 KB Output is correct
93 Correct 55 ms 5120 KB Output is correct
94 Correct 54 ms 5016 KB Output is correct
95 Correct 55 ms 5016 KB Output is correct
96 Correct 56 ms 7420 KB Output is correct
97 Correct 55 ms 7360 KB Output is correct
98 Correct 61 ms 7376 KB Output is correct
99 Correct 56 ms 7392 KB Output is correct
100 Correct 67 ms 7448 KB Output is correct
101 Correct 57 ms 7376 KB Output is correct
102 Correct 56 ms 7380 KB Output is correct
103 Correct 57 ms 7424 KB Output is correct
104 Correct 55 ms 7372 KB Output is correct
105 Correct 74 ms 7436 KB Output is correct
106 Correct 65 ms 8524 KB Output is correct
107 Correct 62 ms 8608 KB Output is correct
108 Correct 56 ms 8504 KB Output is correct
109 Correct 57 ms 8588 KB Output is correct
110 Correct 57 ms 8608 KB Output is correct
111 Correct 55 ms 8528 KB Output is correct
112 Correct 55 ms 8584 KB Output is correct
113 Correct 57 ms 8608 KB Output is correct
114 Correct 55 ms 8524 KB Output is correct
115 Correct 56 ms 8588 KB Output is correct

Subtask #6
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1492 KB Output is correct
2 Correct 1 ms 1620 KB Output is correct
3 Correct 1 ms 1576 KB Output is correct
4 Correct 1 ms 1620 KB Output is correct
5 Correct 1 ms 1620 KB Output is correct
6 Correct 1 ms 1620 KB Output is correct
7 Correct 1 ms 1620 KB Output is correct
8 Correct 1 ms 1620 KB Output is correct
9 Correct 1 ms 1620 KB Output is correct
10 Correct 1 ms 1620 KB Output is correct
11 Correct 1 ms 1620 KB Output is correct
12 Correct 1 ms 1620 KB Output is correct
13 Correct 3 ms 1620 KB Output is correct
14 Correct 23 ms 2136 KB Output is correct
15 Correct 35 ms 2740 KB Output is correct
16 Correct 62 ms 2988 KB Output is correct
17 Correct 53 ms 3404 KB Output is correct
18 Correct 53 ms 2960 KB Output is correct
19 Correct 61 ms 3060 KB Output is correct
20 Correct 61 ms 3132 KB Output is correct
21 Correct 51 ms 3012 KB Output is correct
22 Correct 52 ms 3020 KB Output is correct
23 Correct 51 ms 2944 KB Output is correct
24 Correct 50 ms 3108 KB Output is correct
25 Correct 56 ms 3096 KB Output is correct
26 Correct 1 ms 1620 KB Output is correct
27 Correct 1 ms 1620 KB Output is correct
28 Correct 3 ms 1620 KB Output is correct
29 Correct 22 ms 2100 KB Output is correct
30 Correct 35 ms 2480 KB Output is correct
31 Correct 57 ms 3028 KB Output is correct
32 Correct 52 ms 2980 KB Output is correct
33 Correct 52 ms 2972 KB Output is correct
34 Correct 53 ms 3004 KB Output is correct
35 Correct 51 ms 2992 KB Output is correct
36 Correct 54 ms 2992 KB Output is correct
37 Correct 51 ms 2948 KB Output is correct
38 Correct 52 ms 3148 KB Output is correct
39 Correct 56 ms 2900 KB Output is correct
40 Correct 52 ms 2940 KB Output is correct
41 Correct 2 ms 1620 KB Output is correct
42 Correct 1 ms 1620 KB Output is correct
43 Correct 1 ms 1620 KB Output is correct
44 Correct 3 ms 1620 KB Output is correct
45 Correct 4 ms 1620 KB Output is correct
46 Correct 3 ms 1748 KB Output is correct
47 Correct 9 ms 1888 KB Output is correct
48 Correct 9 ms 1876 KB Output is correct
49 Correct 19 ms 2072 KB Output is correct
50 Correct 35 ms 2388 KB Output is correct
51 Correct 51 ms 2860 KB Output is correct
52 Correct 54 ms 2856 KB Output is correct
53 Correct 55 ms 2860 KB Output is correct
54 Correct 64 ms 2772 KB Output is correct
55 Correct 55 ms 2852 KB Output is correct
56 Correct 62 ms 2868 KB Output is correct
57 Correct 54 ms 2864 KB Output is correct
58 Correct 52 ms 2868 KB Output is correct
59 Correct 62 ms 2892 KB Output is correct
60 Correct 59 ms 2856 KB Output is correct
61 Correct 51 ms 2772 KB Output is correct
62 Correct 54 ms 2856 KB Output is correct
63 Correct 52 ms 2892 KB Output is correct
64 Correct 52 ms 2860 KB Output is correct
65 Correct 65 ms 2860 KB Output is correct
66 Correct 54 ms 2876 KB Output is correct
67 Correct 55 ms 2768 KB Output is correct
68 Correct 52 ms 2804 KB Output is correct
69 Correct 53 ms 2860 KB Output is correct
70 Correct 53 ms 2812 KB Output is correct
71 Correct 10 ms 1876 KB Output is correct
72 Correct 11 ms 2004 KB Output is correct
73 Correct 9 ms 1876 KB Output is correct
74 Correct 10 ms 1876 KB Output is correct
75 Correct 11 ms 1908 KB Output is correct
76 Correct 20 ms 2180 KB Output is correct
77 Correct 20 ms 2172 KB Output is correct
78 Correct 19 ms 2132 KB Output is correct
79 Correct 18 ms 2132 KB Output is correct
80 Correct 19 ms 2132 KB Output is correct
81 Correct 41 ms 2552 KB Output is correct
82 Correct 50 ms 2652 KB Output is correct
83 Correct 49 ms 2644 KB Output is correct
84 Correct 36 ms 2652 KB Output is correct
85 Correct 40 ms 2588 KB Output is correct
86 Correct 37 ms 2880 KB Output is correct
87 Correct 37 ms 2876 KB Output is correct
88 Correct 38 ms 2808 KB Output is correct
89 Correct 43 ms 2764 KB Output is correct
90 Correct 41 ms 2876 KB Output is correct
91 Correct 58 ms 5076 KB Output is correct
92 Correct 56 ms 5124 KB Output is correct
93 Correct 55 ms 5120 KB Output is correct
94 Correct 54 ms 5016 KB Output is correct
95 Correct 55 ms 5016 KB Output is correct
96 Correct 56 ms 7420 KB Output is correct
97 Correct 55 ms 7360 KB Output is correct
98 Correct 61 ms 7376 KB Output is correct
99 Correct 56 ms 7392 KB Output is correct
100 Correct 67 ms 7448 KB Output is correct
101 Correct 57 ms 7376 KB Output is correct
102 Correct 56 ms 7380 KB Output is correct
103 Correct 57 ms 7424 KB Output is correct
104 Correct 55 ms 7372 KB Output is correct
105 Correct 74 ms 7436 KB Output is correct
106 Correct 65 ms 8524 KB Output is correct
107 Correct 62 ms 8608 KB Output is correct
108 Correct 56 ms 8504 KB Output is correct
109 Correct 57 ms 8588 KB Output is correct
110 Correct 57 ms 8608 KB Output is correct
111 Correct 55 ms 8528 KB Output is correct
112 Correct 55 ms 8584 KB Output is correct
113 Correct 57 ms 8608 KB Output is correct
114 Correct 55 ms 8524 KB Output is correct
115 Correct 56 ms 8588 KB Output is correct
116 Correct 634 ms 3036 KB Output is correct
117 Correct 707 ms 3068 KB Output is correct
118 Correct 1522 ms 3360 KB Output is correct
119 Correct 1510 ms 3356 KB Output is correct
120 Correct 1572 ms 3364 KB Output is correct
121 Correct 4448 ms 3564 KB Output is correct
122 Correct 4385 ms 3636 KB Output is correct
123 Execution timed out 7030 ms 3404 KB Time limit exceeded
124 Halted 0 ms 0 KB -