oj.uz

답안 #832042

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
832042 2023-08-20T21:25:54 Z Antekb 도로 폐쇄 (APIO21_roads) C++17
53 / 100
 2000 ms 31784 KB 
#include<bits/stdc++.h>
#include "roads.h"
#define st first
#define nd second
#define pb push_back
#define pp pop_back
#define eb emplace_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii > vii;

void debug(){cerr<<"\n";}
template <typename H, typename... T>
void debug(H h, T... t) {cerr<<h; if (sizeof...(t)) cerr << ", "; debug(t...);}
#define deb(x...) cerr<<#x<<" = ";debug(x);

const int N=1e5+5;
vii E[N], E2[N];
ll dp[N][2];
int par[N];
int vis[N];
vi co[N];
vector<ll> suf[N];

void dfs(int v, int k){
	for(pii e:E[v]){
		int u=e.st, c=e.nd;
		if(u!=par[v]){
			par[u]=v;
			dfs(u, k);
		}
	}
	dp[v][1]=dp[v][0]=0;
		vector<int> V;
		for(pii e:E[v]){
			int u=e.st, c=e.nd;
			if(u!=par[v]){
					dp[v][0]+=dp[u][1];
					V.pb(dp[u][0]+c-dp[u][1]);
			}
		}
		sort(all(V));
		for(int j=V.size()-1; j>=int(V.size())-k+1 && j>=0 && V[j]>0; j--){
			dp[v][0]+=V[j];
		}
		dp[v][1]=dp[v][0];
		if(V.size()>=k && V.end()[-k]>0)dp[v][1]+=V.end()[-k];
		//if(i>=2)assert(2*dp[v][1][i-1]>=dp[v][1][i]+dp[v][1][i-2]);
	//deb(v, dp[v][0], dp[v][1], dp[v][2]);
}
void dfs2(int v, int k){
	for(pii e:E2[v])dfs2(e.st, k);
	dp[v][1]=dp[v][0]=0;
	vector<int> V;
	for(pii e:E2[v]){
		int u=e.st, c=e.nd;
		dp[v][0]+=dp[u][1];
		V.pb(dp[u][0]+c-dp[u][1]);
	}
	sort(all(V));
	ll s=0;
	ll opt=0, opt2=0;
	dp[v][1]=dp[v][0];
	/*for(int i:V){
		deb(i);
	}
	deb(" ");
	for(int i:suf[v]){
		deb(i);
	}*/
	if(suf[v].size()){
	for(int j=0; j<=V.size(); j++){
		if(j+1<k){
			opt=max(opt, suf[v].end()[max(-k+1+j, -int(suf[v].size()))]+s);
			//deb(j, s, suf[v].end()[-k+1+j]);
		}
		if(j<k)opt2=max(opt2, suf[v].end()[max(-k+j, -int(suf[v].size()))]+s);
		if(j!=V.size())s+=V.end()[-1-j];
	}
	}
	else{
		for(int j=0; j<=k && j<=V.size(); j++){
		if(j+1<=k){
			opt=max(opt,s);
			//deb(j, s, suf[v].end()[-k+1+j]);
		}
		if(j<=k)opt2=max(opt2, s);
		if(j!=V.size())s+=V.end()[-1-j];
	}
	}
	opt2=max(opt, opt2);
	dp[v][0]+=opt;
	dp[v][1]+=opt2;
	//deb(v, dp[v][0], dp[v][1]);
}

std::vector<long long> minimum_closure_costs(int n, std::vector<int> uu, 
	std::vector<int> vv,std::vector<int> ww) {
	ll sum=0;
	for(int i=0; i<n-1; i++){
		E[uu[i]].eb(vv[i], ww[i]);
		E[vv[i]].eb(uu[i], ww[i]);
		sum+=ww[i];
	}
	vector<ll> ans(n);
	ans[0]=sum;
	par[0]=-1;
	int K=100;
	for(int i=1; i<K && i<n; i++){
		dfs(0, i);
		ans[i]=sum-dp[0][1];
	}
	vi todo;
	for(int t=K; t<n; t++){
		if(t%100==0 && t<=1000){
			todo.clear();
			sum=0;
			for(int i=0; i<n; i++){
				if(E[i].size()>=K){
					E2[i].clear();
					suf[i].clear();
					co[i].clear();
					if(i==0 || E[par[i]].size()<K)todo.pb(i);
					for(auto e:E[i]){
						if(E[e.st].size()>=K && e.st!=par[i]){
							//deb(i, par[i], e.st);
							E2[i].pb(e);
						}
						if(E[e.st].size()<K || e.st!=par[i]){
							sum+=e.nd;
							if(E[e.st].size()<K){
								co[i].pb(e.nd);
							}
						}
					}
					if(co[i].size())sort(all(co[i]));
					suf[i].resize(co[i].size());
					for(int j=int(co[i].size())-1; j>=0; j--){
						suf[i][j]=co[i][j];
						if(j!=co[i].size()-1){
							suf[i][j]+=suf[i][j+1];
						}
					}
				}
			}
		}
				ans[t]=sum;
				for(int v:todo){
					dfs2(v, t);
					ans[t]-=dp[v][1];
				}
	}
	return ans;
}

Compilation message

roads.cpp: In function 'void dfs(int, int)':
roads.cpp:32:15: warning: unused variable 'c' [-Wunused-variable]
   32 |   int u=e.st, c=e.nd;
      |               ^
roads.cpp:52:14: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   52 |   if(V.size()>=k && V.end()[-k]>0)dp[v][1]+=V.end()[-k];
      |      ~~~~~~~~^~~
roads.cpp: In function 'void dfs2(int, int)':
roads.cpp:77:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   77 |  for(int j=0; j<=V.size(); j++){
      |               ~^~~~~~~~~~
roads.cpp:83:7: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   83 |   if(j!=V.size())s+=V.end()[-1-j];
      |      ~^~~~~~~~~~
roads.cpp:87:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   87 |   for(int j=0; j<=k && j<=V.size(); j++){
      |                        ~^~~~~~~~~~
roads.cpp:93:7: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   93 |   if(j!=V.size())s+=V.end()[-1-j];
      |      ~^~~~~~~~~~
roads.cpp: In function 'std::vector<long long int> minimum_closure_costs(int, std::vector<int>, std::vector<int>, std::vector<int>)':
roads.cpp:124:19: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  124 |     if(E[i].size()>=K){
      |        ~~~~~~~~~~~^~~
roads.cpp:128:33: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  128 |      if(i==0 || E[par[i]].size()<K)todo.pb(i);
      |                 ~~~~~~~~~~~~~~~~^~
roads.cpp:130:24: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  130 |       if(E[e.st].size()>=K && e.st!=par[i]){
      |          ~~~~~~~~~~~~~~^~~
roads.cpp:134:24: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  134 |       if(E[e.st].size()<K || e.st!=par[i]){
      |          ~~~~~~~~~~~~~~^~
roads.cpp:136:25: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  136 |        if(E[e.st].size()<K){
      |           ~~~~~~~~~~~~~~^~
roads.cpp:145:11: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  145 |       if(j!=co[i].size()-1){
      |          ~^~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 9684 KB Output is correct
2 Correct 17 ms 9892 KB Output is correct
3 Correct 15 ms 9940 KB Output is correct
4 Correct 9 ms 9940 KB Output is correct
5 Correct 5 ms 9684 KB Output is correct
6 Correct 5 ms 9684 KB Output is correct
7 Correct 5 ms 9684 KB Output is correct
8 Correct 11 ms 9812 KB Output is correct
9 Correct 10 ms 9812 KB Output is correct
10 Correct 5 ms 9684 KB Output is correct
11 Correct 5 ms 9684 KB Output is correct
12 Correct 260 ms 16000 KB Output is correct
13 Correct 466 ms 20468 KB Output is correct
14 Correct 794 ms 19500 KB Output is correct
15 Correct 964 ms 20472 KB Output is correct
16 Correct 938 ms 20624 KB Output is correct
17 Correct 347 ms 20648 KB Output is correct
18 Correct 6 ms 9684 KB Output is correct
19 Correct 328 ms 19432 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 9684 KB Output is correct
2 Correct 418 ms 26932 KB Output is correct
3 Correct 513 ms 29120 KB Output is correct
4 Correct 539 ms 30436 KB Output is correct
5 Correct 508 ms 30444 KB Output is correct
6 Correct 10 ms 9940 KB Output is correct
7 Correct 12 ms 10116 KB Output is correct
8 Correct 11 ms 10068 KB Output is correct
9 Correct 5 ms 9684 KB Output is correct
10 Correct 6 ms 9684 KB Output is correct
11 Correct 6 ms 9684 KB Output is correct
12 Correct 252 ms 22104 KB Output is correct
13 Correct 502 ms 30440 KB Output is correct
14 Correct 4 ms 9684 KB Output is correct
15 Correct 412 ms 28372 KB Output is correct
16 Correct 536 ms 30340 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 9684 KB Output is correct
2 Correct 6 ms 9684 KB Output is correct
3 Correct 4 ms 9684 KB Output is correct
4 Correct 5 ms 9684 KB Output is correct
5 Correct 5 ms 9712 KB Output is correct
6 Correct 5 ms 9684 KB Output is correct
7 Correct 5 ms 9684 KB Output is correct
8 Correct 8 ms 9736 KB Output is correct
9 Correct 5 ms 9684 KB Output is correct
10 Correct 5 ms 9684 KB Output is correct
11 Correct 5 ms 9684 KB Output is correct
12 Correct 5 ms 9684 KB Output is correct
13 Correct 6 ms 9684 KB Output is correct
14 Correct 5 ms 9684 KB Output is correct
15 Correct 6 ms 9740 KB Output is correct
16 Correct 5 ms 9668 KB Output is correct
17 Correct 7 ms 9712 KB Output is correct
18 Correct 5 ms 9684 KB Output is correct
19 Correct 4 ms 9684 KB Output is correct
20 Correct 5 ms 9684 KB Output is correct
21 Correct 6 ms 9680 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 9684 KB Output is correct
2 Correct 6 ms 9684 KB Output is correct
3 Correct 4 ms 9684 KB Output is correct
4 Correct 5 ms 9684 KB Output is correct
5 Correct 5 ms 9712 KB Output is correct
6 Correct 5 ms 9684 KB Output is correct
7 Correct 5 ms 9684 KB Output is correct
8 Correct 8 ms 9736 KB Output is correct
9 Correct 5 ms 9684 KB Output is correct
10 Correct 5 ms 9684 KB Output is correct
11 Correct 5 ms 9684 KB Output is correct
12 Correct 5 ms 9684 KB Output is correct
13 Correct 6 ms 9684 KB Output is correct
14 Correct 5 ms 9684 KB Output is correct
15 Correct 6 ms 9740 KB Output is correct
16 Correct 5 ms 9668 KB Output is correct
17 Correct 7 ms 9712 KB Output is correct
18 Correct 5 ms 9684 KB Output is correct
19 Correct 4 ms 9684 KB Output is correct
20 Correct 5 ms 9684 KB Output is correct
21 Correct 6 ms 9680 KB Output is correct
22 Correct 4 ms 9684 KB Output is correct
23 Correct 10 ms 9724 KB Output is correct
24 Correct 14 ms 9812 KB Output is correct
25 Correct 12 ms 9872 KB Output is correct
26 Correct 13 ms 9812 KB Output is correct
27 Correct 13 ms 9936 KB Output is correct
28 Correct 13 ms 9936 KB Output is correct
29 Correct 14 ms 9836 KB Output is correct
30 Correct 10 ms 9860 KB Output is correct
31 Correct 10 ms 9848 KB Output is correct
32 Correct 9 ms 9924 KB Output is correct
33 Correct 11 ms 10064 KB Output is correct
34 Correct 11 ms 10112 KB Output is correct
35 Correct 11 ms 10068 KB Output is correct
36 Correct 14 ms 9892 KB Output is correct
37 Correct 14 ms 9940 KB Output is correct
38 Correct 8 ms 9940 KB Output is correct
39 Correct 4 ms 9684 KB Output is correct
40 Correct 4 ms 9684 KB Output is correct
41 Correct 6 ms 9676 KB Output is correct
42 Correct 6 ms 9684 KB Output is correct
43 Correct 6 ms 9684 KB Output is correct
44 Correct 6 ms 9668 KB Output is correct
45 Correct 7 ms 9684 KB Output is correct
46 Correct 5 ms 9684 KB Output is correct
47 Correct 5 ms 9640 KB Output is correct
48 Correct 5 ms 9684 KB Output is correct
49 Correct 5 ms 9712 KB Output is correct
50 Correct 5 ms 9684 KB Output is correct
51 Correct 5 ms 9684 KB Output is correct
52 Correct 5 ms 9684 KB Output is correct
53 Correct 12 ms 9792 KB Output is correct
54 Correct 14 ms 9900 KB Output is correct
55 Correct 10 ms 9904 KB Output is correct
56 Correct 8 ms 9812 KB Output is correct
57 Correct 9 ms 9904 KB Output is correct
58 Correct 4 ms 9684 KB Output is correct
59 Correct 6 ms 9684 KB Output is correct
60 Correct 6 ms 9684 KB Output is correct
61 Correct 5 ms 9684 KB Output is correct
62 Correct 5 ms 9684 KB Output is correct
63 Correct 6 ms 9684 KB Output is correct
64 Correct 17 ms 9812 KB Output is correct
65 Correct 14 ms 9812 KB Output is correct
66 Correct 8 ms 9852 KB Output is correct
67 Correct 8 ms 9892 KB Output is correct
68 Correct 9 ms 9792 KB Output is correct

Subtask #5
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 846 ms 18252 KB Output is correct
2 Correct 758 ms 18100 KB Output is correct
3 Correct 1911 ms 20644 KB Output is correct
4 Correct 839 ms 18780 KB Output is correct
5 Correct 1151 ms 20928 KB Output is correct
6 Correct 474 ms 20300 KB Output is correct
7 Correct 978 ms 20812 KB Output is correct
8 Correct 304 ms 20836 KB Output is correct
9 Correct 893 ms 24472 KB Output is correct
10 Correct 723 ms 19640 KB Output is correct
11 Correct 1954 ms 21676 KB Output is correct
12 Correct 368 ms 21356 KB Output is correct
13 Correct 5 ms 9684 KB Output is correct
14 Correct 420 ms 29592 KB Output is correct
15 Correct 507 ms 31784 KB Output is correct
16 Correct 13 ms 9916 KB Output is correct
17 Correct 14 ms 9812 KB Output is correct
18 Correct 8 ms 9928 KB Output is correct
19 Correct 8 ms 9940 KB Output is correct
20 Correct 8 ms 9812 KB Output is correct
21 Correct 307 ms 20348 KB Output is correct

Subtask #6
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 846 ms 18252 KB Output is correct
2 Correct 758 ms 18100 KB Output is correct
3 Correct 1911 ms 20644 KB Output is correct
4 Correct 839 ms 18780 KB Output is correct
5 Correct 1151 ms 20928 KB Output is correct
6 Correct 474 ms 20300 KB Output is correct
7 Correct 978 ms 20812 KB Output is correct
8 Correct 304 ms 20836 KB Output is correct
9 Correct 893 ms 24472 KB Output is correct
10 Correct 723 ms 19640 KB Output is correct
11 Correct 1954 ms 21676 KB Output is correct
12 Correct 368 ms 21356 KB Output is correct
13 Correct 5 ms 9684 KB Output is correct
14 Correct 420 ms 29592 KB Output is correct
15 Correct 507 ms 31784 KB Output is correct
16 Correct 13 ms 9916 KB Output is correct
17 Correct 14 ms 9812 KB Output is correct
18 Correct 8 ms 9928 KB Output is correct
19 Correct 8 ms 9940 KB Output is correct
20 Correct 8 ms 9812 KB Output is correct
21 Correct 307 ms 20348 KB Output is correct
22 Correct 5 ms 9624 KB Output is correct
23 Correct 5 ms 9684 KB Output is correct
24 Correct 4 ms 9660 KB Output is correct
25 Correct 684 ms 18460 KB Output is correct
26 Correct 575 ms 17612 KB Output is correct
27 Correct 797 ms 19932 KB Output is correct
28 Execution timed out 2054 ms 21984 KB Time limit exceeded
29 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 9684 KB Output is correct
2 Correct 17 ms 9892 KB Output is correct
3 Correct 15 ms 9940 KB Output is correct
4 Correct 9 ms 9940 KB Output is correct
5 Correct 5 ms 9684 KB Output is correct
6 Correct 5 ms 9684 KB Output is correct
7 Correct 5 ms 9684 KB Output is correct
8 Correct 11 ms 9812 KB Output is correct
9 Correct 10 ms 9812 KB Output is correct
10 Correct 5 ms 9684 KB Output is correct
11 Correct 5 ms 9684 KB Output is correct
12 Correct 260 ms 16000 KB Output is correct
13 Correct 466 ms 20468 KB Output is correct
14 Correct 794 ms 19500 KB Output is correct
15 Correct 964 ms 20472 KB Output is correct
16 Correct 938 ms 20624 KB Output is correct
17 Correct 347 ms 20648 KB Output is correct
18 Correct 6 ms 9684 KB Output is correct
19 Correct 328 ms 19432 KB Output is correct
20 Correct 4 ms 9684 KB Output is correct
21 Correct 418 ms 26932 KB Output is correct
22 Correct 513 ms 29120 KB Output is correct
23 Correct 539 ms 30436 KB Output is correct
24 Correct 508 ms 30444 KB Output is correct
25 Correct 10 ms 9940 KB Output is correct
26 Correct 12 ms 10116 KB Output is correct
27 Correct 11 ms 10068 KB Output is correct
28 Correct 5 ms 9684 KB Output is correct
29 Correct 6 ms 9684 KB Output is correct
30 Correct 6 ms 9684 KB Output is correct
31 Correct 252 ms 22104 KB Output is correct
32 Correct 502 ms 30440 KB Output is correct
33 Correct 4 ms 9684 KB Output is correct
34 Correct 412 ms 28372 KB Output is correct
35 Correct 536 ms 30340 KB Output is correct
36 Correct 4 ms 9684 KB Output is correct
37 Correct 6 ms 9684 KB Output is correct
38 Correct 4 ms 9684 KB Output is correct
39 Correct 5 ms 9684 KB Output is correct
40 Correct 5 ms 9712 KB Output is correct
41 Correct 5 ms 9684 KB Output is correct
42 Correct 5 ms 9684 KB Output is correct
43 Correct 8 ms 9736 KB Output is correct
44 Correct 5 ms 9684 KB Output is correct
45 Correct 5 ms 9684 KB Output is correct
46 Correct 5 ms 9684 KB Output is correct
47 Correct 5 ms 9684 KB Output is correct
48 Correct 6 ms 9684 KB Output is correct
49 Correct 5 ms 9684 KB Output is correct
50 Correct 6 ms 9740 KB Output is correct
51 Correct 5 ms 9668 KB Output is correct
52 Correct 7 ms 9712 KB Output is correct
53 Correct 5 ms 9684 KB Output is correct
54 Correct 4 ms 9684 KB Output is correct
55 Correct 5 ms 9684 KB Output is correct
56 Correct 6 ms 9680 KB Output is correct
57 Correct 4 ms 9684 KB Output is correct
58 Correct 10 ms 9724 KB Output is correct
59 Correct 14 ms 9812 KB Output is correct
60 Correct 12 ms 9872 KB Output is correct
61 Correct 13 ms 9812 KB Output is correct
62 Correct 13 ms 9936 KB Output is correct
63 Correct 13 ms 9936 KB Output is correct
64 Correct 14 ms 9836 KB Output is correct
65 Correct 10 ms 9860 KB Output is correct
66 Correct 10 ms 9848 KB Output is correct
67 Correct 9 ms 9924 KB Output is correct
68 Correct 11 ms 10064 KB Output is correct
69 Correct 11 ms 10112 KB Output is correct
70 Correct 11 ms 10068 KB Output is correct
71 Correct 14 ms 9892 KB Output is correct
72 Correct 14 ms 9940 KB Output is correct
73 Correct 8 ms 9940 KB Output is correct
74 Correct 4 ms 9684 KB Output is correct
75 Correct 4 ms 9684 KB Output is correct
76 Correct 6 ms 9676 KB Output is correct
77 Correct 6 ms 9684 KB Output is correct
78 Correct 6 ms 9684 KB Output is correct
79 Correct 6 ms 9668 KB Output is correct
80 Correct 7 ms 9684 KB Output is correct
81 Correct 5 ms 9684 KB Output is correct
82 Correct 5 ms 9640 KB Output is correct
83 Correct 5 ms 9684 KB Output is correct
84 Correct 5 ms 9712 KB Output is correct
85 Correct 5 ms 9684 KB Output is correct
86 Correct 5 ms 9684 KB Output is correct
87 Correct 5 ms 9684 KB Output is correct
88 Correct 12 ms 9792 KB Output is correct
89 Correct 14 ms 9900 KB Output is correct
90 Correct 10 ms 9904 KB Output is correct
91 Correct 8 ms 9812 KB Output is correct
92 Correct 9 ms 9904 KB Output is correct
93 Correct 4 ms 9684 KB Output is correct
94 Correct 6 ms 9684 KB Output is correct
95 Correct 6 ms 9684 KB Output is correct
96 Correct 5 ms 9684 KB Output is correct
97 Correct 5 ms 9684 KB Output is correct
98 Correct 6 ms 9684 KB Output is correct
99 Correct 17 ms 9812 KB Output is correct
100 Correct 14 ms 9812 KB Output is correct
101 Correct 8 ms 9852 KB Output is correct
102 Correct 8 ms 9892 KB Output is correct
103 Correct 9 ms 9792 KB Output is correct
104 Correct 846 ms 18252 KB Output is correct
105 Correct 758 ms 18100 KB Output is correct
106 Correct 1911 ms 20644 KB Output is correct
107 Correct 839 ms 18780 KB Output is correct
108 Correct 1151 ms 20928 KB Output is correct
109 Correct 474 ms 20300 KB Output is correct
110 Correct 978 ms 20812 KB Output is correct
111 Correct 304 ms 20836 KB Output is correct
112 Correct 893 ms 24472 KB Output is correct
113 Correct 723 ms 19640 KB Output is correct
114 Correct 1954 ms 21676 KB Output is correct
115 Correct 368 ms 21356 KB Output is correct
116 Correct 5 ms 9684 KB Output is correct
117 Correct 420 ms 29592 KB Output is correct
118 Correct 507 ms 31784 KB Output is correct
119 Correct 13 ms 9916 KB Output is correct
120 Correct 14 ms 9812 KB Output is correct
121 Correct 8 ms 9928 KB Output is correct
122 Correct 8 ms 9940 KB Output is correct
123 Correct 8 ms 9812 KB Output is correct
124 Correct 307 ms 20348 KB Output is correct
125 Correct 5 ms 9624 KB Output is correct
126 Correct 5 ms 9684 KB Output is correct
127 Correct 4 ms 9660 KB Output is correct
128 Correct 684 ms 18460 KB Output is correct
129 Correct 575 ms 17612 KB Output is correct
130 Correct 797 ms 19932 KB Output is correct
131 Execution timed out 2054 ms 21984 KB Time limit exceeded
132 Halted 0 ms 0 KB -