oj.uz

답안 #283668

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

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][21], 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;
		//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();

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

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 38656 KB Output is correct
2 Correct 24 ms 38656 KB Output is correct
3 Correct 25 ms 38656 KB Output is correct
4 Correct 36 ms 39032 KB Output is correct
5 Correct 45 ms 39032 KB Output is correct
6 Correct 36 ms 39040 KB Output is correct
7 Correct 47 ms 39928 KB Output is correct
8 Correct 48 ms 39928 KB Output is correct
9 Correct 47 ms 39928 KB Output is correct
10 Correct 46 ms 39928 KB Output is correct
11 Correct 48 ms 39928 KB Output is correct
12 Correct 46 ms 39928 KB Output is correct
13 Correct 47 ms 39928 KB Output is correct
14 Correct 46 ms 39928 KB Output is correct
15 Correct 51 ms 39928 KB Output is correct
16 Correct 48 ms 39928 KB Output is correct
17 Correct 45 ms 39800 KB Output is correct
18 Correct 56 ms 39928 KB Output is correct
19 Correct 51 ms 39544 KB Output is correct
20 Correct 49 ms 39928 KB Output is correct
21 Correct 47 ms 39928 KB Output is correct
22 Correct 59 ms 40056 KB Output is correct
23 Correct 58 ms 40160 KB Output is correct
24 Correct 58 ms 40312 KB Output is correct
25 Correct 41 ms 39800 KB Output is correct
26 Correct 40 ms 39800 KB Output is correct
27 Correct 39 ms 39672 KB Output is correct
28 Correct 70 ms 40440 KB Output is correct
29 Correct 56 ms 40440 KB Output is correct
30 Correct 55 ms 40568 KB Output is correct
31 Correct 62 ms 40568 KB Output is correct
32 Correct 55 ms 40440 KB Output is correct
33 Correct 55 ms 40312 KB Output is correct
34 Correct 65 ms 40440 KB Output is correct
35 Correct 55 ms 40440 KB Output is correct
36 Correct 34 ms 39672 KB Output is correct
37 Correct 54 ms 40440 KB Output is correct
38 Correct 54 ms 40444 KB Output is correct
39 Correct 65 ms 40544 KB Output is correct
40 Correct 54 ms 40440 KB Output is correct
41 Correct 53 ms 40184 KB Output is correct
42 Correct 56 ms 40312 KB Output is correct
43 Correct 35 ms 39680 KB Output is correct
44 Correct 57 ms 40312 KB Output is correct
45 Correct 51 ms 40184 KB Output is correct
46 Correct 34 ms 39676 KB Output is correct
47 Correct 46 ms 39416 KB Output is correct
48 Correct 43 ms 39288 KB Output is correct
49 Correct 43 ms 39288 KB Output is correct
50 Correct 40 ms 39160 KB Output is correct
51 Correct 40 ms 39040 KB Output is correct
52 Correct 44 ms 39672 KB Output is correct
53 Correct 45 ms 39544 KB Output is correct
54 Correct 49 ms 39544 KB Output is correct
55 Correct 47 ms 39544 KB Output is correct

Subtask #2
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 38656 KB Output is correct
2 Correct 24 ms 38656 KB Output is correct
3 Correct 25 ms 38656 KB Output is correct
4 Correct 36 ms 39032 KB Output is correct
5 Correct 45 ms 39032 KB Output is correct
6 Correct 36 ms 39040 KB Output is correct
7 Correct 47 ms 39928 KB Output is correct
8 Correct 48 ms 39928 KB Output is correct
9 Correct 47 ms 39928 KB Output is correct
10 Correct 46 ms 39928 KB Output is correct
11 Correct 48 ms 39928 KB Output is correct
12 Correct 46 ms 39928 KB Output is correct
13 Correct 47 ms 39928 KB Output is correct
14 Correct 46 ms 39928 KB Output is correct
15 Correct 51 ms 39928 KB Output is correct
16 Correct 48 ms 39928 KB Output is correct
17 Correct 45 ms 39800 KB Output is correct
18 Correct 56 ms 39928 KB Output is correct
19 Correct 51 ms 39544 KB Output is correct
20 Correct 49 ms 39928 KB Output is correct
21 Correct 47 ms 39928 KB Output is correct
22 Correct 59 ms 40056 KB Output is correct
23 Correct 58 ms 40160 KB Output is correct
24 Correct 58 ms 40312 KB Output is correct
25 Correct 41 ms 39800 KB Output is correct
26 Correct 40 ms 39800 KB Output is correct
27 Correct 39 ms 39672 KB Output is correct
28 Correct 70 ms 40440 KB Output is correct
29 Correct 56 ms 40440 KB Output is correct
30 Correct 55 ms 40568 KB Output is correct
31 Correct 62 ms 40568 KB Output is correct
32 Correct 55 ms 40440 KB Output is correct
33 Correct 55 ms 40312 KB Output is correct
34 Correct 65 ms 40440 KB Output is correct
35 Correct 55 ms 40440 KB Output is correct
36 Correct 34 ms 39672 KB Output is correct
37 Correct 54 ms 40440 KB Output is correct
38 Correct 54 ms 40444 KB Output is correct
39 Correct 65 ms 40544 KB Output is correct
40 Correct 54 ms 40440 KB Output is correct
41 Correct 53 ms 40184 KB Output is correct
42 Correct 56 ms 40312 KB Output is correct
43 Correct 35 ms 39680 KB Output is correct
44 Correct 57 ms 40312 KB Output is correct
45 Correct 51 ms 40184 KB Output is correct
46 Correct 34 ms 39676 KB Output is correct
47 Correct 46 ms 39416 KB Output is correct
48 Correct 43 ms 39288 KB Output is correct
49 Correct 43 ms 39288 KB Output is correct
50 Correct 40 ms 39160 KB Output is correct
51 Correct 40 ms 39040 KB Output is correct
52 Correct 44 ms 39672 KB Output is correct
53 Correct 45 ms 39544 KB Output is correct
54 Correct 49 ms 39544 KB Output is correct
55 Correct 47 ms 39544 KB Output is correct
56 Correct 222 ms 39416 KB Output is correct
57 Correct 251 ms 39288 KB Output is correct
58 Correct 235 ms 39540 KB Output is correct
59 Correct 336 ms 41080 KB Output is correct
60 Correct 359 ms 41080 KB Output is correct
61 Correct 366 ms 41148 KB Output is correct
62 Correct 343 ms 41208 KB Output is correct
63 Correct 333 ms 41208 KB Output is correct
64 Correct 355 ms 41236 KB Output is correct
65 Correct 335 ms 41112 KB Output is correct
66 Correct 401 ms 41092 KB Output is correct
67 Correct 333 ms 41096 KB Output is correct
68 Correct 345 ms 41080 KB Output is correct
69 Correct 345 ms 40560 KB Output is correct
70 Correct 336 ms 41304 KB Output is correct
71 Correct 321 ms 40592 KB Output is correct
72 Correct 347 ms 41080 KB Output is correct
73 Correct 335 ms 41116 KB Output is correct
74 Correct 157 ms 40440 KB Output is correct
75 Correct 200 ms 40888 KB Output is correct
76 Correct 137 ms 40184 KB Output is correct
77 Correct 441 ms 41860 KB Output is correct
78 Correct 460 ms 41732 KB Output is correct
79 Correct 145 ms 40184 KB Output is correct
80 Correct 444 ms 41908 KB Output is correct
81 Correct 446 ms 41924 KB Output is correct
82 Correct 406 ms 41480 KB Output is correct
83 Correct 414 ms 41524 KB Output is correct
84 Correct 153 ms 40220 KB Output is correct
85 Correct 415 ms 41476 KB Output is correct
86 Correct 424 ms 41564 KB Output is correct
87 Correct 157 ms 40312 KB Output is correct
88 Correct 336 ms 40312 KB Output is correct
89 Correct 311 ms 40072 KB Output is correct
90 Correct 301 ms 40184 KB Output is correct
91 Correct 261 ms 39672 KB Output is correct
92 Correct 222 ms 39548 KB Output is correct
93 Correct 334 ms 40440 KB Output is correct
94 Correct 320 ms 40440 KB Output is correct
95 Correct 390 ms 40568 KB Output is correct
96 Correct 343 ms 40568 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 401 ms 61576 KB Output is correct
2 Correct 393 ms 61556 KB Output is correct
3 Correct 1756 ms 85288 KB Output is correct
4 Correct 1795 ms 85732 KB Output is correct
5 Correct 1756 ms 85376 KB Output is correct
6 Correct 1879 ms 85420 KB Output is correct
7 Correct 748 ms 51068 KB Output is correct
8 Correct 311 ms 54384 KB Output is correct
9 Correct 314 ms 59120 KB Output is correct
10 Correct 1102 ms 51776 KB Output is correct
11 Correct 690 ms 59148 KB Output is correct
12 Correct 368 ms 60296 KB Output is correct
13 Correct 303 ms 59376 KB Output is correct
14 Correct 378 ms 60528 KB Output is correct

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1337 ms 65552 KB Output is correct
2 Correct 1381 ms 65764 KB Output is correct
3 Correct 1466 ms 65896 KB Output is correct
4 Correct 1494 ms 74836 KB Output is correct
5 Correct 1556 ms 74600 KB Output is correct
6 Correct 1598 ms 74632 KB Output is correct
7 Correct 1325 ms 65396 KB Output is correct
8 Correct 1324 ms 65536 KB Output is correct
9 Correct 1378 ms 66276 KB Output is correct
10 Correct 1749 ms 78168 KB Output is correct
11 Correct 1847 ms 78296 KB Output is correct
12 Execution timed out 2013 ms 82388 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 38656 KB Output is correct
2 Correct 24 ms 38656 KB Output is correct
3 Correct 25 ms 38656 KB Output is correct
4 Correct 36 ms 39032 KB Output is correct
5 Correct 45 ms 39032 KB Output is correct
6 Correct 36 ms 39040 KB Output is correct
7 Correct 47 ms 39928 KB Output is correct
8 Correct 48 ms 39928 KB Output is correct
9 Correct 47 ms 39928 KB Output is correct
10 Correct 46 ms 39928 KB Output is correct
11 Correct 48 ms 39928 KB Output is correct
12 Correct 46 ms 39928 KB Output is correct
13 Correct 47 ms 39928 KB Output is correct
14 Correct 46 ms 39928 KB Output is correct
15 Correct 51 ms 39928 KB Output is correct
16 Correct 48 ms 39928 KB Output is correct
17 Correct 45 ms 39800 KB Output is correct
18 Correct 56 ms 39928 KB Output is correct
19 Correct 51 ms 39544 KB Output is correct
20 Correct 49 ms 39928 KB Output is correct
21 Correct 47 ms 39928 KB Output is correct
22 Correct 59 ms 40056 KB Output is correct
23 Correct 58 ms 40160 KB Output is correct
24 Correct 58 ms 40312 KB Output is correct
25 Correct 41 ms 39800 KB Output is correct
26 Correct 40 ms 39800 KB Output is correct
27 Correct 39 ms 39672 KB Output is correct
28 Correct 70 ms 40440 KB Output is correct
29 Correct 56 ms 40440 KB Output is correct
30 Correct 55 ms 40568 KB Output is correct
31 Correct 62 ms 40568 KB Output is correct
32 Correct 55 ms 40440 KB Output is correct
33 Correct 55 ms 40312 KB Output is correct
34 Correct 65 ms 40440 KB Output is correct
35 Correct 55 ms 40440 KB Output is correct
36 Correct 34 ms 39672 KB Output is correct
37 Correct 54 ms 40440 KB Output is correct
38 Correct 54 ms 40444 KB Output is correct
39 Correct 65 ms 40544 KB Output is correct
40 Correct 54 ms 40440 KB Output is correct
41 Correct 53 ms 40184 KB Output is correct
42 Correct 56 ms 40312 KB Output is correct
43 Correct 35 ms 39680 KB Output is correct
44 Correct 57 ms 40312 KB Output is correct
45 Correct 51 ms 40184 KB Output is correct
46 Correct 34 ms 39676 KB Output is correct
47 Correct 46 ms 39416 KB Output is correct
48 Correct 43 ms 39288 KB Output is correct
49 Correct 43 ms 39288 KB Output is correct
50 Correct 40 ms 39160 KB Output is correct
51 Correct 40 ms 39040 KB Output is correct
52 Correct 44 ms 39672 KB Output is correct
53 Correct 45 ms 39544 KB Output is correct
54 Correct 49 ms 39544 KB Output is correct
55 Correct 47 ms 39544 KB Output is correct
56 Correct 222 ms 39416 KB Output is correct
57 Correct 251 ms 39288 KB Output is correct
58 Correct 235 ms 39540 KB Output is correct
59 Correct 336 ms 41080 KB Output is correct
60 Correct 359 ms 41080 KB Output is correct
61 Correct 366 ms 41148 KB Output is correct
62 Correct 343 ms 41208 KB Output is correct
63 Correct 333 ms 41208 KB Output is correct
64 Correct 355 ms 41236 KB Output is correct
65 Correct 335 ms 41112 KB Output is correct
66 Correct 401 ms 41092 KB Output is correct
67 Correct 333 ms 41096 KB Output is correct
68 Correct 345 ms 41080 KB Output is correct
69 Correct 345 ms 40560 KB Output is correct
70 Correct 336 ms 41304 KB Output is correct
71 Correct 321 ms 40592 KB Output is correct
72 Correct 347 ms 41080 KB Output is correct
73 Correct 335 ms 41116 KB Output is correct
74 Correct 157 ms 40440 KB Output is correct
75 Correct 200 ms 40888 KB Output is correct
76 Correct 137 ms 40184 KB Output is correct
77 Correct 441 ms 41860 KB Output is correct
78 Correct 460 ms 41732 KB Output is correct
79 Correct 145 ms 40184 KB Output is correct
80 Correct 444 ms 41908 KB Output is correct
81 Correct 446 ms 41924 KB Output is correct
82 Correct 406 ms 41480 KB Output is correct
83 Correct 414 ms 41524 KB Output is correct
84 Correct 153 ms 40220 KB Output is correct
85 Correct 415 ms 41476 KB Output is correct
86 Correct 424 ms 41564 KB Output is correct
87 Correct 157 ms 40312 KB Output is correct
88 Correct 336 ms 40312 KB Output is correct
89 Correct 311 ms 40072 KB Output is correct
90 Correct 301 ms 40184 KB Output is correct
91 Correct 261 ms 39672 KB Output is correct
92 Correct 222 ms 39548 KB Output is correct
93 Correct 334 ms 40440 KB Output is correct
94 Correct 320 ms 40440 KB Output is correct
95 Correct 390 ms 40568 KB Output is correct
96 Correct 343 ms 40568 KB Output is correct
97 Correct 401 ms 61576 KB Output is correct
98 Correct 393 ms 61556 KB Output is correct
99 Correct 1756 ms 85288 KB Output is correct
100 Correct 1795 ms 85732 KB Output is correct
101 Correct 1756 ms 85376 KB Output is correct
102 Correct 1879 ms 85420 KB Output is correct
103 Correct 748 ms 51068 KB Output is correct
104 Correct 311 ms 54384 KB Output is correct
105 Correct 314 ms 59120 KB Output is correct
106 Correct 1102 ms 51776 KB Output is correct
107 Correct 690 ms 59148 KB Output is correct
108 Correct 368 ms 60296 KB Output is correct
109 Correct 303 ms 59376 KB Output is correct
110 Correct 378 ms 60528 KB Output is correct
111 Correct 1337 ms 65552 KB Output is correct
112 Correct 1381 ms 65764 KB Output is correct
113 Correct 1466 ms 65896 KB Output is correct
114 Correct 1494 ms 74836 KB Output is correct
115 Correct 1556 ms 74600 KB Output is correct
116 Correct 1598 ms 74632 KB Output is correct
117 Correct 1325 ms 65396 KB Output is correct
118 Correct 1324 ms 65536 KB Output is correct
119 Correct 1378 ms 66276 KB Output is correct
120 Correct 1749 ms 78168 KB Output is correct
121 Correct 1847 ms 78296 KB Output is correct
122 Execution timed out 2013 ms 82388 KB Time limit exceeded
123 Halted 0 ms 0 KB -