답안 #73726 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
73726	2018-08-28T19:21:46 Z	TadijaSebez	항공 노선도 (JOI18_airline)	C++11	100 / 100	726 ms	30744 KB

Alice
Bob

#include "Alicelib.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
void Alice(int n, int m, int a[], int b[])
{
	int L=10;
    vector<pair<int,int> > edges;
    int cen=n+L,den=n+L+1,i,j;
    for(i=0;i<L-1;i++) edges.pb(mp(n+i,n+i+1));
    vector<int> my(n,0);int k=0;
    for(i=0;i<n;i++)
	{
		while(__builtin_popcount(k)==9) k++;
		my[i]=k;
		edges.pb(mp(i,cen));
		edges.pb(mp(i,den));
		for(j=0;j<L;j++) if((my[i]>>j)&1) edges.pb(mp(i,n+j));
		k++;
	}
	for(i=0;i<L;i++) edges.pb(mp(n+i,den));
	for(i=0;i<m;i++) edges.pb(mp(a[i],b[i]));
	InitG(n+L+2,edges.size());
	for(i=0;i<edges.size();i++) MakeG(i,edges[i].first,edges[i].second);
}

#include "Boblib.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
vector<vector<int> > E;
vector<int> fk,val;
void DFS(int u, int p, int d)
{
	val[u]=d;
	for(int v:E[u]) if(v!=p && fk[v]==1) DFS(v,u,d+1);
}
//set<pair<int,int> > es;
bool has[1012][1012];
//bool has(int a, int b){ return has[a][b];}
void AddEdge(int a, int b){ has[a][b]=has[b][a]=1;}
void Bob(int n, int m, int a[], int b[])
{
	int L=10,N=n-L-2,i;E.clear();E.resize(n);
	vector<int> deg(n,0),my(1012,0);
	for(i=0;i<m;i++) deg[a[i]]++,deg[b[i]]++,AddEdge(a[i],b[i]);
	for(i=0;i<m;i++) E[a[i]].pb(b[i]),E[b[i]].pb(a[i]);
	int den,cen;
	for(i=0;i<n;i++) if(deg[i]==n-2) den=i;
	for(i=0;i<n;i++)
	{
		if(i==den) continue;
		if(has[i][den]) continue;
		cen=i;
	}
	int k=0,con=0;
	for(i=0;i<N;i++)
	{
		while(__builtin_popcount(k)==9) k++;
		my[k]=i;con+=k&1;k++;
	}
	fk.resize(n);fk[cen]=fk[den]=2;val.resize(n);
	for(i=0;i<n;i++) if(i!=cen && i!=den && !has[cen][i]) fk[i]=1;
	int one;
	for(i=0;i<n;i++)
	{
		if(fk[i]==1)
		{
			int c=0,d=0;
			for(int v:E[i]){ if(fk[v]==0) c++;if(fk[v]==1) d++;}
			if(c==con && d==1) one=i;
		}
	}
	DFS(one,-1,0);
	for(i=0;i<n;i++) if(fk[i]==0)
	{
		for(int v:E[i]) if(fk[v]==1) val[i]+=1<<val[v];
	}
	vector<pair<int,int> > edges;
	for(i=0;i<m;i++)
	{
		if(fk[a[i]]==0 && fk[b[i]]==0) edges.pb(mp(my[val[a[i]]],my[val[b[i]]]));
	}
	InitMap(N,edges.size());
	for(i=0;i<edges.size();i++) MakeMap(edges[i].first,edges[i].second);
	for(i=0;i<m;i++) has[a[i]][b[i]]=has[b[i]][a[i]]=0;
	/*int N=n-L-2,M=m-9-2*n,i,j;
	vector<int> indeg;
	indeg.resize(n);
	//for(i=0;i<N;i++) for(j=0;j<L;j++) if((i>>j)&1) M--;
	for(i=0;i<m;i++) indeg[a[i]]++;
	vector<int> real,fake,val,go,in;
	vector<bool> fk;
	for(i=0;i<n;i++){ if(indeg[i]>1) real.pb(i);else fake.pb(i);}
	fk.resize(n);go.resize(n);in.resize(n);
	for(i=0;i<fake.size();i++) fk[fake[i]]=1;
	//printf("Fake: ");for(i=0;i<fake.size();i++) printf("%i ",fake[i]);printf("\n");
	for(i=0;i<n;i++) in[i]=go[i]=-1;
	for(i=0;i<m;i++) if(fk[a[i]] && fk[b[i]]) go[a[i]]=b[i],in[b[i]]=a[i];
	int one;
	for(i=0;i<n;i++) if(go[i]!=-1 && in[i]==-1) one=i;
	val.resize(n);
	for(i=0;i<L;i++) val[one]=i,one=go[one];
	for(i=0;i<m;i++)
	{
		if(!fk[a[i]] && fk[b[i]] && (go[b[i]]!=-1 || in[b[i]]!=-1)) val[a[i]]+=1<<val[b[i]];
	}
	//printf("Val: ");for(i=0;i<n;i++) printf("%i ",val[i]);printf("\n");
	vector<pair<int,int> > edges;
	for(i=0;i<m;i++)
	{
		if(!fk[a[i]] && !fk[b[i]])
		{
			edges.pb(mp(val[a[i]],val[b[i]]));
		}
	}
	InitMap(N,edges.size());
	for(i=0;i<edges.size();i++) MakeMap(edges[i].first,edges[i].second);*/
}

Compilation message

Alice.cpp: In function 'void Alice(int, int, int*, int*)':
Alice.cpp:26:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(i=0;i<edges.size();i++) MakeG(i,edges[i].first,edges[i].second);
          ~^~~~~~~~~~~~~

Bob.cpp: In function 'void Bob(int, int, int*, int*)':
Bob.cpp:61:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(i=0;i<edges.size();i++) MakeMap(edges[i].first,edges[i].second);
          ~^~~~~~~~~~~~~
Bob.cpp:50:5: warning: 'one' may be used uninitialized in this function [-Wmaybe-uninitialized]
  DFS(one,-1,0);
  ~~~^~~~~~~~~~
Bob.cpp:39:33: warning: 'den' may be used uninitialized in this function [-Wmaybe-uninitialized]
  for(i=0;i<n;i++) if(i!=cen && i!=den && !has[cen][i]) fk[i]=1;
                                ~^~~~~
Bob.cpp:39:23: warning: 'cen' may be used uninitialized in this function [-Wmaybe-uninitialized]
  for(i=0;i<n;i++) if(i!=cen && i!=den && !has[cen][i]) fk[i]=1;
                      ~^~~~~

Subtask #1
22.0 / 22.0

#	결과	실행 시간	메모리	Grader output
1	Correct	8 ms	6736 KB	Output is correct
2	Correct	8 ms	6640 KB	Output is correct
3	Correct	8 ms	6640 KB	Output is correct
4	Correct	7 ms	6640 KB	Output is correct
5	Correct	8 ms	6640 KB	Output is correct
6	Correct	8 ms	6640 KB	Output is correct
7	Correct	8 ms	6640 KB	Output is correct
8	Correct	8 ms	6720 KB	Output is correct
9	Correct	7 ms	6904 KB	Output is correct
10	Correct	7 ms	6640 KB	Output is correct
11	Correct	8 ms	6640 KB	Output is correct
12	Correct	7 ms	6640 KB	Output is correct
13	Correct	8 ms	6640 KB	Output is correct
14	Correct	7 ms	6640 KB	Output is correct
15	Correct	7 ms	6672 KB	Output is correct
16	Correct	6 ms	6648 KB	Output is correct
17	Correct	7 ms	6896 KB	Output is correct
18	Correct	8 ms	6896 KB	Output is correct
19	Correct	7 ms	6640 KB	Output is correct
20	Correct	8 ms	6640 KB	Output is correct
21	Correct	8 ms	6640 KB	Output is correct
22	Correct	8 ms	6736 KB	Output is correct
23	Correct	7 ms	6736 KB	Output is correct
24	Correct	8 ms	6904 KB	Output is correct
25	Correct	8 ms	6640 KB	Output is correct
26	Correct	7 ms	6608 KB	Output is correct
27	Correct	6 ms	6640 KB	Output is correct
28	Correct	6 ms	6640 KB	Output is correct
29	Correct	6 ms	6648 KB	Output is correct
30	Correct	6 ms	6896 KB	Output is correct
31	Correct	6 ms	6640 KB	Output is correct
32	Correct	6 ms	6896 KB	Output is correct
33	Correct	7 ms	6640 KB	Output is correct
34	Correct	6 ms	6896 KB	Output is correct
35	Correct	6 ms	6640 KB	Output is correct
36	Correct	8 ms	6640 KB	Output is correct
37	Correct	7 ms	6704 KB	Output is correct
38	Correct	6 ms	6896 KB	Output is correct
39	Correct	7 ms	6736 KB	Output is correct
40	Correct	6 ms	6640 KB	Output is correct
41	Correct	6 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	8 ms	6640 KB	Output is correct
45	Correct	7 ms	6896 KB	Output is correct
46	Correct	6 ms	6904 KB	Output is correct
47	Correct	7 ms	6736 KB	Output is correct
48	Correct	11 ms	6640 KB	Output is correct
49	Correct	6 ms	6640 KB	Output is correct
50	Correct	7 ms	6640 KB	Output is correct
51	Correct	8 ms	6640 KB	Output is correct
52	Correct	8 ms	6704 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	6640 KB	Output is correct
56	Correct	6 ms	6640 KB	Output is correct
57	Correct	8 ms	6896 KB	Output is correct
58	Correct	8 ms	6904 KB	Output is correct

Subtask #2
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	8 ms	6736 KB	Output is correct
2	Correct	8 ms	6640 KB	Output is correct
3	Correct	8 ms	6640 KB	Output is correct
4	Correct	7 ms	6640 KB	Output is correct
5	Correct	8 ms	6640 KB	Output is correct
6	Correct	8 ms	6640 KB	Output is correct
7	Correct	8 ms	6640 KB	Output is correct
8	Correct	8 ms	6720 KB	Output is correct
9	Correct	7 ms	6904 KB	Output is correct
10	Correct	7 ms	6640 KB	Output is correct
11	Correct	8 ms	6640 KB	Output is correct
12	Correct	7 ms	6640 KB	Output is correct
13	Correct	8 ms	6640 KB	Output is correct
14	Correct	7 ms	6640 KB	Output is correct
15	Correct	7 ms	6672 KB	Output is correct
16	Correct	6 ms	6648 KB	Output is correct
17	Correct	7 ms	6896 KB	Output is correct
18	Correct	8 ms	6896 KB	Output is correct
19	Correct	7 ms	6640 KB	Output is correct
20	Correct	8 ms	6640 KB	Output is correct
21	Correct	8 ms	6640 KB	Output is correct
22	Correct	8 ms	6736 KB	Output is correct
23	Correct	7 ms	6736 KB	Output is correct
24	Correct	8 ms	6904 KB	Output is correct
25	Correct	8 ms	6640 KB	Output is correct
26	Correct	7 ms	6608 KB	Output is correct
27	Correct	6 ms	6640 KB	Output is correct
28	Correct	6 ms	6640 KB	Output is correct
29	Correct	6 ms	6648 KB	Output is correct
30	Correct	6 ms	6896 KB	Output is correct
31	Correct	6 ms	6640 KB	Output is correct
32	Correct	6 ms	6896 KB	Output is correct
33	Correct	7 ms	6640 KB	Output is correct
34	Correct	6 ms	6896 KB	Output is correct
35	Correct	6 ms	6640 KB	Output is correct
36	Correct	8 ms	6640 KB	Output is correct
37	Correct	7 ms	6704 KB	Output is correct
38	Correct	6 ms	6896 KB	Output is correct
39	Correct	7 ms	6736 KB	Output is correct
40	Correct	6 ms	6640 KB	Output is correct
41	Correct	6 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	8 ms	6640 KB	Output is correct
45	Correct	7 ms	6896 KB	Output is correct
46	Correct	6 ms	6904 KB	Output is correct
47	Correct	7 ms	6736 KB	Output is correct
48	Correct	11 ms	6640 KB	Output is correct
49	Correct	6 ms	6640 KB	Output is correct
50	Correct	7 ms	6640 KB	Output is correct
51	Correct	8 ms	6640 KB	Output is correct
52	Correct	8 ms	6704 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	6640 KB	Output is correct
56	Correct	6 ms	6640 KB	Output is correct
57	Correct	8 ms	6896 KB	Output is correct
58	Correct	8 ms	6904 KB	Output is correct
59	Correct	8 ms	6640 KB	Output is correct
60	Correct	8 ms	6640 KB	Output is correct
61	Correct	8 ms	6736 KB	Output is correct
62	Correct	8 ms	6640 KB	Output is correct
63	Correct	8 ms	6640 KB	Output is correct
64	Correct	8 ms	6896 KB	Output is correct
65	Correct	8 ms	6640 KB	Output is correct
66	Correct	8 ms	6992 KB	Output is correct
67	Correct	8 ms	6736 KB	Output is correct
68	Correct	7 ms	6896 KB	Output is correct
69	Correct	8 ms	6640 KB	Output is correct
70	Correct	8 ms	6640 KB	Output is correct
71	Correct	8 ms	6896 KB	Output is correct
72	Correct	8 ms	6640 KB	Output is correct
73	Correct	8 ms	6640 KB	Output is correct
74	Correct	7 ms	6640 KB	Output is correct
75	Correct	8 ms	6984 KB	Output is correct
76	Correct	8 ms	6896 KB	Output is correct
77	Correct	8 ms	6640 KB	Output is correct
78	Correct	8 ms	6648 KB	Output is correct
79	Correct	8 ms	6640 KB	Output is correct
80	Correct	8 ms	6640 KB	Output is correct
81	Correct	8 ms	6576 KB	Output is correct
82	Correct	8 ms	6640 KB	Output is correct
83	Correct	6 ms	7048 KB	Output is correct
84	Correct	6 ms	6640 KB	Output is correct
85	Correct	8 ms	6736 KB	Output is correct
86	Correct	7 ms	6840 KB	Output is correct
87	Correct	8 ms	6736 KB	Output is correct
88	Correct	7 ms	6640 KB	Output is correct
89	Correct	7 ms	6736 KB	Output is correct
90	Correct	8 ms	6640 KB	Output is correct
91	Correct	8 ms	6904 KB	Output is correct
92	Correct	7 ms	6640 KB	Output is correct
93	Correct	8 ms	6736 KB	Output is correct
94	Correct	8 ms	6896 KB	Output is correct
95	Correct	8 ms	6696 KB	Output is correct
96	Correct	8 ms	6640 KB	Output is correct
97	Correct	8 ms	6896 KB	Output is correct
98	Correct	8 ms	6640 KB	Output is correct
99	Correct	8 ms	6640 KB	Output is correct
100	Correct	8 ms	6640 KB	Output is correct
101	Correct	8 ms	6976 KB	Output is correct
102	Correct	8 ms	6640 KB	Output is correct
103	Correct	8 ms	6896 KB	Output is correct
104	Correct	8 ms	6896 KB	Output is correct
105	Correct	8 ms	6992 KB	Output is correct
106	Correct	8 ms	6736 KB	Output is correct
107	Correct	8 ms	6992 KB	Output is correct
108	Correct	8 ms	6640 KB	Output is correct
109	Correct	8 ms	6632 KB	Output is correct
110	Correct	8 ms	6640 KB	Output is correct
111	Correct	8 ms	6736 KB	Output is correct
112	Correct	8 ms	6784 KB	Output is correct
113	Correct	8 ms	6896 KB	Output is correct
114	Correct	7 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	6952 KB	Output is correct
118	Correct	8 ms	6736 KB	Output is correct

Subtask #3
63.0 / 63.0

#	결과	실행 시간	메모리	Grader output
1	Correct	649 ms	30712 KB	Output is correct : V - N = 12
2	Correct	544 ms	26764 KB	Output is correct : V - N = 12
3	Correct	205 ms	14948 KB	Output is correct : V - N = 12
4	Correct	15 ms	7312 KB	Output is correct : V - N = 12
5	Correct	157 ms	11504 KB	Output is correct : V - N = 12
6	Correct	483 ms	24808 KB	Output is correct : V - N = 12
7	Correct	726 ms	30096 KB	Output is correct : V - N = 12
8	Correct	611 ms	28392 KB	Output is correct : V - N = 12
9	Correct	337 ms	17344 KB	Output is correct : V - N = 12
10	Correct	34 ms	8312 KB	Output is correct : V - N = 12
11	Correct	65 ms	9040 KB	Output is correct : V - N = 12
12	Correct	355 ms	19356 KB	Output is correct : V - N = 12
13	Correct	686 ms	29032 KB	Output is correct : V - N = 12
14	Correct	680 ms	29580 KB	Output is correct : V - N = 12
15	Correct	425 ms	23624 KB	Output is correct : V - N = 12
16	Correct	98 ms	10080 KB	Output is correct : V - N = 12
17	Correct	19 ms	7664 KB	Output is correct : V - N = 12
18	Correct	259 ms	16152 KB	Output is correct : V - N = 12
19	Correct	565 ms	27716 KB	Output is correct : V - N = 12
20	Correct	671 ms	30544 KB	Output is correct : V - N = 12
21	Correct	192 ms	13304 KB	Output is correct : V - N = 12
22	Correct	122 ms	11728 KB	Output is correct : V - N = 12
23	Correct	50 ms	8808 KB	Output is correct : V - N = 12
24	Correct	10 ms	6896 KB	Output is correct : V - N = 12
25	Correct	39 ms	8104 KB	Output is correct : V - N = 12
26	Correct	138 ms	11024 KB	Output is correct : V - N = 12
27	Correct	172 ms	13088 KB	Output is correct : V - N = 12
28	Correct	174 ms	12424 KB	Output is correct : V - N = 12
29	Correct	100 ms	9888 KB	Output is correct : V - N = 12
30	Correct	13 ms	7408 KB	Output is correct : V - N = 12
31	Correct	13 ms	7240 KB	Output is correct : V - N = 12
32	Correct	13 ms	7240 KB	Output is correct : V - N = 12
33	Correct	13 ms	7360 KB	Output is correct : V - N = 12
34	Correct	13 ms	7152 KB	Output is correct : V - N = 12
35	Correct	13 ms	7152 KB	Output is correct : V - N = 12
36	Correct	691 ms	30712 KB	Output is correct : V - N = 12
37	Correct	652 ms	30744 KB	Output is correct : V - N = 12
38	Correct	719 ms	30640 KB	Output is correct : V - N = 12
39	Correct	697 ms	30560 KB	Output is correct : V - N = 12
40	Correct	674 ms	30584 KB	Output is correct : V - N = 12
41	Correct	133 ms	11072 KB	Output is correct : V - N = 12
42	Correct	123 ms	10200 KB	Output is correct : V - N = 12
43	Correct	110 ms	10628 KB	Output is correct : V - N = 12
44	Correct	14 ms	7240 KB	Output is correct : V - N = 12
45	Correct	76 ms	9088 KB	Output is correct : V - N = 12
46	Correct	210 ms	15404 KB	Output is correct : V - N = 12
47	Correct	117 ms	10960 KB	Output is correct : V - N = 12
48	Correct	320 ms	17496 KB	Output is correct : V - N = 12
49	Correct	63 ms	8880 KB	Output is correct : V - N = 12
50	Correct	23 ms	7664 KB	Output is correct : V - N = 12
51	Correct	536 ms	26676 KB	Output is correct : V - N = 12
52	Correct	15 ms	7408 KB	Output is correct : V - N = 12
53	Correct	461 ms	24580 KB	Output is correct : V - N = 12
54	Correct	617 ms	28056 KB	Output is correct : V - N = 12
55	Correct	40 ms	8264 KB	Output is correct : V - N = 12
56	Correct	405 ms	18836 KB	Output is correct : V - N = 12
57	Correct	651 ms	29184 KB	Output is correct : V - N = 12
58	Correct	97 ms	9896 KB	Output is correct : V - N = 12
59	Correct	242 ms	15964 KB	Output is correct : V - N = 12
60	Correct	695 ms	29724 KB	Output is correct : V - N = 12
61	Correct	8 ms	6640 KB	Output is correct : V - N = 12
62	Correct	8 ms	6896 KB	Output is correct : V - N = 12
63	Correct	8 ms	6896 KB	Output is correct : V - N = 12
64	Correct	8 ms	6640 KB	Output is correct : V - N = 12
65	Correct	7 ms	6896 KB	Output is correct : V - N = 12
66	Correct	8 ms	6640 KB	Output is correct : V - N = 12
67	Correct	8 ms	6864 KB	Output is correct : V - N = 12
68	Correct	8 ms	6896 KB	Output is correct : V - N = 12
69	Correct	8 ms	6640 KB	Output is correct : V - N = 12
70	Correct	7 ms	6640 KB	Output is correct : V - N = 12
71	Correct	8 ms	6640 KB	Output is correct : V - N = 12
72	Correct	8 ms	6640 KB	Output is correct : V - N = 12
73	Correct	8 ms	6896 KB	Output is correct : V - N = 12
74	Correct	8 ms	6640 KB	Output is correct : V - N = 12
75	Correct	8 ms	6848 KB	Output is correct : V - N = 12
76	Correct	8 ms	6896 KB	Output is correct : V - N = 12
77	Correct	8 ms	6736 KB	Output is correct : V - N = 12
78	Correct	8 ms	6640 KB	Output is correct : V - N = 12
79	Correct	8 ms	6688 KB	Output is correct : V - N = 12
80	Correct	8 ms	6704 KB	Output is correct : V - N = 12
81	Correct	8 ms	6640 KB	Output is correct : V - N = 12
82	Correct	8 ms	6640 KB	Output is correct : V - N = 12
83	Correct	8 ms	6896 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	6896 KB	Output is correct : V - N = 12
87	Correct	8 ms	6640 KB	Output is correct : V - N = 12
88	Correct	8 ms	6640 KB	Output is correct : V - N = 12
89	Correct	8 ms	6792 KB	Output is correct : V - N = 12
90	Correct	8 ms	6608 KB	Output is correct : V - N = 12
91	Correct	8 ms	6896 KB	Output is correct : V - N = 12
92	Correct	8 ms	6640 KB	Output is correct : V - N = 12
93	Correct	8 ms	6640 KB	Output is correct : V - N = 12
94	Correct	8 ms	6896 KB	Output is correct : V - N = 12
95	Correct	8 ms	6640 KB	Output is correct : V - N = 12
96	Correct	8 ms	6640 KB	Output is correct : V - N = 12
97	Correct	8 ms	6640 KB	Output is correct : V - N = 12
98	Correct	8 ms	6648 KB	Output is correct : V - N = 12
99	Correct	8 ms	6896 KB	Output is correct : V - N = 12
100	Correct	8 ms	6640 KB	Output is correct : V - N = 12
101	Correct	8 ms	6896 KB	Output is correct : V - N = 12
102	Correct	8 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	6640 KB	Output is correct : V - N = 12
105	Correct	8 ms	6896 KB	Output is correct : V - N = 12
106	Correct	8 ms	6776 KB	Output is correct : V - N = 12
107	Correct	8 ms	6640 KB	Output is correct : V - N = 12
108	Correct	8 ms	6904 KB	Output is correct : V - N = 12
109	Correct	8 ms	6896 KB	Output is correct : V - N = 12
110	Correct	8 ms	6640 KB	Output is correct : V - N = 12
111	Correct	8 ms	6736 KB	Output is correct : V - N = 12
112	Correct	7 ms	6896 KB	Output is correct : V - N = 12
113	Correct	8 ms	6640 KB	Output is correct : V - N = 12
114	Correct	7 ms	6640 KB	Output is correct : V - N = 12
115	Correct	8 ms	6640 KB	Output is correct : V - N = 12
116	Correct	8 ms	6904 KB	Output is correct : V - N = 12
117	Correct	7 ms	6896 KB	Output is correct : V - N = 12
118	Correct	7 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	6648 KB	Output is correct : V - N = 12
121	Correct	7 ms	6896 KB	Output is correct : V - N = 12
122	Correct	6 ms	6896 KB	Output is correct : V - N = 12
123	Correct	7 ms	6640 KB	Output is correct : V - N = 12
124	Correct	7 ms	6800 KB	Output is correct : V - N = 12
125	Correct	8 ms	7160 KB	Output is correct : V - N = 12
126	Correct	8 ms	6896 KB	Output is correct : V - N = 12
127	Correct	6 ms	6640 KB	Output is correct : V - N = 12
128	Correct	6 ms	6640 KB	Output is correct : V - N = 12
129	Correct	8 ms	6824 KB	Output is correct : V - N = 12
130	Correct	7 ms	7160 KB	Output is correct : V - N = 12
131	Correct	7 ms	6896 KB	Output is correct : V - N = 12
132	Correct	8 ms	6640 KB	Output is correct : V - N = 12
133	Correct	8 ms	6736 KB	Output is correct : V - N = 12
134	Correct	7 ms	6896 KB	Output is correct : V - N = 12
135	Correct	7 ms	6896 KB	Output is correct : V - N = 12
136	Correct	6 ms	6792 KB	Output is correct : V - N = 12
137	Correct	7 ms	7152 KB	Output is correct : V - N = 12
138	Correct	6 ms	6896 KB	Output is correct : V - N = 12
139	Correct	7 ms	6736 KB	Output is correct : V - N = 12
140	Correct	6 ms	6896 KB	Output is correct : V - N = 12
141	Correct	7 ms	6736 KB	Output is correct : V - N = 12
142	Correct	6 ms	6896 KB	Output is correct : V - N = 12
143	Correct	8 ms	6640 KB	Output is correct : V - N = 12
144	Correct	7 ms	6896 KB	Output is correct : V - N = 12
145	Correct	7 ms	6640 KB	Output is correct : V - N = 12
146	Correct	8 ms	6896 KB	Output is correct : V - N = 12
147	Correct	12 ms	6896 KB	Output is correct : V - N = 12
148	Correct	6 ms	6896 KB	Output is correct : V - N = 12
149	Correct	7 ms	6640 KB	Output is correct : V - N = 12
150	Correct	6 ms	6896 KB	Output is correct : V - N = 12
151	Correct	6 ms	6896 KB	Output is correct : V - N = 12
152	Correct	6 ms	6640 KB	Output is correct : V - N = 12
153	Correct	7 ms	6896 KB	Output is correct : V - N = 12
154	Correct	7 ms	6896 KB	Output is correct : V - N = 12
155	Correct	7 ms	6896 KB	Output is correct : V - N = 12
156	Correct	7 ms	6896 KB	Output is correct : V - N = 12
157	Correct	6 ms	6640 KB	Output is correct : V - N = 12
158	Correct	7 ms	6640 KB	Output is correct : V - N = 12
159	Correct	8 ms	6816 KB	Output is correct : V - N = 12
160	Correct	8 ms	6896 KB	Output is correct : V - N = 12
161	Correct	8 ms	6896 KB	Output is correct : V - N = 12
162	Correct	8 ms	6896 KB	Output is correct : V - N = 12
163	Correct	8 ms	6640 KB	Output is correct : V - N = 12
164	Correct	8 ms	6640 KB	Output is correct : V - N = 12
165	Correct	8 ms	6896 KB	Output is correct : V - N = 12
166	Correct	7 ms	6896 KB	Output is correct : V - N = 12
167	Correct	7 ms	6768 KB	Output is correct : V - N = 12
168	Correct	8 ms	6896 KB	Output is correct : V - N = 12
169	Correct	7 ms	6640 KB	Output is correct : V - N = 12
170	Correct	8 ms	6992 KB	Output is correct : V - N = 12
171	Correct	7 ms	6640 KB	Output is correct : V - N = 12
172	Correct	8 ms	6640 KB	Output is correct : V - N = 12
173	Correct	7 ms	6896 KB	Output is correct : V - N = 12
174	Correct	7 ms	6640 KB	Output is correct : V - N = 12
175	Correct	7 ms	6648 KB	Output is correct : V - N = 12
176	Correct	8 ms	6640 KB	Output is correct : V - N = 12
177	Correct	8 ms	6640 KB	Output is correct : V - N = 12
178	Correct	7 ms	6640 KB	Output is correct : V - N = 12

답안 #73726

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