| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 655148 |
2022-11-03T10:20:24 Z |
jophyyjh |
Game (IOI14_game) |
C++14 |
|
270 ms |
16440 KB |
/**
* A pretty straight-forward problem. The problem asks us to "confuse" the player by
* only letting him/her know the graph's connectivity at the very last moment.
*
* In order to be "between" connected and disconnected, it makes sense to have a
* small (~O(n)) number of edges. Moreover, whether each edge is present shall be
* determined by what edges are actually asked by the player. Here's my solution:
* First imagine that all edges have the state "undecided". At the beginning,
* all edges are "by default" present (we'll find out the actual ans when
* the player asks for it). When the player asks for a new edge {u,v}, we
* see whether not including {u,v} makes the graph disconnected, assuming
* that all "undecided" edges are included.
* If it does, we must include {u,v}; otherwise, we exclude it from the
* graph since there're other undecided edges that preserve connectivity.
* Finally, we flag the edge as "decided".
* One can prove by induction that nC2 queries are required before we can determine
* connectivity. This may look elegant, but the problem is that finding connectivity
* with edge removal is difficult (O(n^4), only passing the first 2 subtasks...).
*
* After thinking for a while, I modified my solution above. First, let's consider
* all the potential edges incident to (n-1): {n-2,n-1}, {n-3,n-1}, ..., {0,n-1}. It
* only takes one of them to make node (n-1) connected to the other nodes, so we can
* simply include the last potential edge asked by the player (which is incident to
* n-1). In this way, n-1 is certainly linked to another node with a smaller index.
* Moreover, the remaining n-1 nodes' connectivity isn't affected by node n-1, so
* the same goes for the remaining n-1 nodes. Nice~
*
* Time Complexity: O(n^2)
* Implementation 1
*/
#include <bits/stdc++.h>
#include "game.h"
typedef std::vector<int> vec;
vec left;
void initialize(int n) {
left.resize(n);
for (int k = 0; k < n; k++)
left[k] = k;
}
int hasEdge(int u, int v) {
if (u > v)
std::swap(u, v);
left[v]--;
return left[v] == 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
212 KB |
Output is correct |
| 2 |
Correct |
1 ms |
300 KB |
Output is correct |
| 3 |
Correct |
1 ms |
212 KB |
Output is correct |
| 4 |
Correct |
1 ms |
212 KB |
Output is correct |
| 5 |
Correct |
1 ms |
212 KB |
Output is correct |
| 6 |
Correct |
1 ms |
212 KB |
Output is correct |
| 7 |
Correct |
0 ms |
212 KB |
Output is correct |
| 8 |
Correct |
0 ms |
212 KB |
Output is correct |
| 9 |
Correct |
0 ms |
212 KB |
Output is correct |
| 10 |
Correct |
0 ms |
212 KB |
Output is correct |
| 11 |
Correct |
0 ms |
304 KB |
Output is correct |
| 12 |
Correct |
0 ms |
212 KB |
Output is correct |
| 13 |
Correct |
1 ms |
212 KB |
Output is correct |
| 14 |
Correct |
1 ms |
212 KB |
Output is correct |
| 15 |
Correct |
1 ms |
212 KB |
Output is correct |
| 16 |
Correct |
0 ms |
308 KB |
Output is correct |
| 17 |
Correct |
1 ms |
212 KB |
Output is correct |
| 18 |
Correct |
1 ms |
212 KB |
Output is correct |
| 19 |
Correct |
1 ms |
212 KB |
Output is correct |
| 20 |
Correct |
0 ms |
212 KB |
Output is correct |
| 21 |
Correct |
1 ms |
212 KB |
Output is correct |
| 22 |
Correct |
1 ms |
308 KB |
Output is correct |
| 23 |
Correct |
1 ms |
212 KB |
Output is correct |
| 24 |
Correct |
1 ms |
212 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
212 KB |
Output is correct |
| 2 |
Correct |
0 ms |
308 KB |
Output is correct |
| 3 |
Correct |
1 ms |
212 KB |
Output is correct |
| 4 |
Correct |
0 ms |
212 KB |
Output is correct |
| 5 |
Correct |
0 ms |
212 KB |
Output is correct |
| 6 |
Correct |
1 ms |
212 KB |
Output is correct |
| 7 |
Correct |
1 ms |
212 KB |
Output is correct |
| 8 |
Correct |
1 ms |
300 KB |
Output is correct |
| 9 |
Correct |
1 ms |
212 KB |
Output is correct |
| 10 |
Correct |
1 ms |
308 KB |
Output is correct |
| 11 |
Correct |
0 ms |
212 KB |
Output is correct |
| 12 |
Correct |
1 ms |
212 KB |
Output is correct |
| 13 |
Correct |
1 ms |
212 KB |
Output is correct |
| 14 |
Correct |
1 ms |
212 KB |
Output is correct |
| 15 |
Correct |
1 ms |
308 KB |
Output is correct |
| 16 |
Correct |
1 ms |
212 KB |
Output is correct |
| 17 |
Correct |
0 ms |
212 KB |
Output is correct |
| 18 |
Correct |
1 ms |
212 KB |
Output is correct |
| 19 |
Correct |
0 ms |
212 KB |
Output is correct |
| 20 |
Correct |
1 ms |
212 KB |
Output is correct |
| 21 |
Correct |
0 ms |
212 KB |
Output is correct |
| 22 |
Correct |
1 ms |
212 KB |
Output is correct |
| 23 |
Correct |
1 ms |
304 KB |
Output is correct |
| 24 |
Correct |
1 ms |
212 KB |
Output is correct |
| 25 |
Correct |
1 ms |
212 KB |
Output is correct |
| 26 |
Correct |
1 ms |
212 KB |
Output is correct |
| 27 |
Correct |
1 ms |
212 KB |
Output is correct |
| 28 |
Correct |
1 ms |
212 KB |
Output is correct |
| 29 |
Correct |
1 ms |
304 KB |
Output is correct |
| 30 |
Correct |
1 ms |
308 KB |
Output is correct |
| 31 |
Correct |
1 ms |
212 KB |
Output is correct |
| 32 |
Correct |
1 ms |
212 KB |
Output is correct |
| 33 |
Correct |
1 ms |
312 KB |
Output is correct |
| 34 |
Correct |
1 ms |
320 KB |
Output is correct |
| 35 |
Correct |
1 ms |
344 KB |
Output is correct |
| 36 |
Correct |
1 ms |
340 KB |
Output is correct |
| 37 |
Correct |
1 ms |
340 KB |
Output is correct |
| 38 |
Correct |
1 ms |
340 KB |
Output is correct |
| 39 |
Correct |
1 ms |
344 KB |
Output is correct |
| 40 |
Correct |
1 ms |
344 KB |
Output is correct |
| 41 |
Correct |
1 ms |
344 KB |
Output is correct |
| 42 |
Correct |
1 ms |
344 KB |
Output is correct |
| 43 |
Correct |
1 ms |
340 KB |
Output is correct |
| 44 |
Correct |
1 ms |
320 KB |
Output is correct |
| 45 |
Correct |
1 ms |
348 KB |
Output is correct |
| 46 |
Correct |
1 ms |
348 KB |
Output is correct |
| 47 |
Correct |
1 ms |
340 KB |
Output is correct |
| 48 |
Correct |
1 ms |
340 KB |
Output is correct |
| 49 |
Correct |
1 ms |
316 KB |
Output is correct |
| 50 |
Correct |
1 ms |
340 KB |
Output is correct |
| 51 |
Correct |
1 ms |
340 KB |
Output is correct |
| 52 |
Correct |
1 ms |
340 KB |
Output is correct |
| 53 |
Correct |
1 ms |
340 KB |
Output is correct |
| 54 |
Correct |
2 ms |
340 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Correct |
1 ms |
212 KB |
Output is correct |
| 3 |
Correct |
0 ms |
212 KB |
Output is correct |
| 4 |
Correct |
0 ms |
212 KB |
Output is correct |
| 5 |
Correct |
0 ms |
212 KB |
Output is correct |
| 6 |
Correct |
0 ms |
312 KB |
Output is correct |
| 7 |
Correct |
0 ms |
212 KB |
Output is correct |
| 8 |
Correct |
0 ms |
212 KB |
Output is correct |
| 9 |
Correct |
1 ms |
212 KB |
Output is correct |
| 10 |
Correct |
1 ms |
212 KB |
Output is correct |
| 11 |
Correct |
1 ms |
212 KB |
Output is correct |
| 12 |
Correct |
1 ms |
212 KB |
Output is correct |
| 13 |
Correct |
1 ms |
304 KB |
Output is correct |
| 14 |
Correct |
1 ms |
212 KB |
Output is correct |
| 15 |
Correct |
1 ms |
308 KB |
Output is correct |
| 16 |
Correct |
1 ms |
308 KB |
Output is correct |
| 17 |
Correct |
1 ms |
212 KB |
Output is correct |
| 18 |
Correct |
0 ms |
212 KB |
Output is correct |
| 19 |
Correct |
0 ms |
304 KB |
Output is correct |
| 20 |
Correct |
1 ms |
212 KB |
Output is correct |
| 21 |
Correct |
1 ms |
212 KB |
Output is correct |
| 22 |
Correct |
0 ms |
308 KB |
Output is correct |
| 23 |
Correct |
1 ms |
212 KB |
Output is correct |
| 24 |
Correct |
0 ms |
312 KB |
Output is correct |
| 25 |
Correct |
1 ms |
212 KB |
Output is correct |
| 26 |
Correct |
1 ms |
212 KB |
Output is correct |
| 27 |
Correct |
1 ms |
212 KB |
Output is correct |
| 28 |
Correct |
1 ms |
212 KB |
Output is correct |
| 29 |
Correct |
1 ms |
212 KB |
Output is correct |
| 30 |
Correct |
1 ms |
212 KB |
Output is correct |
| 31 |
Correct |
1 ms |
212 KB |
Output is correct |
| 32 |
Correct |
1 ms |
212 KB |
Output is correct |
| 33 |
Correct |
1 ms |
212 KB |
Output is correct |
| 34 |
Correct |
1 ms |
340 KB |
Output is correct |
| 35 |
Correct |
1 ms |
340 KB |
Output is correct |
| 36 |
Correct |
1 ms |
340 KB |
Output is correct |
| 37 |
Correct |
1 ms |
340 KB |
Output is correct |
| 38 |
Correct |
1 ms |
340 KB |
Output is correct |
| 39 |
Correct |
1 ms |
340 KB |
Output is correct |
| 40 |
Correct |
1 ms |
340 KB |
Output is correct |
| 41 |
Correct |
1 ms |
340 KB |
Output is correct |
| 42 |
Correct |
1 ms |
340 KB |
Output is correct |
| 43 |
Correct |
1 ms |
340 KB |
Output is correct |
| 44 |
Correct |
1 ms |
340 KB |
Output is correct |
| 45 |
Correct |
1 ms |
340 KB |
Output is correct |
| 46 |
Correct |
1 ms |
340 KB |
Output is correct |
| 47 |
Correct |
2 ms |
320 KB |
Output is correct |
| 48 |
Correct |
1 ms |
340 KB |
Output is correct |
| 49 |
Correct |
1 ms |
256 KB |
Output is correct |
| 50 |
Correct |
1 ms |
340 KB |
Output is correct |
| 51 |
Correct |
1 ms |
340 KB |
Output is correct |
| 52 |
Correct |
1 ms |
324 KB |
Output is correct |
| 53 |
Correct |
1 ms |
340 KB |
Output is correct |
| 54 |
Correct |
1 ms |
340 KB |
Output is correct |
| 55 |
Correct |
29 ms |
1996 KB |
Output is correct |
| 56 |
Correct |
29 ms |
2016 KB |
Output is correct |
| 57 |
Correct |
30 ms |
1996 KB |
Output is correct |
| 58 |
Correct |
28 ms |
1980 KB |
Output is correct |
| 59 |
Correct |
29 ms |
1960 KB |
Output is correct |
| 60 |
Correct |
29 ms |
1996 KB |
Output is correct |
| 61 |
Correct |
29 ms |
2040 KB |
Output is correct |
| 62 |
Correct |
29 ms |
2000 KB |
Output is correct |
| 63 |
Correct |
29 ms |
2020 KB |
Output is correct |
| 64 |
Correct |
28 ms |
1960 KB |
Output is correct |
| 65 |
Correct |
29 ms |
2004 KB |
Output is correct |
| 66 |
Correct |
29 ms |
1996 KB |
Output is correct |
| 67 |
Correct |
30 ms |
2000 KB |
Output is correct |
| 68 |
Correct |
28 ms |
1948 KB |
Output is correct |
| 69 |
Correct |
29 ms |
2052 KB |
Output is correct |
| 70 |
Correct |
28 ms |
2000 KB |
Output is correct |
| 71 |
Correct |
29 ms |
2008 KB |
Output is correct |
| 72 |
Correct |
28 ms |
1948 KB |
Output is correct |
| 73 |
Correct |
30 ms |
1976 KB |
Output is correct |
| 74 |
Correct |
30 ms |
1996 KB |
Output is correct |
| 75 |
Correct |
29 ms |
1956 KB |
Output is correct |
| 76 |
Correct |
64 ms |
4304 KB |
Output is correct |
| 77 |
Correct |
64 ms |
4312 KB |
Output is correct |
| 78 |
Correct |
68 ms |
4336 KB |
Output is correct |
| 79 |
Correct |
63 ms |
4264 KB |
Output is correct |
| 80 |
Correct |
64 ms |
4300 KB |
Output is correct |
| 81 |
Correct |
66 ms |
4352 KB |
Output is correct |
| 82 |
Correct |
67 ms |
4384 KB |
Output is correct |
| 83 |
Correct |
67 ms |
4292 KB |
Output is correct |
| 84 |
Correct |
63 ms |
4348 KB |
Output is correct |
| 85 |
Correct |
110 ms |
7288 KB |
Output is correct |
| 86 |
Correct |
114 ms |
7384 KB |
Output is correct |
| 87 |
Correct |
114 ms |
7372 KB |
Output is correct |
| 88 |
Correct |
109 ms |
7328 KB |
Output is correct |
| 89 |
Correct |
116 ms |
7360 KB |
Output is correct |
| 90 |
Correct |
116 ms |
7304 KB |
Output is correct |
| 91 |
Correct |
119 ms |
7304 KB |
Output is correct |
| 92 |
Correct |
110 ms |
7388 KB |
Output is correct |
| 93 |
Correct |
110 ms |
7304 KB |
Output is correct |
| 94 |
Correct |
251 ms |
16260 KB |
Output is correct |
| 95 |
Correct |
253 ms |
16440 KB |
Output is correct |
| 96 |
Correct |
248 ms |
16260 KB |
Output is correct |
| 97 |
Correct |
260 ms |
16204 KB |
Output is correct |
| 98 |
Correct |
256 ms |
16332 KB |
Output is correct |
| 99 |
Correct |
270 ms |
16324 KB |
Output is correct |
| 100 |
Correct |
261 ms |
16204 KB |
Output is correct |
