oj.uz

답안 #283651

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

vector<pii> TP1;
vector<int> TP2;

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++)
	{
		P[i]=get(A[i].first, A[i].second);
		vector<int> V1=TX.getpar(P[i].first);
		vector<int> V2=TY.getpar(P[i].second);
		for(auto it : V1) for(auto jt : V2) TP1.push_back({it, jt});
	}
	sort(TP1.begin(), TP1.end());
	TP1.erase(unique(TP1.begin(), TP1.end()), TP1.end());
	TP2=vector<int>(TP1.size(), INF);

	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)
			{
				int pt=lower_bound(TP1.begin(), TP1.end(), pii(it, jt))-TP1.begin();
				TP2[pt]=min(TP2[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)
			{
				int pt=lower_bound(TP1.begin(), TP1.end(), pii(it, jt))-TP1.begin();
				ans=min(ans, TX.cdist[t.first][TX.cdep[it]]+TY.cdist[t.second][TY.cdep[jt]]+TP2[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:146:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  146 |   for(int j=0; j+1<X[i].size(); j++)
      |                ~~~^~~~~~~~~~~~
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].r<it.l; p++);
      |          ~^~~~~~~~~~~~~~~
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].l<=it.r; p++)
      |          ~^~~~~~~~~~~~~~~
C.cpp:185:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  185 |   for(int j=0; j+1<Y[i].size(); j++)
      |                ~~~^~~~~~~~~~~~
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].r<it.l; p++);
      |          ~^~~~~~~~~~~~~~~
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].l<=it.r; p++)
      |          ~^~~~~~~~~~~~~~~
C.cpp:130:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  130 |  scanf("%d", &N);
      |  ~~~~~^~~~~~~~~~
C.cpp:134:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  134 |   scanf("%d%d", &y, &x);
      |   ~~~~~^~~~~~~~~~~~~~~~
C.cpp:231:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  231 |  scanf("%d", &Q);
      |  ~~~~~^~~~~~~~~~
C.cpp:236:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  236 |   scanf("%d%d%d", &tt, &y, &x);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 45688 KB Output is correct
2 Correct 28 ms 45688 KB Output is correct
3 Correct 28 ms 45824 KB Output is correct
4 Correct 60 ms 48112 KB Output is correct
5 Correct 60 ms 48112 KB Output is correct
6 Correct 64 ms 48112 KB Output is correct
7 Correct 98 ms 50412 KB Output is correct
8 Correct 94 ms 50444 KB Output is correct
9 Correct 96 ms 50408 KB Output is correct
10 Correct 85 ms 48364 KB Output is correct
11 Correct 93 ms 50416 KB Output is correct
12 Correct 96 ms 50408 KB Output is correct
13 Correct 88 ms 50536 KB Output is correct
14 Correct 90 ms 50536 KB Output is correct
15 Correct 93 ms 50408 KB Output is correct
16 Correct 89 ms 50408 KB Output is correct
17 Correct 88 ms 50408 KB Output is correct
18 Correct 90 ms 50416 KB Output is correct
19 Correct 90 ms 50412 KB Output is correct
20 Correct 102 ms 50408 KB Output is correct
21 Correct 92 ms 50560 KB Output is correct
22 Correct 113 ms 50540 KB Output is correct
23 Correct 110 ms 50540 KB Output is correct
24 Correct 120 ms 50800 KB Output is correct
25 Correct 50 ms 47992 KB Output is correct
26 Correct 55 ms 47476 KB Output is correct
27 Correct 44 ms 47352 KB Output is correct
28 Correct 120 ms 50800 KB Output is correct
29 Correct 123 ms 50792 KB Output is correct
30 Correct 124 ms 50912 KB Output is correct
31 Correct 128 ms 50924 KB Output is correct
32 Correct 129 ms 50696 KB Output is correct
33 Correct 124 ms 50676 KB Output is correct
34 Correct 128 ms 50920 KB Output is correct
35 Correct 133 ms 50908 KB Output is correct
36 Correct 44 ms 47352 KB Output is correct
37 Correct 125 ms 50792 KB Output is correct
38 Correct 121 ms 50792 KB Output is correct
39 Correct 126 ms 50912 KB Output is correct
40 Correct 126 ms 50876 KB Output is correct
41 Correct 113 ms 50792 KB Output is correct
42 Correct 112 ms 50668 KB Output is correct
43 Correct 47 ms 47220 KB Output is correct
44 Correct 111 ms 50672 KB Output is correct
45 Correct 115 ms 50668 KB Output is correct
46 Correct 48 ms 47728 KB Output is correct
47 Correct 101 ms 50412 KB Output is correct
48 Correct 89 ms 48244 KB Output is correct
49 Correct 79 ms 48244 KB Output is correct
50 Correct 74 ms 48236 KB Output is correct
51 Correct 72 ms 48240 KB Output is correct
52 Correct 91 ms 50540 KB Output is correct
53 Correct 89 ms 50540 KB Output is correct
54 Correct 99 ms 50412 KB Output is correct
55 Correct 98 ms 50416 KB Output is correct

Subtask #2
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 45688 KB Output is correct
2 Correct 28 ms 45688 KB Output is correct
3 Correct 28 ms 45824 KB Output is correct
4 Correct 60 ms 48112 KB Output is correct
5 Correct 60 ms 48112 KB Output is correct
6 Correct 64 ms 48112 KB Output is correct
7 Correct 98 ms 50412 KB Output is correct
8 Correct 94 ms 50444 KB Output is correct
9 Correct 96 ms 50408 KB Output is correct
10 Correct 85 ms 48364 KB Output is correct
11 Correct 93 ms 50416 KB Output is correct
12 Correct 96 ms 50408 KB Output is correct
13 Correct 88 ms 50536 KB Output is correct
14 Correct 90 ms 50536 KB Output is correct
15 Correct 93 ms 50408 KB Output is correct
16 Correct 89 ms 50408 KB Output is correct
17 Correct 88 ms 50408 KB Output is correct
18 Correct 90 ms 50416 KB Output is correct
19 Correct 90 ms 50412 KB Output is correct
20 Correct 102 ms 50408 KB Output is correct
21 Correct 92 ms 50560 KB Output is correct
22 Correct 113 ms 50540 KB Output is correct
23 Correct 110 ms 50540 KB Output is correct
24 Correct 120 ms 50800 KB Output is correct
25 Correct 50 ms 47992 KB Output is correct
26 Correct 55 ms 47476 KB Output is correct
27 Correct 44 ms 47352 KB Output is correct
28 Correct 120 ms 50800 KB Output is correct
29 Correct 123 ms 50792 KB Output is correct
30 Correct 124 ms 50912 KB Output is correct
31 Correct 128 ms 50924 KB Output is correct
32 Correct 129 ms 50696 KB Output is correct
33 Correct 124 ms 50676 KB Output is correct
34 Correct 128 ms 50920 KB Output is correct
35 Correct 133 ms 50908 KB Output is correct
36 Correct 44 ms 47352 KB Output is correct
37 Correct 125 ms 50792 KB Output is correct
38 Correct 121 ms 50792 KB Output is correct
39 Correct 126 ms 50912 KB Output is correct
40 Correct 126 ms 50876 KB Output is correct
41 Correct 113 ms 50792 KB Output is correct
42 Correct 112 ms 50668 KB Output is correct
43 Correct 47 ms 47220 KB Output is correct
44 Correct 111 ms 50672 KB Output is correct
45 Correct 115 ms 50668 KB Output is correct
46 Correct 48 ms 47728 KB Output is correct
47 Correct 101 ms 50412 KB Output is correct
48 Correct 89 ms 48244 KB Output is correct
49 Correct 79 ms 48244 KB Output is correct
50 Correct 74 ms 48236 KB Output is correct
51 Correct 72 ms 48240 KB Output is correct
52 Correct 91 ms 50540 KB Output is correct
53 Correct 89 ms 50540 KB Output is correct
54 Correct 99 ms 50412 KB Output is correct
55 Correct 98 ms 50416 KB Output is correct
56 Correct 393 ms 48240 KB Output is correct
57 Correct 455 ms 48248 KB Output is correct
58 Correct 404 ms 48240 KB Output is correct
59 Correct 733 ms 50544 KB Output is correct
60 Correct 794 ms 50408 KB Output is correct
61 Correct 759 ms 50664 KB Output is correct
62 Correct 757 ms 50408 KB Output is correct
63 Correct 719 ms 50540 KB Output is correct
64 Correct 796 ms 50544 KB Output is correct
65 Correct 760 ms 50536 KB Output is correct
66 Correct 819 ms 50536 KB Output is correct
67 Correct 715 ms 50540 KB Output is correct
68 Correct 763 ms 50536 KB Output is correct
69 Correct 703 ms 50412 KB Output is correct
70 Correct 760 ms 50544 KB Output is correct
71 Correct 707 ms 48872 KB Output is correct
72 Correct 728 ms 50536 KB Output is correct
73 Correct 744 ms 50544 KB Output is correct
74 Correct 246 ms 48004 KB Output is correct
75 Correct 339 ms 47984 KB Output is correct
76 Correct 201 ms 47988 KB Output is correct
77 Correct 1081 ms 51368 KB Output is correct
78 Correct 1113 ms 51548 KB Output is correct
79 Correct 181 ms 47604 KB Output is correct
80 Correct 1101 ms 51160 KB Output is correct
81 Correct 1121 ms 51036 KB Output is correct
82 Correct 997 ms 50544 KB Output is correct
83 Correct 990 ms 50664 KB Output is correct
84 Correct 242 ms 47544 KB Output is correct
85 Correct 1056 ms 50664 KB Output is correct
86 Correct 1041 ms 50600 KB Output is correct
87 Correct 214 ms 47728 KB Output is correct
88 Correct 697 ms 50288 KB Output is correct
89 Correct 653 ms 50280 KB Output is correct
90 Correct 628 ms 50284 KB Output is correct
91 Correct 547 ms 48228 KB Output is correct
92 Correct 430 ms 48112 KB Output is correct
93 Correct 739 ms 50416 KB Output is correct
94 Correct 687 ms 50412 KB Output is correct
95 Correct 789 ms 50284 KB Output is correct
96 Correct 789 ms 50284 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 868 ms 97604 KB Output is correct
2 Correct 851 ms 98752 KB Output is correct
3 Runtime error 460 ms 262148 KB Execution killed with signal 9
4 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2075 ms 185208 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 45688 KB Output is correct
2 Correct 28 ms 45688 KB Output is correct
3 Correct 28 ms 45824 KB Output is correct
4 Correct 60 ms 48112 KB Output is correct
5 Correct 60 ms 48112 KB Output is correct
6 Correct 64 ms 48112 KB Output is correct
7 Correct 98 ms 50412 KB Output is correct
8 Correct 94 ms 50444 KB Output is correct
9 Correct 96 ms 50408 KB Output is correct
10 Correct 85 ms 48364 KB Output is correct
11 Correct 93 ms 50416 KB Output is correct
12 Correct 96 ms 50408 KB Output is correct
13 Correct 88 ms 50536 KB Output is correct
14 Correct 90 ms 50536 KB Output is correct
15 Correct 93 ms 50408 KB Output is correct
16 Correct 89 ms 50408 KB Output is correct
17 Correct 88 ms 50408 KB Output is correct
18 Correct 90 ms 50416 KB Output is correct
19 Correct 90 ms 50412 KB Output is correct
20 Correct 102 ms 50408 KB Output is correct
21 Correct 92 ms 50560 KB Output is correct
22 Correct 113 ms 50540 KB Output is correct
23 Correct 110 ms 50540 KB Output is correct
24 Correct 120 ms 50800 KB Output is correct
25 Correct 50 ms 47992 KB Output is correct
26 Correct 55 ms 47476 KB Output is correct
27 Correct 44 ms 47352 KB Output is correct
28 Correct 120 ms 50800 KB Output is correct
29 Correct 123 ms 50792 KB Output is correct
30 Correct 124 ms 50912 KB Output is correct
31 Correct 128 ms 50924 KB Output is correct
32 Correct 129 ms 50696 KB Output is correct
33 Correct 124 ms 50676 KB Output is correct
34 Correct 128 ms 50920 KB Output is correct
35 Correct 133 ms 50908 KB Output is correct
36 Correct 44 ms 47352 KB Output is correct
37 Correct 125 ms 50792 KB Output is correct
38 Correct 121 ms 50792 KB Output is correct
39 Correct 126 ms 50912 KB Output is correct
40 Correct 126 ms 50876 KB Output is correct
41 Correct 113 ms 50792 KB Output is correct
42 Correct 112 ms 50668 KB Output is correct
43 Correct 47 ms 47220 KB Output is correct
44 Correct 111 ms 50672 KB Output is correct
45 Correct 115 ms 50668 KB Output is correct
46 Correct 48 ms 47728 KB Output is correct
47 Correct 101 ms 50412 KB Output is correct
48 Correct 89 ms 48244 KB Output is correct
49 Correct 79 ms 48244 KB Output is correct
50 Correct 74 ms 48236 KB Output is correct
51 Correct 72 ms 48240 KB Output is correct
52 Correct 91 ms 50540 KB Output is correct
53 Correct 89 ms 50540 KB Output is correct
54 Correct 99 ms 50412 KB Output is correct
55 Correct 98 ms 50416 KB Output is correct
56 Correct 393 ms 48240 KB Output is correct
57 Correct 455 ms 48248 KB Output is correct
58 Correct 404 ms 48240 KB Output is correct
59 Correct 733 ms 50544 KB Output is correct
60 Correct 794 ms 50408 KB Output is correct
61 Correct 759 ms 50664 KB Output is correct
62 Correct 757 ms 50408 KB Output is correct
63 Correct 719 ms 50540 KB Output is correct
64 Correct 796 ms 50544 KB Output is correct
65 Correct 760 ms 50536 KB Output is correct
66 Correct 819 ms 50536 KB Output is correct
67 Correct 715 ms 50540 KB Output is correct
68 Correct 763 ms 50536 KB Output is correct
69 Correct 703 ms 50412 KB Output is correct
70 Correct 760 ms 50544 KB Output is correct
71 Correct 707 ms 48872 KB Output is correct
72 Correct 728 ms 50536 KB Output is correct
73 Correct 744 ms 50544 KB Output is correct
74 Correct 246 ms 48004 KB Output is correct
75 Correct 339 ms 47984 KB Output is correct
76 Correct 201 ms 47988 KB Output is correct
77 Correct 1081 ms 51368 KB Output is correct
78 Correct 1113 ms 51548 KB Output is correct
79 Correct 181 ms 47604 KB Output is correct
80 Correct 1101 ms 51160 KB Output is correct
81 Correct 1121 ms 51036 KB Output is correct
82 Correct 997 ms 50544 KB Output is correct
83 Correct 990 ms 50664 KB Output is correct
84 Correct 242 ms 47544 KB Output is correct
85 Correct 1056 ms 50664 KB Output is correct
86 Correct 1041 ms 50600 KB Output is correct
87 Correct 214 ms 47728 KB Output is correct
88 Correct 697 ms 50288 KB Output is correct
89 Correct 653 ms 50280 KB Output is correct
90 Correct 628 ms 50284 KB Output is correct
91 Correct 547 ms 48228 KB Output is correct
92 Correct 430 ms 48112 KB Output is correct
93 Correct 739 ms 50416 KB Output is correct
94 Correct 687 ms 50412 KB Output is correct
95 Correct 789 ms 50284 KB Output is correct
96 Correct 789 ms 50284 KB Output is correct
97 Correct 868 ms 97604 KB Output is correct
98 Correct 851 ms 98752 KB Output is correct
99 Runtime error 460 ms 262148 KB Execution killed with signal 9
100 Halted 0 ms 0 KB -