oj.uz

답안 #283657

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
283657 2020-08-26T04:46:36 Z arnold518 Iqea (innopolis2018_final_C) C++14
51 / 100
 2000 ms 117812 KB 
#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 main()
{
	scanf("%d", &N);
	for(int i=1; i<=N; i++)
	{
		int y, x;
		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++)
	{
		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++)
	{
		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);

		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:147:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  147 |   for(int j=0; j+1<X[i].size(); j++)
      |                ~~~^~~~~~~~~~~~
C.cpp:166:11: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Line>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  166 |    for(; p<LX[i-1].size() && LX[i-1][p].r<it.l; p++);
      |          ~^~~~~~~~~~~~~~~
C.cpp:167:11: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Line>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  167 |    for(; p<LX[i-1].size() && LX[i-1][p].l<=it.r; p++)
      |          ~^~~~~~~~~~~~~~~
C.cpp:186:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  186 |   for(int j=0; j+1<Y[i].size(); j++)
      |                ~~~^~~~~~~~~~~~
C.cpp:205:11: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Line>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  205 |    for(; p<LY[i-1].size() && LY[i-1][p].r<it.l; p++);
      |          ~^~~~~~~~~~~~~~~
C.cpp:206:11: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Line>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  206 |    for(; p<LY[i-1].size() && LY[i-1][p].l<=it.r; p++)
      |          ~^~~~~~~~~~~~~~~
C.cpp:131:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  131 |  scanf("%d", &N);
      |  ~~~~~^~~~~~~~~~
C.cpp:135:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  135 |   scanf("%d%d", &y, &x);
      |   ~~~~~^~~~~~~~~~~~~~~~
C.cpp:232:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  232 |  scanf("%d", &Q);
      |  ~~~~~^~~~~~~~~~
C.cpp:237:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  237 |   scanf("%d%d%d", &tt, &y, &x);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 50424 KB Output is correct
2 Correct 30 ms 50556 KB Output is correct
3 Correct 31 ms 50424 KB Output is correct
4 Correct 44 ms 51448 KB Output is correct
5 Correct 44 ms 51448 KB Output is correct
6 Correct 43 ms 51412 KB Output is correct
7 Correct 56 ms 52344 KB Output is correct
8 Correct 56 ms 52472 KB Output is correct
9 Correct 53 ms 52472 KB Output is correct
10 Correct 53 ms 52344 KB Output is correct
11 Correct 56 ms 52472 KB Output is correct
12 Correct 55 ms 52472 KB Output is correct
13 Correct 56 ms 52472 KB Output is correct
14 Correct 54 ms 52472 KB Output is correct
15 Correct 63 ms 52472 KB Output is correct
16 Correct 56 ms 52472 KB Output is correct
17 Correct 57 ms 52472 KB Output is correct
18 Correct 55 ms 52344 KB Output is correct
19 Correct 57 ms 52088 KB Output is correct
20 Correct 58 ms 52472 KB Output is correct
21 Correct 56 ms 52472 KB Output is correct
22 Correct 63 ms 52728 KB Output is correct
23 Correct 62 ms 52856 KB Output is correct
24 Correct 64 ms 53112 KB Output is correct
25 Correct 45 ms 52216 KB Output is correct
26 Correct 46 ms 52344 KB Output is correct
27 Correct 42 ms 52224 KB Output is correct
28 Correct 70 ms 53176 KB Output is correct
29 Correct 70 ms 53112 KB Output is correct
30 Correct 70 ms 53240 KB Output is correct
31 Correct 65 ms 53240 KB Output is correct
32 Correct 64 ms 53112 KB Output is correct
33 Correct 75 ms 52984 KB Output is correct
34 Correct 62 ms 53112 KB Output is correct
35 Correct 65 ms 53112 KB Output is correct
36 Correct 42 ms 52216 KB Output is correct
37 Correct 64 ms 53112 KB Output is correct
38 Correct 65 ms 53112 KB Output is correct
39 Correct 63 ms 53240 KB Output is correct
40 Correct 65 ms 53240 KB Output is correct
41 Correct 64 ms 53112 KB Output is correct
42 Correct 63 ms 52916 KB Output is correct
43 Correct 52 ms 52276 KB Output is correct
44 Correct 60 ms 52984 KB Output is correct
45 Correct 60 ms 52856 KB Output is correct
46 Correct 43 ms 52216 KB Output is correct
47 Correct 63 ms 52088 KB Output is correct
48 Correct 52 ms 51836 KB Output is correct
49 Correct 51 ms 51832 KB Output is correct
50 Correct 49 ms 51576 KB Output is correct
51 Correct 47 ms 51448 KB Output is correct
52 Correct 54 ms 52216 KB Output is correct
53 Correct 54 ms 52216 KB Output is correct
54 Correct 55 ms 52216 KB Output is correct
55 Correct 59 ms 52344 KB Output is correct

Subtask #2
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 50424 KB Output is correct
2 Correct 30 ms 50556 KB Output is correct
3 Correct 31 ms 50424 KB Output is correct
4 Correct 44 ms 51448 KB Output is correct
5 Correct 44 ms 51448 KB Output is correct
6 Correct 43 ms 51412 KB Output is correct
7 Correct 56 ms 52344 KB Output is correct
8 Correct 56 ms 52472 KB Output is correct
9 Correct 53 ms 52472 KB Output is correct
10 Correct 53 ms 52344 KB Output is correct
11 Correct 56 ms 52472 KB Output is correct
12 Correct 55 ms 52472 KB Output is correct
13 Correct 56 ms 52472 KB Output is correct
14 Correct 54 ms 52472 KB Output is correct
15 Correct 63 ms 52472 KB Output is correct
16 Correct 56 ms 52472 KB Output is correct
17 Correct 57 ms 52472 KB Output is correct
18 Correct 55 ms 52344 KB Output is correct
19 Correct 57 ms 52088 KB Output is correct
20 Correct 58 ms 52472 KB Output is correct
21 Correct 56 ms 52472 KB Output is correct
22 Correct 63 ms 52728 KB Output is correct
23 Correct 62 ms 52856 KB Output is correct
24 Correct 64 ms 53112 KB Output is correct
25 Correct 45 ms 52216 KB Output is correct
26 Correct 46 ms 52344 KB Output is correct
27 Correct 42 ms 52224 KB Output is correct
28 Correct 70 ms 53176 KB Output is correct
29 Correct 70 ms 53112 KB Output is correct
30 Correct 70 ms 53240 KB Output is correct
31 Correct 65 ms 53240 KB Output is correct
32 Correct 64 ms 53112 KB Output is correct
33 Correct 75 ms 52984 KB Output is correct
34 Correct 62 ms 53112 KB Output is correct
35 Correct 65 ms 53112 KB Output is correct
36 Correct 42 ms 52216 KB Output is correct
37 Correct 64 ms 53112 KB Output is correct
38 Correct 65 ms 53112 KB Output is correct
39 Correct 63 ms 53240 KB Output is correct
40 Correct 65 ms 53240 KB Output is correct
41 Correct 64 ms 53112 KB Output is correct
42 Correct 63 ms 52916 KB Output is correct
43 Correct 52 ms 52276 KB Output is correct
44 Correct 60 ms 52984 KB Output is correct
45 Correct 60 ms 52856 KB Output is correct
46 Correct 43 ms 52216 KB Output is correct
47 Correct 63 ms 52088 KB Output is correct
48 Correct 52 ms 51836 KB Output is correct
49 Correct 51 ms 51832 KB Output is correct
50 Correct 49 ms 51576 KB Output is correct
51 Correct 47 ms 51448 KB Output is correct
52 Correct 54 ms 52216 KB Output is correct
53 Correct 54 ms 52216 KB Output is correct
54 Correct 55 ms 52216 KB Output is correct
55 Correct 59 ms 52344 KB Output is correct
56 Correct 184 ms 51832 KB Output is correct
57 Correct 193 ms 51832 KB Output is correct
58 Correct 188 ms 51960 KB Output is correct
59 Correct 289 ms 53624 KB Output is correct
60 Correct 323 ms 53624 KB Output is correct
61 Correct 318 ms 53752 KB Output is correct
62 Correct 346 ms 53624 KB Output is correct
63 Correct 303 ms 53764 KB Output is correct
64 Correct 323 ms 53636 KB Output is correct
65 Correct 298 ms 53624 KB Output is correct
66 Correct 314 ms 53636 KB Output is correct
67 Correct 314 ms 53748 KB Output is correct
68 Correct 298 ms 53624 KB Output is correct
69 Correct 290 ms 53112 KB Output is correct
70 Correct 320 ms 53584 KB Output is correct
71 Correct 302 ms 52840 KB Output is correct
72 Correct 314 ms 53624 KB Output is correct
73 Correct 320 ms 53628 KB Output is correct
74 Correct 136 ms 52856 KB Output is correct
75 Correct 166 ms 53240 KB Output is correct
76 Correct 116 ms 52644 KB Output is correct
77 Correct 413 ms 54636 KB Output is correct
78 Correct 429 ms 54656 KB Output is correct
79 Correct 117 ms 52856 KB Output is correct
80 Correct 417 ms 54532 KB Output is correct
81 Correct 401 ms 54496 KB Output is correct
82 Correct 386 ms 54148 KB Output is correct
83 Correct 384 ms 54280 KB Output is correct
84 Correct 136 ms 52728 KB Output is correct
85 Correct 374 ms 54308 KB Output is correct
86 Correct 395 ms 54148 KB Output is correct
87 Correct 130 ms 52856 KB Output is correct
88 Correct 342 ms 52888 KB Output is correct
89 Correct 263 ms 52600 KB Output is correct
90 Correct 253 ms 52600 KB Output is correct
91 Correct 239 ms 52216 KB Output is correct
92 Correct 215 ms 51964 KB Output is correct
93 Correct 306 ms 53112 KB Output is correct
94 Correct 341 ms 52984 KB Output is correct
95 Correct 378 ms 53112 KB Output is correct
96 Correct 341 ms 53116 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 484 ms 91272 KB Output is correct
2 Correct 510 ms 91400 KB Output is correct
3 Correct 1995 ms 117360 KB Output is correct
4 Correct 1990 ms 117812 KB Output is correct
5 Correct 1902 ms 117524 KB Output is correct
6 Correct 1988 ms 117372 KB Output is correct
7 Correct 948 ms 82096 KB Output is correct
8 Correct 462 ms 83208 KB Output is correct
9 Correct 440 ms 88072 KB Output is correct
10 Correct 1418 ms 82616 KB Output is correct
11 Correct 744 ms 87816 KB Output is correct
12 Correct 459 ms 89456 KB Output is correct
13 Correct 409 ms 88336 KB Output is correct
14 Correct 455 ms 89736 KB Output is correct

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1448 ms 96980 KB Output is correct
2 Correct 1455 ms 97512 KB Output is correct
3 Correct 1656 ms 97296 KB Output is correct
4 Correct 1730 ms 106480 KB Output is correct
5 Correct 1639 ms 106164 KB Output is correct
6 Correct 1768 ms 105964 KB Output is correct
7 Correct 1453 ms 97028 KB Output is correct
8 Correct 1462 ms 97128 KB Output is correct
9 Correct 1526 ms 97904 KB Output is correct
10 Correct 1929 ms 110368 KB Output is correct
11 Correct 1832 ms 110200 KB Output is correct
12 Execution timed out 2097 ms 114024 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 50424 KB Output is correct
2 Correct 30 ms 50556 KB Output is correct
3 Correct 31 ms 50424 KB Output is correct
4 Correct 44 ms 51448 KB Output is correct
5 Correct 44 ms 51448 KB Output is correct
6 Correct 43 ms 51412 KB Output is correct
7 Correct 56 ms 52344 KB Output is correct
8 Correct 56 ms 52472 KB Output is correct
9 Correct 53 ms 52472 KB Output is correct
10 Correct 53 ms 52344 KB Output is correct
11 Correct 56 ms 52472 KB Output is correct
12 Correct 55 ms 52472 KB Output is correct
13 Correct 56 ms 52472 KB Output is correct
14 Correct 54 ms 52472 KB Output is correct
15 Correct 63 ms 52472 KB Output is correct
16 Correct 56 ms 52472 KB Output is correct
17 Correct 57 ms 52472 KB Output is correct
18 Correct 55 ms 52344 KB Output is correct
19 Correct 57 ms 52088 KB Output is correct
20 Correct 58 ms 52472 KB Output is correct
21 Correct 56 ms 52472 KB Output is correct
22 Correct 63 ms 52728 KB Output is correct
23 Correct 62 ms 52856 KB Output is correct
24 Correct 64 ms 53112 KB Output is correct
25 Correct 45 ms 52216 KB Output is correct
26 Correct 46 ms 52344 KB Output is correct
27 Correct 42 ms 52224 KB Output is correct
28 Correct 70 ms 53176 KB Output is correct
29 Correct 70 ms 53112 KB Output is correct
30 Correct 70 ms 53240 KB Output is correct
31 Correct 65 ms 53240 KB Output is correct
32 Correct 64 ms 53112 KB Output is correct
33 Correct 75 ms 52984 KB Output is correct
34 Correct 62 ms 53112 KB Output is correct
35 Correct 65 ms 53112 KB Output is correct
36 Correct 42 ms 52216 KB Output is correct
37 Correct 64 ms 53112 KB Output is correct
38 Correct 65 ms 53112 KB Output is correct
39 Correct 63 ms 53240 KB Output is correct
40 Correct 65 ms 53240 KB Output is correct
41 Correct 64 ms 53112 KB Output is correct
42 Correct 63 ms 52916 KB Output is correct
43 Correct 52 ms 52276 KB Output is correct
44 Correct 60 ms 52984 KB Output is correct
45 Correct 60 ms 52856 KB Output is correct
46 Correct 43 ms 52216 KB Output is correct
47 Correct 63 ms 52088 KB Output is correct
48 Correct 52 ms 51836 KB Output is correct
49 Correct 51 ms 51832 KB Output is correct
50 Correct 49 ms 51576 KB Output is correct
51 Correct 47 ms 51448 KB Output is correct
52 Correct 54 ms 52216 KB Output is correct
53 Correct 54 ms 52216 KB Output is correct
54 Correct 55 ms 52216 KB Output is correct
55 Correct 59 ms 52344 KB Output is correct
56 Correct 184 ms 51832 KB Output is correct
57 Correct 193 ms 51832 KB Output is correct
58 Correct 188 ms 51960 KB Output is correct
59 Correct 289 ms 53624 KB Output is correct
60 Correct 323 ms 53624 KB Output is correct
61 Correct 318 ms 53752 KB Output is correct
62 Correct 346 ms 53624 KB Output is correct
63 Correct 303 ms 53764 KB Output is correct
64 Correct 323 ms 53636 KB Output is correct
65 Correct 298 ms 53624 KB Output is correct
66 Correct 314 ms 53636 KB Output is correct
67 Correct 314 ms 53748 KB Output is correct
68 Correct 298 ms 53624 KB Output is correct
69 Correct 290 ms 53112 KB Output is correct
70 Correct 320 ms 53584 KB Output is correct
71 Correct 302 ms 52840 KB Output is correct
72 Correct 314 ms 53624 KB Output is correct
73 Correct 320 ms 53628 KB Output is correct
74 Correct 136 ms 52856 KB Output is correct
75 Correct 166 ms 53240 KB Output is correct
76 Correct 116 ms 52644 KB Output is correct
77 Correct 413 ms 54636 KB Output is correct
78 Correct 429 ms 54656 KB Output is correct
79 Correct 117 ms 52856 KB Output is correct
80 Correct 417 ms 54532 KB Output is correct
81 Correct 401 ms 54496 KB Output is correct
82 Correct 386 ms 54148 KB Output is correct
83 Correct 384 ms 54280 KB Output is correct
84 Correct 136 ms 52728 KB Output is correct
85 Correct 374 ms 54308 KB Output is correct
86 Correct 395 ms 54148 KB Output is correct
87 Correct 130 ms 52856 KB Output is correct
88 Correct 342 ms 52888 KB Output is correct
89 Correct 263 ms 52600 KB Output is correct
90 Correct 253 ms 52600 KB Output is correct
91 Correct 239 ms 52216 KB Output is correct
92 Correct 215 ms 51964 KB Output is correct
93 Correct 306 ms 53112 KB Output is correct
94 Correct 341 ms 52984 KB Output is correct
95 Correct 378 ms 53112 KB Output is correct
96 Correct 341 ms 53116 KB Output is correct
97 Correct 484 ms 91272 KB Output is correct
98 Correct 510 ms 91400 KB Output is correct
99 Correct 1995 ms 117360 KB Output is correct
100 Correct 1990 ms 117812 KB Output is correct
101 Correct 1902 ms 117524 KB Output is correct
102 Correct 1988 ms 117372 KB Output is correct
103 Correct 948 ms 82096 KB Output is correct
104 Correct 462 ms 83208 KB Output is correct
105 Correct 440 ms 88072 KB Output is correct
106 Correct 1418 ms 82616 KB Output is correct
107 Correct 744 ms 87816 KB Output is correct
108 Correct 459 ms 89456 KB Output is correct
109 Correct 409 ms 88336 KB Output is correct
110 Correct 455 ms 89736 KB Output is correct
111 Correct 1448 ms 96980 KB Output is correct
112 Correct 1455 ms 97512 KB Output is correct
113 Correct 1656 ms 97296 KB Output is correct
114 Correct 1730 ms 106480 KB Output is correct
115 Correct 1639 ms 106164 KB Output is correct
116 Correct 1768 ms 105964 KB Output is correct
117 Correct 1453 ms 97028 KB Output is correct
118 Correct 1462 ms 97128 KB Output is correct
119 Correct 1526 ms 97904 KB Output is correct
120 Correct 1929 ms 110368 KB Output is correct
121 Correct 1832 ms 110200 KB Output is correct
122 Execution timed out 2097 ms 114024 KB Time limit exceeded
123 Halted 0 ms 0 KB -