답안 #362650

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
362650 2021-02-03T23:59:02 Z LucaDantas 항공 노선도 (JOI18_airline) C++17
37 / 100
647 ms 14880 KB
#include "Alicelib.h"
#include <cassert>
#include <cstdio>

constexpr int maxn = 1510;

int C[maxn], D[maxn];

bool on(int a, int b) {return a&(1<<b);}

void Alice( int N, int M, int A[], int B[] ){
	if(N <= 2) {
		InitG(N, M);
		for(int i = 0; i < M; i++)
			MakeG(i, A[i], B[i]);
		return;
	}
	for(int i = 0; i < M; i++)
		C[i] = A[i], D[i] = B[i];
	for(int i = 0; i < N; i++, M++)
		C[M] = N, D[M] = i;
	
	for(int i = 0; i < N; i++)
		for(int j = 0; j < 10; j++)
			if(on(i+1, j)) C[M] = N+1+j, D[M++] = i;
	
	for(int j = 0; j < 9; j++)
		C[M] = N+1+j, D[M++] = N+1+j+1;
	C[M] = N+11, D[M++] = N;

	InitG(N+12, M);
	for(int i = 0; i < M; i++)
		MakeG(i, C[i], D[i]);
}
#include "Boblib.h"
#include<vector>
#include <cassert>
#include <cstdio>

// InitMap( 3, 2 );
// MakeMap( 1, 2 );
// MakeMap( 1, 3 );

#define pb push_back

constexpr int maxn = 1510;

std::vector<int> g[maxn];

int val[maxn];

bool mark[maxn], vis[maxn];

void Bob( int V, int U, int C[], int D[] ){
	if(V <= 2) {
		InitMap(V, U);
		for(int i = 0; i < U; i++)
			MakeMap(C[i], D[i]);
		return;
	}
	for(int i = 0; i < U; i++)
		g[C[i]].pb(D[i]), g[D[i]].pb(C[i]);
	std::vector<int> opa;
	int mx = -1;
	for(int i = 0; i < V; i++)
		if((int)g[i].size() == 1)
			opa.pb(i);
	int N = V-12;
	for(int x : opa) {
		if((int)g[g[x][0]].size() == N+1)
			mx = g[x][0];
	}

	for(int v : g[mx])
		mark[v] = 1;

	std::vector<int> a, b;
	for(int i = 0; i < V; i++)
		if(!mark[i] && i != mx)
			a.pb(i);

	for(int x : a) {
		int cnt = 0;
		for(int v : g[x])
			if(!mark[v]) ++cnt;
		if(cnt == 1) b.pb(x);
	}
	assert((int)b.size() == 2);
	int now = -1;
	if(g[b[0]].size() > g[b[1]].size())
		now = b[0];
	else now = b[1];

	int pos = 0;
	while(1) {
		for(int v : g[now])
			if(mark[v]) val[v] += 1<<pos, --U;
		++pos;
		int ok = 0;
		vis[now] = 1;
		for(int v : g[now])
			if(!mark[v] && !vis[v]) {now = v; ok = 1; break;}
		if(!ok) break;
	}
	InitMap(N, U - N - 10);
	for(int i = 0; i < V; i++) {
		if(!val[i]) continue;
		for(int v : g[i])
			if(val[v] && val[i] > val[v])
				MakeMap(val[i]-1, val[v]-1);
	}
}

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 4916 KB Output is correct
2 Correct 6 ms 4832 KB Output is correct
3 Correct 5 ms 4764 KB Output is correct
4 Correct 5 ms 4936 KB Output is correct
5 Correct 6 ms 4832 KB Output is correct
6 Correct 6 ms 4832 KB Output is correct
7 Correct 6 ms 4832 KB Output is correct
8 Correct 5 ms 4832 KB Output is correct
9 Correct 5 ms 4960 KB Output is correct
10 Correct 5 ms 4988 KB Output is correct
11 Correct 5 ms 4784 KB Output is correct
12 Correct 5 ms 4992 KB Output is correct
13 Correct 5 ms 4896 KB Output is correct
14 Correct 5 ms 5020 KB Output is correct
15 Correct 5 ms 4832 KB Output is correct
16 Correct 5 ms 4920 KB Output is correct
17 Correct 6 ms 4832 KB Output is correct
18 Correct 6 ms 4832 KB Output is correct
19 Correct 5 ms 4924 KB Output is correct
20 Correct 5 ms 4832 KB Output is correct
21 Correct 5 ms 4896 KB Output is correct
22 Correct 5 ms 4832 KB Output is correct
23 Correct 6 ms 4832 KB Output is correct
24 Correct 5 ms 4832 KB Output is correct
25 Correct 5 ms 4832 KB Output is correct
26 Correct 5 ms 4832 KB Output is correct
27 Correct 5 ms 4928 KB Output is correct
28 Correct 5 ms 4832 KB Output is correct
29 Correct 7 ms 4832 KB Output is correct
30 Correct 5 ms 4832 KB Output is correct
31 Correct 6 ms 4832 KB Output is correct
32 Correct 6 ms 4832 KB Output is correct
33 Correct 5 ms 4832 KB Output is correct
34 Correct 5 ms 4832 KB Output is correct
35 Correct 6 ms 4976 KB Output is correct
36 Correct 5 ms 4832 KB Output is correct
37 Correct 6 ms 4916 KB Output is correct
38 Correct 5 ms 4876 KB Output is correct
39 Correct 5 ms 4864 KB Output is correct
40 Correct 5 ms 4832 KB Output is correct
41 Correct 5 ms 4832 KB Output is correct
42 Correct 6 ms 4832 KB Output is correct
43 Correct 6 ms 4832 KB Output is correct
44 Correct 5 ms 4936 KB Output is correct
45 Correct 5 ms 4832 KB Output is correct
46 Correct 5 ms 4832 KB Output is correct
47 Correct 5 ms 4832 KB Output is correct
48 Correct 5 ms 4928 KB Output is correct
49 Correct 5 ms 4832 KB Output is correct
50 Correct 5 ms 4832 KB Output is correct
51 Correct 5 ms 4832 KB Output is correct
52 Correct 5 ms 4832 KB Output is correct
53 Correct 6 ms 4832 KB Output is correct
54 Correct 6 ms 4920 KB Output is correct
55 Correct 5 ms 4928 KB Output is correct
56 Correct 5 ms 4832 KB Output is correct
57 Correct 5 ms 4832 KB Output is correct
58 Correct 5 ms 4832 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 4916 KB Output is correct
2 Correct 6 ms 4832 KB Output is correct
3 Correct 5 ms 4764 KB Output is correct
4 Correct 5 ms 4936 KB Output is correct
5 Correct 6 ms 4832 KB Output is correct
6 Correct 6 ms 4832 KB Output is correct
7 Correct 6 ms 4832 KB Output is correct
8 Correct 5 ms 4832 KB Output is correct
9 Correct 5 ms 4960 KB Output is correct
10 Correct 5 ms 4988 KB Output is correct
11 Correct 5 ms 4784 KB Output is correct
12 Correct 5 ms 4992 KB Output is correct
13 Correct 5 ms 4896 KB Output is correct
14 Correct 5 ms 5020 KB Output is correct
15 Correct 5 ms 4832 KB Output is correct
16 Correct 5 ms 4920 KB Output is correct
17 Correct 6 ms 4832 KB Output is correct
18 Correct 6 ms 4832 KB Output is correct
19 Correct 5 ms 4924 KB Output is correct
20 Correct 5 ms 4832 KB Output is correct
21 Correct 5 ms 4896 KB Output is correct
22 Correct 5 ms 4832 KB Output is correct
23 Correct 6 ms 4832 KB Output is correct
24 Correct 5 ms 4832 KB Output is correct
25 Correct 5 ms 4832 KB Output is correct
26 Correct 5 ms 4832 KB Output is correct
27 Correct 5 ms 4928 KB Output is correct
28 Correct 5 ms 4832 KB Output is correct
29 Correct 7 ms 4832 KB Output is correct
30 Correct 5 ms 4832 KB Output is correct
31 Correct 6 ms 4832 KB Output is correct
32 Correct 6 ms 4832 KB Output is correct
33 Correct 5 ms 4832 KB Output is correct
34 Correct 5 ms 4832 KB Output is correct
35 Correct 6 ms 4976 KB Output is correct
36 Correct 5 ms 4832 KB Output is correct
37 Correct 6 ms 4916 KB Output is correct
38 Correct 5 ms 4876 KB Output is correct
39 Correct 5 ms 4864 KB Output is correct
40 Correct 5 ms 4832 KB Output is correct
41 Correct 5 ms 4832 KB Output is correct
42 Correct 6 ms 4832 KB Output is correct
43 Correct 6 ms 4832 KB Output is correct
44 Correct 5 ms 4936 KB Output is correct
45 Correct 5 ms 4832 KB Output is correct
46 Correct 5 ms 4832 KB Output is correct
47 Correct 5 ms 4832 KB Output is correct
48 Correct 5 ms 4928 KB Output is correct
49 Correct 5 ms 4832 KB Output is correct
50 Correct 5 ms 4832 KB Output is correct
51 Correct 5 ms 4832 KB Output is correct
52 Correct 5 ms 4832 KB Output is correct
53 Correct 6 ms 4832 KB Output is correct
54 Correct 6 ms 4920 KB Output is correct
55 Correct 5 ms 4928 KB Output is correct
56 Correct 5 ms 4832 KB Output is correct
57 Correct 5 ms 4832 KB Output is correct
58 Correct 5 ms 4832 KB Output is correct
59 Correct 7 ms 5072 KB Output is correct
60 Correct 6 ms 4832 KB Output is correct
61 Correct 6 ms 5052 KB Output is correct
62 Correct 5 ms 4920 KB Output is correct
63 Correct 6 ms 4960 KB Output is correct
64 Correct 6 ms 4960 KB Output is correct
65 Correct 8 ms 4980 KB Output is correct
66 Correct 6 ms 4832 KB Output is correct
67 Correct 6 ms 4832 KB Output is correct
68 Correct 5 ms 4916 KB Output is correct
69 Correct 5 ms 4832 KB Output is correct
70 Correct 6 ms 4960 KB Output is correct
71 Correct 6 ms 5104 KB Output is correct
72 Correct 7 ms 5040 KB Output is correct
73 Correct 6 ms 5088 KB Output is correct
74 Correct 5 ms 4916 KB Output is correct
75 Correct 7 ms 4832 KB Output is correct
76 Correct 6 ms 4832 KB Output is correct
77 Correct 6 ms 4832 KB Output is correct
78 Correct 6 ms 4832 KB Output is correct
79 Correct 5 ms 4832 KB Output is correct
80 Correct 5 ms 4832 KB Output is correct
81 Correct 5 ms 4832 KB Output is correct
82 Correct 5 ms 4832 KB Output is correct
83 Correct 5 ms 4980 KB Output is correct
84 Correct 6 ms 4960 KB Output is correct
85 Correct 6 ms 5044 KB Output is correct
86 Correct 6 ms 5108 KB Output is correct
87 Correct 5 ms 5052 KB Output is correct
88 Correct 7 ms 4916 KB Output is correct
89 Correct 7 ms 4960 KB Output is correct
90 Correct 5 ms 4832 KB Output is correct
91 Correct 6 ms 4832 KB Output is correct
92 Correct 6 ms 4832 KB Output is correct
93 Correct 6 ms 4832 KB Output is correct
94 Correct 7 ms 5104 KB Output is correct
95 Correct 7 ms 5052 KB Output is correct
96 Correct 7 ms 4960 KB Output is correct
97 Correct 7 ms 4832 KB Output is correct
98 Correct 6 ms 4832 KB Output is correct
99 Correct 6 ms 5044 KB Output is correct
100 Correct 5 ms 4960 KB Output is correct
101 Correct 5 ms 4916 KB Output is correct
102 Correct 5 ms 4832 KB Output is correct
103 Correct 6 ms 4832 KB Output is correct
104 Correct 5 ms 4832 KB Output is correct
105 Correct 5 ms 4832 KB Output is correct
106 Correct 5 ms 4832 KB Output is correct
107 Correct 5 ms 4832 KB Output is correct
108 Correct 6 ms 4832 KB Output is correct
109 Correct 7 ms 5088 KB Output is correct
110 Correct 5 ms 4920 KB Output is correct
111 Correct 6 ms 5048 KB Output is correct
112 Correct 6 ms 4960 KB Output is correct
113 Correct 6 ms 4916 KB Output is correct
114 Correct 5 ms 4960 KB Output is correct
115 Correct 6 ms 4980 KB Output is correct
116 Correct 6 ms 4832 KB Output is correct
117 Correct 5 ms 5040 KB Output is correct
118 Correct 6 ms 4960 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Runtime error 647 ms 14880 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -