답안 #69063 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
69063	2018-08-19T17:02:46 Z	IvanC	항공 노선도 (JOI18_airline)	C++17	100 / 100	722 ms	31120 KB

Alice
Bob

#include "Alicelib.h"
#include <bits/stdc++.h>
using namespace std;

const int MAXN = 1020;

static vector<int> grafo[MAXN];

void Alice( int N, int M, int A[], int B[] ){
	
	if(N == 1){
		InitG(1,0);
		return;
	}

	if(N == 2){
		if(M == 0){
			InitG(2,0);
		}
		else{
			InitG(2,1);
			MakeG(0,0,1);
		}
		return;
	}	

	// Padrao
	for(int i = 0;i<M;i++){
		int x = A[i];
		int y = B[i];
		x++;y++; // 1-indexado, se nao falha
		grafo[x].push_back(y);
		grafo[y].push_back(x);
	}

	int qtd_n = N + 12;
	int qtd_m = 0;

	// Bits
	for(int i = 0;i<10;i++){
		int pot = (1 << i);
		int idx = N + i + 1;
		for(int j = 1;j<=N;j++){
			if(pot & j){
				grafo[j].push_back(idx);
				grafo[idx].push_back(j);
			}
		}
	}

	// Ligacao bits
	for(int i = 0;i+1<10;i++){
		int idx1 = N + i + 1;
		int idx2 = N + i + 2;
		grafo[idx1].push_back(idx2);
		grafo[idx2].push_back(idx1);
	}

	//folha
	grafo[N+11].push_back(N+12);
	grafo[N+12].push_back(N+11);

	// grau alto
	for(int i = 1;i<=N;i++){
		grafo[i].push_back(N+12);
		grafo[N+12].push_back(i);
	}

	for(int i = 1;i<=N+12;i++) qtd_m += grafo[i].size();
	qtd_m /=2;

	InitG(qtd_n,qtd_m);
	int ptr = 0;
	for(int i = 1;i<=N+12;i++){
		for(int j : grafo[i]){
			if(i >= j) continue;
			//printf("Ptr %d Alice I %d J %d\n",ptr,i,j);
			MakeG(ptr,i-1,j-1);
			ptr++;
		}
	}

}

#include "Boblib.h"
#include <bits/stdc++.h>
using namespace std;

const int MAXN = 1020;

static vector<int> grafo[MAXN];
static int ehValido[MAXN],somatorio[MAXN];

void Bob( int V, int U, int C[], int D[] ){

	//printf("##############################\n");
	memset(ehValido,0,sizeof(ehValido));
	memset(somatorio,0,sizeof(somatorio));

	// caso especial
	if(V == 1){
		InitMap(1,0);
		return;
	}

	if(V == 2){
		if(U == 0){
			InitMap(2,0);
		}
		else{
			InitMap(2,1);
			MakeMap(0,1);
		}
		return;
	}
	
	int N = V - 12,M = 0,especial = 0,bit_davez = 0;

	// recuperando o grafo
	for(int i = 0;i<U;i++){
		int x = C[i];
		int y = D[i];
		x++;y++;
		grafo[x].push_back(y);
		grafo[y].push_back(x);
		//printf("G %d %d\n",x,y);
	}

	vector<int> candidatos;

	for(int i = 1;i<=N+12;i++){
		if(grafo[i].size() == 1) candidatos.push_back(i);
	}

	if(candidatos.size() == 1){
		int folha = candidatos[0];
		especial = grafo[folha][0];
		for(int i : grafo[especial]){
			ehValido[i] = 1;
		}
		int menor_grau = 1024;
		for(int i = 1;i<=N+12;i++){
			if(ehValido[i]) continue;
			if(grafo[i].size() <= menor_grau){
				menor_grau = grafo[i].size();
				bit_davez = i;
			}
		}
	}
	else if(candidatos.size() == 2){
		int primeiro_cand = candidatos[0];
		int outro_cara = grafo[primeiro_cand][0];
		if(grafo[outro_cara].size() == N + 1){
			especial = outro_cara;
			bit_davez = candidatos[1];
		}
		else{
			bit_davez = primeiro_cand;
			especial = grafo[candidatos[1]][0];
		}
		for(int i : grafo[especial]){
			ehValido[i] = 1;
		}
	}

	ehValido[candidatos[0]] = 0;
	if(candidatos.size() == 2) ehValido[candidatos[1]] = 0;
 
 	for(int vez = 9;vez>=0;vez--){
 		
 		int nxt = 0,pot = (1 << vez);
 		//printf("Meu %d\n",bit_davez);

 		for(int i : grafo[bit_davez]){
 			if(grafo[i].size() <= 1){
 				continue;
 			}
 			if(!ehValido[i]){
 				nxt = i;
 			}
 			else{
 				//printf("Add %d AH %d\n",pot,i);
 				somatorio[i] += pot;
 			}
 		}

 		grafo[bit_davez].clear();

 		bit_davez = nxt;

 	}

 	for(int i = 1;i<=N+12;i++){
 		for(int j : grafo[i]){
 			if(!ehValido[i] || !ehValido[j]) continue;
 			if(i <= j){
 				M++;
 			}
 		}
 	}

 	InitMap(N,M);

 	for(int i = 1;i<=N+12;i++){
 		for(int j : grafo[i]){
 			if(!ehValido[i] || !ehValido[j]) continue;
 			if(i <= j){
 				//printf("Bob I %d J %d (%d %d)\n",i,j,somatorio[i]-1,somatorio[j]-1);
 				MakeMap(somatorio[i] - 1,somatorio[j] - 1);
 			}
 		}
 	}

}

Compilation message

Bob.cpp: In function 'void Bob(int, int, int*, int*)':
Bob.cpp:60:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    if(grafo[i].size() <= menor_grau){
       ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
Bob.cpp:69:31: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if(grafo[outro_cara].size() == N + 1){
      ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~

Subtask #1
22.0 / 22.0

#	결과	실행 시간	메모리	Grader output
1	Correct	8 ms	6648 KB	Output is correct
2	Correct	8 ms	6736 KB	Output is correct
3	Correct	8 ms	6640 KB	Output is correct
4	Correct	7 ms	6648 KB	Output is correct
5	Correct	7 ms	6736 KB	Output is correct
6	Correct	8 ms	6640 KB	Output is correct
7	Correct	7 ms	6896 KB	Output is correct
8	Correct	7 ms	6896 KB	Output is correct
9	Correct	7 ms	6832 KB	Output is correct
10	Correct	6 ms	6640 KB	Output is correct
11	Correct	7 ms	6896 KB	Output is correct
12	Correct	7 ms	6824 KB	Output is correct
13	Correct	7 ms	6896 KB	Output is correct
14	Correct	6 ms	6856 KB	Output is correct
15	Correct	8 ms	6648 KB	Output is correct
16	Correct	8 ms	6640 KB	Output is correct
17	Correct	8 ms	6728 KB	Output is correct
18	Correct	7 ms	6640 KB	Output is correct
19	Correct	7 ms	6640 KB	Output is correct
20	Correct	8 ms	6896 KB	Output is correct
21	Correct	8 ms	6816 KB	Output is correct
22	Correct	7 ms	6800 KB	Output is correct
23	Correct	7 ms	6736 KB	Output is correct
24	Correct	7 ms	6640 KB	Output is correct
25	Correct	7 ms	6984 KB	Output is correct
26	Correct	7 ms	6896 KB	Output is correct
27	Correct	8 ms	6760 KB	Output is correct
28	Correct	8 ms	6640 KB	Output is correct
29	Correct	7 ms	6640 KB	Output is correct
30	Correct	8 ms	6640 KB	Output is correct
31	Correct	8 ms	6640 KB	Output is correct
32	Correct	8 ms	6896 KB	Output is correct
33	Correct	7 ms	6800 KB	Output is correct
34	Correct	6 ms	6896 KB	Output is correct
35	Correct	6 ms	6848 KB	Output is correct
36	Correct	8 ms	6640 KB	Output is correct
37	Correct	8 ms	6640 KB	Output is correct
38	Correct	7 ms	6720 KB	Output is correct
39	Correct	6 ms	6640 KB	Output is correct
40	Correct	6 ms	6640 KB	Output is correct
41	Correct	7 ms	6896 KB	Output is correct
42	Correct	6 ms	6896 KB	Output is correct
43	Correct	7 ms	6896 KB	Output is correct
44	Correct	6 ms	6640 KB	Output is correct
45	Correct	8 ms	6952 KB	Output is correct
46	Correct	7 ms	6736 KB	Output is correct
47	Correct	6 ms	6896 KB	Output is correct
48	Correct	8 ms	6640 KB	Output is correct
49	Correct	7 ms	6728 KB	Output is correct
50	Correct	8 ms	6640 KB	Output is correct
51	Correct	7 ms	6640 KB	Output is correct
52	Correct	8 ms	6896 KB	Output is correct
53	Correct	8 ms	6640 KB	Output is correct
54	Correct	6 ms	6640 KB	Output is correct
55	Correct	7 ms	6904 KB	Output is correct
56	Correct	6 ms	6640 KB	Output is correct
57	Correct	12 ms	6640 KB	Output is correct
58	Correct	7 ms	6736 KB	Output is correct

Subtask #2
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	8 ms	6648 KB	Output is correct
2	Correct	8 ms	6736 KB	Output is correct
3	Correct	8 ms	6640 KB	Output is correct
4	Correct	7 ms	6648 KB	Output is correct
5	Correct	7 ms	6736 KB	Output is correct
6	Correct	8 ms	6640 KB	Output is correct
7	Correct	7 ms	6896 KB	Output is correct
8	Correct	7 ms	6896 KB	Output is correct
9	Correct	7 ms	6832 KB	Output is correct
10	Correct	6 ms	6640 KB	Output is correct
11	Correct	7 ms	6896 KB	Output is correct
12	Correct	7 ms	6824 KB	Output is correct
13	Correct	7 ms	6896 KB	Output is correct
14	Correct	6 ms	6856 KB	Output is correct
15	Correct	8 ms	6648 KB	Output is correct
16	Correct	8 ms	6640 KB	Output is correct
17	Correct	8 ms	6728 KB	Output is correct
18	Correct	7 ms	6640 KB	Output is correct
19	Correct	7 ms	6640 KB	Output is correct
20	Correct	8 ms	6896 KB	Output is correct
21	Correct	8 ms	6816 KB	Output is correct
22	Correct	7 ms	6800 KB	Output is correct
23	Correct	7 ms	6736 KB	Output is correct
24	Correct	7 ms	6640 KB	Output is correct
25	Correct	7 ms	6984 KB	Output is correct
26	Correct	7 ms	6896 KB	Output is correct
27	Correct	8 ms	6760 KB	Output is correct
28	Correct	8 ms	6640 KB	Output is correct
29	Correct	7 ms	6640 KB	Output is correct
30	Correct	8 ms	6640 KB	Output is correct
31	Correct	8 ms	6640 KB	Output is correct
32	Correct	8 ms	6896 KB	Output is correct
33	Correct	7 ms	6800 KB	Output is correct
34	Correct	6 ms	6896 KB	Output is correct
35	Correct	6 ms	6848 KB	Output is correct
36	Correct	8 ms	6640 KB	Output is correct
37	Correct	8 ms	6640 KB	Output is correct
38	Correct	7 ms	6720 KB	Output is correct
39	Correct	6 ms	6640 KB	Output is correct
40	Correct	6 ms	6640 KB	Output is correct
41	Correct	7 ms	6896 KB	Output is correct
42	Correct	6 ms	6896 KB	Output is correct
43	Correct	7 ms	6896 KB	Output is correct
44	Correct	6 ms	6640 KB	Output is correct
45	Correct	8 ms	6952 KB	Output is correct
46	Correct	7 ms	6736 KB	Output is correct
47	Correct	6 ms	6896 KB	Output is correct
48	Correct	8 ms	6640 KB	Output is correct
49	Correct	7 ms	6728 KB	Output is correct
50	Correct	8 ms	6640 KB	Output is correct
51	Correct	7 ms	6640 KB	Output is correct
52	Correct	8 ms	6896 KB	Output is correct
53	Correct	8 ms	6640 KB	Output is correct
54	Correct	6 ms	6640 KB	Output is correct
55	Correct	7 ms	6904 KB	Output is correct
56	Correct	6 ms	6640 KB	Output is correct
57	Correct	12 ms	6640 KB	Output is correct
58	Correct	7 ms	6736 KB	Output is correct
59	Correct	7 ms	6896 KB	Output is correct
60	Correct	8 ms	6904 KB	Output is correct
61	Correct	8 ms	6896 KB	Output is correct
62	Correct	8 ms	6640 KB	Output is correct
63	Correct	8 ms	6928 KB	Output is correct
64	Correct	8 ms	6640 KB	Output is correct
65	Correct	8 ms	6896 KB	Output is correct
66	Correct	8 ms	6904 KB	Output is correct
67	Correct	8 ms	6896 KB	Output is correct
68	Correct	8 ms	6640 KB	Output is correct
69	Correct	8 ms	6896 KB	Output is correct
70	Correct	9 ms	6640 KB	Output is correct
71	Correct	8 ms	6896 KB	Output is correct
72	Correct	8 ms	6896 KB	Output is correct
73	Correct	8 ms	6904 KB	Output is correct
74	Correct	7 ms	6896 KB	Output is correct
75	Correct	7 ms	6640 KB	Output is correct
76	Correct	8 ms	6640 KB	Output is correct
77	Correct	7 ms	6896 KB	Output is correct
78	Correct	7 ms	6896 KB	Output is correct
79	Correct	8 ms	6896 KB	Output is correct
80	Correct	8 ms	6824 KB	Output is correct
81	Correct	7 ms	6672 KB	Output is correct
82	Correct	7 ms	6896 KB	Output is correct
83	Correct	19 ms	6896 KB	Output is correct
84	Correct	7 ms	6648 KB	Output is correct
85	Correct	7 ms	6896 KB	Output is correct
86	Correct	8 ms	6896 KB	Output is correct
87	Correct	8 ms	6640 KB	Output is correct
88	Correct	7 ms	6736 KB	Output is correct
89	Correct	7 ms	6640 KB	Output is correct
90	Correct	6 ms	6728 KB	Output is correct
91	Correct	7 ms	6640 KB	Output is correct
92	Correct	7 ms	6640 KB	Output is correct
93	Correct	6 ms	6640 KB	Output is correct
94	Correct	8 ms	6896 KB	Output is correct
95	Correct	8 ms	6896 KB	Output is correct
96	Correct	8 ms	6896 KB	Output is correct
97	Correct	8 ms	6736 KB	Output is correct
98	Correct	8 ms	6904 KB	Output is correct
99	Correct	7 ms	6896 KB	Output is correct
100	Correct	7 ms	6896 KB	Output is correct
101	Correct	6 ms	6640 KB	Output is correct
102	Correct	6 ms	6896 KB	Output is correct
103	Correct	7 ms	6736 KB	Output is correct
104	Correct	7 ms	6896 KB	Output is correct
105	Correct	7 ms	6736 KB	Output is correct
106	Correct	8 ms	6896 KB	Output is correct
107	Correct	8 ms	6640 KB	Output is correct
108	Correct	8 ms	6896 KB	Output is correct
109	Correct	8 ms	6728 KB	Output is correct
110	Correct	7 ms	6640 KB	Output is correct
111	Correct	8 ms	6640 KB	Output is correct
112	Correct	7 ms	6640 KB	Output is correct
113	Correct	7 ms	6640 KB	Output is correct
114	Correct	8 ms	6640 KB	Output is correct
115	Correct	8 ms	6736 KB	Output is correct
116	Correct	8 ms	6640 KB	Output is correct
117	Correct	8 ms	6640 KB	Output is correct
118	Correct	8 ms	6640 KB	Output is correct

Subtask #3
63.0 / 63.0

#	결과	실행 시간	메모리	Grader output
1	Correct	722 ms	30832 KB	Output is correct : V - N = 12
2	Correct	540 ms	27880 KB	Output is correct : V - N = 12
3	Correct	214 ms	16240 KB	Output is correct : V - N = 12
4	Correct	14 ms	7248 KB	Output is correct : V - N = 12
5	Correct	125 ms	12152 KB	Output is correct : V - N = 12
6	Correct	481 ms	25936 KB	Output is correct : V - N = 12
7	Correct	686 ms	31000 KB	Output is correct : V - N = 12
8	Correct	648 ms	29536 KB	Output is correct : V - N = 12
9	Correct	301 ms	18352 KB	Output is correct : V - N = 12
10	Correct	43 ms	8480 KB	Output is correct : V - N = 12
11	Correct	58 ms	9496 KB	Output is correct : V - N = 12
12	Correct	382 ms	21440 KB	Output is correct : V - N = 12
13	Correct	611 ms	30120 KB	Output is correct : V - N = 12
14	Correct	669 ms	30600 KB	Output is correct : V - N = 12
15	Correct	395 ms	24752 KB	Output is correct : V - N = 12
16	Correct	91 ms	10768 KB	Output is correct : V - N = 12
17	Correct	19 ms	7664 KB	Output is correct : V - N = 12
18	Correct	263 ms	17280 KB	Output is correct : V - N = 12
19	Correct	564 ms	28992 KB	Output is correct : V - N = 12
20	Correct	672 ms	31120 KB	Output is correct : V - N = 12
21	Correct	206 ms	15440 KB	Output is correct : V - N = 12
22	Correct	147 ms	12480 KB	Output is correct : V - N = 12
23	Correct	54 ms	9448 KB	Output is correct : V - N = 12
24	Correct	9 ms	7072 KB	Output is correct : V - N = 12
25	Correct	41 ms	8272 KB	Output is correct : V - N = 12
26	Correct	122 ms	11960 KB	Output is correct : V - N = 12
27	Correct	170 ms	13296 KB	Output is correct : V - N = 12
28	Correct	183 ms	12904 KB	Output is correct : V - N = 12
29	Correct	104 ms	9944 KB	Output is correct : V - N = 12
30	Correct	13 ms	7472 KB	Output is correct : V - N = 12
31	Correct	12 ms	6992 KB	Output is correct : V - N = 12
32	Correct	12 ms	6992 KB	Output is correct : V - N = 12
33	Correct	12 ms	7120 KB	Output is correct : V - N = 12
34	Correct	12 ms	7152 KB	Output is correct : V - N = 12
35	Correct	12 ms	7152 KB	Output is correct : V - N = 12
36	Correct	681 ms	30832 KB	Output is correct : V - N = 12
37	Correct	683 ms	31080 KB	Output is correct : V - N = 12
38	Correct	705 ms	30912 KB	Output is correct : V - N = 12
39	Correct	682 ms	30984 KB	Output is correct : V - N = 12
40	Correct	645 ms	30840 KB	Output is correct : V - N = 12
41	Correct	103 ms	11824 KB	Output is correct : V - N = 12
42	Correct	103 ms	11080 KB	Output is correct : V - N = 12
43	Correct	102 ms	11712 KB	Output is correct : V - N = 12
44	Correct	13 ms	7184 KB	Output is correct : V - N = 12
45	Correct	68 ms	9648 KB	Output is correct : V - N = 12
46	Correct	218 ms	16696 KB	Output is correct : V - N = 12
47	Correct	164 ms	11824 KB	Output is correct : V - N = 12
48	Correct	302 ms	18368 KB	Output is correct : V - N = 12
49	Correct	66 ms	9384 KB	Output is correct : V - N = 12
50	Correct	26 ms	7808 KB	Output is correct : V - N = 12
51	Correct	503 ms	28008 KB	Output is correct : V - N = 12
52	Correct	13 ms	7152 KB	Output is correct : V - N = 12
53	Correct	402 ms	25712 KB	Output is correct : V - N = 12
54	Correct	583 ms	29072 KB	Output is correct : V - N = 12
55	Correct	35 ms	8312 KB	Output is correct : V - N = 12
56	Correct	337 ms	20536 KB	Output is correct : V - N = 12
57	Correct	682 ms	30128 KB	Output is correct : V - N = 12
58	Correct	89 ms	10608 KB	Output is correct : V - N = 12
59	Correct	235 ms	17136 KB	Output is correct : V - N = 12
60	Correct	646 ms	30496 KB	Output is correct : V - N = 12
61	Correct	8 ms	6736 KB	Output is correct : V - N = 12
62	Correct	8 ms	6896 KB	Output is correct : V - N = 12
63	Correct	8 ms	6640 KB	Output is correct : V - N = 12
64	Correct	8 ms	6640 KB	Output is correct : V - N = 12
65	Correct	8 ms	6672 KB	Output is correct : V - N = 12
66	Correct	8 ms	6904 KB	Output is correct : V - N = 12
67	Correct	8 ms	6840 KB	Output is correct : V - N = 12
68	Correct	8 ms	6904 KB	Output is correct : V - N = 12
69	Correct	8 ms	6696 KB	Output is correct : V - N = 12
70	Correct	8 ms	6896 KB	Output is correct : V - N = 12
71	Correct	8 ms	6816 KB	Output is correct : V - N = 12
72	Correct	8 ms	6768 KB	Output is correct : V - N = 12
73	Correct	9 ms	7064 KB	Output is correct : V - N = 12
74	Correct	8 ms	6736 KB	Output is correct : V - N = 12
75	Correct	8 ms	6896 KB	Output is correct : V - N = 12
76	Correct	8 ms	6896 KB	Output is correct : V - N = 12
77	Correct	8 ms	6640 KB	Output is correct : V - N = 12
78	Correct	8 ms	6896 KB	Output is correct : V - N = 12
79	Correct	8 ms	6736 KB	Output is correct : V - N = 12
80	Correct	8 ms	6896 KB	Output is correct : V - N = 12
81	Correct	8 ms	6896 KB	Output is correct : V - N = 12
82	Correct	8 ms	6640 KB	Output is correct : V - N = 12
83	Correct	8 ms	6792 KB	Output is correct : V - N = 12
84	Correct	8 ms	6640 KB	Output is correct : V - N = 12
85	Correct	8 ms	6640 KB	Output is correct : V - N = 12
86	Correct	8 ms	6736 KB	Output is correct : V - N = 12
87	Correct	8 ms	6896 KB	Output is correct : V - N = 12
88	Correct	8 ms	6736 KB	Output is correct : V - N = 12
89	Correct	8 ms	6728 KB	Output is correct : V - N = 12
90	Correct	8 ms	6680 KB	Output is correct : V - N = 12
91	Correct	7 ms	6768 KB	Output is correct : V - N = 12
92	Correct	8 ms	6640 KB	Output is correct : V - N = 12
93	Correct	7 ms	6896 KB	Output is correct : V - N = 12
94	Correct	8 ms	6736 KB	Output is correct : V - N = 12
95	Correct	7 ms	6640 KB	Output is correct : V - N = 12
96	Correct	10 ms	6896 KB	Output is correct : V - N = 12
97	Correct	7 ms	6896 KB	Output is correct : V - N = 12
98	Correct	7 ms	6896 KB	Output is correct : V - N = 12
99	Correct	8 ms	6736 KB	Output is correct : V - N = 12
100	Correct	7 ms	6736 KB	Output is correct : V - N = 12
101	Correct	7 ms	6736 KB	Output is correct : V - N = 12
102	Correct	6 ms	6640 KB	Output is correct : V - N = 12
103	Correct	8 ms	6896 KB	Output is correct : V - N = 12
104	Correct	8 ms	6736 KB	Output is correct : V - N = 12
105	Correct	7 ms	6896 KB	Output is correct : V - N = 12
106	Correct	7 ms	6632 KB	Output is correct : V - N = 12
107	Correct	7 ms	7000 KB	Output is correct : V - N = 12
108	Correct	7 ms	6896 KB	Output is correct : V - N = 12
109	Correct	6 ms	6736 KB	Output is correct : V - N = 12
110	Correct	7 ms	6736 KB	Output is correct : V - N = 12
111	Correct	8 ms	6736 KB	Output is correct : V - N = 12
112	Correct	8 ms	6640 KB	Output is correct : V - N = 12
113	Correct	8 ms	6896 KB	Output is correct : V - N = 12
114	Correct	8 ms	6896 KB	Output is correct : V - N = 12
115	Correct	8 ms	6640 KB	Output is correct : V - N = 12
116	Correct	8 ms	6640 KB	Output is correct : V - N = 12
117	Correct	8 ms	6896 KB	Output is correct : V - N = 12
118	Correct	8 ms	6640 KB	Output is correct : V - N = 12
119	Correct	8 ms	6896 KB	Output is correct : V - N = 12
120	Correct	8 ms	6896 KB	Output is correct : V - N = 12
121	Correct	7 ms	6896 KB	Output is correct : V - N = 12
122	Correct	8 ms	6640 KB	Output is correct : V - N = 12
123	Correct	8 ms	6656 KB	Output is correct : V - N = 12
124	Correct	8 ms	6896 KB	Output is correct : V - N = 12
125	Correct	8 ms	6736 KB	Output is correct : V - N = 12
126	Correct	8 ms	6640 KB	Output is correct : V - N = 12
127	Correct	8 ms	6640 KB	Output is correct : V - N = 12
128	Correct	8 ms	6904 KB	Output is correct : V - N = 12
129	Correct	8 ms	6640 KB	Output is correct : V - N = 12
130	Correct	8 ms	6736 KB	Output is correct : V - N = 12
131	Correct	8 ms	6640 KB	Output is correct : V - N = 12
132	Correct	8 ms	6640 KB	Output is correct : V - N = 12
133	Correct	7 ms	6896 KB	Output is correct : V - N = 12
134	Correct	8 ms	6640 KB	Output is correct : V - N = 12
135	Correct	8 ms	6640 KB	Output is correct : V - N = 12
136	Correct	8 ms	6896 KB	Output is correct : V - N = 12
137	Correct	8 ms	6664 KB	Output is correct : V - N = 12
138	Correct	8 ms	6648 KB	Output is correct : V - N = 12
139	Correct	8 ms	6928 KB	Output is correct : V - N = 12
140	Correct	8 ms	6736 KB	Output is correct : V - N = 12
141	Correct	8 ms	6640 KB	Output is correct : V - N = 12
142	Correct	8 ms	6640 KB	Output is correct : V - N = 12
143	Correct	7 ms	6896 KB	Output is correct : V - N = 12
144	Correct	8 ms	6736 KB	Output is correct : V - N = 12
145	Correct	8 ms	6640 KB	Output is correct : V - N = 12
146	Correct	8 ms	6904 KB	Output is correct : V - N = 12
147	Correct	9 ms	6896 KB	Output is correct : V - N = 12
148	Correct	8 ms	6896 KB	Output is correct : V - N = 12
149	Correct	8 ms	6896 KB	Output is correct : V - N = 12
150	Correct	8 ms	6640 KB	Output is correct : V - N = 12
151	Correct	8 ms	6640 KB	Output is correct : V - N = 12
152	Correct	7 ms	6640 KB	Output is correct : V - N = 12
153	Correct	8 ms	6896 KB	Output is correct : V - N = 12
154	Correct	7 ms	6896 KB	Output is correct : V - N = 12
155	Correct	8 ms	6896 KB	Output is correct : V - N = 12
156	Correct	8 ms	6896 KB	Output is correct : V - N = 12
157	Correct	8 ms	6984 KB	Output is correct : V - N = 12
158	Correct	8 ms	6640 KB	Output is correct : V - N = 12
159	Correct	8 ms	6624 KB	Output is correct : V - N = 12
160	Correct	8 ms	6904 KB	Output is correct : V - N = 12
161	Correct	8 ms	6640 KB	Output is correct : V - N = 12
162	Correct	8 ms	6640 KB	Output is correct : V - N = 12
163	Correct	8 ms	6640 KB	Output is correct : V - N = 12
164	Correct	8 ms	6648 KB	Output is correct : V - N = 12
165	Correct	8 ms	6896 KB	Output is correct : V - N = 12
166	Correct	8 ms	6640 KB	Output is correct : V - N = 12
167	Correct	8 ms	6640 KB	Output is correct : V - N = 12
168	Correct	8 ms	6896 KB	Output is correct : V - N = 12
169	Correct	8 ms	6896 KB	Output is correct : V - N = 12
170	Correct	8 ms	6896 KB	Output is correct : V - N = 12
171	Correct	8 ms	6768 KB	Output is correct : V - N = 0
172	Correct	8 ms	6800 KB	Output is correct : V - N = 0
173	Correct	8 ms	6736 KB	Output is correct : V - N = 0
174	Correct	8 ms	6736 KB	Output is correct : V - N = 12
175	Correct	7 ms	6736 KB	Output is correct : V - N = 12
176	Correct	7 ms	6632 KB	Output is correct : V - N = 12
177	Correct	8 ms	6640 KB	Output is correct : V - N = 12
178	Correct	8 ms	6640 KB	Output is correct : V - N = 12

답안 #69063

Compilation message

Subtask #1 22.0 / 22.0

Subtask #2 15.0 / 15.0

Subtask #3 63.0 / 63.0

Subtask #1
22.0 / 22.0

Subtask #2
15.0 / 15.0

Subtask #3
63.0 / 63.0