답안 #1091271

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1091271	2024-09-20T10:18:44 Z	DobromirAngelov	항공 노선도 (JOI18_airline)	C++14	100 / 100	446 ms	36552 KB

Alice
Bob

#include "Alicelib.h"
#include<bits/stdc++.h>

using namespace std;

static const int MAXN=1505;
static const int BIT_CNT=10;

static int n,m;
static vector<pair<int,int> > edges;
static int code[MAXN];
static int deg1=0;

void addEdge(int u,int v)
{
	if(u==n+1 || v==n+1) deg1++;
	edges.push_back({u-1,v-1});
}

void returnGraph()
{
	InitG(n+BIT_CNT+2, edges.size());
	int pos=0;
	for(auto cur: edges)
	{
		MakeG(pos++, cur.first, cur.second);
	}
}

void Alice( int N, int M, int A[], int B[] )
{
	n=N;
	m=M;
	for(int i=0;i<m;i++)
	{
		int u=A[i]+1;
		int v=B[i]+1;
		addEdge(u,v);
	}

	int ptr=1;
	for(int i=1;i<=n;i++)
	{
		while(__builtin_popcount(ptr)==9) ptr++;
		code[i]=ptr++;
	}
	for(int i=1;i<=n;i++)
	{
		for(int j=0;j<BIT_CNT;j++)
		{
			if(code[i]&(1<<j)) addEdge(i,n+1+j);
		}
	}

	for(int i=1;i<=n+BIT_CNT;i++)
	{
		if(i==n+1) continue;
		addEdge(n+BIT_CNT+1,i);
	}
	for(int i=1;i<=BIT_CNT;i++)
	{
		addEdge(n+BIT_CNT+2,n+i);
	}

	for(int i=2;i<BIT_CNT;i++)
	{
		addEdge(n+i-1,n+i);
	}
	if(deg1==BIT_CNT) addEdge(n+1,n+BIT_CNT);
	else addEdge(n+BIT_CNT-1,n+BIT_CNT);

	returnGraph();
}

#include "Boblib.h"
#include <bits/stdc++.h>

using namespace std;

static const int MAXN=1505;
static const int BIT_CNT=10;

static int n,m;
static vector<int> adj[MAXN];
static int mark[MAXN];
static bool isBit[MAXN];
static int val[MAXN];
static int id[MAXN];
static int decode[MAXN];
static bool edge[MAXN][MAXN];
static vector<pair<int,int> > MapEdges;

void addMapEdge(int u,int v)
{
	MapEdges.push_back({u-1,v-1});
}

void returnMap()
{
	InitMap(n,MapEdges.size());
	for(auto cur: MapEdges)
	{
		MakeMap(cur.first, cur.second);
	}
}

void dfsBit(int v,int d,int par)
{
	int cnt=0;
	for(auto u: adj[v])
	{
		if(!isBit[u]) continue;
		if(u==par) continue;
		cnt++;
		dfsBit(u,d+1,v);
	}
	if(cnt==0 && d==1) val[v]=(1<<(BIT_CNT-1));
	else val[v]=(1<<d);
}

void Bob( int V, int U, int C[], int D[] )
{
	n=V-BIT_CNT-2;
	m=U;
	for(int i=0;i<m;i++)
	{
		int u=C[i]+1;
		int v=D[i]+1;
		adj[u].push_back(v);
		adj[v].push_back(u);
	}

	int bigR=0;
	for(int i=1;i<=V;i++)
	{
		if(adj[i].size()==n+BIT_CNT-1)
		{
			bigR=i;
			break;
		}
	}
	for(auto u: adj[bigR])
	{
		mark[u]=1;
	}
	int smR=0;
	int bit1=0;
	for(int i=1;i<=V;i++)
	{
		if(i!=bigR && !mark[i])
		{
			if(adj[i].size()==BIT_CNT) smR=i;
			else bit1=i;
		}
	}

	for(auto u: adj[smR])
	{
		isBit[u]=1;
	}
	dfsBit(bit1, 0, -1);

	for(int i=1;i<=V;i++)
	{
		if(i==bigR || i==smR || isBit[i]) continue;
		for(auto u: adj[i])
		{
			if(isBit[u]) id[i]+=val[u];
		}
	}
	int ptr=1;
	for(int i=1;i<=n;i++)
	{
		while(__builtin_popcount(ptr)==9) ptr++;
		decode[ptr++]=i;
	}
	for(int i=1;i<=V;i++)
	{
		if(id[i]>0) id[i]=decode[id[i]];
	}

	for(int i=1;i<=V;i++)
	{
		if(i==bigR || i==smR || isBit[i]) continue;
		for(auto u: adj[i])
		{
			if(u==bigR || u==smR || isBit[u]) continue;
			edge[id[i]][id[u]]=1;
		}
	}
	for(int i=1;i<=V;i++)
	{
		for(int j=i+1;j<=V;j++)
		{
			if(edge[i][j]) addMapEdge(i,j);
		}
	}

	returnMap();
}

Compilation message

Bob.cpp: In function 'void Bob(int, int, int*, int*)':
Bob.cpp:62:19: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   62 |   if(adj[i].size()==n+BIT_CNT-1)
      |      ~~~~~~~~~~~~~^~~~~~~~~~~~~

Subtask #1
22.0 / 22.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	17668 KB	Output is correct
2	Correct	2 ms	13580 KB	Output is correct
3	Correct	2 ms	17664 KB	Output is correct
4	Correct	3 ms	15616 KB	Output is correct
5	Correct	2 ms	13580 KB	Output is correct
6	Correct	3 ms	17664 KB	Output is correct
7	Correct	2 ms	13580 KB	Output is correct
8	Correct	2 ms	17664 KB	Output is correct
9	Correct	2 ms	17668 KB	Output is correct
10	Correct	2 ms	15620 KB	Output is correct
11	Correct	3 ms	17664 KB	Output is correct
12	Correct	2 ms	15456 KB	Output is correct
13	Correct	2 ms	11540 KB	Output is correct
14	Correct	2 ms	17700 KB	Output is correct
15	Correct	1 ms	11532 KB	Output is correct
16	Correct	2 ms	12296 KB	Output is correct
17	Correct	2 ms	10264 KB	Output is correct
18	Correct	2 ms	10256 KB	Output is correct
19	Correct	2 ms	10248 KB	Output is correct
20	Correct	2 ms	6928 KB	Output is correct
21	Correct	2 ms	12132 KB	Output is correct
22	Correct	2 ms	10256 KB	Output is correct
23	Correct	2 ms	13572 KB	Output is correct
24	Correct	2 ms	15620 KB	Output is correct
25	Correct	2 ms	10248 KB	Output is correct
26	Correct	1 ms	10256 KB	Output is correct
27	Correct	2 ms	17676 KB	Output is correct
28	Correct	2 ms	11528 KB	Output is correct
29	Correct	2 ms	15624 KB	Output is correct
30	Correct	2 ms	13572 KB	Output is correct
31	Correct	2 ms	15640 KB	Output is correct
32	Correct	2 ms	13572 KB	Output is correct
33	Correct	2 ms	6936 KB	Output is correct
34	Correct	3 ms	13568 KB	Output is correct
35	Correct	2 ms	12332 KB	Output is correct
36	Correct	2 ms	8976 KB	Output is correct
37	Correct	2 ms	11532 KB	Output is correct
38	Correct	2 ms	14336 KB	Output is correct
39	Correct	2 ms	8984 KB	Output is correct
40	Correct	1 ms	13572 KB	Output is correct
41	Correct	2 ms	10260 KB	Output is correct
42	Correct	2 ms	13580 KB	Output is correct
43	Correct	2 ms	17664 KB	Output is correct
44	Correct	2 ms	15620 KB	Output is correct
45	Correct	1 ms	13568 KB	Output is correct
46	Correct	2 ms	13576 KB	Output is correct
47	Correct	1 ms	11540 KB	Output is correct
48	Correct	2 ms	13576 KB	Output is correct
49	Correct	2 ms	12292 KB	Output is correct
50	Correct	1 ms	13572 KB	Output is correct
51	Correct	2 ms	13572 KB	Output is correct
52	Correct	1 ms	6924 KB	Output is correct
53	Correct	1 ms	10244 KB	Output is correct
54	Correct	2 ms	6936 KB	Output is correct
55	Correct	2 ms	6932 KB	Output is correct
56	Correct	2 ms	10252 KB	Output is correct
57	Correct	1 ms	13576 KB	Output is correct
58	Correct	2 ms	17676 KB	Output is correct

Subtask #2
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	17668 KB	Output is correct
2	Correct	2 ms	13580 KB	Output is correct
3	Correct	2 ms	17664 KB	Output is correct
4	Correct	3 ms	15616 KB	Output is correct
5	Correct	2 ms	13580 KB	Output is correct
6	Correct	3 ms	17664 KB	Output is correct
7	Correct	2 ms	13580 KB	Output is correct
8	Correct	2 ms	17664 KB	Output is correct
9	Correct	2 ms	17668 KB	Output is correct
10	Correct	2 ms	15620 KB	Output is correct
11	Correct	3 ms	17664 KB	Output is correct
12	Correct	2 ms	15456 KB	Output is correct
13	Correct	2 ms	11540 KB	Output is correct
14	Correct	2 ms	17700 KB	Output is correct
15	Correct	1 ms	11532 KB	Output is correct
16	Correct	2 ms	12296 KB	Output is correct
17	Correct	2 ms	10264 KB	Output is correct
18	Correct	2 ms	10256 KB	Output is correct
19	Correct	2 ms	10248 KB	Output is correct
20	Correct	2 ms	6928 KB	Output is correct
21	Correct	2 ms	12132 KB	Output is correct
22	Correct	2 ms	10256 KB	Output is correct
23	Correct	2 ms	13572 KB	Output is correct
24	Correct	2 ms	15620 KB	Output is correct
25	Correct	2 ms	10248 KB	Output is correct
26	Correct	1 ms	10256 KB	Output is correct
27	Correct	2 ms	17676 KB	Output is correct
28	Correct	2 ms	11528 KB	Output is correct
29	Correct	2 ms	15624 KB	Output is correct
30	Correct	2 ms	13572 KB	Output is correct
31	Correct	2 ms	15640 KB	Output is correct
32	Correct	2 ms	13572 KB	Output is correct
33	Correct	2 ms	6936 KB	Output is correct
34	Correct	3 ms	13568 KB	Output is correct
35	Correct	2 ms	12332 KB	Output is correct
36	Correct	2 ms	8976 KB	Output is correct
37	Correct	2 ms	11532 KB	Output is correct
38	Correct	2 ms	14336 KB	Output is correct
39	Correct	2 ms	8984 KB	Output is correct
40	Correct	1 ms	13572 KB	Output is correct
41	Correct	2 ms	10260 KB	Output is correct
42	Correct	2 ms	13580 KB	Output is correct
43	Correct	2 ms	17664 KB	Output is correct
44	Correct	2 ms	15620 KB	Output is correct
45	Correct	1 ms	13568 KB	Output is correct
46	Correct	2 ms	13576 KB	Output is correct
47	Correct	1 ms	11540 KB	Output is correct
48	Correct	2 ms	13576 KB	Output is correct
49	Correct	2 ms	12292 KB	Output is correct
50	Correct	1 ms	13572 KB	Output is correct
51	Correct	2 ms	13572 KB	Output is correct
52	Correct	1 ms	6924 KB	Output is correct
53	Correct	1 ms	10244 KB	Output is correct
54	Correct	2 ms	6936 KB	Output is correct
55	Correct	2 ms	6932 KB	Output is correct
56	Correct	2 ms	10252 KB	Output is correct
57	Correct	1 ms	13576 KB	Output is correct
58	Correct	2 ms	17676 KB	Output is correct
59	Correct	2 ms	17660 KB	Output is correct
60	Correct	2 ms	17668 KB	Output is correct
61	Correct	2 ms	17668 KB	Output is correct
62	Correct	2 ms	13580 KB	Output is correct
63	Correct	2 ms	15632 KB	Output is correct
64	Correct	3 ms	15632 KB	Output is correct
65	Correct	2 ms	13580 KB	Output is correct
66	Correct	2 ms	8972 KB	Output is correct
67	Correct	3 ms	10260 KB	Output is correct
68	Correct	2 ms	13580 KB	Output is correct
69	Correct	2 ms	17668 KB	Output is correct
70	Correct	2 ms	10264 KB	Output is correct
71	Correct	2 ms	8984 KB	Output is correct
72	Correct	2 ms	11532 KB	Output is correct
73	Correct	2 ms	13580 KB	Output is correct
74	Correct	2 ms	17668 KB	Output is correct
75	Correct	2 ms	17668 KB	Output is correct
76	Correct	3 ms	17664 KB	Output is correct
77	Correct	2 ms	13580 KB	Output is correct
78	Correct	3 ms	15624 KB	Output is correct
79	Correct	2 ms	10248 KB	Output is correct
80	Correct	2 ms	15632 KB	Output is correct
81	Correct	1 ms	11544 KB	Output is correct
82	Correct	2 ms	17664 KB	Output is correct
83	Correct	2 ms	13580 KB	Output is correct
84	Correct	2 ms	15620 KB	Output is correct
85	Correct	3 ms	17668 KB	Output is correct
86	Correct	3 ms	17676 KB	Output is correct
87	Correct	3 ms	17660 KB	Output is correct
88	Correct	2 ms	17660 KB	Output is correct
89	Correct	2 ms	15624 KB	Output is correct
90	Correct	2 ms	15620 KB	Output is correct
91	Correct	2 ms	13568 KB	Output is correct
92	Correct	2 ms	13568 KB	Output is correct
93	Correct	3 ms	15620 KB	Output is correct
94	Correct	2 ms	13588 KB	Output is correct
95	Correct	2 ms	17668 KB	Output is correct
96	Correct	2 ms	12448 KB	Output is correct
97	Correct	3 ms	11532 KB	Output is correct
98	Correct	2 ms	10248 KB	Output is correct
99	Correct	3 ms	8988 KB	Output is correct
100	Correct	3 ms	10264 KB	Output is correct
101	Correct	2 ms	17668 KB	Output is correct
102	Correct	2 ms	15620 KB	Output is correct
103	Correct	2 ms	10252 KB	Output is correct
104	Correct	2 ms	10264 KB	Output is correct
105	Correct	2 ms	6940 KB	Output is correct
106	Correct	3 ms	6928 KB	Output is correct
107	Correct	3 ms	12296 KB	Output is correct
108	Correct	2 ms	10256 KB	Output is correct
109	Correct	3 ms	17664 KB	Output is correct
110	Correct	2 ms	17668 KB	Output is correct
111	Correct	2 ms	17676 KB	Output is correct
112	Correct	2 ms	13572 KB	Output is correct
113	Correct	2 ms	12296 KB	Output is correct
114	Correct	2 ms	10256 KB	Output is correct
115	Correct	2 ms	13576 KB	Output is correct
116	Correct	2 ms	17664 KB	Output is correct
117	Correct	2 ms	17676 KB	Output is correct
118	Correct	2 ms	17676 KB	Output is correct

Subtask #3
63.0 / 63.0

#	결과	실행 시간	메모리	Grader output
1	Correct	383 ms	36552 KB	Output is correct : V - N = 12
2	Correct	269 ms	34788 KB	Output is correct : V - N = 12
3	Correct	112 ms	24352 KB	Output is correct : V - N = 12
4	Correct	8 ms	18956 KB	Output is correct : V - N = 12
5	Correct	74 ms	18516 KB	Output is correct : V - N = 12
6	Correct	232 ms	28424 KB	Output is correct : V - N = 12
7	Correct	399 ms	33568 KB	Output is correct : V - N = 12
8	Correct	359 ms	32060 KB	Output is correct : V - N = 12
9	Correct	153 ms	22704 KB	Output is correct : V - N = 12
10	Correct	18 ms	13788 KB	Output is correct : V - N = 12
11	Correct	46 ms	12352 KB	Output is correct : V - N = 12
12	Correct	247 ms	24584 KB	Output is correct : V - N = 12
13	Correct	332 ms	32616 KB	Output is correct : V - N = 12
14	Correct	446 ms	31772 KB	Output is correct : V - N = 12
15	Correct	210 ms	27976 KB	Output is correct : V - N = 12
16	Correct	45 ms	16264 KB	Output is correct : V - N = 12
17	Correct	9 ms	11104 KB	Output is correct : V - N = 12
18	Correct	131 ms	19636 KB	Output is correct : V - N = 12
19	Correct	303 ms	31268 KB	Output is correct : V - N = 12
20	Correct	412 ms	32420 KB	Output is correct : V - N = 12
21	Correct	89 ms	16996 KB	Output is correct : V - N = 12
22	Correct	68 ms	17732 KB	Output is correct : V - N = 12
23	Correct	27 ms	15772 KB	Output is correct : V - N = 12
24	Correct	4 ms	12560 KB	Output is correct : V - N = 12
25	Correct	16 ms	10668 KB	Output is correct : V - N = 12
26	Correct	57 ms	16640 KB	Output is correct : V - N = 12
27	Correct	116 ms	15924 KB	Output is correct : V - N = 12
28	Correct	82 ms	13368 KB	Output is correct : V - N = 12
29	Correct	51 ms	14932 KB	Output is correct : V - N = 12
30	Correct	5 ms	14104 KB	Output is correct : V - N = 12
31	Correct	6 ms	12544 KB	Output is correct : V - N = 12
32	Correct	5 ms	13576 KB	Output is correct : V - N = 12
33	Correct	5 ms	12548 KB	Output is correct : V - N = 12
34	Correct	5 ms	13568 KB	Output is correct : V - N = 12
35	Correct	6 ms	13568 KB	Output is correct : V - N = 12
36	Correct	367 ms	33760 KB	Output is correct : V - N = 12
37	Correct	440 ms	34652 KB	Output is correct : V - N = 12
38	Correct	366 ms	32484 KB	Output is correct : V - N = 12
39	Correct	382 ms	32556 KB	Output is correct : V - N = 12
40	Correct	358 ms	32988 KB	Output is correct : V - N = 12
41	Correct	62 ms	18512 KB	Output is correct : V - N = 12
42	Correct	48 ms	13708 KB	Output is correct : V - N = 12
43	Correct	55 ms	15504 KB	Output is correct : V - N = 12
44	Correct	7 ms	13320 KB	Output is correct : V - N = 12
45	Correct	42 ms	13460 KB	Output is correct : V - N = 12
46	Correct	129 ms	22948 KB	Output is correct : V - N = 12
47	Correct	62 ms	15556 KB	Output is correct : V - N = 12
48	Correct	162 ms	19560 KB	Output is correct : V - N = 12
49	Correct	27 ms	13436 KB	Output is correct : V - N = 12
50	Correct	9 ms	13204 KB	Output is correct : V - N = 12
51	Correct	278 ms	29200 KB	Output is correct : V - N = 12
52	Correct	8 ms	14864 KB	Output is correct : V - N = 12
53	Correct	231 ms	28832 KB	Output is correct : V - N = 12
54	Correct	306 ms	33368 KB	Output is correct : V - N = 12
55	Correct	18 ms	14476 KB	Output is correct : V - N = 12
56	Correct	182 ms	20880 KB	Output is correct : V - N = 12
57	Correct	360 ms	32696 KB	Output is correct : V - N = 12
58	Correct	45 ms	18680 KB	Output is correct : V - N = 12
59	Correct	167 ms	23056 KB	Output is correct : V - N = 12
60	Correct	356 ms	33884 KB	Output is correct : V - N = 12
61	Correct	2 ms	13576 KB	Output is correct : V - N = 12
62	Correct	2 ms	17668 KB	Output is correct : V - N = 12
63	Correct	2 ms	13580 KB	Output is correct : V - N = 12
64	Correct	3 ms	17668 KB	Output is correct : V - N = 12
65	Correct	2 ms	17668 KB	Output is correct : V - N = 12
66	Correct	3 ms	8972 KB	Output is correct : V - N = 12
67	Correct	2 ms	10256 KB	Output is correct : V - N = 12
68	Correct	2 ms	13576 KB	Output is correct : V - N = 12
69	Correct	2 ms	13576 KB	Output is correct : V - N = 12
70	Correct	2 ms	17676 KB	Output is correct : V - N = 12
71	Correct	2 ms	15616 KB	Output is correct : V - N = 12
72	Correct	2 ms	13580 KB	Output is correct : V - N = 12
73	Correct	2 ms	13580 KB	Output is correct : V - N = 12
74	Correct	2 ms	17664 KB	Output is correct : V - N = 12
75	Correct	2 ms	11532 KB	Output is correct : V - N = 12
76	Correct	2 ms	12296 KB	Output is correct : V - N = 12
77	Correct	2 ms	13444 KB	Output is correct : V - N = 12
78	Correct	2 ms	11532 KB	Output is correct : V - N = 12
79	Correct	2 ms	11528 KB	Output is correct : V - N = 12
80	Correct	2 ms	13584 KB	Output is correct : V - N = 12
81	Correct	2 ms	10252 KB	Output is correct : V - N = 12
82	Correct	3 ms	6932 KB	Output is correct : V - N = 12
83	Correct	2 ms	15620 KB	Output is correct : V - N = 12
84	Correct	2 ms	13580 KB	Output is correct : V - N = 12
85	Correct	2 ms	11528 KB	Output is correct : V - N = 12
86	Correct	2 ms	10264 KB	Output is correct : V - N = 12
87	Correct	2 ms	11540 KB	Output is correct : V - N = 12
88	Correct	2 ms	11532 KB	Output is correct : V - N = 12
89	Correct	3 ms	10272 KB	Output is correct : V - N = 12
90	Correct	2 ms	10256 KB	Output is correct : V - N = 12
91	Correct	2 ms	15620 KB	Output is correct : V - N = 12
92	Correct	2 ms	15624 KB	Output is correct : V - N = 12
93	Correct	3 ms	15620 KB	Output is correct : V - N = 12
94	Correct	3 ms	12300 KB	Output is correct : V - N = 12
95	Correct	2 ms	15616 KB	Output is correct : V - N = 12
96	Correct	2 ms	17668 KB	Output is correct : V - N = 12
97	Correct	3 ms	14348 KB	Output is correct : V - N = 12
98	Correct	3 ms	8980 KB	Output is correct : V - N = 12
99	Correct	2 ms	6928 KB	Output is correct : V - N = 12
100	Correct	3 ms	10256 KB	Output is correct : V - N = 12
101	Correct	3 ms	17664 KB	Output is correct : V - N = 12
102	Correct	2 ms	13576 KB	Output is correct : V - N = 12
103	Correct	1 ms	10256 KB	Output is correct : V - N = 12
104	Correct	2 ms	15620 KB	Output is correct : V - N = 12
105	Correct	2 ms	13824 KB	Output is correct : V - N = 12
106	Correct	2 ms	13820 KB	Output is correct : V - N = 12
107	Correct	2 ms	10256 KB	Output is correct : V - N = 12
108	Correct	3 ms	10268 KB	Output is correct : V - N = 12
109	Correct	3 ms	15624 KB	Output is correct : V - N = 12
110	Correct	3 ms	15632 KB	Output is correct : V - N = 12
111	Correct	2 ms	13588 KB	Output is correct : V - N = 12
112	Correct	2 ms	17668 KB	Output is correct : V - N = 12
113	Correct	2 ms	17668 KB	Output is correct : V - N = 12
114	Correct	2 ms	18172 KB	Output is correct : V - N = 12
115	Correct	2 ms	17668 KB	Output is correct : V - N = 12
116	Correct	3 ms	17676 KB	Output is correct : V - N = 12
117	Correct	2 ms	10252 KB	Output is correct : V - N = 12
118	Correct	2 ms	6928 KB	Output is correct : V - N = 12
119	Correct	2 ms	10264 KB	Output is correct : V - N = 12
120	Correct	2 ms	13576 KB	Output is correct : V - N = 12
121	Correct	2 ms	13580 KB	Output is correct : V - N = 12
122	Correct	3 ms	13588 KB	Output is correct : V - N = 12
123	Correct	2 ms	12296 KB	Output is correct : V - N = 12
124	Correct	2 ms	13572 KB	Output is correct : V - N = 12
125	Correct	2 ms	15624 KB	Output is correct : V - N = 12
126	Correct	2 ms	10264 KB	Output is correct : V - N = 12
127	Correct	3 ms	15620 KB	Output is correct : V - N = 12
128	Correct	3 ms	10260 KB	Output is correct : V - N = 12
129	Correct	2 ms	11540 KB	Output is correct : V - N = 12
130	Correct	2 ms	13572 KB	Output is correct : V - N = 12
131	Correct	2 ms	17660 KB	Output is correct : V - N = 12
132	Correct	2 ms	17668 KB	Output is correct : V - N = 12
133	Correct	2 ms	12304 KB	Output is correct : V - N = 12
134	Correct	3 ms	6932 KB	Output is correct : V - N = 12
135	Correct	2 ms	13584 KB	Output is correct : V - N = 12
136	Correct	2 ms	15636 KB	Output is correct : V - N = 12
137	Correct	2 ms	17676 KB	Output is correct : V - N = 12
138	Correct	3 ms	9036 KB	Output is correct : V - N = 12
139	Correct	3 ms	10264 KB	Output is correct : V - N = 12
140	Correct	2 ms	17676 KB	Output is correct : V - N = 12
141	Correct	1 ms	11536 KB	Output is correct : V - N = 12
142	Correct	2 ms	11540 KB	Output is correct : V - N = 12
143	Correct	2 ms	15620 KB	Output is correct : V - N = 12
144	Correct	2 ms	12160 KB	Output is correct : V - N = 12
145	Correct	1 ms	13572 KB	Output is correct : V - N = 12
146	Correct	2 ms	17668 KB	Output is correct : V - N = 12
147	Correct	2 ms	17668 KB	Output is correct : V - N = 12
148	Correct	2 ms	10256 KB	Output is correct : V - N = 12
149	Correct	1 ms	11532 KB	Output is correct : V - N = 12
150	Correct	2 ms	15620 KB	Output is correct : V - N = 12
151	Correct	2 ms	15616 KB	Output is correct : V - N = 12
152	Correct	2 ms	15624 KB	Output is correct : V - N = 12
153	Correct	2 ms	15620 KB	Output is correct : V - N = 12
154	Correct	1 ms	13568 KB	Output is correct : V - N = 12
155	Correct	3 ms	13572 KB	Output is correct : V - N = 12
156	Correct	1 ms	13572 KB	Output is correct : V - N = 12
157	Correct	2 ms	17668 KB	Output is correct : V - N = 12
158	Correct	2 ms	15624 KB	Output is correct : V - N = 12
159	Correct	2 ms	12292 KB	Output is correct : V - N = 12
160	Correct	2 ms	10256 KB	Output is correct : V - N = 12
161	Correct	2 ms	10252 KB	Output is correct : V - N = 12
162	Correct	2 ms	13576 KB	Output is correct : V - N = 12
163	Correct	2 ms	10260 KB	Output is correct : V - N = 12
164	Correct	2 ms	10240 KB	Output is correct : V - N = 12
165	Correct	2 ms	10252 KB	Output is correct : V - N = 12
166	Correct	2 ms	12296 KB	Output is correct : V - N = 12
167	Correct	2 ms	12296 KB	Output is correct : V - N = 12
168	Correct	2 ms	4888 KB	Output is correct : V - N = 12
169	Correct	3 ms	10260 KB	Output is correct : V - N = 12
170	Correct	2 ms	15620 KB	Output is correct : V - N = 12
171	Correct	2 ms	15620 KB	Output is correct : V - N = 12
172	Correct	2 ms	17676 KB	Output is correct : V - N = 12
173	Correct	2 ms	13576 KB	Output is correct : V - N = 12
174	Correct	2 ms	17668 KB	Output is correct : V - N = 12
175	Correct	2 ms	15624 KB	Output is correct : V - N = 12
176	Correct	3 ms	17664 KB	Output is correct : V - N = 12
177	Correct	2 ms	8976 KB	Output is correct : V - N = 12
178	Correct	3 ms	4880 KB	Output is correct : V - N = 12

답안 #1091271

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