oj.uz

Submission #260328

# Submission time Handle Problem Language Result Execution time Memory
260328 2020-08-10T05:38:10 Z 임성재(#5050) Airline Route Map (JOI18_airline) C++14
37 / 100
 1109 ms 22824 KB 
#include "Alicelib.h"
#include<bits/stdc++.h>
using namespace std;

#define fast ios::sync_with_stdio(false); cin.tie(0);
#define fi first
#define se second
#define em emplace
#define eb emplace_back
#define all(v) (v).begin(), (v).end()
#define mp make_pair

void Alice( int N, int M, int A[], int B[] ) {
	int cnt = N + 29 + M;

	for(int i=0; i<N; i++) {
		for(int j=0; j<10; j++) {
			if(i & (1<<j)) cnt++;
		}
	}

	InitG(N+12, cnt);

	cnt = 0;

	for(int i=0; i<N+10; i++) {
		MakeG(cnt++, i, N+11);
	}

	for(int i=0; i<10; i++) {
		if(i < 8) MakeG(cnt++, N + i, N + i + 1);
		MakeG(cnt++, N+i, N+10);
	}
	MakeG(cnt++, N + 6, N + 9);

	for(int i=0; i<N; i++) {
		for(int j=0; j<10; j++) {
			if(i & (1<<j)) MakeG(cnt++, N + j, i);
		}
	}

	for(int i=0; i<M; i++) {
		MakeG(cnt++, A[i], B[i]);
	}
}


#include "Boblib.h"
#include<bits/stdc++.h>
using namespace std;

#define fast ios::sync_with_stdio(false); cin.tie(0);
#define fi first
#define se second
#define em emplace
#define eb emplace_back
#define all(v) (v).begin(), (v).end()
#define mp make_pair

static int g[1100][1100];
static vector<int> v;
static int num[1100];
static bool chk[1100];

static void dfs(int x) {
	num[x] = 0;
	chk[x] = true;
	for(auto i : v) {
		if(chk[i] || !g[x][i]) continue;

		dfs(i);
		num[x] = max(num[x], num[i] + 1);
	}
}

void Bob( int V, int U, int C[], int D[] ){
	int n = V - 12;
	int m = U - (n + 29);
	int mask[10];
	int x, y;

	for(int i=0; i<n; i++) {
		for(int j=0; j<10; j++) {
			if(i & (1<<j)) m--;
		}
	}

	//cout << n << " " << m << endl;

	for(int i=0; i<U; i++) {
		//cout << C[i] << "-" << D[i] << endl;
		g[C[i]][D[i]] = g[D[i]][C[i]] = 1;
	}

	for(int i=0; i<V; i++) {
		int cnt = 0;
		for(int j=0; j<V; j++) {
			if(!g[i][j]) x = j; 
			cnt += g[i][j];
		}

		if(cnt == V - 2) {
			//cout << "x" << i << endl;
			x = i;
			break;
		}
	}

	for(int i=0; i<V; i++) {
		if(i == x) continue;

		if(!g[x][i]) { 
			y = i;
		}
		
		g[x][i] = g[i][x] = 0;
	}

	for(int i=0; i<V; i++) {
		if(g[y][i]) v.eb(i);
		//cout << "!" << i << endl;
	}

	for(auto i : v) {
		int cnt = 0;
		for(auto j : v) {
			if(g[i][j]) cnt++;
		}

		if(cnt == 3) mask[6] = i;
	}

	dfs(mask[6]);

	for(auto i : v) {
		for(int j : v) {
			if(!g[i][j]) continue;

			if(num[j] == 6 && num[i] == 0) num[i] = 7;
			if(num[j] == 6 && num[i] == 1) num[i] = 8;
		}
	}

	for(auto i : v) {
		for(int j : v) {
			if(!g[i][j]) continue;

			if(num[j] == 8 && num[i] == 0) num[i] = 9;
		}
	}

	for(auto i : v) {
		mask[num[i]] = i;
		num[i] += n;
	}

	num[x] = n+11;
	num[y] = n+10;

	/*for(int i=0; i<10; i++) {
		for(int j=0; j<10; j++) {
			cout << g[mask[i]][mask[j]];
		}
		cout << endl;
	}*/

	for(int i=0; i<V; i++) {
		if(num[i]) continue;

		for(int j=0; j<10; j++) {
			if(g[i][mask[j]]) num[i] |= 1<<j;
		}
	}

	InitMap( n , m );

	for(int i=0; i<V; i++) {
		if(num[i] >= n) continue;
		for(int j=0; j<i; j++) {
			if(num[j] >= n) continue;

			if(g[i][j] ) MakeMap(num[i], num[j]);
		}
	}
}

Compilation message

Bob.cpp: In function 'void Bob(int, int, int*, int*)':
Bob.cpp:111:9: warning: 'y' may be used uninitialized in this function [-Wmaybe-uninitialized]
  num[y] = n+10;
  ~~~~~~~^~~~~~
Bob.cpp:110:9: warning: 'x' may be used uninitialized in this function [-Wmaybe-uninitialized]
  num[x] = n+11;
  ~~~~~~~^~~~~~

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 6912 KB Output is correct
2 Correct 7 ms 6912 KB Output is correct
3 Correct 6 ms 6912 KB Output is correct
4 Correct 7 ms 6912 KB Output is correct
5 Correct 5 ms 6912 KB Output is correct
6 Correct 5 ms 6912 KB Output is correct
7 Correct 5 ms 6912 KB Output is correct
8 Correct 5 ms 6912 KB Output is correct
9 Correct 6 ms 6912 KB Output is correct
10 Correct 5 ms 6656 KB Output is correct
11 Correct 5 ms 6912 KB Output is correct
12 Correct 6 ms 6912 KB Output is correct
13 Correct 6 ms 6912 KB Output is correct
14 Correct 6 ms 6912 KB Output is correct
15 Correct 5 ms 6912 KB Output is correct
16 Correct 6 ms 6912 KB Output is correct
17 Correct 6 ms 6912 KB Output is correct
18 Correct 6 ms 6912 KB Output is correct
19 Correct 5 ms 6912 KB Output is correct
20 Correct 6 ms 6912 KB Output is correct
21 Correct 5 ms 6912 KB Output is correct
22 Correct 7 ms 6912 KB Output is correct
23 Correct 5 ms 6912 KB Output is correct
24 Correct 5 ms 6720 KB Output is correct
25 Correct 5 ms 6912 KB Output is correct
26 Correct 5 ms 6912 KB Output is correct
27 Correct 5 ms 6912 KB Output is correct
28 Correct 5 ms 6912 KB Output is correct
29 Correct 5 ms 6912 KB Output is correct
30 Correct 6 ms 6656 KB Output is correct
31 Correct 6 ms 6656 KB Output is correct
32 Correct 6 ms 6656 KB Output is correct
33 Correct 5 ms 6912 KB Output is correct
34 Correct 5 ms 6656 KB Output is correct
35 Correct 5 ms 6912 KB Output is correct
36 Correct 5 ms 6912 KB Output is correct
37 Correct 6 ms 6912 KB Output is correct
38 Correct 5 ms 6912 KB Output is correct
39 Correct 5 ms 6912 KB Output is correct
40 Correct 5 ms 6912 KB Output is correct
41 Correct 5 ms 6784 KB Output is correct
42 Correct 5 ms 6912 KB Output is correct
43 Correct 5 ms 6912 KB Output is correct
44 Correct 5 ms 6656 KB Output is correct
45 Correct 5 ms 6912 KB Output is correct
46 Correct 5 ms 6912 KB Output is correct
47 Correct 6 ms 6912 KB Output is correct
48 Correct 7 ms 6912 KB Output is correct
49 Correct 5 ms 6912 KB Output is correct
50 Correct 7 ms 6656 KB Output is correct
51 Correct 6 ms 6912 KB Output is correct
52 Correct 5 ms 6912 KB Output is correct
53 Correct 5 ms 6912 KB Output is correct
54 Correct 8 ms 6912 KB Output is correct
55 Correct 7 ms 6912 KB Output is correct
56 Correct 6 ms 6912 KB Output is correct
57 Correct 5 ms 6912 KB Output is correct
58 Correct 6 ms 6912 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 6912 KB Output is correct
2 Correct 7 ms 6912 KB Output is correct
3 Correct 6 ms 6912 KB Output is correct
4 Correct 7 ms 6912 KB Output is correct
5 Correct 5 ms 6912 KB Output is correct
6 Correct 5 ms 6912 KB Output is correct
7 Correct 5 ms 6912 KB Output is correct
8 Correct 5 ms 6912 KB Output is correct
9 Correct 6 ms 6912 KB Output is correct
10 Correct 5 ms 6656 KB Output is correct
11 Correct 5 ms 6912 KB Output is correct
12 Correct 6 ms 6912 KB Output is correct
13 Correct 6 ms 6912 KB Output is correct
14 Correct 6 ms 6912 KB Output is correct
15 Correct 5 ms 6912 KB Output is correct
16 Correct 6 ms 6912 KB Output is correct
17 Correct 6 ms 6912 KB Output is correct
18 Correct 6 ms 6912 KB Output is correct
19 Correct 5 ms 6912 KB Output is correct
20 Correct 6 ms 6912 KB Output is correct
21 Correct 5 ms 6912 KB Output is correct
22 Correct 7 ms 6912 KB Output is correct
23 Correct 5 ms 6912 KB Output is correct
24 Correct 5 ms 6720 KB Output is correct
25 Correct 5 ms 6912 KB Output is correct
26 Correct 5 ms 6912 KB Output is correct
27 Correct 5 ms 6912 KB Output is correct
28 Correct 5 ms 6912 KB Output is correct
29 Correct 5 ms 6912 KB Output is correct
30 Correct 6 ms 6656 KB Output is correct
31 Correct 6 ms 6656 KB Output is correct
32 Correct 6 ms 6656 KB Output is correct
33 Correct 5 ms 6912 KB Output is correct
34 Correct 5 ms 6656 KB Output is correct
35 Correct 5 ms 6912 KB Output is correct
36 Correct 5 ms 6912 KB Output is correct
37 Correct 6 ms 6912 KB Output is correct
38 Correct 5 ms 6912 KB Output is correct
39 Correct 5 ms 6912 KB Output is correct
40 Correct 5 ms 6912 KB Output is correct
41 Correct 5 ms 6784 KB Output is correct
42 Correct 5 ms 6912 KB Output is correct
43 Correct 5 ms 6912 KB Output is correct
44 Correct 5 ms 6656 KB Output is correct
45 Correct 5 ms 6912 KB Output is correct
46 Correct 5 ms 6912 KB Output is correct
47 Correct 6 ms 6912 KB Output is correct
48 Correct 7 ms 6912 KB Output is correct
49 Correct 5 ms 6912 KB Output is correct
50 Correct 7 ms 6656 KB Output is correct
51 Correct 6 ms 6912 KB Output is correct
52 Correct 5 ms 6912 KB Output is correct
53 Correct 5 ms 6912 KB Output is correct
54 Correct 8 ms 6912 KB Output is correct
55 Correct 7 ms 6912 KB Output is correct
56 Correct 6 ms 6912 KB Output is correct
57 Correct 5 ms 6912 KB Output is correct
58 Correct 6 ms 6912 KB Output is correct
59 Correct 6 ms 6912 KB Output is correct
60 Correct 7 ms 6912 KB Output is correct
61 Correct 6 ms 6912 KB Output is correct
62 Correct 6 ms 6912 KB Output is correct
63 Correct 6 ms 6912 KB Output is correct
64 Correct 6 ms 6912 KB Output is correct
65 Correct 7 ms 6912 KB Output is correct
66 Correct 7 ms 6912 KB Output is correct
67 Correct 6 ms 6912 KB Output is correct
68 Correct 5 ms 6912 KB Output is correct
69 Correct 5 ms 6912 KB Output is correct
70 Correct 6 ms 6912 KB Output is correct
71 Correct 7 ms 6912 KB Output is correct
72 Correct 6 ms 6912 KB Output is correct
73 Correct 7 ms 6720 KB Output is correct
74 Correct 6 ms 6912 KB Output is correct
75 Correct 7 ms 6912 KB Output is correct
76 Correct 5 ms 6912 KB Output is correct
77 Correct 5 ms 6912 KB Output is correct
78 Correct 6 ms 6912 KB Output is correct
79 Correct 6 ms 6912 KB Output is correct
80 Correct 6 ms 6912 KB Output is correct
81 Correct 6 ms 6912 KB Output is correct
82 Correct 5 ms 6912 KB Output is correct
83 Correct 5 ms 6912 KB Output is correct
84 Correct 7 ms 6912 KB Output is correct
85 Correct 6 ms 6912 KB Output is correct
86 Correct 6 ms 6912 KB Output is correct
87 Correct 6 ms 6912 KB Output is correct
88 Correct 7 ms 6912 KB Output is correct
89 Correct 6 ms 6912 KB Output is correct
90 Correct 5 ms 6912 KB Output is correct
91 Correct 6 ms 6656 KB Output is correct
92 Correct 5 ms 6656 KB Output is correct
93 Correct 5 ms 6912 KB Output is correct
94 Correct 6 ms 6912 KB Output is correct
95 Correct 6 ms 6912 KB Output is correct
96 Correct 6 ms 6912 KB Output is correct
97 Correct 7 ms 6912 KB Output is correct
98 Correct 7 ms 6912 KB Output is correct
99 Correct 6 ms 6912 KB Output is correct
100 Correct 6 ms 6912 KB Output is correct
101 Correct 5 ms 6912 KB Output is correct
102 Correct 6 ms 6912 KB Output is correct
103 Correct 6 ms 6912 KB Output is correct
104 Correct 6 ms 6912 KB Output is correct
105 Correct 7 ms 7168 KB Output is correct
106 Correct 5 ms 6912 KB Output is correct
107 Correct 5 ms 6912 KB Output is correct
108 Correct 6 ms 6912 KB Output is correct
109 Correct 6 ms 6912 KB Output is correct
110 Correct 5 ms 6912 KB Output is correct
111 Correct 5 ms 6912 KB Output is correct
112 Correct 5 ms 6912 KB Output is correct
113 Correct 5 ms 6912 KB Output is correct
114 Correct 5 ms 6912 KB Output is correct
115 Correct 5 ms 6912 KB Output is correct
116 Correct 6 ms 6912 KB Output is correct
117 Correct 6 ms 6912 KB Output is correct
118 Correct 5 ms 6912 KB Output is correct

Subtask #3
0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 1109 ms 22824 KB Output is correct : V - N = 12
2 Failed 584 ms 19136 KB Wrong Answer [13]
3 Halted 0 ms 0 KB -