oj.uz

Submission #50902

# Submission time Handle Problem Language Result Execution time Memory
50902 2018-06-14T15:45:57 Z Nicksechko Segments (IZhO18_segments) C++14
100 / 100
 3873 ms 172032 KB 
#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <vector>
#include <cmath>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <ctime>

#define pb push_back
#define ll long long
#define mp make_pair
#define f first
#define s second
#define pii pair < int, int >
#define ull unsigned long long
#define pll pair < ll, ll >
#define forit(it, s) for(__typeof(s.begin()) it = s.begin(); it != s.end(); it ++)
#define all(s) s.begin(), s.end()
#define sz(a) (int)a.size()

const int inf = (1ll << 30) - 1;
const int maxn = (int) 1e5 + 10;

inline int min(int a, int b){
	if(a<b) return a;
	return b;
}
inline int max(int a, int b){
	if(a>b) return a;
	return b;
}

using namespace std;

int A[544][544];
int B[544][544];
int L_pos[200200];
int R_pos[200200];
int pos[200200];
const int KK = 430;
int K = 4;
int G[744][944];
int L[744][944];
int R[744][944];
int szG[744];
int szL[744];
int szR[744];
int l[200200];
int r[200200];
int GOOD[2944];
int GG = 0;
int BAD[2944];
int BB = 0;
void add(int id){
	GOOD[GG++] = id;
}
int bad[200200];
void del(int id){
	BAD[BB++] = id;
	bad[id] = 1;
}

bool cmpL(int i, int j){
	if(l[i] != l[j]) return l[i] > l[j];
	return i < j;
}
bool cmpR(int i, int j){
	if(r[i] != r[j]) return r[i] < r[j];
	return i < j;
}
bool cmpG(int i, int j){
	if(r[i] - l[i] != r[j] - l[j]) return r[i] - l[i] > r[j] - l[j];
	return i < j;
}

int was[200200];
int pref[2020];
int T;
int get(int a, int b, int k){
	if(b - a + 1 < k) return 0;
	int I = 1, J = K - 1, c = 1;
	while(I <= J){
		int mid = (I + J)>>1;
		if(szG[mid]>0 && r[G[mid][0]] - l[G[mid][0]] + 1 >= k){
			c = mid;
			I = mid+1;
		}else {
			J = mid-1;
		}
	}

	int ans = pref[c-1];
	I = 1, J = K-1;
	int d = 1;
	while(I <= J){
		int mid = (I + J)>>1;
		if(szR[mid]>0 && r[R[mid][0]] < a + k - 1){
			d = mid;
			I = mid+1;
		}else {
			J = mid-1;
		}
	}
	I = 1, J = K-1;
	int e = 1;
	while(I <= J){
		int mid = (I + J)>>1;
		if(szL[mid]>0 && l[L[mid][0]] > b - k + 1){
			e = mid;
			I = mid+1;
		}else {
			J = mid-1;
		}
	}
	ans -= A[c-1][e-1];
	
	ans -= B[c-1][d-1];
	++T;
	for(int i = 0; i < szG[c]; i++){
		int id = G[c][i];
		if(min(r[id], b) - max(a, l[id]) + 1 >= k) ans++;
	}
	for(int i = 0; i < szL[e]; i++){
		int id = L[e][i];
		if(pos[id] >= c) continue;
		if(R_pos[id] < d) continue;
		if(min(r[id], b) - max(a, l[id]) + 1 < k) --ans;
		was[id] = T;
	}
	for(int i = 0; i < szR[d]; i++){
		int id = R[d][i];
		if(pos[id] >= c || was[id] == T) continue;
		if(L_pos[id] < e) continue;
		if(min(r[id], b) - max(a, l[id]) + 1 < k) --ans;
	}
	for(int i = 0; i < GG; i++){
		int id = GOOD[i];
		if(min(r[id], b) - max(a, l[id]) + 1 >= k) ++ans;
	}
	for(int i = 0; i <BB; i++){
		int id = BAD[i];
		if(min(r[id], b) - max(a, l[id]) + 1 >= k) --ans;
	}
	return ans;
}

int a[200200];
int sz = 0;
void recalc(){
	for(int i = 1; i < K; i++){
		for(int j = 1; j < K; j++){
			A[i][j] = 0;
			B[i][j] = 0;
		}
	}
	
	sz = 0;
	int st = 0;
	sort(GOOD, GOOD + GG, cmpR);
	for(int i = 1; i < K; i++){
		for(int j = 0; j < szR[i];j++) {
			if(bad[R[i][j]]) continue;
			while(st < GG && cmpR(GOOD[st], R[i][j])){
				if(!bad[GOOD[st]]){
					a[sz++] = GOOD[st];
				}
				++st;
			}
			a[sz++] = R[i][j];
		}
		szR[i] = 0;
	}
	while(st < GG){
		if(!bad[GOOD[st]]){
			a[sz++] = GOOD[st];
		}
		++st;
	}
	for(int i = 0 ; i < sz; i++){
		int ind = i/KK + 1;
		R_pos[a[i]] = ind;
		R[ind][szR[ind]++] = a[i];
	}
	sz = 0;

	st = 0;
	sort(GOOD, GOOD + GG, cmpL);
	for(int i = 1; i < K; i++){
		for(int j = 0; j < szL[i];j++) {
			if(bad[L[i][j]]) continue;
			while(st < GG && cmpL(GOOD[st], L[i][j])){
				if(!bad[GOOD[st]]){
					a[sz++] = GOOD[st];
				}
				++st;
			}
			a[sz++] = L[i][j];
		}
		szL[i] = 0;
	}
	while(st < GG){
		if(!bad[GOOD[st]]){
			a[sz++] = GOOD[st];
		}
		++st;
	}
	for(int i = 0 ; i < sz; i++){
		int ind = i/KK + 1;
		L_pos[a[i]] = ind;
		L[ind][szL[ind]++] = a[i];
	}
	sz = 0;
		st = 0;
	sort(GOOD, GOOD + GG, cmpG);
	for(int i = 1; i < K; i++){
		
		for(int j = 0; j < szG[i];j++) {
			if(bad[G[i][j]]) continue;
			while(st < GG && cmpG(GOOD[st], G[i][j])){
				if(!bad[GOOD[st]]){
					a[sz++] = GOOD[st];
				}
				++st;
			}
			a[sz++] = G[i][j];
		}
		szG[i] = 0;
	}
	while(st < GG){
		if(!bad[GOOD[st]]){
			a[sz++] = GOOD[st];
		}
		++st;
	}
	GG = 0;
	BB = 0;
	for(int i = 0; i < sz; i++){
		int ind = i/KK + 1;
		pos[a[i]] = ind;
		G[ind][szG[ind]++] = a[i];
		A[ind][L_pos[a[i]]]++;
		B[ind][R_pos[a[i]]]++;
	}
	K = sz/KK + 2;

	for(int i = 1; i < K; i++){
		for(int j = 1; j < K; j++){
			A[i][j] += A[i][j-1] + A[i-1][j] - A[i-1][j-1];
			B[i][j] += B[i][j-1] + B[i-1][j] - B[i-1][j-1];
		}
	}
	for(int i = 1; i < K; i++){
		pref[i] = pref[i-1] + szG[i];
	}
}
void solve(){
	int q;
	int G;
	scanf("%d%d", &q, &G);
	int id = 1;
	vector<int> ans;
	int last = 0;
	int lastans = 0;
	for(int i = 0, ty, a, b, k; i < q; i++){
		scanf("%d", &ty);
		if(GG + BB == 700) {
			recalc();
		}
		if(ty == 1){
			scanf("%d%d", &l[id], &r[id]);
			l[id] = l[id]^(lastans*G);
			r[id] = r[id]^(lastans*G);
			if(l[id] > r[id]) swap(l[id], r[id]);
			add(id);
			++id;
		}
		else if(ty==2){
			scanf("%d", &a);
			del(a);
		}
		else if(ty == 3){
			scanf("%d%d%d", &a, &b, &k);
			
			a = a^(lastans*G);
			b = b^(lastans*G);
			if(a>b) swap(a, b);
			lastans = get(a, b, k);
			++last;
			ans.pb(lastans);
		}
	}
	forit(it, ans){
		printf("%d\n", *it);
	}
}

int main () {
	#ifdef LOCAL
	freopen("a.in", "r", stdin);
	freopen("a.out", "w", stdout);
	#endif
    int t=1;
    //scanf("%d", &t);
    for(int i=1; i <= t; i++){
      //printf("Case #%d\n", i);
      solve();
    }

    return 0;
}

Compilation message

segments.cpp: In function 'void solve()':
segments.cpp:263:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &q, &G);
  ~~~~~^~~~~~~~~~~~~~~~
segments.cpp:269:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &ty);
   ~~~~~^~~~~~~~~~~
segments.cpp:274:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d%d", &l[id], &r[id]);
    ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
segments.cpp:282:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d", &a);
    ~~~~~^~~~~~~~~~
segments.cpp:286:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d%d%d", &a, &b, &k);
    ~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 492 KB Output is correct
3 Correct 9 ms 724 KB Output is correct
4 Correct 9 ms 736 KB Output is correct
5 Correct 13 ms 1032 KB Output is correct
6 Correct 16 ms 1220 KB Output is correct
7 Correct 15 ms 1268 KB Output is correct
8 Correct 17 ms 1436 KB Output is correct
9 Correct 11 ms 1592 KB Output is correct
10 Correct 11 ms 1700 KB Output is correct
11 Correct 24 ms 1828 KB Output is correct
12 Correct 25 ms 2004 KB Output is correct
13 Correct 9 ms 2200 KB Output is correct
14 Correct 12 ms 2200 KB Output is correct
15 Correct 7 ms 2200 KB Output is correct
16 Correct 8 ms 2412 KB Output is correct
17 Correct 15 ms 2532 KB Output is correct
18 Correct 11 ms 2768 KB Output is correct
19 Correct 19 ms 2768 KB Output is correct
20 Correct 12 ms 2904 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 989 ms 9524 KB Output is correct
2 Correct 1014 ms 11924 KB Output is correct
3 Correct 950 ms 14560 KB Output is correct
4 Correct 1014 ms 17688 KB Output is correct
5 Correct 805 ms 21872 KB Output is correct
6 Correct 666 ms 24168 KB Output is correct
7 Correct 973 ms 24500 KB Output is correct
8 Correct 1069 ms 27312 KB Output is correct
9 Correct 959 ms 29744 KB Output is correct
10 Correct 1156 ms 31156 KB Output is correct
11 Correct 1338 ms 34468 KB Output is correct
12 Correct 830 ms 39364 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 116 ms 39364 KB Output is correct
2 Correct 91 ms 39364 KB Output is correct
3 Correct 184 ms 41272 KB Output is correct
4 Correct 128 ms 43004 KB Output is correct
5 Correct 711 ms 48992 KB Output is correct
6 Correct 874 ms 50896 KB Output is correct
7 Correct 761 ms 53356 KB Output is correct
8 Correct 661 ms 56980 KB Output is correct
9 Correct 763 ms 59528 KB Output is correct
10 Correct 799 ms 60100 KB Output is correct
11 Correct 423 ms 60100 KB Output is correct
12 Correct 604 ms 64100 KB Output is correct
13 Correct 745 ms 65724 KB Output is correct
14 Correct 563 ms 66208 KB Output is correct
15 Correct 500 ms 67848 KB Output is correct
16 Correct 517 ms 69304 KB Output is correct
17 Correct 936 ms 73112 KB Output is correct
18 Correct 932 ms 75496 KB Output is correct
19 Correct 1053 ms 77924 KB Output is correct
20 Correct 875 ms 80284 KB Output is correct
21 Correct 433 ms 80284 KB Output is correct
22 Correct 660 ms 83552 KB Output is correct
23 Correct 710 ms 86304 KB Output is correct
24 Correct 604 ms 87836 KB Output is correct
25 Correct 199 ms 87836 KB Output is correct
26 Correct 108 ms 89148 KB Output is correct
27 Correct 117 ms 90988 KB Output is correct
28 Correct 131 ms 92872 KB Output is correct
29 Correct 698 ms 98076 KB Output is correct
30 Correct 657 ms 100004 KB Output is correct
31 Correct 751 ms 104232 KB Output is correct
32 Correct 688 ms 104960 KB Output is correct
33 Correct 707 ms 106744 KB Output is correct
34 Correct 513 ms 106744 KB Output is correct
35 Correct 646 ms 110040 KB Output is correct
36 Correct 692 ms 112784 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 107 ms 112784 KB Output is correct
2 Correct 125 ms 113308 KB Output is correct
3 Correct 126 ms 115352 KB Output is correct
4 Correct 156 ms 117504 KB Output is correct
5 Correct 772 ms 124088 KB Output is correct
6 Correct 1143 ms 124088 KB Output is correct
7 Correct 721 ms 129892 KB Output is correct
8 Correct 1084 ms 129892 KB Output is correct
9 Correct 651 ms 132648 KB Output is correct
10 Correct 760 ms 136724 KB Output is correct
11 Correct 586 ms 136724 KB Output is correct
12 Correct 801 ms 142248 KB Output is correct
13 Correct 773 ms 142512 KB Output is correct
14 Correct 653 ms 143056 KB Output is correct
15 Correct 696 ms 148432 KB Output is correct
16 Correct 693 ms 149244 KB Output is correct
17 Correct 1024 ms 150988 KB Output is correct
18 Correct 974 ms 153504 KB Output is correct
19 Correct 989 ms 156320 KB Output is correct
20 Correct 952 ms 158908 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 492 KB Output is correct
3 Correct 9 ms 724 KB Output is correct
4 Correct 9 ms 736 KB Output is correct
5 Correct 13 ms 1032 KB Output is correct
6 Correct 16 ms 1220 KB Output is correct
7 Correct 15 ms 1268 KB Output is correct
8 Correct 17 ms 1436 KB Output is correct
9 Correct 11 ms 1592 KB Output is correct
10 Correct 11 ms 1700 KB Output is correct
11 Correct 24 ms 1828 KB Output is correct
12 Correct 25 ms 2004 KB Output is correct
13 Correct 9 ms 2200 KB Output is correct
14 Correct 12 ms 2200 KB Output is correct
15 Correct 7 ms 2200 KB Output is correct
16 Correct 8 ms 2412 KB Output is correct
17 Correct 15 ms 2532 KB Output is correct
18 Correct 11 ms 2768 KB Output is correct
19 Correct 19 ms 2768 KB Output is correct
20 Correct 12 ms 2904 KB Output is correct
21 Correct 989 ms 9524 KB Output is correct
22 Correct 1014 ms 11924 KB Output is correct
23 Correct 950 ms 14560 KB Output is correct
24 Correct 1014 ms 17688 KB Output is correct
25 Correct 805 ms 21872 KB Output is correct
26 Correct 666 ms 24168 KB Output is correct
27 Correct 973 ms 24500 KB Output is correct
28 Correct 1069 ms 27312 KB Output is correct
29 Correct 959 ms 29744 KB Output is correct
30 Correct 1156 ms 31156 KB Output is correct
31 Correct 1338 ms 34468 KB Output is correct
32 Correct 830 ms 39364 KB Output is correct
33 Correct 107 ms 112784 KB Output is correct
34 Correct 125 ms 113308 KB Output is correct
35 Correct 126 ms 115352 KB Output is correct
36 Correct 156 ms 117504 KB Output is correct
37 Correct 772 ms 124088 KB Output is correct
38 Correct 1143 ms 124088 KB Output is correct
39 Correct 721 ms 129892 KB Output is correct
40 Correct 1084 ms 129892 KB Output is correct
41 Correct 651 ms 132648 KB Output is correct
42 Correct 760 ms 136724 KB Output is correct
43 Correct 586 ms 136724 KB Output is correct
44 Correct 801 ms 142248 KB Output is correct
45 Correct 773 ms 142512 KB Output is correct
46 Correct 653 ms 143056 KB Output is correct
47 Correct 696 ms 148432 KB Output is correct
48 Correct 693 ms 149244 KB Output is correct
49 Correct 1024 ms 150988 KB Output is correct
50 Correct 974 ms 153504 KB Output is correct
51 Correct 989 ms 156320 KB Output is correct
52 Correct 952 ms 158908 KB Output is correct
53 Correct 124 ms 158908 KB Output is correct
54 Correct 124 ms 160472 KB Output is correct
55 Correct 116 ms 162544 KB Output is correct
56 Correct 126 ms 164756 KB Output is correct
57 Correct 1121 ms 169240 KB Output is correct
58 Correct 1155 ms 170948 KB Output is correct
59 Correct 857 ms 172032 KB Output is correct
60 Correct 890 ms 172032 KB Output is correct
61 Correct 750 ms 172032 KB Output is correct
62 Correct 744 ms 172032 KB Output is correct
63 Correct 680 ms 172032 KB Output is correct
64 Correct 691 ms 172032 KB Output is correct
65 Correct 593 ms 172032 KB Output is correct
66 Correct 633 ms 172032 KB Output is correct
67 Correct 819 ms 172032 KB Output is correct
68 Correct 749 ms 172032 KB Output is correct
69 Correct 984 ms 172032 KB Output is correct
70 Correct 952 ms 172032 KB Output is correct
71 Correct 941 ms 172032 KB Output is correct
72 Correct 968 ms 172032 KB Output is correct
73 Correct 605 ms 172032 KB Output is correct
74 Correct 710 ms 172032 KB Output is correct
75 Correct 742 ms 172032 KB Output is correct
76 Correct 701 ms 172032 KB Output is correct
77 Correct 116 ms 172032 KB Output is correct
78 Correct 102 ms 172032 KB Output is correct
79 Correct 105 ms 172032 KB Output is correct
80 Correct 158 ms 172032 KB Output is correct
81 Correct 719 ms 172032 KB Output is correct
82 Correct 679 ms 172032 KB Output is correct
83 Correct 559 ms 172032 KB Output is correct
84 Correct 715 ms 172032 KB Output is correct
85 Correct 654 ms 172032 KB Output is correct
86 Correct 661 ms 172032 KB Output is correct
87 Correct 594 ms 172032 KB Output is correct
88 Correct 734 ms 172032 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 492 KB Output is correct
3 Correct 9 ms 724 KB Output is correct
4 Correct 9 ms 736 KB Output is correct
5 Correct 13 ms 1032 KB Output is correct
6 Correct 16 ms 1220 KB Output is correct
7 Correct 15 ms 1268 KB Output is correct
8 Correct 17 ms 1436 KB Output is correct
9 Correct 11 ms 1592 KB Output is correct
10 Correct 11 ms 1700 KB Output is correct
11 Correct 24 ms 1828 KB Output is correct
12 Correct 25 ms 2004 KB Output is correct
13 Correct 9 ms 2200 KB Output is correct
14 Correct 12 ms 2200 KB Output is correct
15 Correct 7 ms 2200 KB Output is correct
16 Correct 8 ms 2412 KB Output is correct
17 Correct 15 ms 2532 KB Output is correct
18 Correct 11 ms 2768 KB Output is correct
19 Correct 19 ms 2768 KB Output is correct
20 Correct 12 ms 2904 KB Output is correct
21 Correct 989 ms 9524 KB Output is correct
22 Correct 1014 ms 11924 KB Output is correct
23 Correct 950 ms 14560 KB Output is correct
24 Correct 1014 ms 17688 KB Output is correct
25 Correct 805 ms 21872 KB Output is correct
26 Correct 666 ms 24168 KB Output is correct
27 Correct 973 ms 24500 KB Output is correct
28 Correct 1069 ms 27312 KB Output is correct
29 Correct 959 ms 29744 KB Output is correct
30 Correct 1156 ms 31156 KB Output is correct
31 Correct 1338 ms 34468 KB Output is correct
32 Correct 830 ms 39364 KB Output is correct
33 Correct 116 ms 39364 KB Output is correct
34 Correct 91 ms 39364 KB Output is correct
35 Correct 184 ms 41272 KB Output is correct
36 Correct 128 ms 43004 KB Output is correct
37 Correct 711 ms 48992 KB Output is correct
38 Correct 874 ms 50896 KB Output is correct
39 Correct 761 ms 53356 KB Output is correct
40 Correct 661 ms 56980 KB Output is correct
41 Correct 763 ms 59528 KB Output is correct
42 Correct 799 ms 60100 KB Output is correct
43 Correct 423 ms 60100 KB Output is correct
44 Correct 604 ms 64100 KB Output is correct
45 Correct 745 ms 65724 KB Output is correct
46 Correct 563 ms 66208 KB Output is correct
47 Correct 500 ms 67848 KB Output is correct
48 Correct 517 ms 69304 KB Output is correct
49 Correct 936 ms 73112 KB Output is correct
50 Correct 932 ms 75496 KB Output is correct
51 Correct 1053 ms 77924 KB Output is correct
52 Correct 875 ms 80284 KB Output is correct
53 Correct 433 ms 80284 KB Output is correct
54 Correct 660 ms 83552 KB Output is correct
55 Correct 710 ms 86304 KB Output is correct
56 Correct 604 ms 87836 KB Output is correct
57 Correct 199 ms 87836 KB Output is correct
58 Correct 108 ms 89148 KB Output is correct
59 Correct 117 ms 90988 KB Output is correct
60 Correct 131 ms 92872 KB Output is correct
61 Correct 698 ms 98076 KB Output is correct
62 Correct 657 ms 100004 KB Output is correct
63 Correct 751 ms 104232 KB Output is correct
64 Correct 688 ms 104960 KB Output is correct
65 Correct 707 ms 106744 KB Output is correct
66 Correct 513 ms 106744 KB Output is correct
67 Correct 646 ms 110040 KB Output is correct
68 Correct 692 ms 112784 KB Output is correct
69 Correct 107 ms 112784 KB Output is correct
70 Correct 125 ms 113308 KB Output is correct
71 Correct 126 ms 115352 KB Output is correct
72 Correct 156 ms 117504 KB Output is correct
73 Correct 772 ms 124088 KB Output is correct
74 Correct 1143 ms 124088 KB Output is correct
75 Correct 721 ms 129892 KB Output is correct
76 Correct 1084 ms 129892 KB Output is correct
77 Correct 651 ms 132648 KB Output is correct
78 Correct 760 ms 136724 KB Output is correct
79 Correct 586 ms 136724 KB Output is correct
80 Correct 801 ms 142248 KB Output is correct
81 Correct 773 ms 142512 KB Output is correct
82 Correct 653 ms 143056 KB Output is correct
83 Correct 696 ms 148432 KB Output is correct
84 Correct 693 ms 149244 KB Output is correct
85 Correct 1024 ms 150988 KB Output is correct
86 Correct 974 ms 153504 KB Output is correct
87 Correct 989 ms 156320 KB Output is correct
88 Correct 952 ms 158908 KB Output is correct
89 Correct 124 ms 158908 KB Output is correct
90 Correct 124 ms 160472 KB Output is correct
91 Correct 116 ms 162544 KB Output is correct
92 Correct 126 ms 164756 KB Output is correct
93 Correct 1121 ms 169240 KB Output is correct
94 Correct 1155 ms 170948 KB Output is correct
95 Correct 857 ms 172032 KB Output is correct
96 Correct 890 ms 172032 KB Output is correct
97 Correct 750 ms 172032 KB Output is correct
98 Correct 744 ms 172032 KB Output is correct
99 Correct 680 ms 172032 KB Output is correct
100 Correct 691 ms 172032 KB Output is correct
101 Correct 593 ms 172032 KB Output is correct
102 Correct 633 ms 172032 KB Output is correct
103 Correct 819 ms 172032 KB Output is correct
104 Correct 749 ms 172032 KB Output is correct
105 Correct 984 ms 172032 KB Output is correct
106 Correct 952 ms 172032 KB Output is correct
107 Correct 941 ms 172032 KB Output is correct
108 Correct 968 ms 172032 KB Output is correct
109 Correct 605 ms 172032 KB Output is correct
110 Correct 710 ms 172032 KB Output is correct
111 Correct 742 ms 172032 KB Output is correct
112 Correct 701 ms 172032 KB Output is correct
113 Correct 116 ms 172032 KB Output is correct
114 Correct 102 ms 172032 KB Output is correct
115 Correct 105 ms 172032 KB Output is correct
116 Correct 158 ms 172032 KB Output is correct
117 Correct 719 ms 172032 KB Output is correct
118 Correct 679 ms 172032 KB Output is correct
119 Correct 559 ms 172032 KB Output is correct
120 Correct 715 ms 172032 KB Output is correct
121 Correct 654 ms 172032 KB Output is correct
122 Correct 661 ms 172032 KB Output is correct
123 Correct 594 ms 172032 KB Output is correct
124 Correct 734 ms 172032 KB Output is correct
125 Correct 240 ms 172032 KB Output is correct
126 Correct 294 ms 172032 KB Output is correct
127 Correct 285 ms 172032 KB Output is correct
128 Correct 305 ms 172032 KB Output is correct
129 Correct 259 ms 172032 KB Output is correct
130 Correct 273 ms 172032 KB Output is correct
131 Correct 2412 ms 172032 KB Output is correct
132 Correct 2374 ms 172032 KB Output is correct
133 Correct 2692 ms 172032 KB Output is correct
134 Correct 2519 ms 172032 KB Output is correct
135 Correct 2606 ms 172032 KB Output is correct
136 Correct 1842 ms 172032 KB Output is correct
137 Correct 3873 ms 172032 KB Output is correct
138 Correct 3157 ms 172032 KB Output is correct
139 Correct 3180 ms 172032 KB Output is correct
140 Correct 3165 ms 172032 KB Output is correct
141 Correct 3167 ms 172032 KB Output is correct
142 Correct 1248 ms 172032 KB Output is correct
143 Correct 1694 ms 172032 KB Output is correct
144 Correct 1070 ms 172032 KB Output is correct
145 Correct 3590 ms 172032 KB Output is correct
146 Correct 2139 ms 172032 KB Output is correct
147 Correct 1850 ms 172032 KB Output is correct
148 Correct 1524 ms 172032 KB Output is correct
149 Correct 2665 ms 172032 KB Output is correct
150 Correct 2822 ms 172032 KB Output is correct
151 Correct 2577 ms 172032 KB Output is correct
152 Correct 2509 ms 172032 KB Output is correct
153 Correct 2508 ms 172032 KB Output is correct
154 Correct 2383 ms 172032 KB Output is correct
155 Correct 1364 ms 172032 KB Output is correct
156 Correct 1758 ms 172032 KB Output is correct
157 Correct 3532 ms 172032 KB Output is correct
158 Correct 3750 ms 172032 KB Output is correct
159 Correct 3007 ms 172032 KB Output is correct
160 Correct 2489 ms 172032 KB Output is correct
161 Correct 348 ms 172032 KB Output is correct
162 Correct 381 ms 172032 KB Output is correct
163 Correct 292 ms 172032 KB Output is correct
164 Correct 600 ms 172032 KB Output is correct
165 Correct 358 ms 172032 KB Output is correct
166 Correct 252 ms 172032 KB Output is correct
167 Correct 3585 ms 172032 KB Output is correct
168 Correct 3619 ms 172032 KB Output is correct
169 Correct 3696 ms 172032 KB Output is correct
170 Correct 3167 ms 172032 KB Output is correct
171 Correct 2798 ms 172032 KB Output is correct
172 Correct 2084 ms 172032 KB Output is correct
173 Correct 3838 ms 172032 KB Output is correct
174 Correct 2128 ms 172032 KB Output is correct
175 Correct 3346 ms 172032 KB Output is correct
176 Correct 1626 ms 172032 KB Output is correct
177 Correct 2676 ms 172032 KB Output is correct
178 Correct 2805 ms 172032 KB Output is correct