oj.uz

답안 #154968

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
154968 2019-09-25T17:14:32 Z andrew Segments (IZhO18_segments) C++17
100 / 100
 4729 ms 15648 KB 
#include <bits/stdc++.h>

#pragma GCC optimize("-O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")

#define fi first
#define se second
#define p_b push_back
#define pll pair<ll,ll>
#define pii pair<int,int>
#define m_p make_pair
#define all(x) x.begin(),x.end()
#define sset ordered_set
#define sqr(x) (x)*(x)
#define pw(x) (1ll << x)

using namespace std;
typedef long long ll;
typedef long double ld;
const ll MAXN = 1123456;
const ll N = 2e5;
const ll inf = 3e18;
int buben = 2000;
mt19937_64 rnd(chrono::system_clock::now().time_since_epoch().count());

template <typename T> void vout(T s){cout << s << endl;exit(0);}

pii a[N + 3];
int stn;

int WD[N + 3];
int Wstn;

pii b[N + 3];
int Stn;

bool f_deleted[N + 3], will_deleted[N + 3];

int luk, ruk;

ll Len_Block, Len;

vector <ll> V[501], V1[501];

void clr(){
    if(!Len)return;
    for(int i = 0; i < Len; i++){
        V[i / Len_Block].clear();
        V1[i / Len_Block].clear();
    }
    Len = 0;
    Len_Block = 0;
}

void build(int Nt){
    Len_Block = 1;
    Len = Nt;
    while(sqr(Len_Block) < Len)Len_Block++;

    for(int i = 0; i < Len; i++){
        V[i / Len_Block].p_b(a[i + 1].se);
        V1[i / Len_Block].p_b(a[i + 1].se - a[i + 1].fi + 1);
    }
    for(int i = 0; i <= (Len - 1) / Len_Block; i++){
        sort(all(V[i]));
        sort(all(V1[i]));
    }
}

int Val;

int V_more(int l, int r){
    l--, r--;
    int ans = 0;
    for(int i = l; i <= r;){
        if(i % Len_Block == 0 && i + Len_Block - 1 <= r){
            ans += (int)V[i / Len_Block].size() - (lower_bound(all(V[i / Len_Block]), Val) - V[i / Len_Block].begin());
            i += Len_Block;
        }else{
            if(a[i + 1].se >= Val)ans++;
            i++;
        }
    }
    return ans;
}

int V1_more(int l, int r){
    l--, r--;
    int ans = 0;
    for(int i = l; i <= r;){
        if(i % Len_Block == 0 && i + Len_Block - 1 <= r){
            ans += (int)V1[i / Len_Block].size() - (lower_bound(all(V1[i / Len_Block]), Val) - V1[i / Len_Block].begin());
            i += Len_Block;
        }else{
            if(a[i + 1].se - a[i + 1].fi + 1 >= Val)ans++;
            i++;
        }
    }
    return ans;
}


struct qry{
    short t;
    int a, b, c, Id;
};

qry c[N + 3];

int main(){
    ios_base :: sync_with_stdio(0);
    cin.tie(0);
    int n, t;
    cin >> n >> t;


    for(int i = 1; i <= n; i++){
        cin >> c[i].t;
        if(c[i].t == 1){
            cin >> c[i].a >> c[i].b;
        }else if(c[i].t == 2){
            cin >> c[i].a;
        }else{
            cin >> c[i].a >> c[i].b >> c[i].c;
        }
    }

    int l = 1, last_ans = 0, ans = 0, Le, Ri, L1, R1, L, R, mid, k, i, j;
    for(i = 1; i <= n; i++){
        if(i % buben == 0){
            Wstn = 0;
            for(j = i; j <= min(n, i + buben - 1); j++){
                if(c[j].t == 2){
                    will_deleted[c[j].a] = 1;
                    if(c[j].a <= Stn){
                        Wstn++;
                        WD[Wstn] = c[j].a;
                    }
                }
            }
            clr();
            stn = 0;
            for(j = 1; j <= Stn; j++)if(!will_deleted[j]){
                stn++;
                a[stn] = b[j];
            }

            if(stn){
                sort(a + 1, a + stn + 1);
                build(stn);
            }
            l = i;
        }

        if(c[i].t == 1){
            c[i].a ^= t * last_ans;
            c[i].b ^= t * last_ans;
            if(c[i].a > c[i].b)swap(c[i].a, c[i].b);
            Stn++;
            c[i].Id = Stn;
            b[Stn] = {c[i].a, c[i].b};

        }else if(c[i].t == 2){
            f_deleted[c[i].a] = 1;
            will_deleted[c[i].a] = 1;
        }else if(c[i].t == 3){
            c[i].a ^= t * last_ans;
            c[i].b ^= t * last_ans;
            if(c[i].a > c[i].b)swap(c[i].a, c[i].b);
            if(c[i].b - c[i].a + 1 < c[i].c){
                cout << "0\n";
                last_ans = 0;
                continue;
            }
            ans = 0;
            k = c[i].c;
            for(j = l; j < i; j++)if(c[j].t == 1 && !f_deleted[c[j].Id]){
                if(min(c[i].b, c[j].b) - max(c[i].a, c[j].a) + 1 >= c[i].c || c[i].c == 0)ans++;
            }

            for(j = 1; j <= Wstn; j++)if(!f_deleted[WD[j]]){
                if(min(c[i].b, b[WD[j]].se) - max(c[i].a, b[WD[j]].fi) + 1 >= c[i].c || c[i].c == 0)ans++;
            }

            if(!k)ans += stn;
            else{
                if(stn){
                    L = 1, R = stn;
                    while(L < R){
                        mid = (L + R) >> 1;
                        if(a[mid].fi < c[i].a)L = mid + 1; else R = mid;
                    }
                    if(a[L].fi < c[i].a)L++;
                    if(L != 1){
                        Val = k + c[i].a - 1;
                        ans += V_more(1, L - 1);
                    }
                    Le = L;
                    L = 1, R = stn;
                    while(L < R){
                        mid = (L + R) >> 1;
                        if(a[mid].fi <= c[i].b - k + 1)L = mid + 1; else R = mid;
                    }
                    if(a[L].fi <= c[i].b - k + 1)L++;
                    if(Le < L){
                        Val = k;
                        ans += V1_more(Le, L - 1);
                    }
                }

            }
            cout << ans << "\n";
            last_ans = ans;
        }

    }

    return 0;
}

Compilation message

segments.cpp: In function 'int main()':
segments.cpp:129:43: warning: unused variable 'Ri' [-Wunused-variable]
     int l = 1, last_ans = 0, ans = 0, Le, Ri, L1, R1, L, R, mid, k, i, j;
                                           ^~
segments.cpp:129:47: warning: unused variable 'L1' [-Wunused-variable]
     int l = 1, last_ans = 0, ans = 0, Le, Ri, L1, R1, L, R, mid, k, i, j;
                                               ^~
segments.cpp:129:51: warning: unused variable 'R1' [-Wunused-variable]
     int l = 1, last_ans = 0, ans = 0, Le, Ri, L1, R1, L, R, mid, k, i, j;
                                                   ^~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 8 ms 632 KB Output is correct
4 Correct 8 ms 632 KB Output is correct
5 Correct 9 ms 760 KB Output is correct
6 Correct 13 ms 760 KB Output is correct
7 Correct 15 ms 760 KB Output is correct
8 Correct 12 ms 692 KB Output is correct
9 Correct 14 ms 760 KB Output is correct
10 Correct 8 ms 780 KB Output is correct
11 Correct 18 ms 692 KB Output is correct
12 Correct 17 ms 760 KB Output is correct
13 Correct 7 ms 760 KB Output is correct
14 Correct 13 ms 632 KB Output is correct
15 Correct 8 ms 632 KB Output is correct
16 Correct 10 ms 760 KB Output is correct
17 Correct 15 ms 632 KB Output is correct
18 Correct 8 ms 760 KB Output is correct
19 Correct 16 ms 632 KB Output is correct
20 Correct 15 ms 760 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1407 ms 4700 KB Output is correct
2 Correct 1406 ms 4552 KB Output is correct
3 Correct 1402 ms 4912 KB Output is correct
4 Correct 1382 ms 4828 KB Output is correct
5 Correct 767 ms 6728 KB Output is correct
6 Correct 694 ms 6524 KB Output is correct
7 Correct 1409 ms 4344 KB Output is correct
8 Correct 1410 ms 4320 KB Output is correct
9 Correct 1400 ms 4464 KB Output is correct
10 Correct 1088 ms 6648 KB Output is correct
11 Correct 1258 ms 6772 KB Output is correct
12 Correct 1258 ms 8356 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 166 ms 4600 KB Output is correct
2 Correct 146 ms 4648 KB Output is correct
3 Correct 189 ms 4644 KB Output is correct
4 Correct 151 ms 4620 KB Output is correct
5 Correct 1244 ms 8196 KB Output is correct
6 Correct 1342 ms 7036 KB Output is correct
7 Correct 1323 ms 8128 KB Output is correct
8 Correct 762 ms 8616 KB Output is correct
9 Correct 728 ms 8824 KB Output is correct
10 Correct 908 ms 7044 KB Output is correct
11 Correct 365 ms 4780 KB Output is correct
12 Correct 908 ms 7884 KB Output is correct
13 Correct 947 ms 6712 KB Output is correct
14 Correct 858 ms 5804 KB Output is correct
15 Correct 811 ms 5788 KB Output is correct
16 Correct 696 ms 5228 KB Output is correct
17 Correct 1392 ms 6760 KB Output is correct
18 Correct 1392 ms 6780 KB Output is correct
19 Correct 1387 ms 6680 KB Output is correct
20 Correct 1387 ms 6676 KB Output is correct
21 Correct 434 ms 4928 KB Output is correct
22 Correct 875 ms 6116 KB Output is correct
23 Correct 910 ms 6452 KB Output is correct
24 Correct 903 ms 6100 KB Output is correct
25 Correct 172 ms 4692 KB Output is correct
26 Correct 154 ms 4716 KB Output is correct
27 Correct 167 ms 4688 KB Output is correct
28 Correct 158 ms 4632 KB Output is correct
29 Correct 921 ms 6548 KB Output is correct
30 Correct 931 ms 6564 KB Output is correct
31 Correct 717 ms 8880 KB Output is correct
32 Correct 911 ms 6896 KB Output is correct
33 Correct 933 ms 6816 KB Output is correct
34 Correct 793 ms 5852 KB Output is correct
35 Correct 947 ms 6392 KB Output is correct
36 Correct 972 ms 6900 KB Output is correct

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 143 ms 4828 KB Output is correct
2 Correct 145 ms 4984 KB Output is correct
3 Correct 148 ms 4856 KB Output is correct
4 Correct 156 ms 4860 KB Output is correct
5 Correct 1154 ms 8428 KB Output is correct
6 Correct 918 ms 6340 KB Output is correct
7 Correct 1035 ms 8412 KB Output is correct
8 Correct 1120 ms 6684 KB Output is correct
9 Correct 852 ms 6340 KB Output is correct
10 Correct 875 ms 8036 KB Output is correct
11 Correct 598 ms 5396 KB Output is correct
12 Correct 676 ms 8852 KB Output is correct
13 Correct 1000 ms 6780 KB Output is correct
14 Correct 905 ms 6148 KB Output is correct
15 Correct 749 ms 8656 KB Output is correct
16 Correct 960 ms 6932 KB Output is correct
17 Correct 1402 ms 7140 KB Output is correct
18 Correct 1397 ms 7064 KB Output is correct
19 Correct 1400 ms 7112 KB Output is correct
20 Correct 1403 ms 7088 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 8 ms 632 KB Output is correct
4 Correct 8 ms 632 KB Output is correct
5 Correct 9 ms 760 KB Output is correct
6 Correct 13 ms 760 KB Output is correct
7 Correct 15 ms 760 KB Output is correct
8 Correct 12 ms 692 KB Output is correct
9 Correct 14 ms 760 KB Output is correct
10 Correct 8 ms 780 KB Output is correct
11 Correct 18 ms 692 KB Output is correct
12 Correct 17 ms 760 KB Output is correct
13 Correct 7 ms 760 KB Output is correct
14 Correct 13 ms 632 KB Output is correct
15 Correct 8 ms 632 KB Output is correct
16 Correct 10 ms 760 KB Output is correct
17 Correct 15 ms 632 KB Output is correct
18 Correct 8 ms 760 KB Output is correct
19 Correct 16 ms 632 KB Output is correct
20 Correct 15 ms 760 KB Output is correct
21 Correct 1407 ms 4700 KB Output is correct
22 Correct 1406 ms 4552 KB Output is correct
23 Correct 1402 ms 4912 KB Output is correct
24 Correct 1382 ms 4828 KB Output is correct
25 Correct 767 ms 6728 KB Output is correct
26 Correct 694 ms 6524 KB Output is correct
27 Correct 1409 ms 4344 KB Output is correct
28 Correct 1410 ms 4320 KB Output is correct
29 Correct 1400 ms 4464 KB Output is correct
30 Correct 1088 ms 6648 KB Output is correct
31 Correct 1258 ms 6772 KB Output is correct
32 Correct 1258 ms 8356 KB Output is correct
33 Correct 143 ms 4828 KB Output is correct
34 Correct 145 ms 4984 KB Output is correct
35 Correct 148 ms 4856 KB Output is correct
36 Correct 156 ms 4860 KB Output is correct
37 Correct 1154 ms 8428 KB Output is correct
38 Correct 918 ms 6340 KB Output is correct
39 Correct 1035 ms 8412 KB Output is correct
40 Correct 1120 ms 6684 KB Output is correct
41 Correct 852 ms 6340 KB Output is correct
42 Correct 875 ms 8036 KB Output is correct
43 Correct 598 ms 5396 KB Output is correct
44 Correct 676 ms 8852 KB Output is correct
45 Correct 1000 ms 6780 KB Output is correct
46 Correct 905 ms 6148 KB Output is correct
47 Correct 749 ms 8656 KB Output is correct
48 Correct 960 ms 6932 KB Output is correct
49 Correct 1402 ms 7140 KB Output is correct
50 Correct 1397 ms 7064 KB Output is correct
51 Correct 1400 ms 7112 KB Output is correct
52 Correct 1403 ms 7088 KB Output is correct
53 Correct 158 ms 4968 KB Output is correct
54 Correct 157 ms 4844 KB Output is correct
55 Correct 145 ms 4832 KB Output is correct
56 Correct 150 ms 4832 KB Output is correct
57 Correct 1309 ms 6920 KB Output is correct
58 Correct 749 ms 6108 KB Output is correct
59 Correct 1347 ms 7260 KB Output is correct
60 Correct 680 ms 6136 KB Output is correct
61 Correct 914 ms 6704 KB Output is correct
62 Correct 766 ms 8524 KB Output is correct
63 Correct 693 ms 8636 KB Output is correct
64 Correct 760 ms 8660 KB Output is correct
65 Correct 762 ms 5748 KB Output is correct
66 Correct 686 ms 5496 KB Output is correct
67 Correct 955 ms 7008 KB Output is correct
68 Correct 980 ms 6580 KB Output is correct
69 Correct 1402 ms 7116 KB Output is correct
70 Correct 1401 ms 7096 KB Output is correct
71 Correct 1399 ms 7152 KB Output is correct
72 Correct 1398 ms 7172 KB Output is correct
73 Correct 756 ms 5984 KB Output is correct
74 Correct 912 ms 6556 KB Output is correct
75 Correct 635 ms 8960 KB Output is correct
76 Correct 688 ms 8696 KB Output is correct
77 Correct 154 ms 4880 KB Output is correct
78 Correct 147 ms 4888 KB Output is correct
79 Correct 159 ms 4824 KB Output is correct
80 Correct 146 ms 4856 KB Output is correct
81 Correct 904 ms 6464 KB Output is correct
82 Correct 766 ms 5804 KB Output is correct
83 Correct 581 ms 5488 KB Output is correct
84 Correct 908 ms 6484 KB Output is correct
85 Correct 963 ms 6904 KB Output is correct
86 Correct 951 ms 7024 KB Output is correct
87 Correct 923 ms 6328 KB Output is correct
88 Correct 642 ms 5488 KB Output is correct

Subtask #6
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 8 ms 632 KB Output is correct
4 Correct 8 ms 632 KB Output is correct
5 Correct 9 ms 760 KB Output is correct
6 Correct 13 ms 760 KB Output is correct
7 Correct 15 ms 760 KB Output is correct
8 Correct 12 ms 692 KB Output is correct
9 Correct 14 ms 760 KB Output is correct
10 Correct 8 ms 780 KB Output is correct
11 Correct 18 ms 692 KB Output is correct
12 Correct 17 ms 760 KB Output is correct
13 Correct 7 ms 760 KB Output is correct
14 Correct 13 ms 632 KB Output is correct
15 Correct 8 ms 632 KB Output is correct
16 Correct 10 ms 760 KB Output is correct
17 Correct 15 ms 632 KB Output is correct
18 Correct 8 ms 760 KB Output is correct
19 Correct 16 ms 632 KB Output is correct
20 Correct 15 ms 760 KB Output is correct
21 Correct 1407 ms 4700 KB Output is correct
22 Correct 1406 ms 4552 KB Output is correct
23 Correct 1402 ms 4912 KB Output is correct
24 Correct 1382 ms 4828 KB Output is correct
25 Correct 767 ms 6728 KB Output is correct
26 Correct 694 ms 6524 KB Output is correct
27 Correct 1409 ms 4344 KB Output is correct
28 Correct 1410 ms 4320 KB Output is correct
29 Correct 1400 ms 4464 KB Output is correct
30 Correct 1088 ms 6648 KB Output is correct
31 Correct 1258 ms 6772 KB Output is correct
32 Correct 1258 ms 8356 KB Output is correct
33 Correct 166 ms 4600 KB Output is correct
34 Correct 146 ms 4648 KB Output is correct
35 Correct 189 ms 4644 KB Output is correct
36 Correct 151 ms 4620 KB Output is correct
37 Correct 1244 ms 8196 KB Output is correct
38 Correct 1342 ms 7036 KB Output is correct
39 Correct 1323 ms 8128 KB Output is correct
40 Correct 762 ms 8616 KB Output is correct
41 Correct 728 ms 8824 KB Output is correct
42 Correct 908 ms 7044 KB Output is correct
43 Correct 365 ms 4780 KB Output is correct
44 Correct 908 ms 7884 KB Output is correct
45 Correct 947 ms 6712 KB Output is correct
46 Correct 858 ms 5804 KB Output is correct
47 Correct 811 ms 5788 KB Output is correct
48 Correct 696 ms 5228 KB Output is correct
49 Correct 1392 ms 6760 KB Output is correct
50 Correct 1392 ms 6780 KB Output is correct
51 Correct 1387 ms 6680 KB Output is correct
52 Correct 1387 ms 6676 KB Output is correct
53 Correct 434 ms 4928 KB Output is correct
54 Correct 875 ms 6116 KB Output is correct
55 Correct 910 ms 6452 KB Output is correct
56 Correct 903 ms 6100 KB Output is correct
57 Correct 172 ms 4692 KB Output is correct
58 Correct 154 ms 4716 KB Output is correct
59 Correct 167 ms 4688 KB Output is correct
60 Correct 158 ms 4632 KB Output is correct
61 Correct 921 ms 6548 KB Output is correct
62 Correct 931 ms 6564 KB Output is correct
63 Correct 717 ms 8880 KB Output is correct
64 Correct 911 ms 6896 KB Output is correct
65 Correct 933 ms 6816 KB Output is correct
66 Correct 793 ms 5852 KB Output is correct
67 Correct 947 ms 6392 KB Output is correct
68 Correct 972 ms 6900 KB Output is correct
69 Correct 143 ms 4828 KB Output is correct
70 Correct 145 ms 4984 KB Output is correct
71 Correct 148 ms 4856 KB Output is correct
72 Correct 156 ms 4860 KB Output is correct
73 Correct 1154 ms 8428 KB Output is correct
74 Correct 918 ms 6340 KB Output is correct
75 Correct 1035 ms 8412 KB Output is correct
76 Correct 1120 ms 6684 KB Output is correct
77 Correct 852 ms 6340 KB Output is correct
78 Correct 875 ms 8036 KB Output is correct
79 Correct 598 ms 5396 KB Output is correct
80 Correct 676 ms 8852 KB Output is correct
81 Correct 1000 ms 6780 KB Output is correct
82 Correct 905 ms 6148 KB Output is correct
83 Correct 749 ms 8656 KB Output is correct
84 Correct 960 ms 6932 KB Output is correct
85 Correct 1402 ms 7140 KB Output is correct
86 Correct 1397 ms 7064 KB Output is correct
87 Correct 1400 ms 7112 KB Output is correct
88 Correct 1403 ms 7088 KB Output is correct
89 Correct 158 ms 4968 KB Output is correct
90 Correct 157 ms 4844 KB Output is correct
91 Correct 145 ms 4832 KB Output is correct
92 Correct 150 ms 4832 KB Output is correct
93 Correct 1309 ms 6920 KB Output is correct
94 Correct 749 ms 6108 KB Output is correct
95 Correct 1347 ms 7260 KB Output is correct
96 Correct 680 ms 6136 KB Output is correct
97 Correct 914 ms 6704 KB Output is correct
98 Correct 766 ms 8524 KB Output is correct
99 Correct 693 ms 8636 KB Output is correct
100 Correct 760 ms 8660 KB Output is correct
101 Correct 762 ms 5748 KB Output is correct
102 Correct 686 ms 5496 KB Output is correct
103 Correct 955 ms 7008 KB Output is correct
104 Correct 980 ms 6580 KB Output is correct
105 Correct 1402 ms 7116 KB Output is correct
106 Correct 1401 ms 7096 KB Output is correct
107 Correct 1399 ms 7152 KB Output is correct
108 Correct 1398 ms 7172 KB Output is correct
109 Correct 756 ms 5984 KB Output is correct
110 Correct 912 ms 6556 KB Output is correct
111 Correct 635 ms 8960 KB Output is correct
112 Correct 688 ms 8696 KB Output is correct
113 Correct 154 ms 4880 KB Output is correct
114 Correct 147 ms 4888 KB Output is correct
115 Correct 159 ms 4824 KB Output is correct
116 Correct 146 ms 4856 KB Output is correct
117 Correct 904 ms 6464 KB Output is correct
118 Correct 766 ms 5804 KB Output is correct
119 Correct 581 ms 5488 KB Output is correct
120 Correct 908 ms 6484 KB Output is correct
121 Correct 963 ms 6904 KB Output is correct
122 Correct 951 ms 7024 KB Output is correct
123 Correct 923 ms 6328 KB Output is correct
124 Correct 642 ms 5488 KB Output is correct
125 Correct 315 ms 8960 KB Output is correct
126 Correct 321 ms 8948 KB Output is correct
127 Correct 357 ms 9088 KB Output is correct
128 Correct 331 ms 8924 KB Output is correct
129 Correct 299 ms 8872 KB Output is correct
130 Correct 328 ms 8928 KB Output is correct
131 Correct 2460 ms 12080 KB Output is correct
132 Correct 4655 ms 14192 KB Output is correct
133 Correct 4481 ms 14888 KB Output is correct
134 Correct 3152 ms 12652 KB Output is correct
135 Correct 4375 ms 15104 KB Output is correct
136 Correct 953 ms 11512 KB Output is correct
137 Correct 2824 ms 15408 KB Output is correct
138 Correct 3112 ms 13684 KB Output is correct
139 Correct 3115 ms 14628 KB Output is correct
140 Correct 2960 ms 15192 KB Output is correct
141 Correct 3166 ms 14236 KB Output is correct
142 Correct 1140 ms 9936 KB Output is correct
143 Correct 2257 ms 10912 KB Output is correct
144 Correct 883 ms 9688 KB Output is correct
145 Correct 3065 ms 15104 KB Output is correct
146 Correct 2961 ms 12496 KB Output is correct
147 Correct 2342 ms 11100 KB Output is correct
148 Correct 2222 ms 10808 KB Output is correct
149 Correct 4718 ms 14508 KB Output is correct
150 Correct 4729 ms 14520 KB Output is correct
151 Correct 4708 ms 14520 KB Output is correct
152 Correct 4664 ms 14568 KB Output is correct
153 Correct 4712 ms 14416 KB Output is correct
154 Correct 4676 ms 14532 KB Output is correct
155 Correct 1595 ms 10400 KB Output is correct
156 Correct 2250 ms 11140 KB Output is correct
157 Correct 2941 ms 15308 KB Output is correct
158 Correct 2876 ms 15360 KB Output is correct
159 Correct 3165 ms 13940 KB Output is correct
160 Correct 2815 ms 12636 KB Output is correct
161 Correct 347 ms 9448 KB Output is correct
162 Correct 337 ms 9308 KB Output is correct
163 Correct 336 ms 9384 KB Output is correct
164 Correct 418 ms 9536 KB Output is correct
165 Correct 349 ms 9384 KB Output is correct
166 Correct 320 ms 9300 KB Output is correct
167 Correct 2806 ms 15604 KB Output is correct
168 Correct 2750 ms 15648 KB Output is correct
169 Correct 2977 ms 15252 KB Output is correct
170 Correct 3040 ms 15020 KB Output is correct
171 Correct 3209 ms 14264 KB Output is correct
172 Correct 2595 ms 11424 KB Output is correct
173 Correct 2982 ms 15484 KB Output is correct
174 Correct 2902 ms 11560 KB Output is correct
175 Correct 3306 ms 14412 KB Output is correct
176 Correct 2180 ms 10852 KB Output is correct
177 Correct 3349 ms 13908 KB Output is correct
178 Correct 3279 ms 13640 KB Output is correct