oj.uz

Submission #62423

# Submission time Handle Problem Language Result Execution time Memory
62423 2018-07-28T12:32:18 Z gusfring Airline Route Map (JOI18_airline) C++14
37 / 100
 696 ms 30488 KB 
#include "Alicelib.h"
#include <cassert>
#include <cstdio>
#include <algorithm>
#include <vector>
using namespace std;
 
void Alice( int N, int M, int A[], int B[] ){
	vector<pair<int,int>> G;
	for(int i = 0 ; i < M ; i ++){
		G.push_back(pair<int,int>(A[i],B[i]));
	}
	for(int i = 0 ; i < 10 ; i ++){
		for(int j = 0 ; j < N ; j ++){
			if((j>>i)&1)G.push_back(pair<int,int>(N+i,j));
		}
		G.push_back(pair<int,int>(N+i,N+10));
		if(i < 9)G.push_back(pair<int,int>(N+i,N+i+1));
	}
	for(int i = 0 ; i < N+10 ; i ++){
		G.push_back(pair<int,int>(i,N+11));
	}
	InitG( N+12, G.size() );
	for(int i = 0 ; i < G.size() ; i ++){
		MakeG( i, G[i].first, G[i].second );
	}
}
#include "Boblib.h"
#include <cassert>
#include <cstdio>
#include <vector>
using namespace std;
 
void Bob( int V, int U, int C[], int D[] ){
	static int N = V-12;
	static int cnt[1020] = {};
	static bool edge[1020][1020];
	static bool used[1020];
	for(int i = 0 ; i < V ; i ++){
		used[i] = false;
		for(int j = 0 ; j < V ; j ++){
			edge[i][j] = false;
		}
	}
	for(int i = 0 ; i < U ; i ++){
		cnt[C[i]] ++;
		cnt[D[i]] ++;
		edge[C[i]][D[i]] = true;
		edge[D[i]][C[i]] = true;
	}
	static int a = -1;
	for(int i = 0 ; i < V ; i ++){
		if(cnt[i] == N+10){
			a = i;
			break;
		}
	}
	used[a] = true;
	static int b = -1;
	for(int i = 0 ; i < V ; i ++){
		if(a != i && !edge[i][a]){
			b = i;
			break;
		}
	}
	used[b] = true;
	static int c[10];
	for(int i = 0 ; i < V ; i ++){
		if(edge[i][b]){
			int cnt_c = 0;
			for(int j = 0 ; j < V ; j ++){
				if(edge[j][b] && edge[i][j])cnt_c ++;
			}
			if(cnt_c == 1){
				c[0] = i;
				int k = 1;
				while(k < 10){
					for(int j = 0 ; j < V ; j ++){
						if(edge[j][b] && edge[c[k-1]][j] && !(k >= 2 && j == c[k-2])){
							c[k] = j;
							break;
						}
					}
					k ++;
				}
				if(cnt[c[0]] < cnt[c[9]]){
					for(int j = 0 ; j < 5 ; j ++)swap(c[j],c[9-j]);
				}
				break;
			}
		}
	}
	for(int i = 0 ; i < 10 ; i ++){
		used[c[i]] = true;
	}
	static int id[1002] = {};
	for(int i = 0 ; i < V ; i ++){
		if(used[i])continue;
		for(int j = 0 ; j < 10 ; j ++){
			if(edge[i][c[j]])id[i] += 1<<j;
		}
	}
	vector<pair<int,int>> Map;
	for(int i = 0 ; i < V ; i ++){
		if(used[i])continue;
		for(int j = i+1 ; j < V ; j ++){
			if(used[j])continue;
			if(edge[i][j]){
				Map.push_back(pair<int,int>(id[i],id[j]));
			}
		}
	}
	InitMap( N, Map.size() );
	for(int i = 0 ; i < Map.size() ; i ++){
		MakeMap( Map[i].first, Map[i].second );
	}
}

Compilation message

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

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

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 6896 KB Output is correct
2 Correct 7 ms 6736 KB Output is correct
3 Correct 7 ms 6640 KB Output is correct
4 Correct 8 ms 6632 KB Output is correct
5 Correct 8 ms 6712 KB Output is correct
6 Correct 7 ms 6896 KB Output is correct
7 Correct 8 ms 6696 KB Output is correct
8 Correct 8 ms 6736 KB Output is correct
9 Correct 7 ms 6736 KB Output is correct
10 Correct 8 ms 6640 KB Output is correct
11 Correct 6 ms 6640 KB Output is correct
12 Correct 7 ms 6736 KB Output is correct
13 Correct 7 ms 6896 KB Output is correct
14 Correct 6 ms 6728 KB Output is correct
15 Correct 7 ms 6688 KB Output is correct
16 Correct 6 ms 6640 KB Output is correct
17 Correct 6 ms 6736 KB Output is correct
18 Correct 6 ms 6640 KB Output is correct
19 Correct 6 ms 6640 KB Output is correct
20 Correct 7 ms 6736 KB Output is correct
21 Correct 6 ms 6576 KB Output is correct
22 Correct 7 ms 6640 KB Output is correct
23 Correct 8 ms 6936 KB Output is correct
24 Correct 7 ms 6696 KB Output is correct
25 Correct 8 ms 6640 KB Output is correct
26 Correct 6 ms 6728 KB Output is correct
27 Correct 13 ms 6640 KB Output is correct
28 Correct 8 ms 6640 KB Output is correct
29 Correct 7 ms 6640 KB Output is correct
30 Correct 6 ms 6640 KB Output is correct
31 Correct 7 ms 6640 KB Output is correct
32 Correct 13 ms 6640 KB Output is correct
33 Correct 6 ms 6640 KB Output is correct
34 Correct 8 ms 6896 KB Output is correct
35 Correct 8 ms 6640 KB Output is correct
36 Correct 8 ms 6896 KB Output is correct
37 Correct 7 ms 6896 KB Output is correct
38 Correct 8 ms 6640 KB Output is correct
39 Correct 8 ms 6896 KB Output is correct
40 Correct 8 ms 6640 KB Output is correct
41 Correct 8 ms 6640 KB Output is correct
42 Correct 8 ms 6896 KB Output is correct
43 Correct 8 ms 6640 KB Output is correct
44 Correct 8 ms 6640 KB Output is correct
45 Correct 8 ms 6640 KB Output is correct
46 Correct 7 ms 6640 KB Output is correct
47 Correct 6 ms 6640 KB Output is correct
48 Correct 9 ms 6736 KB Output is correct
49 Correct 8 ms 6640 KB Output is correct
50 Correct 7 ms 6664 KB Output is correct
51 Correct 7 ms 6640 KB Output is correct
52 Correct 8 ms 6736 KB Output is correct
53 Correct 7 ms 6736 KB Output is correct
54 Correct 8 ms 6736 KB Output is correct
55 Correct 7 ms 6728 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 6736 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 6896 KB Output is correct
2 Correct 7 ms 6736 KB Output is correct
3 Correct 7 ms 6640 KB Output is correct
4 Correct 8 ms 6632 KB Output is correct
5 Correct 8 ms 6712 KB Output is correct
6 Correct 7 ms 6896 KB Output is correct
7 Correct 8 ms 6696 KB Output is correct
8 Correct 8 ms 6736 KB Output is correct
9 Correct 7 ms 6736 KB Output is correct
10 Correct 8 ms 6640 KB Output is correct
11 Correct 6 ms 6640 KB Output is correct
12 Correct 7 ms 6736 KB Output is correct
13 Correct 7 ms 6896 KB Output is correct
14 Correct 6 ms 6728 KB Output is correct
15 Correct 7 ms 6688 KB Output is correct
16 Correct 6 ms 6640 KB Output is correct
17 Correct 6 ms 6736 KB Output is correct
18 Correct 6 ms 6640 KB Output is correct
19 Correct 6 ms 6640 KB Output is correct
20 Correct 7 ms 6736 KB Output is correct
21 Correct 6 ms 6576 KB Output is correct
22 Correct 7 ms 6640 KB Output is correct
23 Correct 8 ms 6936 KB Output is correct
24 Correct 7 ms 6696 KB Output is correct
25 Correct 8 ms 6640 KB Output is correct
26 Correct 6 ms 6728 KB Output is correct
27 Correct 13 ms 6640 KB Output is correct
28 Correct 8 ms 6640 KB Output is correct
29 Correct 7 ms 6640 KB Output is correct
30 Correct 6 ms 6640 KB Output is correct
31 Correct 7 ms 6640 KB Output is correct
32 Correct 13 ms 6640 KB Output is correct
33 Correct 6 ms 6640 KB Output is correct
34 Correct 8 ms 6896 KB Output is correct
35 Correct 8 ms 6640 KB Output is correct
36 Correct 8 ms 6896 KB Output is correct
37 Correct 7 ms 6896 KB Output is correct
38 Correct 8 ms 6640 KB Output is correct
39 Correct 8 ms 6896 KB Output is correct
40 Correct 8 ms 6640 KB Output is correct
41 Correct 8 ms 6640 KB Output is correct
42 Correct 8 ms 6896 KB Output is correct
43 Correct 8 ms 6640 KB Output is correct
44 Correct 8 ms 6640 KB Output is correct
45 Correct 8 ms 6640 KB Output is correct
46 Correct 7 ms 6640 KB Output is correct
47 Correct 6 ms 6640 KB Output is correct
48 Correct 9 ms 6736 KB Output is correct
49 Correct 8 ms 6640 KB Output is correct
50 Correct 7 ms 6664 KB Output is correct
51 Correct 7 ms 6640 KB Output is correct
52 Correct 8 ms 6736 KB Output is correct
53 Correct 7 ms 6736 KB Output is correct
54 Correct 8 ms 6736 KB Output is correct
55 Correct 7 ms 6728 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 6736 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 6800 KB Output is correct
64 Correct 9 ms 6640 KB Output is correct
65 Correct 7 ms 6640 KB Output is correct
66 Correct 8 ms 6640 KB Output is correct
67 Correct 16 ms 6728 KB Output is correct
68 Correct 7 ms 6896 KB Output is correct
69 Correct 8 ms 6648 KB Output is correct
70 Correct 8 ms 6624 KB Output is correct
71 Correct 8 ms 6640 KB Output is correct
72 Correct 9 ms 6904 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 6736 KB Output is correct
76 Correct 8 ms 6640 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 6640 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 6640 KB Output is correct
84 Correct 8 ms 6784 KB Output is correct
85 Correct 8 ms 6640 KB Output is correct
86 Correct 8 ms 6640 KB Output is correct
87 Correct 8 ms 6608 KB Output is correct
88 Correct 7 ms 6576 KB Output is correct
89 Correct 7 ms 6896 KB Output is correct
90 Correct 7 ms 6896 KB Output is correct
91 Correct 8 ms 6736 KB Output is correct
92 Correct 7 ms 6640 KB Output is correct
93 Correct 8 ms 6640 KB Output is correct
94 Correct 8 ms 6664 KB Output is correct
95 Correct 8 ms 6640 KB Output is correct
96 Correct 8 ms 6896 KB Output is correct
97 Correct 8 ms 6640 KB Output is correct
98 Correct 8 ms 6736 KB Output is correct
99 Correct 8 ms 6728 KB Output is correct
100 Correct 8 ms 6736 KB Output is correct
101 Correct 8 ms 6896 KB Output is correct
102 Correct 8 ms 6640 KB Output is correct
103 Correct 8 ms 6640 KB Output is correct
104 Correct 8 ms 6640 KB Output is correct
105 Correct 8 ms 6640 KB Output is correct
106 Correct 8 ms 6648 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 6640 KB Output is correct
110 Correct 8 ms 6648 KB Output is correct
111 Correct 8 ms 6640 KB Output is correct
112 Correct 8 ms 6896 KB Output is correct
113 Correct 7 ms 6896 KB Output is correct
114 Correct 8 ms 6736 KB Output is correct
115 Correct 8 ms 6640 KB Output is correct
116 Correct 8 ms 6648 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

# Verdict Execution time Memory Grader output
1 Incorrect 696 ms 30488 KB Wrong Answer [14]
2 Halted 0 ms 0 KB -