oj.uz

Submission #283665

# Submission time Handle Problem Language Result Execution time Memory
283665 2020-08-26T04:57:50 Z arnold518 Iqea (innopolis2018_final_C) C++14
36 / 100
 2000 ms 118148 KB 
#pragma GCC optimize ("O3")
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAXN = 1e5;
const int INF = 5e7;

int N;
pii A[MAXN+10];
vector<int> X[MAXN+10], Y[MAXN+10];

struct Line
{
	int l, r, p;
	Line(int l, int r, int p) : l(l), r(r), p(p) {}
	bool operator < (const Line &q) const { return r<q.r; }
};
int Q;
vector<Line> LX[MAXN+10], LY[MAXN+10];
vector<int> adjX[MAXN+10], adjY[MAXN+10];

pii get(int y, int x)
{
	int nx=lower_bound(LX[y].begin(), LX[y].end(), Line(0, x, 0))->p;
	int ny=lower_bound(LY[x].begin(), LY[x].end(), Line(0, y, 0))->p;
	return {nx, ny};
}

pii P[MAXN+10], T[MAXN+10];
vector<int> VX[MAXN+10], VY[MAXN+10];
unordered_map<ll, int> M2;

struct Tree
{
	int M;
	//vector<vector<int>> adj, cdist;
	//vector<int> sz, del, cpar, cdep;
	int sz[MAXN+10], del[MAXN+10], cpar[MAXN+10], cdist[MAXN+10][30], cdep[MAXN+10];
	vector<int> adj[MAXN+10];

	Tree()
	{
		M=0;
		memset(sz, 0, sizeof(sz));
		memset(del, 0, sizeof(del));
		memset(cpar, 0, sizeof(cpar));
		memset(cdist, 0, sizeof(cdist));
		memset(cdep, 0, sizeof(cdep));
		//sz=del=cpar=cdep=vector<int>(MAXN+10);
		//cdist.resize(MAXN+10);
		//for(auto &it : cdist) it.resize(30);
		//adj.resize(MAXN+10);
	}

	void getsz(int now, int bef)
	{
		sz[now]=1;
		for(int nxt : adj[now])
		{
			if(nxt==bef) continue;
			if(del[nxt]) continue;
			getsz(nxt, now);
			sz[now]+=sz[nxt];
		}
	}

	int getcen(int now, int bef, int S)
	{
		for(int nxt : adj[now])
		{
			if(nxt==bef) continue;
			if(del[nxt]) continue;
			if(sz[nxt]>S/2) return getcen(nxt, now, S);
		}
		return now;
	}

	void dfs(int now, int bef, int t, int dist)
	{
		cdist[now][t]=dist;
		for(int nxt : adj[now])
		{
			if(nxt==bef) continue;
			if(del[nxt]) continue;
			dfs(nxt, now, t, dist+1);
		}
	}

	void decomp(int now, int bef, int cendep)
	{
		getsz(now, now);
		now=getcen(now, now, sz[now]);
		cpar[now]=bef;
		cdep[now]=cendep;

		dfs(now, now, cendep, 0);
		del[now]=true;

		for(auto nxt : adj[now])
		{
			if(del[nxt]) continue;
			decomp(nxt, now, cendep+1);
		}
	}

	void init()
	{
		decomp(1, 0, 1);
		for(int i=1; i<=M; i++) if(!del[i]) while(1);
	}

	vector<int> getpar(int now)
	{
		vector<int> ans;
		while(now)
		{
			ans.push_back(now);
			now=cpar[now];
		}
		return ans;
	}
}TX, TY;

unordered_map<ll, int> M;

int readInt () {
	bool minus = false;
	int result = 0;
	char ch;
	ch = getchar();
	while (true) {
		if (ch == '-') break;
		if (ch >= '0' && ch <= '9') break;
		ch = getchar();
	}
	if (ch == '-') minus = true; else result = ch-'0';
	while (true) {
		ch = getchar();
		if (ch < '0' || ch > '9') break;
		result = result*10 + (ch - '0');
	}
	if (minus)
		return -result;
	else
		return result;
}

int main()
{
	scanf("%d", &N);
	for(int i=1; i<=N; i++)
	{
		int y, x;
		//y=readInt(); x=readInt();
		scanf("%d%d", &y, &x);
		A[i]={y, x};
		X[y].push_back(x);
		Y[x].push_back(y);
	}

	for(int i=1; i<=MAXN; i++)
	{
		if(X[i].empty()) continue;
		sort(X[i].begin(), X[i].end());

		int bef=X[i][0];
		for(int j=0; j+1<X[i].size(); j++)
		{
			if(X[i][j]+1<X[i][j+1])
			{
				LX[i].push_back({bef, X[i][j], ++TX.M});
				//printf("LX %d %d %d %d\n", i, LX[i].back().l, LX[i].back().r, LX[i].back().p);
				bef=X[i][j+1];
			}
		}
		LX[i].push_back({bef, X[i].back(), ++TX.M});
		//printf("LX %d %d %d %d\n", i, LX[i].back().l, LX[i].back().r, LX[i].back().p);
	}

	int cnt=0;
	for(int i=2; i<=MAXN; i++)
	{
		if(LX[i].empty() || LX[i-1].empty()) continue;
		int p=0;
		for(auto it : LX[i])
		{
			for(; p<LX[i-1].size() && LX[i-1][p].r<it.l; p++);
			for(; p<LX[i-1].size() && LX[i-1][p].l<=it.r; p++)
			{
				int u=LX[i-1][p].p, v=it.p;
				TX.adj[u].push_back(v);
				TX.adj[v].push_back(u);
				cnt++;
				//printf("adjX %d %d\n", u, v);
			}
			if(p) p--;
		}
	}
	if(cnt!=TX.M-1) while(1);

	for(int i=1; i<=MAXN; i++)
	{
		if(Y[i].empty()) continue;
		sort(Y[i].begin(), Y[i].end());

		int bef=Y[i][0];
		for(int j=0; j+1<Y[i].size(); j++)
		{
			if(Y[i][j]+1!=Y[i][j+1])
			{
				LY[i].push_back({bef, Y[i][j], ++TY.M});
				//printf("LY %d %d %d %d\n", i, LY[i].back().l, LY[i].back().r, LY[i].back().p);
				bef=Y[i][j+1];
			}
		}
		LY[i].push_back({bef, Y[i].back(), ++TY.M});
		//printf("LY %d %d %d %d\n", i, LY[i].back().l, LY[i].back().r, LY[i].back().p);
	}

	cnt=0;
	for(int i=2; i<=MAXN; i++)
	{
		if(LY[i].empty() || LY[i-1].empty()) continue;
		int p=0;
		for(auto it : LY[i])
		{
			for(; p<LY[i-1].size() && LY[i-1][p].r<it.l; p++);
			for(; p<LY[i-1].size() && LY[i-1][p].l<=it.r; p++)
			{
				int u=LY[i-1][p].p, v=it.p;
				TY.adj[u].push_back(v);
				TY.adj[v].push_back(u);
				cnt++;
				//printf("adjY %d %d\n", u, v);
			}
			if(p) p--;
		}
	}
	if(cnt!=TY.M-1) while(1);

	TX.init(); TY.init();

	for(int i=1; i<=N; i++)
	{
		pii t=get(A[i].first, A[i].second);
		VX[i]=TX.getpar(t.first);
		VY[i]=TY.getpar(t.second);
		T[i]=t;

		ll pt=((ll)A[i].first<<20)|A[i].second;
		M2[pt]=i;
	}

	scanf("%d", &Q);
	bool flag=false;
	while(Q--)
	{
		int tt, y, x;
		scanf("%d%d%d", &tt, &y, &x);
		//tt=readInt(); y=readInt(); x=readInt();

		int pt=M2[((ll)y<<20)|x];
		vector<int> &V1=VX[pt], &V2=VY[pt];
		pii &t=T[pt];
		if(tt==1)
		{
			for(auto it : V1) for(auto jt : V2)
			{
				ll pt=((ll)it<<20)|jt;
				if(M.find(pt)==M.end()) M[pt]=INF;
				M[pt]=min(M[pt], TX.cdist[t.first][TX.cdep[it]]+TY.cdist[t.second][TY.cdep[jt]]);
			}
			flag=true;
		}
		else
		{
			if(!flag) { printf("-1\n"); continue; }
			int ans=INF;
			for(auto it : V1) for(auto jt : V2)
			{
				ll pt=((ll)it<<20)|jt;
				if(M.find(pt)==M.end()) continue;
				ans=min(ans, TX.cdist[t.first][TX.cdep[it]]+TY.cdist[t.second][TY.cdep[jt]]+M[pt]);
			}
			if(ans==INF) ans=-1;
			//if(ans!=-1) assert(flag);
			printf("%d\n", ans);
		}
	}
}

Compilation message

C.cpp: In function 'int main()':
C.cpp:174:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  174 |   for(int j=0; j+1<X[i].size(); j++)
      |                ~~~^~~~~~~~~~~~
C.cpp:194:11: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Line>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  194 |    for(; p<LX[i-1].size() && LX[i-1][p].r<it.l; p++);
      |          ~^~~~~~~~~~~~~~~
C.cpp:195:11: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Line>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  195 |    for(; p<LX[i-1].size() && LX[i-1][p].l<=it.r; p++)
      |          ~^~~~~~~~~~~~~~~
C.cpp:214:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  214 |   for(int j=0; j+1<Y[i].size(); j++)
      |                ~~~^~~~~~~~~~~~
C.cpp:234:11: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Line>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  234 |    for(; p<LY[i-1].size() && LY[i-1][p].r<it.l; p++);
      |          ~^~~~~~~~~~~~~~~
C.cpp:235:11: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Line>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  235 |    for(; p<LY[i-1].size() && LY[i-1][p].l<=it.r; p++)
      |          ~^~~~~~~~~~~~~~~
C.cpp:157:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  157 |  scanf("%d", &N);
      |  ~~~~~^~~~~~~~~~
C.cpp:162:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  162 |   scanf("%d%d", &y, &x);
      |   ~~~~~^~~~~~~~~~~~~~~~
C.cpp:261:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  261 |  scanf("%d", &Q);
      |  ~~~~~^~~~~~~~~~
C.cpp:266:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  266 |   scanf("%d%d%d", &tt, &y, &x);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 50560 KB Output is correct
2 Correct 37 ms 50432 KB Output is correct
3 Correct 35 ms 50432 KB Output is correct
4 Correct 56 ms 51448 KB Output is correct
5 Correct 46 ms 51456 KB Output is correct
6 Correct 47 ms 51576 KB Output is correct
7 Correct 59 ms 52472 KB Output is correct
8 Correct 70 ms 52600 KB Output is correct
9 Correct 59 ms 52600 KB Output is correct
10 Correct 58 ms 52472 KB Output is correct
11 Correct 64 ms 52600 KB Output is correct
12 Correct 57 ms 52600 KB Output is correct
13 Correct 60 ms 52728 KB Output is correct
14 Correct 57 ms 52600 KB Output is correct
15 Correct 57 ms 52600 KB Output is correct
16 Correct 58 ms 52600 KB Output is correct
17 Correct 56 ms 52600 KB Output is correct
18 Correct 56 ms 52472 KB Output is correct
19 Correct 58 ms 52216 KB Output is correct
20 Correct 59 ms 52600 KB Output is correct
21 Correct 58 ms 52600 KB Output is correct
22 Correct 63 ms 52856 KB Output is correct
23 Correct 64 ms 52856 KB Output is correct
24 Correct 67 ms 53240 KB Output is correct
25 Correct 47 ms 52344 KB Output is correct
26 Correct 51 ms 52344 KB Output is correct
27 Correct 48 ms 52344 KB Output is correct
28 Correct 65 ms 53240 KB Output is correct
29 Correct 69 ms 53240 KB Output is correct
30 Correct 65 ms 53368 KB Output is correct
31 Correct 65 ms 53368 KB Output is correct
32 Correct 66 ms 53240 KB Output is correct
33 Correct 66 ms 53112 KB Output is correct
34 Correct 68 ms 53240 KB Output is correct
35 Correct 68 ms 53368 KB Output is correct
36 Correct 45 ms 52376 KB Output is correct
37 Correct 64 ms 53272 KB Output is correct
38 Correct 70 ms 53240 KB Output is correct
39 Correct 73 ms 53368 KB Output is correct
40 Correct 66 ms 53312 KB Output is correct
41 Correct 63 ms 53088 KB Output is correct
42 Correct 61 ms 52984 KB Output is correct
43 Correct 44 ms 52344 KB Output is correct
44 Correct 74 ms 52984 KB Output is correct
45 Correct 66 ms 52988 KB Output is correct
46 Correct 46 ms 52324 KB Output is correct
47 Correct 57 ms 52216 KB Output is correct
48 Correct 52 ms 51960 KB Output is correct
49 Correct 59 ms 51968 KB Output is correct
50 Correct 50 ms 51760 KB Output is correct
51 Correct 47 ms 51608 KB Output is correct
52 Correct 52 ms 52216 KB Output is correct
53 Correct 54 ms 52344 KB Output is correct
54 Correct 63 ms 52356 KB Output is correct
55 Correct 70 ms 52344 KB Output is correct

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 50560 KB Output is correct
2 Correct 37 ms 50432 KB Output is correct
3 Correct 35 ms 50432 KB Output is correct
4 Correct 56 ms 51448 KB Output is correct
5 Correct 46 ms 51456 KB Output is correct
6 Correct 47 ms 51576 KB Output is correct
7 Correct 59 ms 52472 KB Output is correct
8 Correct 70 ms 52600 KB Output is correct
9 Correct 59 ms 52600 KB Output is correct
10 Correct 58 ms 52472 KB Output is correct
11 Correct 64 ms 52600 KB Output is correct
12 Correct 57 ms 52600 KB Output is correct
13 Correct 60 ms 52728 KB Output is correct
14 Correct 57 ms 52600 KB Output is correct
15 Correct 57 ms 52600 KB Output is correct
16 Correct 58 ms 52600 KB Output is correct
17 Correct 56 ms 52600 KB Output is correct
18 Correct 56 ms 52472 KB Output is correct
19 Correct 58 ms 52216 KB Output is correct
20 Correct 59 ms 52600 KB Output is correct
21 Correct 58 ms 52600 KB Output is correct
22 Correct 63 ms 52856 KB Output is correct
23 Correct 64 ms 52856 KB Output is correct
24 Correct 67 ms 53240 KB Output is correct
25 Correct 47 ms 52344 KB Output is correct
26 Correct 51 ms 52344 KB Output is correct
27 Correct 48 ms 52344 KB Output is correct
28 Correct 65 ms 53240 KB Output is correct
29 Correct 69 ms 53240 KB Output is correct
30 Correct 65 ms 53368 KB Output is correct
31 Correct 65 ms 53368 KB Output is correct
32 Correct 66 ms 53240 KB Output is correct
33 Correct 66 ms 53112 KB Output is correct
34 Correct 68 ms 53240 KB Output is correct
35 Correct 68 ms 53368 KB Output is correct
36 Correct 45 ms 52376 KB Output is correct
37 Correct 64 ms 53272 KB Output is correct
38 Correct 70 ms 53240 KB Output is correct
39 Correct 73 ms 53368 KB Output is correct
40 Correct 66 ms 53312 KB Output is correct
41 Correct 63 ms 53088 KB Output is correct
42 Correct 61 ms 52984 KB Output is correct
43 Correct 44 ms 52344 KB Output is correct
44 Correct 74 ms 52984 KB Output is correct
45 Correct 66 ms 52988 KB Output is correct
46 Correct 46 ms 52324 KB Output is correct
47 Correct 57 ms 52216 KB Output is correct
48 Correct 52 ms 51960 KB Output is correct
49 Correct 59 ms 51968 KB Output is correct
50 Correct 50 ms 51760 KB Output is correct
51 Correct 47 ms 51608 KB Output is correct
52 Correct 52 ms 52216 KB Output is correct
53 Correct 54 ms 52344 KB Output is correct
54 Correct 63 ms 52356 KB Output is correct
55 Correct 70 ms 52344 KB Output is correct
56 Correct 190 ms 52488 KB Output is correct
57 Correct 191 ms 52600 KB Output is correct
58 Correct 188 ms 52600 KB Output is correct
59 Correct 287 ms 54264 KB Output is correct
60 Correct 327 ms 54536 KB Output is correct
61 Correct 323 ms 54276 KB Output is correct
62 Correct 317 ms 54392 KB Output is correct
63 Correct 293 ms 54392 KB Output is correct
64 Correct 331 ms 54276 KB Output is correct
65 Correct 318 ms 54264 KB Output is correct
66 Correct 337 ms 54280 KB Output is correct
67 Correct 312 ms 54368 KB Output is correct
68 Correct 311 ms 54264 KB Output is correct
69 Correct 297 ms 53752 KB Output is correct
70 Correct 308 ms 54292 KB Output is correct
71 Correct 281 ms 53496 KB Output is correct
72 Correct 305 ms 54392 KB Output is correct
73 Correct 308 ms 54264 KB Output is correct
74 Correct 148 ms 53496 KB Output is correct
75 Correct 167 ms 53880 KB Output is correct
76 Correct 118 ms 53368 KB Output is correct
77 Correct 436 ms 55300 KB Output is correct
78 Correct 424 ms 55176 KB Output is correct
79 Correct 121 ms 53496 KB Output is correct
80 Correct 394 ms 55172 KB Output is correct
81 Correct 408 ms 55148 KB Output is correct
82 Correct 394 ms 54784 KB Output is correct
83 Correct 414 ms 55044 KB Output is correct
84 Correct 149 ms 53472 KB Output is correct
85 Correct 388 ms 54916 KB Output is correct
86 Correct 415 ms 54916 KB Output is correct
87 Correct 136 ms 53496 KB Output is correct
88 Correct 287 ms 53496 KB Output is correct
89 Correct 259 ms 53240 KB Output is correct
90 Correct 263 ms 53240 KB Output is correct
91 Correct 232 ms 52984 KB Output is correct
92 Correct 204 ms 52600 KB Output is correct
93 Correct 285 ms 53752 KB Output is correct
94 Correct 320 ms 53780 KB Output is correct
95 Correct 310 ms 53752 KB Output is correct
96 Correct 319 ms 53752 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 487 ms 92168 KB Output is correct
2 Correct 497 ms 91804 KB Output is correct
3 Correct 1819 ms 118148 KB Output is correct
4 Correct 1857 ms 118008 KB Output is correct
5 Correct 1933 ms 117692 KB Output is correct
6 Execution timed out 2001 ms 117472 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1413 ms 97512 KB Output is correct
2 Correct 1410 ms 97604 KB Output is correct
3 Correct 1451 ms 97644 KB Output is correct
4 Correct 1591 ms 106340 KB Output is correct
5 Correct 1545 ms 106476 KB Output is correct
6 Correct 1607 ms 106220 KB Output is correct
7 Correct 1349 ms 97068 KB Output is correct
8 Correct 1426 ms 97124 KB Output is correct
9 Correct 1425 ms 97900 KB Output is correct
10 Correct 1912 ms 110200 KB Output is correct
11 Correct 1908 ms 110308 KB Output is correct
12 Execution timed out 2065 ms 114024 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 50560 KB Output is correct
2 Correct 37 ms 50432 KB Output is correct
3 Correct 35 ms 50432 KB Output is correct
4 Correct 56 ms 51448 KB Output is correct
5 Correct 46 ms 51456 KB Output is correct
6 Correct 47 ms 51576 KB Output is correct
7 Correct 59 ms 52472 KB Output is correct
8 Correct 70 ms 52600 KB Output is correct
9 Correct 59 ms 52600 KB Output is correct
10 Correct 58 ms 52472 KB Output is correct
11 Correct 64 ms 52600 KB Output is correct
12 Correct 57 ms 52600 KB Output is correct
13 Correct 60 ms 52728 KB Output is correct
14 Correct 57 ms 52600 KB Output is correct
15 Correct 57 ms 52600 KB Output is correct
16 Correct 58 ms 52600 KB Output is correct
17 Correct 56 ms 52600 KB Output is correct
18 Correct 56 ms 52472 KB Output is correct
19 Correct 58 ms 52216 KB Output is correct
20 Correct 59 ms 52600 KB Output is correct
21 Correct 58 ms 52600 KB Output is correct
22 Correct 63 ms 52856 KB Output is correct
23 Correct 64 ms 52856 KB Output is correct
24 Correct 67 ms 53240 KB Output is correct
25 Correct 47 ms 52344 KB Output is correct
26 Correct 51 ms 52344 KB Output is correct
27 Correct 48 ms 52344 KB Output is correct
28 Correct 65 ms 53240 KB Output is correct
29 Correct 69 ms 53240 KB Output is correct
30 Correct 65 ms 53368 KB Output is correct
31 Correct 65 ms 53368 KB Output is correct
32 Correct 66 ms 53240 KB Output is correct
33 Correct 66 ms 53112 KB Output is correct
34 Correct 68 ms 53240 KB Output is correct
35 Correct 68 ms 53368 KB Output is correct
36 Correct 45 ms 52376 KB Output is correct
37 Correct 64 ms 53272 KB Output is correct
38 Correct 70 ms 53240 KB Output is correct
39 Correct 73 ms 53368 KB Output is correct
40 Correct 66 ms 53312 KB Output is correct
41 Correct 63 ms 53088 KB Output is correct
42 Correct 61 ms 52984 KB Output is correct
43 Correct 44 ms 52344 KB Output is correct
44 Correct 74 ms 52984 KB Output is correct
45 Correct 66 ms 52988 KB Output is correct
46 Correct 46 ms 52324 KB Output is correct
47 Correct 57 ms 52216 KB Output is correct
48 Correct 52 ms 51960 KB Output is correct
49 Correct 59 ms 51968 KB Output is correct
50 Correct 50 ms 51760 KB Output is correct
51 Correct 47 ms 51608 KB Output is correct
52 Correct 52 ms 52216 KB Output is correct
53 Correct 54 ms 52344 KB Output is correct
54 Correct 63 ms 52356 KB Output is correct
55 Correct 70 ms 52344 KB Output is correct
56 Correct 190 ms 52488 KB Output is correct
57 Correct 191 ms 52600 KB Output is correct
58 Correct 188 ms 52600 KB Output is correct
59 Correct 287 ms 54264 KB Output is correct
60 Correct 327 ms 54536 KB Output is correct
61 Correct 323 ms 54276 KB Output is correct
62 Correct 317 ms 54392 KB Output is correct
63 Correct 293 ms 54392 KB Output is correct
64 Correct 331 ms 54276 KB Output is correct
65 Correct 318 ms 54264 KB Output is correct
66 Correct 337 ms 54280 KB Output is correct
67 Correct 312 ms 54368 KB Output is correct
68 Correct 311 ms 54264 KB Output is correct
69 Correct 297 ms 53752 KB Output is correct
70 Correct 308 ms 54292 KB Output is correct
71 Correct 281 ms 53496 KB Output is correct
72 Correct 305 ms 54392 KB Output is correct
73 Correct 308 ms 54264 KB Output is correct
74 Correct 148 ms 53496 KB Output is correct
75 Correct 167 ms 53880 KB Output is correct
76 Correct 118 ms 53368 KB Output is correct
77 Correct 436 ms 55300 KB Output is correct
78 Correct 424 ms 55176 KB Output is correct
79 Correct 121 ms 53496 KB Output is correct
80 Correct 394 ms 55172 KB Output is correct
81 Correct 408 ms 55148 KB Output is correct
82 Correct 394 ms 54784 KB Output is correct
83 Correct 414 ms 55044 KB Output is correct
84 Correct 149 ms 53472 KB Output is correct
85 Correct 388 ms 54916 KB Output is correct
86 Correct 415 ms 54916 KB Output is correct
87 Correct 136 ms 53496 KB Output is correct
88 Correct 287 ms 53496 KB Output is correct
89 Correct 259 ms 53240 KB Output is correct
90 Correct 263 ms 53240 KB Output is correct
91 Correct 232 ms 52984 KB Output is correct
92 Correct 204 ms 52600 KB Output is correct
93 Correct 285 ms 53752 KB Output is correct
94 Correct 320 ms 53780 KB Output is correct
95 Correct 310 ms 53752 KB Output is correct
96 Correct 319 ms 53752 KB Output is correct
97 Correct 487 ms 92168 KB Output is correct
98 Correct 497 ms 91804 KB Output is correct
99 Correct 1819 ms 118148 KB Output is correct
100 Correct 1857 ms 118008 KB Output is correct
101 Correct 1933 ms 117692 KB Output is correct
102 Execution timed out 2001 ms 117472 KB Time limit exceeded
103 Halted 0 ms 0 KB -