Submission #95844

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
95844	2019-02-03T04:05:48 Z	diamond_duke	Airline Route Map (JOI18_airline)	C++11	37 / 100	689 ms	30720 KB

Alice
Bob

#include "Alicelib.h"
#include <utility>
#include <vector>
void Alice(int n, int m, int *eu, int *ev)
{
	std::vector<std::pair<int, int> > edge;
	for (int i = 0; i < m; i++)
		edge.emplace_back(eu[i], ev[i]);
	for (int i = 0; i < n + 10; i++)
		edge.emplace_back(i, n + 11);
	for (int i = 0; i < 10; i++)
		edge.emplace_back(n + i, n + 10);
	for (int i = 1; i < 10; i++)
		edge.emplace_back(n + i - 1, n + i);
	edge.emplace_back(n + 1, n + 3);
	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j < 10; j++)
		{
			if (i & (1 << j))
				edge.emplace_back(i, n + j);
		}
	}
	InitG(n + 12, edge.size());
	for (int i = 0; i < edge.size(); i++)
		MakeG(i, edge[i].first, edge[i].second);
}

#include "Boblib.h"
#include <algorithm>
#include <utility>
#include <vector>
std::vector<int> adj[1005], G[1005], seq;
int real[1005];
bool have[1005][1005], del[1005];
void dfs(int u, int rk = 0, int fa = -1)
{
	seq[rk] = u;
	for (int v : G[u])
	{
		if (v != fa)
			dfs(v, rk + 1, u);
	}
}
void Bob(int n, int m, int *eu, int *ev)
{
	for (int i = 0; i < m; i++)
	{
		adj[eu[i]].push_back(ev[i]);
		adj[ev[i]].push_back(eu[i]);
		have[eu[i]][ev[i]] = have[ev[i]][eu[i]] = true;
	}
	int n11 = -1, n10 = -1;
	for (int i = 0; i < n && -1 == n11; i++)
	{
		if (adj[i].size() == n - 2)
			n11 = i;
	}
	for (int i = 0; i < n && -1 == n10; i++)
	{
		if (i != n11 && !have[i][n11])
			n10 = i;
	}
	for (int i = 0; i < n; i++)
	{
		if (have[n10][i])
			seq.push_back(i);
	}
	for (int u : seq)
	{
		for (int v : seq)
		{
			if (have[u][v])
				G[u].push_back(v);
		}
	}
	int n0 = -1;
	for (int u : seq)
	{
		if (G[u].size() == 1 && G[G[u][0]].size() == 3)
			n0 = u;
	}
	for (int u : seq)
	{
		if (G[u].size() != 3)
			continue;
		for (int v : G[u])
		{
			if (G[v].size() != 3)
				continue;
			G[u].erase(std::find(G[u].begin(), G[u].end(), v));
			G[v].erase(std::find(G[v].begin(), G[v].end(), u));
			break;
		}
	}
	dfs(n0);
	for (int u : seq)
		del[u] = true;
	del[n10] = del[n11] = true;
	for (int i = 0; i < n; i++)
	{
		if (del[i])
			continue;
		int rk = 0;
		for (int j = 0; j < 10; j++)
		{
			if (have[i][seq[j]])
				rk |= 1 << j;
		}
		real[rk] = i;
	}
	std::vector<std::pair<int, int> > edge;
	for (int i = 0; i < n - 12; i++)
	{
		for (int j = 0; j < i; j++)
		{
			if (have[real[i]][real[j]])
				edge.emplace_back(i, j);
		}
	}
	InitMap(n - 12, edge.size());
	for (auto &it : edge)
		MakeMap(it.first, it.second);
}

Compilation message

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

Bob.cpp: In function 'void Bob(int, int, int*, int*)':
Bob.cpp:28:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if (adj[i].size() == n - 2)
       ~~~~~~~~~~~~~~^~~~~~~~

Subtask #1
22.0 / 22.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	8 ms	6896 KB	Output is correct
2	Correct	8 ms	6640 KB	Output is correct
3	Correct	8 ms	6640 KB	Output is correct
4	Correct	8 ms	6736 KB	Output is correct
5	Correct	8 ms	6640 KB	Output is correct
6	Correct	8 ms	6896 KB	Output is correct
7	Correct	8 ms	6640 KB	Output is correct
8	Correct	8 ms	6896 KB	Output is correct
9	Correct	8 ms	6640 KB	Output is correct
10	Correct	7 ms	6640 KB	Output is correct
11	Correct	8 ms	6640 KB	Output is correct
12	Correct	7 ms	6640 KB	Output is correct
13	Correct	7 ms	6896 KB	Output is correct
14	Correct	8 ms	6896 KB	Output is correct
15	Correct	7 ms	6736 KB	Output is correct
16	Correct	7 ms	6640 KB	Output is correct
17	Correct	6 ms	6640 KB	Output is correct
18	Correct	7 ms	6896 KB	Output is correct
19	Correct	7 ms	6640 KB	Output is correct
20	Correct	7 ms	6640 KB	Output is correct
21	Correct	6 ms	6896 KB	Output is correct
22	Correct	7 ms	6896 KB	Output is correct
23	Correct	7 ms	6640 KB	Output is correct
24	Correct	6 ms	6896 KB	Output is correct
25	Correct	7 ms	6640 KB	Output is correct
26	Correct	8 ms	6896 KB	Output is correct
27	Correct	8 ms	6896 KB	Output is correct
28	Correct	7 ms	6648 KB	Output is correct
29	Correct	8 ms	6640 KB	Output is correct
30	Correct	8 ms	6640 KB	Output is correct
31	Correct	8 ms	6896 KB	Output is correct
32	Correct	7 ms	6640 KB	Output is correct
33	Correct	7 ms	6896 KB	Output is correct
34	Correct	7 ms	6896 KB	Output is correct
35	Correct	7 ms	6896 KB	Output is correct
36	Correct	7 ms	6896 KB	Output is correct
37	Correct	7 ms	6896 KB	Output is correct
38	Correct	7 ms	6640 KB	Output is correct
39	Correct	7 ms	6648 KB	Output is correct
40	Correct	7 ms	6896 KB	Output is correct
41	Correct	6 ms	6904 KB	Output is correct
42	Correct	6 ms	6640 KB	Output is correct
43	Correct	7 ms	6640 KB	Output is correct
44	Correct	6 ms	6896 KB	Output is correct
45	Correct	7 ms	6640 KB	Output is correct
46	Correct	7 ms	6640 KB	Output is correct
47	Correct	7 ms	6640 KB	Output is correct
48	Correct	7 ms	6640 KB	Output is correct
49	Correct	6 ms	6640 KB	Output is correct
50	Correct	6 ms	6640 KB	Output is correct
51	Correct	8 ms	6896 KB	Output is correct
52	Correct	7 ms	6640 KB	Output is correct
53	Correct	7 ms	6648 KB	Output is correct
54	Correct	6 ms	6640 KB	Output is correct
55	Correct	7 ms	6640 KB	Output is correct
56	Correct	7 ms	6640 KB	Output is correct
57	Correct	7 ms	6896 KB	Output is correct
58	Correct	7 ms	6808 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	8 ms	6640 KB	Output is correct
3	Correct	8 ms	6640 KB	Output is correct
4	Correct	8 ms	6736 KB	Output is correct
5	Correct	8 ms	6640 KB	Output is correct
6	Correct	8 ms	6896 KB	Output is correct
7	Correct	8 ms	6640 KB	Output is correct
8	Correct	8 ms	6896 KB	Output is correct
9	Correct	8 ms	6640 KB	Output is correct
10	Correct	7 ms	6640 KB	Output is correct
11	Correct	8 ms	6640 KB	Output is correct
12	Correct	7 ms	6640 KB	Output is correct
13	Correct	7 ms	6896 KB	Output is correct
14	Correct	8 ms	6896 KB	Output is correct
15	Correct	7 ms	6736 KB	Output is correct
16	Correct	7 ms	6640 KB	Output is correct
17	Correct	6 ms	6640 KB	Output is correct
18	Correct	7 ms	6896 KB	Output is correct
19	Correct	7 ms	6640 KB	Output is correct
20	Correct	7 ms	6640 KB	Output is correct
21	Correct	6 ms	6896 KB	Output is correct
22	Correct	7 ms	6896 KB	Output is correct
23	Correct	7 ms	6640 KB	Output is correct
24	Correct	6 ms	6896 KB	Output is correct
25	Correct	7 ms	6640 KB	Output is correct
26	Correct	8 ms	6896 KB	Output is correct
27	Correct	8 ms	6896 KB	Output is correct
28	Correct	7 ms	6648 KB	Output is correct
29	Correct	8 ms	6640 KB	Output is correct
30	Correct	8 ms	6640 KB	Output is correct
31	Correct	8 ms	6896 KB	Output is correct
32	Correct	7 ms	6640 KB	Output is correct
33	Correct	7 ms	6896 KB	Output is correct
34	Correct	7 ms	6896 KB	Output is correct
35	Correct	7 ms	6896 KB	Output is correct
36	Correct	7 ms	6896 KB	Output is correct
37	Correct	7 ms	6896 KB	Output is correct
38	Correct	7 ms	6640 KB	Output is correct
39	Correct	7 ms	6648 KB	Output is correct
40	Correct	7 ms	6896 KB	Output is correct
41	Correct	6 ms	6904 KB	Output is correct
42	Correct	6 ms	6640 KB	Output is correct
43	Correct	7 ms	6640 KB	Output is correct
44	Correct	6 ms	6896 KB	Output is correct
45	Correct	7 ms	6640 KB	Output is correct
46	Correct	7 ms	6640 KB	Output is correct
47	Correct	7 ms	6640 KB	Output is correct
48	Correct	7 ms	6640 KB	Output is correct
49	Correct	6 ms	6640 KB	Output is correct
50	Correct	6 ms	6640 KB	Output is correct
51	Correct	8 ms	6896 KB	Output is correct
52	Correct	7 ms	6640 KB	Output is correct
53	Correct	7 ms	6648 KB	Output is correct
54	Correct	6 ms	6640 KB	Output is correct
55	Correct	7 ms	6640 KB	Output is correct
56	Correct	7 ms	6640 KB	Output is correct
57	Correct	7 ms	6896 KB	Output is correct
58	Correct	7 ms	6808 KB	Output is correct
59	Correct	8 ms	6640 KB	Output is correct
60	Correct	8 ms	6896 KB	Output is correct
61	Correct	7 ms	6640 KB	Output is correct
62	Correct	8 ms	6640 KB	Output is correct
63	Correct	7 ms	6640 KB	Output is correct
64	Correct	8 ms	6640 KB	Output is correct
65	Correct	8 ms	6640 KB	Output is correct
66	Correct	8 ms	6896 KB	Output is correct
67	Correct	8 ms	6640 KB	Output is correct
68	Correct	8 ms	6896 KB	Output is correct
69	Correct	8 ms	6640 KB	Output is correct
70	Correct	8 ms	6896 KB	Output is correct
71	Correct	8 ms	6640 KB	Output is correct
72	Correct	8 ms	6640 KB	Output is correct
73	Correct	8 ms	6640 KB	Output is correct
74	Correct	8 ms	6648 KB	Output is correct
75	Correct	7 ms	6896 KB	Output is correct
76	Correct	8 ms	6896 KB	Output is correct
77	Correct	8 ms	6640 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	6896 KB	Output is correct
82	Correct	8 ms	6904 KB	Output is correct
83	Correct	7 ms	6728 KB	Output is correct
84	Correct	8 ms	6640 KB	Output is correct
85	Correct	8 ms	6640 KB	Output is correct
86	Correct	9 ms	6896 KB	Output is correct
87	Correct	7 ms	6736 KB	Output is correct
88	Correct	8 ms	6896 KB	Output is correct
89	Correct	8 ms	6896 KB	Output is correct
90	Correct	8 ms	6896 KB	Output is correct
91	Correct	8 ms	6640 KB	Output is correct
92	Correct	8 ms	6896 KB	Output is correct
93	Correct	8 ms	6896 KB	Output is correct
94	Correct	8 ms	6896 KB	Output is correct
95	Correct	8 ms	6640 KB	Output is correct
96	Correct	8 ms	6952 KB	Output is correct
97	Correct	10 ms	6896 KB	Output is correct
98	Correct	8 ms	6896 KB	Output is correct
99	Correct	8 ms	6640 KB	Output is correct
100	Correct	8 ms	6640 KB	Output is correct
101	Correct	16 ms	6896 KB	Output is correct
102	Correct	22 ms	6896 KB	Output is correct
103	Correct	12 ms	6896 KB	Output is correct
104	Correct	8 ms	6648 KB	Output is correct
105	Correct	8 ms	6688 KB	Output is correct
106	Correct	8 ms	6896 KB	Output is correct
107	Correct	8 ms	6896 KB	Output is correct
108	Correct	8 ms	6640 KB	Output is correct
109	Correct	8 ms	6640 KB	Output is correct
110	Correct	8 ms	6640 KB	Output is correct
111	Correct	8 ms	6896 KB	Output is correct
112	Correct	9 ms	6896 KB	Output is correct
113	Correct	7 ms	6896 KB	Output is correct
114	Correct	8 ms	6640 KB	Output is correct
115	Correct	8 ms	6816 KB	Output is correct
116	Correct	8 ms	6640 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	Runtime error	689 ms	30720 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
2	Halted	0 ms	0 KB	-

Submission #95844

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