oj.uz

답안 #283654

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
283654 2020-08-26T04:38:22 Z arnold518 Iqea (innopolis2018_final_C) C++14
51 / 100
 2000 ms 94620 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];

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();

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

		pii t=get(y, x);

		vector<int> V1=TX.getpar(t.first);
		vector<int> V2=TY.getpar(t.second);

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

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 45688 KB Output is correct
2 Correct 28 ms 45696 KB Output is correct
3 Correct 28 ms 45740 KB Output is correct
4 Correct 40 ms 46080 KB Output is correct
5 Correct 41 ms 46072 KB Output is correct
6 Correct 45 ms 46104 KB Output is correct
7 Correct 53 ms 46968 KB Output is correct
8 Correct 52 ms 46968 KB Output is correct
9 Correct 50 ms 46968 KB Output is correct
10 Correct 51 ms 46968 KB Output is correct
11 Correct 52 ms 46968 KB Output is correct
12 Correct 52 ms 46968 KB Output is correct
13 Correct 59 ms 46968 KB Output is correct
14 Correct 54 ms 46968 KB Output is correct
15 Correct 51 ms 46968 KB Output is correct
16 Correct 52 ms 46916 KB Output is correct
17 Correct 60 ms 46968 KB Output is correct
18 Correct 50 ms 46988 KB Output is correct
19 Correct 51 ms 46584 KB Output is correct
20 Correct 52 ms 46968 KB Output is correct
21 Correct 51 ms 46968 KB Output is correct
22 Correct 56 ms 47224 KB Output is correct
23 Correct 58 ms 47224 KB Output is correct
24 Correct 59 ms 47352 KB Output is correct
25 Correct 40 ms 46840 KB Output is correct
26 Correct 47 ms 46840 KB Output is correct
27 Correct 37 ms 46712 KB Output is correct
28 Correct 59 ms 47480 KB Output is correct
29 Correct 59 ms 47480 KB Output is correct
30 Correct 57 ms 47608 KB Output is correct
31 Correct 60 ms 47480 KB Output is correct
32 Correct 70 ms 47480 KB Output is correct
33 Correct 61 ms 47352 KB Output is correct
34 Correct 59 ms 47480 KB Output is correct
35 Correct 58 ms 47480 KB Output is correct
36 Correct 38 ms 46712 KB Output is correct
37 Correct 57 ms 47480 KB Output is correct
38 Correct 57 ms 47480 KB Output is correct
39 Correct 59 ms 47480 KB Output is correct
40 Correct 59 ms 47484 KB Output is correct
41 Correct 57 ms 47232 KB Output is correct
42 Correct 57 ms 47224 KB Output is correct
43 Correct 38 ms 46712 KB Output is correct
44 Correct 55 ms 47352 KB Output is correct
45 Correct 57 ms 47248 KB Output is correct
46 Correct 39 ms 46740 KB Output is correct
47 Correct 50 ms 46584 KB Output is correct
48 Correct 45 ms 46328 KB Output is correct
49 Correct 46 ms 46456 KB Output is correct
50 Correct 44 ms 46200 KB Output is correct
51 Correct 43 ms 46072 KB Output is correct
52 Correct 53 ms 46780 KB Output is correct
53 Correct 49 ms 46584 KB Output is correct
54 Correct 54 ms 46712 KB Output is correct
55 Correct 54 ms 46712 KB Output is correct

Subtask #2
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 45688 KB Output is correct
2 Correct 28 ms 45696 KB Output is correct
3 Correct 28 ms 45740 KB Output is correct
4 Correct 40 ms 46080 KB Output is correct
5 Correct 41 ms 46072 KB Output is correct
6 Correct 45 ms 46104 KB Output is correct
7 Correct 53 ms 46968 KB Output is correct
8 Correct 52 ms 46968 KB Output is correct
9 Correct 50 ms 46968 KB Output is correct
10 Correct 51 ms 46968 KB Output is correct
11 Correct 52 ms 46968 KB Output is correct
12 Correct 52 ms 46968 KB Output is correct
13 Correct 59 ms 46968 KB Output is correct
14 Correct 54 ms 46968 KB Output is correct
15 Correct 51 ms 46968 KB Output is correct
16 Correct 52 ms 46916 KB Output is correct
17 Correct 60 ms 46968 KB Output is correct
18 Correct 50 ms 46988 KB Output is correct
19 Correct 51 ms 46584 KB Output is correct
20 Correct 52 ms 46968 KB Output is correct
21 Correct 51 ms 46968 KB Output is correct
22 Correct 56 ms 47224 KB Output is correct
23 Correct 58 ms 47224 KB Output is correct
24 Correct 59 ms 47352 KB Output is correct
25 Correct 40 ms 46840 KB Output is correct
26 Correct 47 ms 46840 KB Output is correct
27 Correct 37 ms 46712 KB Output is correct
28 Correct 59 ms 47480 KB Output is correct
29 Correct 59 ms 47480 KB Output is correct
30 Correct 57 ms 47608 KB Output is correct
31 Correct 60 ms 47480 KB Output is correct
32 Correct 70 ms 47480 KB Output is correct
33 Correct 61 ms 47352 KB Output is correct
34 Correct 59 ms 47480 KB Output is correct
35 Correct 58 ms 47480 KB Output is correct
36 Correct 38 ms 46712 KB Output is correct
37 Correct 57 ms 47480 KB Output is correct
38 Correct 57 ms 47480 KB Output is correct
39 Correct 59 ms 47480 KB Output is correct
40 Correct 59 ms 47484 KB Output is correct
41 Correct 57 ms 47232 KB Output is correct
42 Correct 57 ms 47224 KB Output is correct
43 Correct 38 ms 46712 KB Output is correct
44 Correct 55 ms 47352 KB Output is correct
45 Correct 57 ms 47248 KB Output is correct
46 Correct 39 ms 46740 KB Output is correct
47 Correct 50 ms 46584 KB Output is correct
48 Correct 45 ms 46328 KB Output is correct
49 Correct 46 ms 46456 KB Output is correct
50 Correct 44 ms 46200 KB Output is correct
51 Correct 43 ms 46072 KB Output is correct
52 Correct 53 ms 46780 KB Output is correct
53 Correct 49 ms 46584 KB Output is correct
54 Correct 54 ms 46712 KB Output is correct
55 Correct 54 ms 46712 KB Output is correct
56 Correct 227 ms 46508 KB Output is correct
57 Correct 224 ms 46332 KB Output is correct
58 Correct 218 ms 46584 KB Output is correct
59 Correct 337 ms 48248 KB Output is correct
60 Correct 354 ms 48124 KB Output is correct
61 Correct 352 ms 48124 KB Output is correct
62 Correct 354 ms 48252 KB Output is correct
63 Correct 337 ms 48124 KB Output is correct
64 Correct 353 ms 48124 KB Output is correct
65 Correct 344 ms 48248 KB Output is correct
66 Correct 353 ms 48120 KB Output is correct
67 Correct 332 ms 48144 KB Output is correct
68 Correct 355 ms 48504 KB Output is correct
69 Correct 331 ms 47608 KB Output is correct
70 Correct 328 ms 48120 KB Output is correct
71 Correct 326 ms 47684 KB Output is correct
72 Correct 345 ms 48120 KB Output is correct
73 Correct 348 ms 48120 KB Output is correct
74 Correct 166 ms 47480 KB Output is correct
75 Correct 198 ms 47736 KB Output is correct
76 Correct 148 ms 47352 KB Output is correct
77 Correct 465 ms 48776 KB Output is correct
78 Correct 459 ms 48772 KB Output is correct
79 Correct 147 ms 47352 KB Output is correct
80 Correct 448 ms 48900 KB Output is correct
81 Correct 443 ms 48772 KB Output is correct
82 Correct 410 ms 48516 KB Output is correct
83 Correct 442 ms 48604 KB Output is correct
84 Correct 157 ms 47352 KB Output is correct
85 Correct 421 ms 48656 KB Output is correct
86 Correct 415 ms 48512 KB Output is correct
87 Correct 153 ms 47352 KB Output is correct
88 Correct 331 ms 47352 KB Output is correct
89 Correct 303 ms 47224 KB Output is correct
90 Correct 293 ms 47096 KB Output is correct
91 Correct 265 ms 46840 KB Output is correct
92 Correct 243 ms 46648 KB Output is correct
93 Correct 360 ms 47608 KB Output is correct
94 Correct 337 ms 47608 KB Output is correct
95 Correct 356 ms 47480 KB Output is correct
96 Correct 349 ms 47480 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 407 ms 68616 KB Output is correct
2 Correct 419 ms 68872 KB Output is correct
3 Correct 1797 ms 92380 KB Output is correct
4 Correct 1868 ms 92840 KB Output is correct
5 Correct 1840 ms 92440 KB Output is correct
6 Correct 1953 ms 92332 KB Output is correct
7 Correct 823 ms 57840 KB Output is correct
8 Correct 351 ms 61420 KB Output is correct
9 Correct 312 ms 65904 KB Output is correct
10 Correct 1183 ms 58716 KB Output is correct
11 Correct 720 ms 66056 KB Output is correct
12 Correct 381 ms 67208 KB Output is correct
13 Correct 304 ms 66156 KB Output is correct
14 Correct 369 ms 67440 KB Output is correct

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1341 ms 72804 KB Output is correct
2 Correct 1386 ms 72976 KB Output is correct
3 Correct 1407 ms 72864 KB Output is correct
4 Correct 1525 ms 81620 KB Output is correct
5 Correct 1596 ms 81508 KB Output is correct
6 Correct 1582 ms 81500 KB Output is correct
7 Correct 1317 ms 72460 KB Output is correct
8 Correct 1312 ms 72548 KB Output is correct
9 Correct 1377 ms 73396 KB Output is correct
10 Correct 1817 ms 85308 KB Output is correct
11 Correct 1722 ms 85476 KB Output is correct
12 Correct 1999 ms 89332 KB Output is correct
13 Correct 414 ms 71084 KB Output is correct
14 Correct 574 ms 76196 KB Output is correct
15 Correct 313 ms 68976 KB Output is correct
16 Correct 1836 ms 93276 KB Output is correct
17 Correct 1836 ms 93084 KB Output is correct
18 Execution timed out 2071 ms 94620 KB Time limit exceeded
19 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 45688 KB Output is correct
2 Correct 28 ms 45696 KB Output is correct
3 Correct 28 ms 45740 KB Output is correct
4 Correct 40 ms 46080 KB Output is correct
5 Correct 41 ms 46072 KB Output is correct
6 Correct 45 ms 46104 KB Output is correct
7 Correct 53 ms 46968 KB Output is correct
8 Correct 52 ms 46968 KB Output is correct
9 Correct 50 ms 46968 KB Output is correct
10 Correct 51 ms 46968 KB Output is correct
11 Correct 52 ms 46968 KB Output is correct
12 Correct 52 ms 46968 KB Output is correct
13 Correct 59 ms 46968 KB Output is correct
14 Correct 54 ms 46968 KB Output is correct
15 Correct 51 ms 46968 KB Output is correct
16 Correct 52 ms 46916 KB Output is correct
17 Correct 60 ms 46968 KB Output is correct
18 Correct 50 ms 46988 KB Output is correct
19 Correct 51 ms 46584 KB Output is correct
20 Correct 52 ms 46968 KB Output is correct
21 Correct 51 ms 46968 KB Output is correct
22 Correct 56 ms 47224 KB Output is correct
23 Correct 58 ms 47224 KB Output is correct
24 Correct 59 ms 47352 KB Output is correct
25 Correct 40 ms 46840 KB Output is correct
26 Correct 47 ms 46840 KB Output is correct
27 Correct 37 ms 46712 KB Output is correct
28 Correct 59 ms 47480 KB Output is correct
29 Correct 59 ms 47480 KB Output is correct
30 Correct 57 ms 47608 KB Output is correct
31 Correct 60 ms 47480 KB Output is correct
32 Correct 70 ms 47480 KB Output is correct
33 Correct 61 ms 47352 KB Output is correct
34 Correct 59 ms 47480 KB Output is correct
35 Correct 58 ms 47480 KB Output is correct
36 Correct 38 ms 46712 KB Output is correct
37 Correct 57 ms 47480 KB Output is correct
38 Correct 57 ms 47480 KB Output is correct
39 Correct 59 ms 47480 KB Output is correct
40 Correct 59 ms 47484 KB Output is correct
41 Correct 57 ms 47232 KB Output is correct
42 Correct 57 ms 47224 KB Output is correct
43 Correct 38 ms 46712 KB Output is correct
44 Correct 55 ms 47352 KB Output is correct
45 Correct 57 ms 47248 KB Output is correct
46 Correct 39 ms 46740 KB Output is correct
47 Correct 50 ms 46584 KB Output is correct
48 Correct 45 ms 46328 KB Output is correct
49 Correct 46 ms 46456 KB Output is correct
50 Correct 44 ms 46200 KB Output is correct
51 Correct 43 ms 46072 KB Output is correct
52 Correct 53 ms 46780 KB Output is correct
53 Correct 49 ms 46584 KB Output is correct
54 Correct 54 ms 46712 KB Output is correct
55 Correct 54 ms 46712 KB Output is correct
56 Correct 227 ms 46508 KB Output is correct
57 Correct 224 ms 46332 KB Output is correct
58 Correct 218 ms 46584 KB Output is correct
59 Correct 337 ms 48248 KB Output is correct
60 Correct 354 ms 48124 KB Output is correct
61 Correct 352 ms 48124 KB Output is correct
62 Correct 354 ms 48252 KB Output is correct
63 Correct 337 ms 48124 KB Output is correct
64 Correct 353 ms 48124 KB Output is correct
65 Correct 344 ms 48248 KB Output is correct
66 Correct 353 ms 48120 KB Output is correct
67 Correct 332 ms 48144 KB Output is correct
68 Correct 355 ms 48504 KB Output is correct
69 Correct 331 ms 47608 KB Output is correct
70 Correct 328 ms 48120 KB Output is correct
71 Correct 326 ms 47684 KB Output is correct
72 Correct 345 ms 48120 KB Output is correct
73 Correct 348 ms 48120 KB Output is correct
74 Correct 166 ms 47480 KB Output is correct
75 Correct 198 ms 47736 KB Output is correct
76 Correct 148 ms 47352 KB Output is correct
77 Correct 465 ms 48776 KB Output is correct
78 Correct 459 ms 48772 KB Output is correct
79 Correct 147 ms 47352 KB Output is correct
80 Correct 448 ms 48900 KB Output is correct
81 Correct 443 ms 48772 KB Output is correct
82 Correct 410 ms 48516 KB Output is correct
83 Correct 442 ms 48604 KB Output is correct
84 Correct 157 ms 47352 KB Output is correct
85 Correct 421 ms 48656 KB Output is correct
86 Correct 415 ms 48512 KB Output is correct
87 Correct 153 ms 47352 KB Output is correct
88 Correct 331 ms 47352 KB Output is correct
89 Correct 303 ms 47224 KB Output is correct
90 Correct 293 ms 47096 KB Output is correct
91 Correct 265 ms 46840 KB Output is correct
92 Correct 243 ms 46648 KB Output is correct
93 Correct 360 ms 47608 KB Output is correct
94 Correct 337 ms 47608 KB Output is correct
95 Correct 356 ms 47480 KB Output is correct
96 Correct 349 ms 47480 KB Output is correct
97 Correct 407 ms 68616 KB Output is correct
98 Correct 419 ms 68872 KB Output is correct
99 Correct 1797 ms 92380 KB Output is correct
100 Correct 1868 ms 92840 KB Output is correct
101 Correct 1840 ms 92440 KB Output is correct
102 Correct 1953 ms 92332 KB Output is correct
103 Correct 823 ms 57840 KB Output is correct
104 Correct 351 ms 61420 KB Output is correct
105 Correct 312 ms 65904 KB Output is correct
106 Correct 1183 ms 58716 KB Output is correct
107 Correct 720 ms 66056 KB Output is correct
108 Correct 381 ms 67208 KB Output is correct
109 Correct 304 ms 66156 KB Output is correct
110 Correct 369 ms 67440 KB Output is correct
111 Correct 1341 ms 72804 KB Output is correct
112 Correct 1386 ms 72976 KB Output is correct
113 Correct 1407 ms 72864 KB Output is correct
114 Correct 1525 ms 81620 KB Output is correct
115 Correct 1596 ms 81508 KB Output is correct
116 Correct 1582 ms 81500 KB Output is correct
117 Correct 1317 ms 72460 KB Output is correct
118 Correct 1312 ms 72548 KB Output is correct
119 Correct 1377 ms 73396 KB Output is correct
120 Correct 1817 ms 85308 KB Output is correct
121 Correct 1722 ms 85476 KB Output is correct
122 Correct 1999 ms 89332 KB Output is correct
123 Correct 414 ms 71084 KB Output is correct
124 Correct 574 ms 76196 KB Output is correct
125 Correct 313 ms 68976 KB Output is correct
126 Correct 1836 ms 93276 KB Output is correct
127 Correct 1836 ms 93084 KB Output is correct
128 Execution timed out 2071 ms 94620 KB Time limit exceeded
129 Halted 0 ms 0 KB -