Submission #95399

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
95399	2019-01-31T13:48:57 Z	Retro3014	Airline Route Map (JOI18_airline)	C++17	37 / 100	701 ms	30976 KB

Alice
Bob

#include "Alicelib.h"
#include <cassert>
#include <cstdio>
#include <algorithm>
#include <iostream>
#include <vector>
#include <stdio.h>

using namespace std;

vector<pair<int, int> > Edge;

void Alice(int N, int M, int A[], int B[] ){
	for(int i=0; i<M; i++){
		Edge.push_back(make_pair(A[i], B[i]));
	}
	int two = 1;
	for(int i=0; i<10; i++){
		for(int j=0; j<N; j++){
			if((j&two)!=0){
				Edge.push_back(make_pair(j, i+N));
			}
		}
		two*=2;
	}
	for(int i=0; i<N; i++){
		Edge.push_back(make_pair(N+10, i));
		Edge.push_back(make_pair(N+11, i));
	}
	for(int i=0; i<9; i++){
		Edge.push_back(make_pair(N+i, N+10));
		Edge.push_back(make_pair(N+i, N+i+1));
	}
	InitG(N+12, Edge.size());
	for(int i=0; i<Edge.size(); i++){
		MakeG(i, Edge[i].first, Edge[i].second);
	}
	return;
}

#include "Boblib.h"
#include <cassert>
#include <cstdio>
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <iostream>

using namespace std;

#define MAX_V 1012

vector<int> gp[MAX_V+1];
bool chk[MAX_V+1];
int index[MAX_V+1];
bool vst[MAX_V+1];
bool f[MAX_V+1];

vector<pair<int, int> > edge;

void Bob( int V, int U, int C[], int D[] ){
	for(int i=0; i<U; i++){
		gp[C[i]].push_back(D[i]);
		gp[D[i]].push_back(C[i]);
	}
	int idx = 0;
	for(int i=1; i<V; i++){
		if(gp[i].size()>gp[idx].size()){
			idx = i;
		}
	}
	for(int i=0; i<gp[idx].size(); i++){
		vst[gp[idx][i]] = true;
	}
	int a = 0, b = 0;
	for(int i=0; i<V; i++){
		if(i==idx)	continue;
		if(vst[i]==false){
			if(a==0)	a = i;
			else	b = i;
		}
	}
	if(gp[a].size()>gp[b].size()){int tmp = a; a = b; b = tmp;}
	for(int i=0; i<V; i++){
		chk[i] = true;
	}
	chk[idx] = false; chk[b] = false;
	for(int i=0; i<gp[b].size(); i++){
		chk[gp[b][i]] = false;
	}
	int two = (1<<9);
	for(int T=0; T<10; T++){
		int nxt = 0;
		for(int i=0; i<gp[a].size(); i++){
			if(chk[gp[a][i]]){
				if(!f[gp[a][i]]){
					nxt = gp[a][i];
				}
				continue;
			}
			index[gp[a][i]]+=two;
		}
		f[a] = true;
		a = nxt;
		two/=2;
	}
	chk[idx] = true; chk[b] = true;
	for(int i=0; i<U; i++){
		if(chk[D[i]] || chk[C[i]])	continue;
		edge.push_back(make_pair(index[D[i]], index[C[i]]));
	}
	InitMap(V-12, edge.size());
	for(int i=0; i<edge.size(); i++){
		MakeMap(edge[i].first, edge[i].second);
	}
	return;
}

Compilation message

Alice.cpp: In function 'void Alice(int, int, int*, int*)':
Alice.cpp:35:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0; i<Edge.size(); i++){
               ~^~~~~~~~~~~~

Bob.cpp: In function 'void Bob(int, int, int*, int*)':
Bob.cpp:32:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0; i<gp[idx].size(); i++){
               ~^~~~~~~~~~~~~~~
Bob.cpp:48:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0; i<gp[b].size(); i++){
               ~^~~~~~~~~~~~~
Bob.cpp:54:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i=0; i<gp[a].size(); i++){
                ~^~~~~~~~~~~~~
Bob.cpp:73:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0; i<edge.size(); i++){
               ~^~~~~~~~~~~~

Subtask #1
22.0 / 22.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	8 ms	6640 KB	Output is correct
2	Correct	8 ms	6640 KB	Output is correct
3	Correct	8 ms	6640 KB	Output is correct
4	Correct	8 ms	6896 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	6896 KB	Output is correct
8	Correct	7 ms	6640 KB	Output is correct
9	Correct	7 ms	6640 KB	Output is correct
10	Correct	7 ms	6896 KB	Output is correct
11	Correct	6 ms	6640 KB	Output is correct
12	Correct	6 ms	6640 KB	Output is correct
13	Correct	7 ms	6896 KB	Output is correct
14	Correct	8 ms	6648 KB	Output is correct
15	Correct	8 ms	6640 KB	Output is correct
16	Correct	8 ms	6640 KB	Output is correct
17	Correct	8 ms	6640 KB	Output is correct
18	Correct	8 ms	6640 KB	Output is correct
19	Correct	8 ms	6648 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	8 ms	6640 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	6896 KB	Output is correct
27	Correct	8 ms	6896 KB	Output is correct
28	Correct	8 ms	6640 KB	Output is correct
29	Correct	6 ms	6640 KB	Output is correct
30	Correct	6 ms	6640 KB	Output is correct
31	Correct	8 ms	6640 KB	Output is correct
32	Correct	7 ms	6896 KB	Output is correct
33	Correct	8 ms	6640 KB	Output is correct
34	Correct	7 ms	6896 KB	Output is correct
35	Correct	7 ms	6896 KB	Output is correct
36	Correct	7 ms	6640 KB	Output is correct
37	Correct	8 ms	6896 KB	Output is correct
38	Correct	6 ms	6640 KB	Output is correct
39	Correct	8 ms	6744 KB	Output is correct
40	Correct	8 ms	6896 KB	Output is correct
41	Correct	8 ms	6640 KB	Output is correct
42	Correct	8 ms	6640 KB	Output is correct
43	Correct	8 ms	6896 KB	Output is correct
44	Correct	8 ms	6928 KB	Output is correct
45	Correct	8 ms	6640 KB	Output is correct
46	Correct	8 ms	6672 KB	Output is correct
47	Correct	8 ms	6640 KB	Output is correct
48	Correct	8 ms	6896 KB	Output is correct
49	Correct	8 ms	6896 KB	Output is correct
50	Correct	8 ms	6640 KB	Output is correct
51	Correct	8 ms	6640 KB	Output is correct
52	Correct	8 ms	6648 KB	Output is correct
53	Correct	8 ms	6640 KB	Output is correct
54	Correct	8 ms	6640 KB	Output is correct
55	Correct	7 ms	6640 KB	Output is correct
56	Correct	8 ms	6896 KB	Output is correct
57	Correct	8 ms	6640 KB	Output is correct
58	Correct	8 ms	6640 KB	Output is correct

Subtask #2
15.0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	8 ms	6640 KB	Output is correct
2	Correct	8 ms	6640 KB	Output is correct
3	Correct	8 ms	6640 KB	Output is correct
4	Correct	8 ms	6896 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	6896 KB	Output is correct
8	Correct	7 ms	6640 KB	Output is correct
9	Correct	7 ms	6640 KB	Output is correct
10	Correct	7 ms	6896 KB	Output is correct
11	Correct	6 ms	6640 KB	Output is correct
12	Correct	6 ms	6640 KB	Output is correct
13	Correct	7 ms	6896 KB	Output is correct
14	Correct	8 ms	6648 KB	Output is correct
15	Correct	8 ms	6640 KB	Output is correct
16	Correct	8 ms	6640 KB	Output is correct
17	Correct	8 ms	6640 KB	Output is correct
18	Correct	8 ms	6640 KB	Output is correct
19	Correct	8 ms	6648 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	8 ms	6640 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	6896 KB	Output is correct
27	Correct	8 ms	6896 KB	Output is correct
28	Correct	8 ms	6640 KB	Output is correct
29	Correct	6 ms	6640 KB	Output is correct
30	Correct	6 ms	6640 KB	Output is correct
31	Correct	8 ms	6640 KB	Output is correct
32	Correct	7 ms	6896 KB	Output is correct
33	Correct	8 ms	6640 KB	Output is correct
34	Correct	7 ms	6896 KB	Output is correct
35	Correct	7 ms	6896 KB	Output is correct
36	Correct	7 ms	6640 KB	Output is correct
37	Correct	8 ms	6896 KB	Output is correct
38	Correct	6 ms	6640 KB	Output is correct
39	Correct	8 ms	6744 KB	Output is correct
40	Correct	8 ms	6896 KB	Output is correct
41	Correct	8 ms	6640 KB	Output is correct
42	Correct	8 ms	6640 KB	Output is correct
43	Correct	8 ms	6896 KB	Output is correct
44	Correct	8 ms	6928 KB	Output is correct
45	Correct	8 ms	6640 KB	Output is correct
46	Correct	8 ms	6672 KB	Output is correct
47	Correct	8 ms	6640 KB	Output is correct
48	Correct	8 ms	6896 KB	Output is correct
49	Correct	8 ms	6896 KB	Output is correct
50	Correct	8 ms	6640 KB	Output is correct
51	Correct	8 ms	6640 KB	Output is correct
52	Correct	8 ms	6648 KB	Output is correct
53	Correct	8 ms	6640 KB	Output is correct
54	Correct	8 ms	6640 KB	Output is correct
55	Correct	7 ms	6640 KB	Output is correct
56	Correct	8 ms	6896 KB	Output is correct
57	Correct	8 ms	6640 KB	Output is correct
58	Correct	8 ms	6640 KB	Output is correct
59	Correct	8 ms	6896 KB	Output is correct
60	Correct	8 ms	6896 KB	Output is correct
61	Correct	8 ms	6896 KB	Output is correct
62	Correct	8 ms	6640 KB	Output is correct
63	Correct	7 ms	6648 KB	Output is correct
64	Correct	7 ms	6640 KB	Output is correct
65	Correct	8 ms	6800 KB	Output is correct
66	Correct	8 ms	6640 KB	Output is correct
67	Correct	9 ms	6648 KB	Output is correct
68	Correct	8 ms	6896 KB	Output is correct
69	Correct	8 ms	6896 KB	Output is correct
70	Correct	8 ms	6640 KB	Output is correct
71	Correct	9 ms	6640 KB	Output is correct
72	Correct	8 ms	6640 KB	Output is correct
73	Correct	8 ms	6640 KB	Output is correct
74	Correct	8 ms	6640 KB	Output is correct
75	Correct	8 ms	6896 KB	Output is correct
76	Correct	8 ms	6896 KB	Output is correct
77	Correct	8 ms	6896 KB	Output is correct
78	Correct	8 ms	6640 KB	Output is correct
79	Correct	8 ms	6640 KB	Output is correct
80	Correct	8 ms	6896 KB	Output is correct
81	Correct	8 ms	6640 KB	Output is correct
82	Correct	8 ms	6896 KB	Output is correct
83	Correct	8 ms	6696 KB	Output is correct
84	Correct	8 ms	6896 KB	Output is correct
85	Correct	8 ms	6640 KB	Output is correct
86	Correct	8 ms	6896 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	6640 KB	Output is correct
90	Correct	8 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	6640 KB	Output is correct
94	Correct	8 ms	6640 KB	Output is correct
95	Correct	8 ms	6640 KB	Output is correct
96	Correct	8 ms	6640 KB	Output is correct
97	Correct	9 ms	6936 KB	Output is correct
98	Correct	8 ms	6648 KB	Output is correct
99	Correct	8 ms	6744 KB	Output is correct
100	Correct	8 ms	6896 KB	Output is correct
101	Correct	8 ms	6640 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	6896 KB	Output is correct
106	Correct	8 ms	6928 KB	Output is correct
107	Correct	8 ms	6640 KB	Output is correct
108	Correct	8 ms	6736 KB	Output is correct
109	Correct	8 ms	6648 KB	Output is correct
110	Correct	7 ms	6640 KB	Output is correct
111	Correct	8 ms	6640 KB	Output is correct
112	Correct	8 ms	6640 KB	Output is correct
113	Correct	7 ms	6640 KB	Output is correct
114	Correct	6 ms	6640 KB	Output is correct
115	Correct	7 ms	6896 KB	Output is correct
116	Correct	7 ms	6696 KB	Output is correct
117	Correct	8 ms	6640 KB	Output is correct
118	Correct	8 ms	6640 KB	Output is correct

Subtask #3
0 / 63.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	701 ms	30976 KB	Wrong Answer [11]
2	Halted	0 ms	0 KB	-

Submission #95399

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