oj.uz

답안 #72217

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
72217 2018-08-26T06:05:06 Z KLPP 철인 이종 경기 (APIO18_duathlon) C++14
47 / 100
 264 ms 35832 KB 
#include<iostream>
#include<stdio.h>
#include<vector>
#include<queue>
#include<algorithm>

using namespace std;
typedef long long int lld;
lld DP[1000000];
bool visited[1000000];
vector<int>nei[1000000];
lld ans;
bool visited2[1000000];
void DFS(int node,lld dist){//cout<<node+1<<" "<<dist<<endl;
	visited[node]=true;
	lld sum=0;
	//lld square=0;
	//lld totaldist=0;
	for(int i=0;i<nei[node].size();i++){
		int v=nei[node][i];
		if(!visited[v]){
			DFS(v,dist+1);
			sum+=DP[v];
			//square+=DP[v]*DP[v];
		}
	}
	DP[node]=sum+1;
	//ans+=sum*sum-square;
	//cout<<sum*sum-square<<" "<<node+1<<endl;
	//ans+=dist*(dist-1);
}
void DFS2(int node,lld componentsize){
	visited2[node]=true;
	lld sq=componentsize-DP[node];
	sq*=sq;
	for(int i=0;i<nei[node].size();i++){
		int v=nei[node][i];
		if(!visited2[v]){
			DFS2(v,componentsize);
			sq+=DP[v]*DP[v];
		}		
	}
	ans+=(componentsize-1)*(componentsize-1)-sq;
	//cout<<(componentsize-1)*(componentsize-1)-sq<<" "<<node+1<<endl;
}
int main(){
	int n,m;
	cin>>n>>m;
	int edges[m][2];
	
	for(int i=0;i<m;i++){
		int x,y;
		cin>>x>>y;
		x--;y--;
		edges[i][0]=x;
		edges[i][1]=y;
		nei[x].push_back(y);
		nei[y].push_back(x);
	}
	//for(int i=0;i<m;i++)cout<<edges[i][0]<<" "<<edges[i][1]<<endl;
	bool enter=true;
	for(int i=0;i<n;i++){
		if(nei[i].size()>2)enter=false;
	}
	if(enter){
	int component[n];
	
	for(int i=0;i<n;i++){
		component[i]=-1;
		
	}
	lld ans=0;
	int color=0;
	for(int i=0;i<n;i++){
		if(component[i]==-1){
			component[i]=color;
			
			queue<int>q;
			q.push(i);
			bool cycle=false;
			lld size=0;lld edges=0;
			while(!q.empty()){size++;
				int u=q.front();q.pop();
				//cout<<u<<" ";
				edges+=nei[u].size();
				for(int j=0;j<nei[u].size();j++){
					int v=nei[u][j];
					if(component[v]==-1){
						component[v]=color;
						q.push(v);
						
					}
				}
			}
			color++;//cout<<endl;
			/*for(int j=0;j<n;j++){
				if(component[j]==color-1)edges+=nei[j].size();
			}*/
			if(edges==2*size)cycle=true;
			//cout<<size<<" "<<cycle<<" "<<edges<<endl;
			
			if(cycle){
				ans+=(size*(size-1)*(size-2));
			}else{
				ans+=(size*(size-1)*(size-2))/3;
			}
		}
	}
	cout<<ans<<endl;
	return 0;
	}
	if(n>50){
	ans=0;
	for(int i=0;i<n;i++){
		DP[i]=-1;
		visited[i]=false;
		visited2[i]=false;
	}
	for(int i=0;i<n;i++){
		if(!visited[i]){
			DFS(i,0);
			DFS2(i,DP[i]);
		}
	}//for(int i=0;i<n;i++)cout<<DP[i]<<" "<<i+1<<endl;
	cout<<ans<<endl;
	return 0;
	}
	if(n<=50){
	int component[n][n];
	vector<int>graph[n];
	for(int node=0;node<n;node++){
		for(int j=0;j<m;j++){
			if(edges[j][0]!=node && edges[j][1]!=node){//cout<<edges[j][0]<<" "<<edges[j][1]<<" "<<j<<endl;
				graph[edges[j][0]].push_back(edges[j][1]);
				graph[edges[j][1]].push_back(edges[j][0]);
				//cout<<edges[j][0]<<" "<<edges[j][1]<<" "<<j<<endl;
			}
		}
		int color=0;
		for(int i=0;i<n;i++)component[node][i]=-1;
		for(int i=0;i<n;i++){
			if(component[node][i]==-1){
				component[node][i]=color;
				queue<int>q;
				q.push(i);
				while(!q.empty()){
					int u=q.front();q.pop();
					//cout<<u<<" ";
					for(int j=0;j<graph[u].size();j++){
						int v=graph[u][j];
						if(component[node][v]==-1){
							component[node][v]=color;
							q.push(v);
						}
					}
				}
				color++;//cout<<endl;
			}
		}
		for(int i=0;i<n;i++)graph[i].clear();
	}
	int cnt=0;
	for(int s=0;s<n;s++){
		for(int f=0;f<n;f++){
			for(int c=0;c<n;c++){
				if(s!=c && s!=f && f!=c){
					bool b=true;
					for(int i=0;i<n;i++){
						if(i!=c){
						if(component[i][c]!=component[i][s] && component[i][c]!=component[i][f]){
							b=false;
						}
						}
					}cnt+=b;
				}
			}
		}
	}
	cout<<cnt<<endl;
	
	return 0;	
	}
}

Compilation message

count_triplets.cpp: In function 'void DFS(int, lld)':
count_triplets.cpp:19:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<nei[node].size();i++){
              ~^~~~~~~~~~~~~~~~~
count_triplets.cpp: In function 'void DFS2(int, lld)':
count_triplets.cpp:36:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<nei[node].size();i++){
              ~^~~~~~~~~~~~~~~~~
count_triplets.cpp: In function 'int main()':
count_triplets.cpp:86:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int j=0;j<nei[u].size();j++){
                 ~^~~~~~~~~~~~~~
count_triplets.cpp:149:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
      for(int j=0;j<graph[u].size();j++){
                  ~^~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 23800 KB Output is correct
2 Correct 25 ms 23800 KB Output is correct
3 Correct 24 ms 23836 KB Output is correct
4 Correct 25 ms 23836 KB Output is correct
5 Correct 27 ms 23964 KB Output is correct
6 Correct 24 ms 23964 KB Output is correct
7 Correct 25 ms 23964 KB Output is correct
8 Correct 25 ms 23964 KB Output is correct
9 Correct 25 ms 23964 KB Output is correct
10 Correct 25 ms 23992 KB Output is correct
11 Correct 25 ms 23992 KB Output is correct
12 Correct 25 ms 24016 KB Output is correct
13 Correct 26 ms 24020 KB Output is correct
14 Correct 26 ms 24148 KB Output is correct
15 Correct 26 ms 24148 KB Output is correct
16 Correct 24 ms 24148 KB Output is correct
17 Correct 25 ms 24172 KB Output is correct
18 Correct 25 ms 24172 KB Output is correct
19 Correct 25 ms 24172 KB Output is correct
20 Correct 25 ms 24172 KB Output is correct
21 Correct 25 ms 24172 KB Output is correct
22 Correct 25 ms 24172 KB Output is correct
23 Correct 24 ms 24172 KB Output is correct
24 Correct 27 ms 24172 KB Output is correct
25 Correct 25 ms 24172 KB Output is correct
26 Correct 26 ms 24172 KB Output is correct
27 Correct 32 ms 24172 KB Output is correct
28 Correct 26 ms 24172 KB Output is correct
29 Correct 28 ms 24172 KB Output is correct
30 Correct 26 ms 24172 KB Output is correct
31 Correct 25 ms 24172 KB Output is correct
32 Correct 29 ms 24172 KB Output is correct
33 Correct 26 ms 24172 KB Output is correct
34 Correct 24 ms 24172 KB Output is correct
35 Correct 26 ms 24172 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 23800 KB Output is correct
2 Correct 25 ms 23800 KB Output is correct
3 Correct 24 ms 23836 KB Output is correct
4 Correct 25 ms 23836 KB Output is correct
5 Correct 27 ms 23964 KB Output is correct
6 Correct 24 ms 23964 KB Output is correct
7 Correct 25 ms 23964 KB Output is correct
8 Correct 25 ms 23964 KB Output is correct
9 Correct 25 ms 23964 KB Output is correct
10 Correct 25 ms 23992 KB Output is correct
11 Correct 25 ms 23992 KB Output is correct
12 Correct 25 ms 24016 KB Output is correct
13 Correct 26 ms 24020 KB Output is correct
14 Correct 26 ms 24148 KB Output is correct
15 Correct 26 ms 24148 KB Output is correct
16 Correct 24 ms 24148 KB Output is correct
17 Correct 25 ms 24172 KB Output is correct
18 Correct 25 ms 24172 KB Output is correct
19 Correct 25 ms 24172 KB Output is correct
20 Correct 25 ms 24172 KB Output is correct
21 Correct 25 ms 24172 KB Output is correct
22 Correct 25 ms 24172 KB Output is correct
23 Correct 24 ms 24172 KB Output is correct
24 Correct 27 ms 24172 KB Output is correct
25 Correct 25 ms 24172 KB Output is correct
26 Correct 26 ms 24172 KB Output is correct
27 Correct 32 ms 24172 KB Output is correct
28 Correct 26 ms 24172 KB Output is correct
29 Correct 28 ms 24172 KB Output is correct
30 Correct 26 ms 24172 KB Output is correct
31 Correct 25 ms 24172 KB Output is correct
32 Correct 29 ms 24172 KB Output is correct
33 Correct 26 ms 24172 KB Output is correct
34 Correct 24 ms 24172 KB Output is correct
35 Correct 26 ms 24172 KB Output is correct
36 Correct 26 ms 24172 KB Output is correct
37 Correct 45 ms 24172 KB Output is correct
38 Correct 39 ms 24172 KB Output is correct
39 Correct 38 ms 24172 KB Output is correct
40 Correct 38 ms 24172 KB Output is correct
41 Correct 43 ms 24172 KB Output is correct
42 Correct 42 ms 24172 KB Output is correct
43 Correct 38 ms 24172 KB Output is correct
44 Correct 38 ms 24172 KB Output is correct
45 Correct 44 ms 24172 KB Output is correct
46 Correct 44 ms 24172 KB Output is correct
47 Correct 25 ms 24172 KB Output is correct
48 Correct 29 ms 24172 KB Output is correct
49 Correct 26 ms 24172 KB Output is correct
50 Correct 28 ms 24172 KB Output is correct
51 Correct 40 ms 24172 KB Output is correct
52 Correct 42 ms 24172 KB Output is correct
53 Correct 40 ms 24172 KB Output is correct
54 Correct 41 ms 24188 KB Output is correct
55 Correct 39 ms 24188 KB Output is correct
56 Correct 40 ms 24188 KB Output is correct
57 Correct 36 ms 24188 KB Output is correct
58 Correct 43 ms 24188 KB Output is correct
59 Correct 42 ms 24188 KB Output is correct
60 Correct 49 ms 24188 KB Output is correct
61 Correct 43 ms 24188 KB Output is correct
62 Correct 46 ms 24188 KB Output is correct
63 Correct 37 ms 24188 KB Output is correct
64 Correct 43 ms 24188 KB Output is correct
65 Correct 40 ms 24188 KB Output is correct

Subtask #3
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 228 ms 28464 KB Output is correct
2 Correct 197 ms 28464 KB Output is correct
3 Correct 211 ms 28464 KB Output is correct
4 Correct 202 ms 28464 KB Output is correct
5 Correct 189 ms 28464 KB Output is correct
6 Correct 216 ms 28464 KB Output is correct
7 Correct 222 ms 28484 KB Output is correct
8 Correct 222 ms 28484 KB Output is correct
9 Correct 233 ms 28556 KB Output is correct
10 Correct 235 ms 28556 KB Output is correct
11 Correct 196 ms 28556 KB Output is correct
12 Correct 236 ms 29136 KB Output is correct
13 Correct 199 ms 30200 KB Output is correct
14 Correct 186 ms 31192 KB Output is correct
15 Correct 153 ms 31352 KB Output is correct
16 Correct 147 ms 31932 KB Output is correct
17 Correct 42 ms 31932 KB Output is correct
18 Correct 46 ms 31932 KB Output is correct
19 Correct 43 ms 31932 KB Output is correct
20 Correct 48 ms 31932 KB Output is correct
21 Correct 42 ms 31932 KB Output is correct
22 Correct 39 ms 31932 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 31932 KB Output is correct
2 Correct 26 ms 31932 KB Output is correct
3 Correct 26 ms 31932 KB Output is correct
4 Correct 26 ms 31932 KB Output is correct
5 Correct 29 ms 31932 KB Output is correct
6 Correct 28 ms 31932 KB Output is correct
7 Correct 28 ms 31932 KB Output is correct
8 Correct 27 ms 31932 KB Output is correct
9 Correct 28 ms 31932 KB Output is correct
10 Correct 28 ms 31932 KB Output is correct
11 Correct 29 ms 31932 KB Output is correct
12 Correct 28 ms 31932 KB Output is correct
13 Correct 27 ms 31932 KB Output is correct
14 Correct 27 ms 31932 KB Output is correct
15 Correct 28 ms 31932 KB Output is correct
16 Correct 26 ms 31932 KB Output is correct
17 Correct 27 ms 31932 KB Output is correct
18 Correct 28 ms 31932 KB Output is correct
19 Correct 27 ms 31932 KB Output is correct
20 Correct 24 ms 31932 KB Output is correct

Subtask #5
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 207 ms 33552 KB Output is correct
2 Correct 238 ms 33696 KB Output is correct
3 Correct 209 ms 33696 KB Output is correct
4 Correct 209 ms 33696 KB Output is correct
5 Correct 242 ms 33740 KB Output is correct
6 Correct 198 ms 33740 KB Output is correct
7 Correct 229 ms 35832 KB Output is correct
8 Correct 229 ms 35832 KB Output is correct
9 Correct 219 ms 35832 KB Output is correct
10 Correct 209 ms 35832 KB Output is correct
11 Correct 200 ms 35832 KB Output is correct
12 Correct 215 ms 35832 KB Output is correct
13 Correct 207 ms 35832 KB Output is correct
14 Correct 172 ms 35832 KB Output is correct
15 Correct 164 ms 35832 KB Output is correct
16 Correct 122 ms 35832 KB Output is correct
17 Correct 166 ms 35832 KB Output is correct
18 Correct 183 ms 35832 KB Output is correct
19 Correct 166 ms 35832 KB Output is correct
20 Correct 156 ms 35832 KB Output is correct

Subtask #6
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 35832 KB Output is correct
2 Correct 27 ms 35832 KB Output is correct
3 Incorrect 27 ms 35832 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 225 ms 35832 KB Output is correct
2 Correct 224 ms 35832 KB Output is correct
3 Incorrect 264 ms 35832 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #8
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 23800 KB Output is correct
2 Correct 25 ms 23800 KB Output is correct
3 Correct 24 ms 23836 KB Output is correct
4 Correct 25 ms 23836 KB Output is correct
5 Correct 27 ms 23964 KB Output is correct
6 Correct 24 ms 23964 KB Output is correct
7 Correct 25 ms 23964 KB Output is correct
8 Correct 25 ms 23964 KB Output is correct
9 Correct 25 ms 23964 KB Output is correct
10 Correct 25 ms 23992 KB Output is correct
11 Correct 25 ms 23992 KB Output is correct
12 Correct 25 ms 24016 KB Output is correct
13 Correct 26 ms 24020 KB Output is correct
14 Correct 26 ms 24148 KB Output is correct
15 Correct 26 ms 24148 KB Output is correct
16 Correct 24 ms 24148 KB Output is correct
17 Correct 25 ms 24172 KB Output is correct
18 Correct 25 ms 24172 KB Output is correct
19 Correct 25 ms 24172 KB Output is correct
20 Correct 25 ms 24172 KB Output is correct
21 Correct 25 ms 24172 KB Output is correct
22 Correct 25 ms 24172 KB Output is correct
23 Correct 24 ms 24172 KB Output is correct
24 Correct 27 ms 24172 KB Output is correct
25 Correct 25 ms 24172 KB Output is correct
26 Correct 26 ms 24172 KB Output is correct
27 Correct 32 ms 24172 KB Output is correct
28 Correct 26 ms 24172 KB Output is correct
29 Correct 28 ms 24172 KB Output is correct
30 Correct 26 ms 24172 KB Output is correct
31 Correct 25 ms 24172 KB Output is correct
32 Correct 29 ms 24172 KB Output is correct
33 Correct 26 ms 24172 KB Output is correct
34 Correct 24 ms 24172 KB Output is correct
35 Correct 26 ms 24172 KB Output is correct
36 Correct 26 ms 24172 KB Output is correct
37 Correct 45 ms 24172 KB Output is correct
38 Correct 39 ms 24172 KB Output is correct
39 Correct 38 ms 24172 KB Output is correct
40 Correct 38 ms 24172 KB Output is correct
41 Correct 43 ms 24172 KB Output is correct
42 Correct 42 ms 24172 KB Output is correct
43 Correct 38 ms 24172 KB Output is correct
44 Correct 38 ms 24172 KB Output is correct
45 Correct 44 ms 24172 KB Output is correct
46 Correct 44 ms 24172 KB Output is correct
47 Correct 25 ms 24172 KB Output is correct
48 Correct 29 ms 24172 KB Output is correct
49 Correct 26 ms 24172 KB Output is correct
50 Correct 28 ms 24172 KB Output is correct
51 Correct 40 ms 24172 KB Output is correct
52 Correct 42 ms 24172 KB Output is correct
53 Correct 40 ms 24172 KB Output is correct
54 Correct 41 ms 24188 KB Output is correct
55 Correct 39 ms 24188 KB Output is correct
56 Correct 40 ms 24188 KB Output is correct
57 Correct 36 ms 24188 KB Output is correct
58 Correct 43 ms 24188 KB Output is correct
59 Correct 42 ms 24188 KB Output is correct
60 Correct 49 ms 24188 KB Output is correct
61 Correct 43 ms 24188 KB Output is correct
62 Correct 46 ms 24188 KB Output is correct
63 Correct 37 ms 24188 KB Output is correct
64 Correct 43 ms 24188 KB Output is correct
65 Correct 40 ms 24188 KB Output is correct
66 Correct 26 ms 35832 KB Output is correct
67 Correct 25 ms 35832 KB Output is correct
68 Incorrect 26 ms 35832 KB Output isn't correct
69 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 23800 KB Output is correct
2 Correct 25 ms 23800 KB Output is correct
3 Correct 24 ms 23836 KB Output is correct
4 Correct 25 ms 23836 KB Output is correct
5 Correct 27 ms 23964 KB Output is correct
6 Correct 24 ms 23964 KB Output is correct
7 Correct 25 ms 23964 KB Output is correct
8 Correct 25 ms 23964 KB Output is correct
9 Correct 25 ms 23964 KB Output is correct
10 Correct 25 ms 23992 KB Output is correct
11 Correct 25 ms 23992 KB Output is correct
12 Correct 25 ms 24016 KB Output is correct
13 Correct 26 ms 24020 KB Output is correct
14 Correct 26 ms 24148 KB Output is correct
15 Correct 26 ms 24148 KB Output is correct
16 Correct 24 ms 24148 KB Output is correct
17 Correct 25 ms 24172 KB Output is correct
18 Correct 25 ms 24172 KB Output is correct
19 Correct 25 ms 24172 KB Output is correct
20 Correct 25 ms 24172 KB Output is correct
21 Correct 25 ms 24172 KB Output is correct
22 Correct 25 ms 24172 KB Output is correct
23 Correct 24 ms 24172 KB Output is correct
24 Correct 27 ms 24172 KB Output is correct
25 Correct 25 ms 24172 KB Output is correct
26 Correct 26 ms 24172 KB Output is correct
27 Correct 32 ms 24172 KB Output is correct
28 Correct 26 ms 24172 KB Output is correct
29 Correct 28 ms 24172 KB Output is correct
30 Correct 26 ms 24172 KB Output is correct
31 Correct 25 ms 24172 KB Output is correct
32 Correct 29 ms 24172 KB Output is correct
33 Correct 26 ms 24172 KB Output is correct
34 Correct 24 ms 24172 KB Output is correct
35 Correct 26 ms 24172 KB Output is correct
36 Correct 26 ms 24172 KB Output is correct
37 Correct 45 ms 24172 KB Output is correct
38 Correct 39 ms 24172 KB Output is correct
39 Correct 38 ms 24172 KB Output is correct
40 Correct 38 ms 24172 KB Output is correct
41 Correct 43 ms 24172 KB Output is correct
42 Correct 42 ms 24172 KB Output is correct
43 Correct 38 ms 24172 KB Output is correct
44 Correct 38 ms 24172 KB Output is correct
45 Correct 44 ms 24172 KB Output is correct
46 Correct 44 ms 24172 KB Output is correct
47 Correct 25 ms 24172 KB Output is correct
48 Correct 29 ms 24172 KB Output is correct
49 Correct 26 ms 24172 KB Output is correct
50 Correct 28 ms 24172 KB Output is correct
51 Correct 40 ms 24172 KB Output is correct
52 Correct 42 ms 24172 KB Output is correct
53 Correct 40 ms 24172 KB Output is correct
54 Correct 41 ms 24188 KB Output is correct
55 Correct 39 ms 24188 KB Output is correct
56 Correct 40 ms 24188 KB Output is correct
57 Correct 36 ms 24188 KB Output is correct
58 Correct 43 ms 24188 KB Output is correct
59 Correct 42 ms 24188 KB Output is correct
60 Correct 49 ms 24188 KB Output is correct
61 Correct 43 ms 24188 KB Output is correct
62 Correct 46 ms 24188 KB Output is correct
63 Correct 37 ms 24188 KB Output is correct
64 Correct 43 ms 24188 KB Output is correct
65 Correct 40 ms 24188 KB Output is correct
66 Correct 228 ms 28464 KB Output is correct
67 Correct 197 ms 28464 KB Output is correct
68 Correct 211 ms 28464 KB Output is correct
69 Correct 202 ms 28464 KB Output is correct
70 Correct 189 ms 28464 KB Output is correct
71 Correct 216 ms 28464 KB Output is correct
72 Correct 222 ms 28484 KB Output is correct
73 Correct 222 ms 28484 KB Output is correct
74 Correct 233 ms 28556 KB Output is correct
75 Correct 235 ms 28556 KB Output is correct
76 Correct 196 ms 28556 KB Output is correct
77 Correct 236 ms 29136 KB Output is correct
78 Correct 199 ms 30200 KB Output is correct
79 Correct 186 ms 31192 KB Output is correct
80 Correct 153 ms 31352 KB Output is correct
81 Correct 147 ms 31932 KB Output is correct
82 Correct 42 ms 31932 KB Output is correct
83 Correct 46 ms 31932 KB Output is correct
84 Correct 43 ms 31932 KB Output is correct
85 Correct 48 ms 31932 KB Output is correct
86 Correct 42 ms 31932 KB Output is correct
87 Correct 39 ms 31932 KB Output is correct
88 Correct 27 ms 31932 KB Output is correct
89 Correct 26 ms 31932 KB Output is correct
90 Correct 26 ms 31932 KB Output is correct
91 Correct 26 ms 31932 KB Output is correct
92 Correct 29 ms 31932 KB Output is correct
93 Correct 28 ms 31932 KB Output is correct
94 Correct 28 ms 31932 KB Output is correct
95 Correct 27 ms 31932 KB Output is correct
96 Correct 28 ms 31932 KB Output is correct
97 Correct 28 ms 31932 KB Output is correct
98 Correct 29 ms 31932 KB Output is correct
99 Correct 28 ms 31932 KB Output is correct
100 Correct 27 ms 31932 KB Output is correct
101 Correct 27 ms 31932 KB Output is correct
102 Correct 28 ms 31932 KB Output is correct
103 Correct 26 ms 31932 KB Output is correct
104 Correct 27 ms 31932 KB Output is correct
105 Correct 28 ms 31932 KB Output is correct
106 Correct 27 ms 31932 KB Output is correct
107 Correct 24 ms 31932 KB Output is correct
108 Correct 207 ms 33552 KB Output is correct
109 Correct 238 ms 33696 KB Output is correct
110 Correct 209 ms 33696 KB Output is correct
111 Correct 209 ms 33696 KB Output is correct
112 Correct 242 ms 33740 KB Output is correct
113 Correct 198 ms 33740 KB Output is correct
114 Correct 229 ms 35832 KB Output is correct
115 Correct 229 ms 35832 KB Output is correct
116 Correct 219 ms 35832 KB Output is correct
117 Correct 209 ms 35832 KB Output is correct
118 Correct 200 ms 35832 KB Output is correct
119 Correct 215 ms 35832 KB Output is correct
120 Correct 207 ms 35832 KB Output is correct
121 Correct 172 ms 35832 KB Output is correct
122 Correct 164 ms 35832 KB Output is correct
123 Correct 122 ms 35832 KB Output is correct
124 Correct 166 ms 35832 KB Output is correct
125 Correct 183 ms 35832 KB Output is correct
126 Correct 166 ms 35832 KB Output is correct
127 Correct 156 ms 35832 KB Output is correct
128 Correct 27 ms 35832 KB Output is correct
129 Correct 27 ms 35832 KB Output is correct
130 Incorrect 27 ms 35832 KB Output isn't correct
131 Halted 0 ms 0 KB -