답안 #73725 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
73725	2018-08-28T19:13:40 Z	TadijaSebez	항공 노선도 (JOI18_airline)	C++11	37 / 100	666 ms	30608 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;
	for(i=0;i<N;i++)
	{
		while(__builtin_popcount(k)==9) k++;
		my[k]=i;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==N/2 && 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	6816 KB	Output is correct
2	Correct	7 ms	6736 KB	Output is correct
3	Correct	8 ms	6640 KB	Output is correct
4	Correct	8 ms	6904 KB	Output is correct
5	Correct	7 ms	6640 KB	Output is correct
6	Correct	8 ms	6640 KB	Output is correct
7	Correct	8 ms	6896 KB	Output is correct
8	Correct	8 ms	6640 KB	Output is correct
9	Correct	8 ms	6736 KB	Output is correct
10	Correct	8 ms	6736 KB	Output is correct
11	Correct	7 ms	6736 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	8 ms	6640 KB	Output is correct
16	Correct	7 ms	6896 KB	Output is correct
17	Correct	8 ms	6896 KB	Output is correct
18	Correct	8 ms	6640 KB	Output is correct
19	Correct	7 ms	6640 KB	Output is correct
20	Correct	8 ms	6736 KB	Output is correct
21	Correct	7 ms	6896 KB	Output is correct
22	Correct	8 ms	6640 KB	Output is correct
23	Correct	7 ms	6632 KB	Output is correct
24	Correct	8 ms	6640 KB	Output is correct
25	Correct	8 ms	6640 KB	Output is correct
26	Correct	8 ms	6640 KB	Output is correct
27	Correct	7 ms	6640 KB	Output is correct
28	Correct	8 ms	6752 KB	Output is correct
29	Correct	8 ms	6640 KB	Output is correct
30	Correct	8 ms	6896 KB	Output is correct
31	Correct	8 ms	6952 KB	Output is correct
32	Correct	8 ms	6640 KB	Output is correct
33	Correct	8 ms	6640 KB	Output is correct
34	Correct	7 ms	6640 KB	Output is correct
35	Correct	7 ms	6640 KB	Output is correct
36	Correct	8 ms	6896 KB	Output is correct
37	Correct	8 ms	6896 KB	Output is correct
38	Correct	8 ms	6896 KB	Output is correct
39	Correct	8 ms	6736 KB	Output is correct
40	Correct	8 ms	6992 KB	Output is correct
41	Correct	8 ms	6640 KB	Output is correct
42	Correct	8 ms	6896 KB	Output is correct
43	Correct	7 ms	6896 KB	Output is correct
44	Correct	8 ms	6896 KB	Output is correct
45	Correct	7 ms	6640 KB	Output is correct
46	Correct	6 ms	6640 KB	Output is correct
47	Correct	7 ms	6640 KB	Output is correct
48	Correct	8 ms	6736 KB	Output is correct
49	Correct	7 ms	6896 KB	Output is correct
50	Correct	8 ms	6640 KB	Output is correct
51	Correct	7 ms	6640 KB	Output is correct
52	Correct	7 ms	6640 KB	Output is correct
53	Correct	8 ms	6736 KB	Output is correct
54	Correct	7 ms	6896 KB	Output is correct
55	Correct	8 ms	6768 KB	Output is correct
56	Correct	7 ms	6640 KB	Output is correct
57	Correct	7 ms	6584 KB	Output is correct
58	Correct	7 ms	6640 KB	Output is correct

Subtask #2
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	8 ms	6816 KB	Output is correct
2	Correct	7 ms	6736 KB	Output is correct
3	Correct	8 ms	6640 KB	Output is correct
4	Correct	8 ms	6904 KB	Output is correct
5	Correct	7 ms	6640 KB	Output is correct
6	Correct	8 ms	6640 KB	Output is correct
7	Correct	8 ms	6896 KB	Output is correct
8	Correct	8 ms	6640 KB	Output is correct
9	Correct	8 ms	6736 KB	Output is correct
10	Correct	8 ms	6736 KB	Output is correct
11	Correct	7 ms	6736 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	8 ms	6640 KB	Output is correct
16	Correct	7 ms	6896 KB	Output is correct
17	Correct	8 ms	6896 KB	Output is correct
18	Correct	8 ms	6640 KB	Output is correct
19	Correct	7 ms	6640 KB	Output is correct
20	Correct	8 ms	6736 KB	Output is correct
21	Correct	7 ms	6896 KB	Output is correct
22	Correct	8 ms	6640 KB	Output is correct
23	Correct	7 ms	6632 KB	Output is correct
24	Correct	8 ms	6640 KB	Output is correct
25	Correct	8 ms	6640 KB	Output is correct
26	Correct	8 ms	6640 KB	Output is correct
27	Correct	7 ms	6640 KB	Output is correct
28	Correct	8 ms	6752 KB	Output is correct
29	Correct	8 ms	6640 KB	Output is correct
30	Correct	8 ms	6896 KB	Output is correct
31	Correct	8 ms	6952 KB	Output is correct
32	Correct	8 ms	6640 KB	Output is correct
33	Correct	8 ms	6640 KB	Output is correct
34	Correct	7 ms	6640 KB	Output is correct
35	Correct	7 ms	6640 KB	Output is correct
36	Correct	8 ms	6896 KB	Output is correct
37	Correct	8 ms	6896 KB	Output is correct
38	Correct	8 ms	6896 KB	Output is correct
39	Correct	8 ms	6736 KB	Output is correct
40	Correct	8 ms	6992 KB	Output is correct
41	Correct	8 ms	6640 KB	Output is correct
42	Correct	8 ms	6896 KB	Output is correct
43	Correct	7 ms	6896 KB	Output is correct
44	Correct	8 ms	6896 KB	Output is correct
45	Correct	7 ms	6640 KB	Output is correct
46	Correct	6 ms	6640 KB	Output is correct
47	Correct	7 ms	6640 KB	Output is correct
48	Correct	8 ms	6736 KB	Output is correct
49	Correct	7 ms	6896 KB	Output is correct
50	Correct	8 ms	6640 KB	Output is correct
51	Correct	7 ms	6640 KB	Output is correct
52	Correct	7 ms	6640 KB	Output is correct
53	Correct	8 ms	6736 KB	Output is correct
54	Correct	7 ms	6896 KB	Output is correct
55	Correct	8 ms	6768 KB	Output is correct
56	Correct	7 ms	6640 KB	Output is correct
57	Correct	7 ms	6584 KB	Output is correct
58	Correct	7 ms	6640 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	6640 KB	Output is correct
62	Correct	8 ms	6640 KB	Output is correct
63	Correct	8 ms	6896 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	6720 KB	Output is correct
67	Correct	8 ms	6656 KB	Output is correct
68	Correct	8 ms	6640 KB	Output is correct
69	Correct	8 ms	6896 KB	Output is correct
70	Correct	8 ms	6728 KB	Output is correct
71	Correct	8 ms	6896 KB	Output is correct
72	Correct	8 ms	6720 KB	Output is correct
73	Correct	8 ms	6640 KB	Output is correct
74	Correct	8 ms	6896 KB	Output is correct
75	Correct	8 ms	6640 KB	Output is correct
76	Correct	8 ms	6736 KB	Output is correct
77	Correct	8 ms	6896 KB	Output is correct
78	Correct	8 ms	6736 KB	Output is correct
79	Correct	8 ms	6840 KB	Output is correct
80	Correct	8 ms	6640 KB	Output is correct
81	Correct	8 ms	6640 KB	Output is correct
82	Correct	8 ms	6640 KB	Output is correct
83	Correct	8 ms	6728 KB	Output is correct
84	Correct	8 ms	6640 KB	Output is correct
85	Correct	8 ms	6640 KB	Output is correct
86	Correct	7 ms	6736 KB	Output is correct
87	Correct	8 ms	6640 KB	Output is correct
88	Correct	8 ms	6640 KB	Output is correct
89	Correct	8 ms	6896 KB	Output is correct
90	Correct	7 ms	6640 KB	Output is correct
91	Correct	8 ms	6640 KB	Output is correct
92	Correct	8 ms	6640 KB	Output is correct
93	Correct	8 ms	7000 KB	Output is correct
94	Correct	8 ms	6864 KB	Output is correct
95	Correct	8 ms	6896 KB	Output is correct
96	Correct	8 ms	6640 KB	Output is correct
97	Correct	9 ms	6896 KB	Output is correct
98	Correct	8 ms	6640 KB	Output is correct
99	Correct	7 ms	7152 KB	Output is correct
100	Correct	10 ms	6640 KB	Output is correct
101	Correct	6 ms	6640 KB	Output is correct
102	Correct	7 ms	6896 KB	Output is correct
103	Correct	7 ms	6640 KB	Output is correct
104	Correct	6 ms	6640 KB	Output is correct
105	Correct	8 ms	6896 KB	Output is correct
106	Correct	13 ms	6640 KB	Output is correct
107	Correct	8 ms	6736 KB	Output is correct
108	Correct	8 ms	6640 KB	Output is correct
109	Correct	8 ms	6896 KB	Output is correct
110	Correct	8 ms	6640 KB	Output is correct
111	Correct	7 ms	6896 KB	Output is correct
112	Correct	8 ms	6640 KB	Output is correct
113	Correct	8 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	6896 KB	Output is correct
117	Correct	8 ms	6640 KB	Output is correct
118	Correct	8 ms	6896 KB	Output is correct

Subtask #3
0 / 63.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	666 ms	30608 KB	Wrong Answer [12]
2	Halted	0 ms	0 KB	-

답안 #73725

Compilation message

Subtask #1 22.0 / 22.0

Subtask #2 15.0 / 15.0

Subtask #3 0 / 63.0

Subtask #1
22.0 / 22.0

Subtask #2
15.0 / 15.0

Subtask #3
0 / 63.0