oj.uz

답안 #852542

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
852542 2023-09-22T03:47:25 Z Lib 봉쇄 시간 (IOI23_closing) C++17
100 / 100
 173 ms 52664 KB 
#include "closing.h"
#include <bits/stdc++.h>
using namespace std;
int Type[300003];
int Check[300003];
int BFSCheck[300003];
long long Cost1[300003];
long long Cost2[300003];
long long DistX[300003];
long long DistY[300003];
vector <int> XYPath;
int check[300003];
int check2[300003];
long long N,X,Y,K,n,ans1,ans2;
struct edge{
	int first;
	long long second;
};
vector <edge> VTemp;
vector <vector <edge> > adj;
priority_queue <pair <long long,int> > pq1,pq2,pq3,pq4;
int max_score(int N, int X, int Y, long long K, std::vector<int> U, std::vector<int> V, std::vector<int> W)
{
	int n=N;
	int x=X;
	int y=Y;
	long long k=K;
	int q,s,e;
	long long tans,Budget,len;
	vector <int> CList;
	int cur,cur2;
	int t;
	long long t2;
	pair <long long,int> tpos;
		while(!pq1.empty()){
			pq1.pop();
		}
		while(!pq2.empty()){
			pq2.pop();
		}
		while(!pq3.empty()){
			pq3.pop();
		}
		while(!pq4.empty()){
			pq4.pop();
		}
		XYPath.clear();
		adj.clear();
		n=N;
		for(int i=0;i<=n+1;i++){
			adj.push_back(VTemp);
			check[i]=0;
			Cost1[i]=0;
			Cost2[i]=0;
			DistX[i]=0;
			DistY[i]=0;
			Type[i]=0;
		}
		ans1=0;
		ans2=0;
		for(int i=1;i<n;i++){
			s=U[i-1];
			e=V[i-1];
			len=W[i-1];
			adj[s].push_back({e,len});
			adj[e].push_back({s,len});
		}
		CList.clear();
		cur=0;
		cur2=0;
		for(int i=0;i<=n+1;i++){
			BFSCheck[i]=0;
		}
		CList.push_back(X);
		BFSCheck[X]=1;
		DistX[X]=0;
		while(cur<CList.size()){
			t=CList[cur];
			for(int i=0;i<adj[t].size();i++){
				if(BFSCheck[adj[t][i].first]==0){
					BFSCheck[adj[t][i].first]=1;
					DistX[adj[t][i].first]=DistX[t]+adj[t][i].second;
					CList.push_back(adj[t][i].first);
				}
			}
			cur++;
		}
		CList.clear();
		cur=0;
		cur2=0;
		for(int i=0;i<=n+1;i++){
			BFSCheck[i]=0;
		}
		CList.push_back(Y);
		BFSCheck[Y]=1;
		DistY[Y]=0;
		while(cur<CList.size()){
			t=CList[cur];
			for(int i=0;i<adj[t].size();i++){
				if(BFSCheck[adj[t][i].first]==0){
					BFSCheck[adj[t][i].first]=1;
					DistY[adj[t][i].first]=DistY[t]+adj[t][i].second;
					CList.push_back(adj[t][i].first);
				}
			}
			cur++;
		}
		for(int i=0;i<n;i++){
			Cost1[i]=min(DistX[i],DistY[i]);
			Cost2[i]=max(DistX[i],DistY[i])-Cost1[i];
			if(Cost1[i]*2+Cost2[i]==DistX[Y]){
				XYPath.push_back(i);
			}
			if(Cost2[i]<=Cost1[i]){
			 Type[i]=1;
			}
		}
		for(int i=0;i<XYPath.size();i++){
			Type[XYPath[i]]=2;
		}
		for(int i=0;i<n;i++){
			pq4.push({-Cost1[i],i});
		}
		Budget=K;
		while(Budget>0&&!pq4.empty()){
			Budget+=pq4.top().first;
			check2[pq4.top().second]=1;
			if(Budget>=0){
				ans1++;
				pq4.pop();
			}
		}
		Budget=K;
		for(int i=0;i<XYPath.size();i++){
			Budget-=Cost1[XYPath[i]];
			check[XYPath[i]]=1;
			ans2++;
		}
		tans=ans1;
		if(Budget>0){
			for(int i=0;i<n;i++){
				if(Type[i]==0){
					pq1.push({-Cost1[i],i});
					pq1.push({-Cost2[i],i});
				}else if(Type[i]==1){
					pq2.push({-(Cost1[i]+Cost2[i]),i});
					pq3.push({-Cost1[i],i});
				}else{
					pq1.push({-Cost2[i],i});
				}
			}
			while(!pq2.empty()&&Budget+pq2.top().first>=0){
				if(pq1.size() <=1){
					Budget+=pq2.top().first;
					if(Budget>=0){
					check[pq2.top().second]=2;
					pq2.pop();
					ans2+=2;
					continue;
					}
				}
				tpos=pq1.top();
				pq1.pop();
				if(pq1.top().first+tpos.first> pq2.top().first&&Budget+tpos.first>=0){
					Budget+=(tpos.first);
					ans2+=1;
					check[tpos.second]++;
				}else if(pq2.top().first+Budget>=0){
				Budget+=pq2.top().first;
					pq1.push(tpos);
					ans2+=2;
					check[pq2.top().second]=2;
					pq2.pop();
				}
			}
			while(!pq1.empty()&&Budget+pq1.top().first>=0){
				Budget+=pq1.top().first;
					ans2++;
					check[pq1.top().second]++;
					pq1.pop();
			}
			while(!pq3.empty()&&check[pq3.top().second]!=0){
				pq3.pop();
			}
			if(!pq3.empty()&&pq3.top().first+Budget>=0){
				ans2++;
				check[pq3.top().second]=1;
			}
			tans=max(ans1,ans2);
		}
		return tans;
}

Compilation message

closing.cpp: In function 'int max_score(int, int, int, long long int, std::vector<int>, std::vector<int>, std::vector<int>)':
closing.cpp:77:12: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   77 |   while(cur<CList.size()){
      |         ~~~^~~~~~~~~~~~~
closing.cpp:79:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<edge>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   79 |    for(int i=0;i<adj[t].size();i++){
      |                ~^~~~~~~~~~~~~~
closing.cpp:97:12: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   97 |   while(cur<CList.size()){
      |         ~~~^~~~~~~~~~~~~
closing.cpp:99:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<edge>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   99 |    for(int i=0;i<adj[t].size();i++){
      |                ~^~~~~~~~~~~~~~
closing.cpp:118:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  118 |   for(int i=0;i<XYPath.size();i++){
      |               ~^~~~~~~~~~~~~~
closing.cpp:134:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  134 |   for(int i=0;i<XYPath.size();i++){
      |               ~^~~~~~~~~~~~~~
closing.cpp:25:6: warning: unused variable 'x' [-Wunused-variable]
   25 |  int x=X;
      |      ^
closing.cpp:26:6: warning: unused variable 'y' [-Wunused-variable]
   26 |  int y=Y;
      |      ^
closing.cpp:27:12: warning: unused variable 'k' [-Wunused-variable]
   27 |  long long k=K;
      |            ^
closing.cpp:28:6: warning: unused variable 'q' [-Wunused-variable]
   28 |  int q,s,e;
      |      ^
closing.cpp:31:10: warning: variable 'cur2' set but not used [-Wunused-but-set-variable]
   31 |  int cur,cur2;
      |          ^~~~
closing.cpp:33:12: warning: unused variable 't2' [-Wunused-variable]
   33 |  long long t2;
      |            ^~

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 14680 KB Output is correct

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 100 ms 43416 KB Output is correct
2 Correct 103 ms 45656 KB Output is correct
3 Correct 76 ms 17232 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 14680 KB Output is correct
2 Correct 2 ms 14684 KB Output is correct
3 Correct 2 ms 14680 KB Output is correct
4 Correct 2 ms 14680 KB Output is correct
5 Correct 2 ms 14680 KB Output is correct
6 Correct 2 ms 14680 KB Output is correct
7 Correct 2 ms 14680 KB Output is correct
8 Correct 2 ms 14684 KB Output is correct
9 Correct 2 ms 14680 KB Output is correct
10 Correct 2 ms 14936 KB Output is correct
11 Correct 2 ms 14780 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 14680 KB Output is correct
2 Correct 2 ms 14684 KB Output is correct
3 Correct 2 ms 14680 KB Output is correct
4 Correct 2 ms 14680 KB Output is correct
5 Correct 2 ms 14680 KB Output is correct
6 Correct 2 ms 14680 KB Output is correct
7 Correct 2 ms 14680 KB Output is correct
8 Correct 2 ms 14684 KB Output is correct
9 Correct 2 ms 14680 KB Output is correct
10 Correct 2 ms 14936 KB Output is correct
11 Correct 2 ms 14780 KB Output is correct
12 Correct 2 ms 14680 KB Output is correct
13 Correct 2 ms 14684 KB Output is correct
14 Correct 2 ms 14936 KB Output is correct
15 Correct 2 ms 14684 KB Output is correct
16 Correct 2 ms 14680 KB Output is correct
17 Correct 2 ms 14680 KB Output is correct
18 Correct 2 ms 14680 KB Output is correct
19 Correct 2 ms 14680 KB Output is correct
20 Correct 2 ms 14680 KB Output is correct
21 Correct 2 ms 14684 KB Output is correct
22 Correct 2 ms 14680 KB Output is correct
23 Correct 2 ms 14680 KB Output is correct
24 Correct 3 ms 14680 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 14680 KB Output is correct
2 Correct 2 ms 14684 KB Output is correct
3 Correct 2 ms 14680 KB Output is correct
4 Correct 2 ms 14680 KB Output is correct
5 Correct 2 ms 14680 KB Output is correct
6 Correct 2 ms 14680 KB Output is correct
7 Correct 2 ms 14680 KB Output is correct
8 Correct 2 ms 14684 KB Output is correct
9 Correct 2 ms 14680 KB Output is correct
10 Correct 2 ms 14936 KB Output is correct
11 Correct 2 ms 14780 KB Output is correct
12 Correct 2 ms 14680 KB Output is correct
13 Correct 2 ms 14684 KB Output is correct
14 Correct 2 ms 14936 KB Output is correct
15 Correct 2 ms 14684 KB Output is correct
16 Correct 2 ms 14680 KB Output is correct
17 Correct 2 ms 14680 KB Output is correct
18 Correct 2 ms 14680 KB Output is correct
19 Correct 2 ms 14680 KB Output is correct
20 Correct 2 ms 14680 KB Output is correct
21 Correct 2 ms 14684 KB Output is correct
22 Correct 2 ms 14680 KB Output is correct
23 Correct 2 ms 14680 KB Output is correct
24 Correct 3 ms 14680 KB Output is correct
25 Correct 3 ms 14680 KB Output is correct
26 Correct 4 ms 15192 KB Output is correct
27 Correct 3 ms 15192 KB Output is correct
28 Correct 3 ms 15196 KB Output is correct
29 Correct 3 ms 15196 KB Output is correct
30 Correct 3 ms 15192 KB Output is correct
31 Correct 3 ms 15192 KB Output is correct
32 Correct 3 ms 15192 KB Output is correct

Subtask #5
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 14680 KB Output is correct
2 Correct 2 ms 14680 KB Output is correct
3 Correct 2 ms 14684 KB Output is correct
4 Correct 2 ms 14680 KB Output is correct
5 Correct 2 ms 14680 KB Output is correct
6 Correct 2 ms 14680 KB Output is correct
7 Correct 2 ms 14680 KB Output is correct
8 Correct 2 ms 14684 KB Output is correct
9 Correct 2 ms 14680 KB Output is correct
10 Correct 2 ms 14680 KB Output is correct
11 Correct 2 ms 14680 KB Output is correct
12 Correct 2 ms 14680 KB Output is correct
13 Correct 2 ms 14684 KB Output is correct
14 Correct 2 ms 14680 KB Output is correct
15 Correct 2 ms 14680 KB Output is correct
16 Correct 2 ms 14936 KB Output is correct
17 Correct 2 ms 14680 KB Output is correct
18 Correct 2 ms 14680 KB Output is correct
19 Correct 2 ms 14680 KB Output is correct
20 Correct 2 ms 14936 KB Output is correct
21 Correct 2 ms 14680 KB Output is correct
22 Correct 2 ms 14684 KB Output is correct
23 Correct 2 ms 14680 KB Output is correct
24 Correct 2 ms 14680 KB Output is correct

Subtask #6
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 14680 KB Output is correct
2 Correct 2 ms 14680 KB Output is correct
3 Correct 2 ms 14684 KB Output is correct
4 Correct 2 ms 14680 KB Output is correct
5 Correct 2 ms 14680 KB Output is correct
6 Correct 2 ms 14680 KB Output is correct
7 Correct 2 ms 14680 KB Output is correct
8 Correct 2 ms 14680 KB Output is correct
9 Correct 2 ms 14684 KB Output is correct
10 Correct 2 ms 14680 KB Output is correct
11 Correct 2 ms 14936 KB Output is correct
12 Correct 2 ms 14780 KB Output is correct
13 Correct 2 ms 14680 KB Output is correct
14 Correct 2 ms 14684 KB Output is correct
15 Correct 2 ms 14936 KB Output is correct
16 Correct 2 ms 14684 KB Output is correct
17 Correct 2 ms 14680 KB Output is correct
18 Correct 2 ms 14680 KB Output is correct
19 Correct 2 ms 14680 KB Output is correct
20 Correct 2 ms 14684 KB Output is correct
21 Correct 2 ms 14680 KB Output is correct
22 Correct 2 ms 14680 KB Output is correct
23 Correct 2 ms 14680 KB Output is correct
24 Correct 2 ms 14680 KB Output is correct
25 Correct 2 ms 14684 KB Output is correct
26 Correct 2 ms 14680 KB Output is correct
27 Correct 2 ms 14680 KB Output is correct
28 Correct 2 ms 14936 KB Output is correct
29 Correct 2 ms 14680 KB Output is correct
30 Correct 2 ms 14680 KB Output is correct
31 Correct 2 ms 14680 KB Output is correct
32 Correct 2 ms 14936 KB Output is correct
33 Correct 2 ms 14680 KB Output is correct
34 Correct 2 ms 14684 KB Output is correct
35 Correct 2 ms 14680 KB Output is correct
36 Correct 2 ms 14680 KB Output is correct
37 Correct 2 ms 14680 KB Output is correct
38 Correct 2 ms 14680 KB Output is correct
39 Correct 2 ms 14684 KB Output is correct
40 Correct 2 ms 14680 KB Output is correct
41 Correct 2 ms 14680 KB Output is correct
42 Correct 2 ms 14684 KB Output is correct
43 Correct 2 ms 14680 KB Output is correct
44 Correct 2 ms 14680 KB Output is correct
45 Correct 2 ms 14680 KB Output is correct
46 Correct 2 ms 14680 KB Output is correct
47 Correct 2 ms 14680 KB Output is correct
48 Correct 2 ms 14680 KB Output is correct
49 Correct 2 ms 14680 KB Output is correct
50 Correct 2 ms 14680 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 14680 KB Output is correct
2 Correct 2 ms 14680 KB Output is correct
3 Correct 2 ms 14684 KB Output is correct
4 Correct 2 ms 14680 KB Output is correct
5 Correct 2 ms 14680 KB Output is correct
6 Correct 2 ms 14680 KB Output is correct
7 Correct 2 ms 14680 KB Output is correct
8 Correct 2 ms 14680 KB Output is correct
9 Correct 2 ms 14684 KB Output is correct
10 Correct 2 ms 14680 KB Output is correct
11 Correct 2 ms 14936 KB Output is correct
12 Correct 2 ms 14780 KB Output is correct
13 Correct 2 ms 14680 KB Output is correct
14 Correct 2 ms 14684 KB Output is correct
15 Correct 2 ms 14936 KB Output is correct
16 Correct 2 ms 14684 KB Output is correct
17 Correct 2 ms 14680 KB Output is correct
18 Correct 2 ms 14680 KB Output is correct
19 Correct 2 ms 14680 KB Output is correct
20 Correct 2 ms 14680 KB Output is correct
21 Correct 2 ms 14680 KB Output is correct
22 Correct 2 ms 14684 KB Output is correct
23 Correct 2 ms 14680 KB Output is correct
24 Correct 2 ms 14680 KB Output is correct
25 Correct 3 ms 14680 KB Output is correct
26 Correct 2 ms 14680 KB Output is correct
27 Correct 2 ms 14684 KB Output is correct
28 Correct 2 ms 14680 KB Output is correct
29 Correct 2 ms 14680 KB Output is correct
30 Correct 2 ms 14680 KB Output is correct
31 Correct 2 ms 14680 KB Output is correct
32 Correct 2 ms 14684 KB Output is correct
33 Correct 2 ms 14680 KB Output is correct
34 Correct 2 ms 14680 KB Output is correct
35 Correct 2 ms 14936 KB Output is correct
36 Correct 2 ms 14680 KB Output is correct
37 Correct 2 ms 14680 KB Output is correct
38 Correct 2 ms 14680 KB Output is correct
39 Correct 2 ms 14936 KB Output is correct
40 Correct 2 ms 14680 KB Output is correct
41 Correct 2 ms 14684 KB Output is correct
42 Correct 2 ms 14680 KB Output is correct
43 Correct 2 ms 14680 KB Output is correct
44 Correct 2 ms 14680 KB Output is correct
45 Correct 2 ms 14680 KB Output is correct
46 Correct 2 ms 14684 KB Output is correct
47 Correct 2 ms 14680 KB Output is correct
48 Correct 2 ms 14680 KB Output is correct
49 Correct 2 ms 14684 KB Output is correct
50 Correct 2 ms 14680 KB Output is correct
51 Correct 2 ms 14680 KB Output is correct
52 Correct 2 ms 14680 KB Output is correct
53 Correct 2 ms 14680 KB Output is correct
54 Correct 2 ms 14680 KB Output is correct
55 Correct 2 ms 14680 KB Output is correct
56 Correct 2 ms 14680 KB Output is correct
57 Correct 2 ms 14680 KB Output is correct
58 Correct 2 ms 14880 KB Output is correct
59 Correct 2 ms 14680 KB Output is correct
60 Correct 2 ms 14684 KB Output is correct
61 Correct 2 ms 14680 KB Output is correct
62 Correct 2 ms 14680 KB Output is correct
63 Correct 2 ms 14680 KB Output is correct
64 Correct 2 ms 14680 KB Output is correct
65 Correct 2 ms 14936 KB Output is correct
66 Correct 2 ms 14680 KB Output is correct
67 Correct 2 ms 14680 KB Output is correct
68 Correct 2 ms 14680 KB Output is correct
69 Correct 2 ms 14684 KB Output is correct
70 Correct 2 ms 14680 KB Output is correct
71 Correct 2 ms 14680 KB Output is correct
72 Correct 2 ms 14680 KB Output is correct
73 Correct 2 ms 14684 KB Output is correct
74 Correct 2 ms 14684 KB Output is correct
75 Correct 2 ms 14684 KB Output is correct

Subtask #8
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 14680 KB Output is correct
2 Correct 2 ms 14680 KB Output is correct
3 Correct 2 ms 14684 KB Output is correct
4 Correct 2 ms 14680 KB Output is correct
5 Correct 2 ms 14680 KB Output is correct
6 Correct 2 ms 14680 KB Output is correct
7 Correct 2 ms 14680 KB Output is correct
8 Correct 2 ms 14680 KB Output is correct
9 Correct 2 ms 14684 KB Output is correct
10 Correct 2 ms 14680 KB Output is correct
11 Correct 2 ms 14936 KB Output is correct
12 Correct 2 ms 14780 KB Output is correct
13 Correct 2 ms 14680 KB Output is correct
14 Correct 2 ms 14684 KB Output is correct
15 Correct 2 ms 14936 KB Output is correct
16 Correct 2 ms 14684 KB Output is correct
17 Correct 2 ms 14680 KB Output is correct
18 Correct 2 ms 14680 KB Output is correct
19 Correct 2 ms 14680 KB Output is correct
20 Correct 2 ms 14680 KB Output is correct
21 Correct 2 ms 14680 KB Output is correct
22 Correct 2 ms 14684 KB Output is correct
23 Correct 2 ms 14680 KB Output is correct
24 Correct 2 ms 14680 KB Output is correct
25 Correct 3 ms 14680 KB Output is correct
26 Correct 3 ms 14680 KB Output is correct
27 Correct 4 ms 15192 KB Output is correct
28 Correct 3 ms 15192 KB Output is correct
29 Correct 3 ms 15196 KB Output is correct
30 Correct 3 ms 15196 KB Output is correct
31 Correct 3 ms 15192 KB Output is correct
32 Correct 3 ms 15192 KB Output is correct
33 Correct 3 ms 15192 KB Output is correct
34 Correct 2 ms 14680 KB Output is correct
35 Correct 2 ms 14684 KB Output is correct
36 Correct 2 ms 14680 KB Output is correct
37 Correct 2 ms 14680 KB Output is correct
38 Correct 2 ms 14680 KB Output is correct
39 Correct 2 ms 14680 KB Output is correct
40 Correct 2 ms 14684 KB Output is correct
41 Correct 2 ms 14680 KB Output is correct
42 Correct 2 ms 14680 KB Output is correct
43 Correct 2 ms 14936 KB Output is correct
44 Correct 2 ms 14680 KB Output is correct
45 Correct 2 ms 14680 KB Output is correct
46 Correct 2 ms 14680 KB Output is correct
47 Correct 2 ms 14936 KB Output is correct
48 Correct 2 ms 14680 KB Output is correct
49 Correct 2 ms 14684 KB Output is correct
50 Correct 2 ms 14680 KB Output is correct
51 Correct 2 ms 14680 KB Output is correct
52 Correct 2 ms 14680 KB Output is correct
53 Correct 2 ms 14680 KB Output is correct
54 Correct 2 ms 14684 KB Output is correct
55 Correct 2 ms 14680 KB Output is correct
56 Correct 2 ms 14680 KB Output is correct
57 Correct 2 ms 14684 KB Output is correct
58 Correct 2 ms 14680 KB Output is correct
59 Correct 2 ms 14680 KB Output is correct
60 Correct 2 ms 14680 KB Output is correct
61 Correct 2 ms 14680 KB Output is correct
62 Correct 2 ms 14680 KB Output is correct
63 Correct 2 ms 14680 KB Output is correct
64 Correct 2 ms 14680 KB Output is correct
65 Correct 2 ms 14680 KB Output is correct
66 Correct 2 ms 14880 KB Output is correct
67 Correct 2 ms 14680 KB Output is correct
68 Correct 2 ms 14684 KB Output is correct
69 Correct 2 ms 14680 KB Output is correct
70 Correct 2 ms 14680 KB Output is correct
71 Correct 2 ms 14680 KB Output is correct
72 Correct 2 ms 14680 KB Output is correct
73 Correct 2 ms 14936 KB Output is correct
74 Correct 2 ms 14680 KB Output is correct
75 Correct 2 ms 14680 KB Output is correct
76 Correct 2 ms 14680 KB Output is correct
77 Correct 2 ms 14684 KB Output is correct
78 Correct 2 ms 14680 KB Output is correct
79 Correct 2 ms 14680 KB Output is correct
80 Correct 2 ms 14680 KB Output is correct
81 Correct 2 ms 14684 KB Output is correct
82 Correct 2 ms 14684 KB Output is correct
83 Correct 2 ms 14684 KB Output is correct
84 Correct 3 ms 14680 KB Output is correct
85 Correct 3 ms 14680 KB Output is correct
86 Correct 3 ms 14684 KB Output is correct
87 Correct 3 ms 14680 KB Output is correct
88 Correct 3 ms 14840 KB Output is correct
89 Correct 5 ms 15192 KB Output is correct
90 Correct 4 ms 15192 KB Output is correct
91 Correct 3 ms 15192 KB Output is correct
92 Correct 3 ms 15192 KB Output is correct
93 Correct 3 ms 15192 KB Output is correct
94 Correct 3 ms 15192 KB Output is correct
95 Correct 4 ms 15196 KB Output is correct
96 Correct 3 ms 15192 KB Output is correct
97 Correct 4 ms 15196 KB Output is correct
98 Correct 4 ms 15196 KB Output is correct
99 Correct 4 ms 15196 KB Output is correct
100 Correct 4 ms 15192 KB Output is correct
101 Correct 3 ms 14680 KB Output is correct

Subtask #9
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 14680 KB Output is correct
2 Correct 2 ms 14680 KB Output is correct
3 Correct 2 ms 14684 KB Output is correct
4 Correct 2 ms 14680 KB Output is correct
5 Correct 2 ms 14680 KB Output is correct
6 Correct 2 ms 14680 KB Output is correct
7 Correct 2 ms 14680 KB Output is correct
8 Correct 2 ms 14680 KB Output is correct
9 Correct 2 ms 14684 KB Output is correct
10 Correct 2 ms 14680 KB Output is correct
11 Correct 2 ms 14936 KB Output is correct
12 Correct 2 ms 14780 KB Output is correct
13 Correct 2 ms 14680 KB Output is correct
14 Correct 2 ms 14684 KB Output is correct
15 Correct 2 ms 14936 KB Output is correct
16 Correct 2 ms 14684 KB Output is correct
17 Correct 2 ms 14680 KB Output is correct
18 Correct 2 ms 14680 KB Output is correct
19 Correct 2 ms 14680 KB Output is correct
20 Correct 2 ms 14680 KB Output is correct
21 Correct 2 ms 14680 KB Output is correct
22 Correct 2 ms 14684 KB Output is correct
23 Correct 2 ms 14680 KB Output is correct
24 Correct 2 ms 14680 KB Output is correct
25 Correct 3 ms 14680 KB Output is correct
26 Correct 3 ms 14680 KB Output is correct
27 Correct 4 ms 15192 KB Output is correct
28 Correct 3 ms 15192 KB Output is correct
29 Correct 3 ms 15196 KB Output is correct
30 Correct 3 ms 15196 KB Output is correct
31 Correct 3 ms 15192 KB Output is correct
32 Correct 3 ms 15192 KB Output is correct
33 Correct 3 ms 15192 KB Output is correct
34 Correct 2 ms 14680 KB Output is correct
35 Correct 2 ms 14684 KB Output is correct
36 Correct 2 ms 14680 KB Output is correct
37 Correct 2 ms 14680 KB Output is correct
38 Correct 2 ms 14680 KB Output is correct
39 Correct 2 ms 14680 KB Output is correct
40 Correct 2 ms 14684 KB Output is correct
41 Correct 2 ms 14680 KB Output is correct
42 Correct 2 ms 14680 KB Output is correct
43 Correct 2 ms 14936 KB Output is correct
44 Correct 2 ms 14680 KB Output is correct
45 Correct 2 ms 14680 KB Output is correct
46 Correct 2 ms 14680 KB Output is correct
47 Correct 2 ms 14936 KB Output is correct
48 Correct 2 ms 14680 KB Output is correct
49 Correct 2 ms 14684 KB Output is correct
50 Correct 2 ms 14680 KB Output is correct
51 Correct 2 ms 14680 KB Output is correct
52 Correct 2 ms 14680 KB Output is correct
53 Correct 2 ms 14680 KB Output is correct
54 Correct 2 ms 14684 KB Output is correct
55 Correct 2 ms 14680 KB Output is correct
56 Correct 2 ms 14680 KB Output is correct
57 Correct 2 ms 14684 KB Output is correct
58 Correct 2 ms 14680 KB Output is correct
59 Correct 2 ms 14680 KB Output is correct
60 Correct 2 ms 14680 KB Output is correct
61 Correct 2 ms 14680 KB Output is correct
62 Correct 2 ms 14680 KB Output is correct
63 Correct 2 ms 14680 KB Output is correct
64 Correct 2 ms 14680 KB Output is correct
65 Correct 2 ms 14680 KB Output is correct
66 Correct 2 ms 14880 KB Output is correct
67 Correct 2 ms 14680 KB Output is correct
68 Correct 2 ms 14684 KB Output is correct
69 Correct 2 ms 14680 KB Output is correct
70 Correct 2 ms 14680 KB Output is correct
71 Correct 2 ms 14680 KB Output is correct
72 Correct 2 ms 14680 KB Output is correct
73 Correct 2 ms 14936 KB Output is correct
74 Correct 2 ms 14680 KB Output is correct
75 Correct 2 ms 14680 KB Output is correct
76 Correct 2 ms 14680 KB Output is correct
77 Correct 2 ms 14684 KB Output is correct
78 Correct 2 ms 14680 KB Output is correct
79 Correct 2 ms 14680 KB Output is correct
80 Correct 2 ms 14680 KB Output is correct
81 Correct 2 ms 14684 KB Output is correct
82 Correct 2 ms 14684 KB Output is correct
83 Correct 2 ms 14684 KB Output is correct
84 Correct 3 ms 14680 KB Output is correct
85 Correct 3 ms 14680 KB Output is correct
86 Correct 3 ms 14684 KB Output is correct
87 Correct 3 ms 14680 KB Output is correct
88 Correct 3 ms 14840 KB Output is correct
89 Correct 5 ms 15192 KB Output is correct
90 Correct 4 ms 15192 KB Output is correct
91 Correct 3 ms 15192 KB Output is correct
92 Correct 3 ms 15192 KB Output is correct
93 Correct 3 ms 15192 KB Output is correct
94 Correct 3 ms 15192 KB Output is correct
95 Correct 4 ms 15196 KB Output is correct
96 Correct 3 ms 15192 KB Output is correct
97 Correct 4 ms 15196 KB Output is correct
98 Correct 4 ms 15196 KB Output is correct
99 Correct 4 ms 15196 KB Output is correct
100 Correct 4 ms 15192 KB Output is correct
101 Correct 3 ms 14680 KB Output is correct
102 Correct 106 ms 17248 KB Output is correct
103 Correct 110 ms 17232 KB Output is correct
104 Correct 157 ms 49032 KB Output is correct
105 Correct 122 ms 18768 KB Output is correct
106 Correct 111 ms 17988 KB Output is correct
107 Correct 104 ms 49084 KB Output is correct
108 Correct 106 ms 48824 KB Output is correct
109 Correct 69 ms 42684 KB Output is correct
110 Correct 173 ms 51160 KB Output is correct
111 Correct 125 ms 50108 KB Output is correct
112 Correct 127 ms 52012 KB Output is correct
113 Correct 117 ms 44472 KB Output is correct
114 Correct 111 ms 50632 KB Output is correct
115 Correct 99 ms 45500 KB Output is correct
116 Correct 134 ms 50112 KB Output is correct
117 Correct 147 ms 43200 KB Output is correct
118 Correct 137 ms 52664 KB Output is correct
119 Correct 136 ms 20936 KB Output is correct
120 Correct 92 ms 17472 KB Output is correct