oj.uz

답안 #954848

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
954848 2024-03-28T17:18:40 Z Skywk 항공 노선도 (JOI18_airline) C++17
37 / 100
 441 ms 48196 KB 
#include "Alicelib.h"
#include <cassert>
#include <cstdio>
#include <bits/stdc++.h>

using namespace std;

vector<array<int, 2>> edgesA;

void Alice(int N, int M, int A[], int B[]){
	int supremeNode = N;
	int startNode = N + 11;
	int bitNode[10]; iota(bitNode, bitNode + 10, N + 1);
	
	int V = N + 12;
	for(int i=0; i<M; i++){
		edgesA.push_back({A[i], B[i]});
	}
	for(int i=0; i<N; i++){
		edgesA.push_back({supremeNode, i});
	}
	edgesA.push_back({startNode, supremeNode});
	for(int x=1; x<10; x++){
		edgesA.push_back({bitNode[x], bitNode[x-1]});
	}
	for(int i=0; i<N; i++){
		for(int x=0; x<10; x++){
			if(i & (1 << x)){
				edgesA.push_back({i, bitNode[x]});
			}
		}
	}
	int U = edgesA.size();
	InitG(V, U);
	for(int i=0; i<U; i++){
		MakeG(i, edgesA[i][0], edgesA[i][1]);
	}
}
#include "Boblib.h"
#include <cassert>
#include <cstdio>
#include <bits/stdc++.h>

using namespace std;

const int MAXN = 1000;
vector<int> adj[MAXN + 12];
int degree[MAXN + 12];
int vis[MAXN + 12];
int value[MAXN + 1];
vector<array<int, 2>> edgesB;

void Bob(int V, int U, int C[], int D[]){
	memset(degree, 0, sizeof(degree[0]) * V);
	int N = V - 12;
	for(int i=0; i<U; i++){
		degree[C[i]]++;
		degree[D[i]]++;
		adj[C[i]].push_back(D[i]);
		adj[D[i]].push_back(C[i]);
	}
	int startNode = -1;
	int supremeNode = -1;
	for(int i=0; i<V; i++){
		if(degree[i] == 1 && degree[adj[i][0]] == N + 1){
				startNode = i;
				supremeNode = adj[i][0];
				break;
		}
	}
	memset(vis, 0, sizeof(vis[0]) * V);
	for(auto u : adj[supremeNode]) vis[u] = 1;
	vis[startNode] = 2;
	vis[supremeNode] = 2;
	int bitNode[10], bitEdges[10];
	memset(bitNode, -1, sizeof(bitNode[0]) * 10);
	memset(bitEdges, 0, sizeof(bitEdges[0]) * 10);
	for(int i=0; i<N; i++){
		for(int x=0; x<10; x++){
			bitEdges[x] += (i >> x) & 1;
		}
	}
	for(int i=0; i<V; i++){
		if(!vis[i] && degree[i] == bitEdges[9] + 1){
			bitNode[9] = i;
			vis[i] = 2;
		}
	}
	for(int i=8; i>=0; i--){
		for(auto u : adj[bitNode[i+1]]){
			if(vis[u]) continue;
			bitNode[i] = u;
			vis[u] = 2;
		}
	}
	memset(value, 0, sizeof(value[0]) * V);
	for(int i=0; i<10; i++){
		for(auto u : adj[bitNode[i]]){
			if(vis[u] == 1){
				value[u] += (1 << i);
			}
		}
	}
	for(int i=0; i<U; i++){
		if(vis[C[i]] == 1 && vis[D[i]] == 1){
			edgesB.push_back({value[C[i]], value[D[i]]});
		}
	}
	int M = edgesB.size();
	InitMap(N, M);
	for(auto [u, v] : edgesB){
		MakeMap(u, v);
	}
}

Subtask #1
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 15616 KB Output is correct
2 Correct 3 ms 15620 KB Output is correct
3 Correct 3 ms 15528 KB Output is correct
4 Correct 2 ms 13568 KB Output is correct
5 Correct 3 ms 15616 KB Output is correct
6 Correct 3 ms 15620 KB Output is correct
7 Correct 2 ms 15620 KB Output is correct
8 Correct 4 ms 15620 KB Output is correct
9 Correct 3 ms 15872 KB Output is correct
10 Correct 3 ms 13572 KB Output is correct
11 Correct 3 ms 15620 KB Output is correct
12 Correct 2 ms 15616 KB Output is correct
13 Correct 3 ms 15620 KB Output is correct
14 Correct 3 ms 15620 KB Output is correct
15 Correct 2 ms 15620 KB Output is correct
16 Correct 2 ms 15620 KB Output is correct
17 Correct 3 ms 15620 KB Output is correct
18 Correct 3 ms 15620 KB Output is correct
19 Correct 2 ms 15620 KB Output is correct
20 Correct 3 ms 15616 KB Output is correct
21 Correct 2 ms 15620 KB Output is correct
22 Correct 3 ms 15624 KB Output is correct
23 Correct 3 ms 15620 KB Output is correct
24 Correct 2 ms 13572 KB Output is correct
25 Correct 2 ms 15616 KB Output is correct
26 Correct 3 ms 15616 KB Output is correct
27 Correct 3 ms 15620 KB Output is correct
28 Correct 3 ms 15616 KB Output is correct
29 Correct 3 ms 15620 KB Output is correct
30 Correct 2 ms 13572 KB Output is correct
31 Correct 2 ms 13572 KB Output is correct
32 Correct 2 ms 13572 KB Output is correct
33 Correct 2 ms 13572 KB Output is correct
34 Correct 2 ms 13572 KB Output is correct
35 Correct 2 ms 13568 KB Output is correct
36 Correct 2 ms 15868 KB Output is correct
37 Correct 2 ms 15620 KB Output is correct
38 Correct 3 ms 15872 KB Output is correct
39 Correct 3 ms 15616 KB Output is correct
40 Correct 3 ms 15620 KB Output is correct
41 Correct 3 ms 15616 KB Output is correct
42 Correct 3 ms 15620 KB Output is correct
43 Correct 2 ms 15616 KB Output is correct
44 Correct 2 ms 13572 KB Output is correct
45 Correct 2 ms 13824 KB Output is correct
46 Correct 2 ms 15620 KB Output is correct
47 Correct 3 ms 15876 KB Output is correct
48 Correct 3 ms 15620 KB Output is correct
49 Correct 3 ms 15620 KB Output is correct
50 Correct 2 ms 13572 KB Output is correct
51 Correct 3 ms 13572 KB Output is correct
52 Correct 2 ms 15620 KB Output is correct
53 Correct 2 ms 13568 KB Output is correct
54 Correct 2 ms 15620 KB Output is correct
55 Correct 2 ms 15620 KB Output is correct
56 Correct 3 ms 15620 KB Output is correct
57 Correct 3 ms 15616 KB Output is correct
58 Correct 3 ms 15616 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 15616 KB Output is correct
2 Correct 3 ms 15620 KB Output is correct
3 Correct 3 ms 15528 KB Output is correct
4 Correct 2 ms 13568 KB Output is correct
5 Correct 3 ms 15616 KB Output is correct
6 Correct 3 ms 15620 KB Output is correct
7 Correct 2 ms 15620 KB Output is correct
8 Correct 4 ms 15620 KB Output is correct
9 Correct 3 ms 15872 KB Output is correct
10 Correct 3 ms 13572 KB Output is correct
11 Correct 3 ms 15620 KB Output is correct
12 Correct 2 ms 15616 KB Output is correct
13 Correct 3 ms 15620 KB Output is correct
14 Correct 3 ms 15620 KB Output is correct
15 Correct 2 ms 15620 KB Output is correct
16 Correct 2 ms 15620 KB Output is correct
17 Correct 3 ms 15620 KB Output is correct
18 Correct 3 ms 15620 KB Output is correct
19 Correct 2 ms 15620 KB Output is correct
20 Correct 3 ms 15616 KB Output is correct
21 Correct 2 ms 15620 KB Output is correct
22 Correct 3 ms 15624 KB Output is correct
23 Correct 3 ms 15620 KB Output is correct
24 Correct 2 ms 13572 KB Output is correct
25 Correct 2 ms 15616 KB Output is correct
26 Correct 3 ms 15616 KB Output is correct
27 Correct 3 ms 15620 KB Output is correct
28 Correct 3 ms 15616 KB Output is correct
29 Correct 3 ms 15620 KB Output is correct
30 Correct 2 ms 13572 KB Output is correct
31 Correct 2 ms 13572 KB Output is correct
32 Correct 2 ms 13572 KB Output is correct
33 Correct 2 ms 13572 KB Output is correct
34 Correct 2 ms 13572 KB Output is correct
35 Correct 2 ms 13568 KB Output is correct
36 Correct 2 ms 15868 KB Output is correct
37 Correct 2 ms 15620 KB Output is correct
38 Correct 3 ms 15872 KB Output is correct
39 Correct 3 ms 15616 KB Output is correct
40 Correct 3 ms 15620 KB Output is correct
41 Correct 3 ms 15616 KB Output is correct
42 Correct 3 ms 15620 KB Output is correct
43 Correct 2 ms 15616 KB Output is correct
44 Correct 2 ms 13572 KB Output is correct
45 Correct 2 ms 13824 KB Output is correct
46 Correct 2 ms 15620 KB Output is correct
47 Correct 3 ms 15876 KB Output is correct
48 Correct 3 ms 15620 KB Output is correct
49 Correct 3 ms 15620 KB Output is correct
50 Correct 2 ms 13572 KB Output is correct
51 Correct 3 ms 13572 KB Output is correct
52 Correct 2 ms 15620 KB Output is correct
53 Correct 2 ms 13568 KB Output is correct
54 Correct 2 ms 15620 KB Output is correct
55 Correct 2 ms 15620 KB Output is correct
56 Correct 3 ms 15620 KB Output is correct
57 Correct 3 ms 15616 KB Output is correct
58 Correct 3 ms 15616 KB Output is correct
59 Correct 3 ms 15620 KB Output is correct
60 Correct 3 ms 15620 KB Output is correct
61 Correct 3 ms 15620 KB Output is correct
62 Correct 3 ms 15616 KB Output is correct
63 Correct 3 ms 15620 KB Output is correct
64 Correct 3 ms 15620 KB Output is correct
65 Correct 3 ms 15616 KB Output is correct
66 Correct 3 ms 15620 KB Output is correct
67 Correct 3 ms 15624 KB Output is correct
68 Correct 3 ms 15620 KB Output is correct
69 Correct 3 ms 15620 KB Output is correct
70 Correct 3 ms 15620 KB Output is correct
71 Correct 3 ms 15616 KB Output is correct
72 Correct 3 ms 15616 KB Output is correct
73 Correct 3 ms 15620 KB Output is correct
74 Correct 2 ms 15620 KB Output is correct
75 Correct 3 ms 15620 KB Output is correct
76 Correct 3 ms 15620 KB Output is correct
77 Correct 3 ms 15624 KB Output is correct
78 Correct 3 ms 15616 KB Output is correct
79 Correct 3 ms 15612 KB Output is correct
80 Correct 3 ms 15620 KB Output is correct
81 Correct 3 ms 15612 KB Output is correct
82 Correct 3 ms 15620 KB Output is correct
83 Correct 3 ms 15620 KB Output is correct
84 Correct 3 ms 15628 KB Output is correct
85 Correct 4 ms 15620 KB Output is correct
86 Correct 3 ms 15616 KB Output is correct
87 Correct 3 ms 15616 KB Output is correct
88 Correct 3 ms 15620 KB Output is correct
89 Correct 2 ms 13572 KB Output is correct
90 Correct 2 ms 13572 KB Output is correct
91 Correct 3 ms 13568 KB Output is correct
92 Correct 2 ms 13572 KB Output is correct
93 Correct 2 ms 13564 KB Output is correct
94 Correct 3 ms 15588 KB Output is correct
95 Correct 3 ms 15624 KB Output is correct
96 Correct 3 ms 15616 KB Output is correct
97 Correct 3 ms 15620 KB Output is correct
98 Correct 3 ms 15616 KB Output is correct
99 Correct 3 ms 15620 KB Output is correct
100 Correct 2 ms 15872 KB Output is correct
101 Correct 2 ms 15616 KB Output is correct
102 Correct 2 ms 13568 KB Output is correct
103 Correct 2 ms 15620 KB Output is correct
104 Correct 3 ms 15620 KB Output is correct
105 Correct 3 ms 15620 KB Output is correct
106 Correct 3 ms 15620 KB Output is correct
107 Correct 3 ms 15620 KB Output is correct
108 Correct 3 ms 15644 KB Output is correct
109 Correct 3 ms 15620 KB Output is correct
110 Correct 2 ms 15620 KB Output is correct
111 Correct 3 ms 15616 KB Output is correct
112 Correct 4 ms 15620 KB Output is correct
113 Correct 3 ms 15612 KB Output is correct
114 Correct 3 ms 15620 KB Output is correct
115 Correct 3 ms 15620 KB Output is correct
116 Correct 2 ms 15620 KB Output is correct
117 Correct 3 ms 15796 KB Output is correct
118 Correct 3 ms 15828 KB Output is correct

Subtask #3
0 / 63.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 441 ms 48196 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -