답안 #1037990

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1037990	2024-07-29T11:48:27 Z	juicy	항공 노선도 (JOI18_airline)	C++17	37 / 100	458 ms	37900 KB

Alice
Bob

#include "Alicelib.h"

#include <bits/stdc++.h>

using namespace std;

void Alice(int N, int M, int *A, int *B) {
  vector<array<int, 2>> E;
  for (int i = 0; i < M; ++i) {
    E.push_back({A[i], B[i]});
  }
  for (int i = 1; i <= N; ++i) {
    for (int j = 0; j < 10; ++j) {
      if (i >> j & 1) {
        E.push_back({i - 1, N + j});
      }
    }
  }
  int nVer = N + 12;
  for (int i = 0; i < N + 10; ++i) {
    E.push_back({nVer - 1, i});
  }
  for (int i = 0; i < 10; ++i) {
    E.push_back({nVer - 2, N + i});
  }
  for (int i = 1; i < 10; ++i) {
    E.push_back({N + i - 1, N + i});
  }
  InitG(nVer, E.size());
  for (int i = 0; i < E.size(); ++i) {
    MakeG(i, E[i][0], E[i][1]);
  }
}

#include "Boblib.h"

#include <bits/stdc++.h>

using namespace std;

const int MAX = 1011;

int deg[MAX], id[MAX];
bool spec[MAX], vis[MAX];
bitset<MAX> g[MAX];

void Bob(int N, int M, int *C, int *D) {
  for (int i = 0; i < M; ++i) {
    int u = C[i], v = D[i];
    g[u][v] = g[v][u] = 1;
    ++deg[u], ++deg[v];
  }
  vector<int> ord(N); iota(ord.begin(), ord.end(), 0);
  int V = *max_element(ord.begin(), ord.end(), [&](int i, int j) {
    return deg[i] < deg[j];
  });
  assert(deg[V] == N - 2);
  int U;
  for (int i = 0; i < N; ++i) {
    if (i != V && g[V][i] == 0) {
      U = i;
      break;
    }
  }
  for (int i = 0; i < N; ++i) {
    spec[i] = g[U][i];
  }
  vector<int> cands;
  function<void(int)> dfs = [&](int u) {
    vis[u] = 1;
    cands.push_back(u);
    for (int i = 0; i < N; ++i) {
      if (g[u][i] && spec[i] && !vis[i]) {
        dfs(i);
      }
    }
  };
  for (int i = 0; i < N; ++i) {
    if (spec[i] && deg[i] == max(3, N - 521)) {
      dfs(i);
      break;
    }
  }
  reverse(cands.begin(), cands.end());
  fill(id, id + N, -1);
  for (int i = 0; i < 10; ++i) {
    for (int j = 0; j < N; ++j) {
      if (g[cands[i]][j] && !spec[j] && j != V) {
        id[j] = max(id[j], 0) + (1 << i);
      }
    }
  }
  vector<array<int, 2>> E;
  for (int i = 0; i < N; ++i) {
    if (id[i] != -1) {
      for (int j = 0; j < N; ++j) {
        if (g[i][j] && id[j] != -1 && i < j) {
          E.push_back({id[i] - 1, id[j] - 1});
        }
      }
    }
  }
  N -= 12;
  InitMap(N, E.size());
  for (auto [u, v] : E) {
    MakeMap(u, v);
  }
}

Compilation message

Alice.cpp: In function 'void Alice(int, int, int*, int*)':
Alice.cpp:30:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::array<int, 2> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |   for (int i = 0; i < E.size(); ++i) {
      |                   ~~^~~~~~~~~~

Bob.cpp: In function 'void Bob(int, int, int*, int*)':
Bob.cpp:24:7: warning: 'U' may be used uninitialized in this function [-Wmaybe-uninitialized]
   24 |   int U;
      |       ^

Subtask #1
22.0 / 22.0

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

Subtask #2
15.0 / 15.0

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

Subtask #3
0 / 63.0

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

답안 #1037990

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