Submission #990578

# Submission time Handle Problem Language Result Execution time Memory
990578 2024-05-30T16:26:49 Z Lib Game (IOI14_game) C++14
100 / 100
211 ms 18308 KB
#include <bits/stdc++.h>
using namespace std;
int q[10003];
int con[10003];
int N;
void initialize(int n){
  N=n-1;
}
/*
The key idea is simple: Build a tree and that's it. Find a way to build a tree so that, up until the
penultimate query, is not yet a tree.
Could be done in many ways: the DSU that only connects the final edges between 2 components, the kind of thing
mentioned in the editorial, or.......find a way to seperate all kinds of edges into N-1 non-intersecting sets,
then answering YES to the final edge that belongs to each individual set.
Instead of following the big-brain thing of the editorial........any method of seperating the edges into N-1
non-intersecting sets, where only the final edge that belongs to each set is added, and no cycles are formed
would do.
....okay, the kind of partitioning in the editorial is pretty smart, still thinking of a more original, hyper 
clownery way
cant
*/
int hasEdge(int u, int v){
  if(v>u){
 	swap(u,v);
  }
  q[u]++;
  return (q[u]==(u));
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 356 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 448 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 436 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 344 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 1 ms 344 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 1 ms 348 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 1 ms 348 KB Output is correct
44 Correct 1 ms 604 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 348 KB Output is correct
48 Correct 1 ms 348 KB Output is correct
49 Correct 1 ms 348 KB Output is correct
50 Correct 1 ms 348 KB Output is correct
51 Correct 1 ms 348 KB Output is correct
52 Correct 1 ms 348 KB Output is correct
53 Correct 1 ms 348 KB Output is correct
54 Correct 1 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 1 ms 456 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 1 ms 344 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 1 ms 344 KB Output is correct
42 Correct 1 ms 448 KB Output is correct
43 Correct 1 ms 480 KB Output is correct
44 Correct 1 ms 348 KB Output is correct
45 Correct 1 ms 348 KB Output is correct
46 Correct 1 ms 480 KB Output is correct
47 Correct 1 ms 452 KB Output is correct
48 Correct 1 ms 348 KB Output is correct
49 Correct 1 ms 348 KB Output is correct
50 Correct 1 ms 452 KB Output is correct
51 Correct 1 ms 344 KB Output is correct
52 Correct 1 ms 348 KB Output is correct
53 Correct 1 ms 348 KB Output is correct
54 Correct 1 ms 480 KB Output is correct
55 Correct 20 ms 3736 KB Output is correct
56 Correct 21 ms 3568 KB Output is correct
57 Correct 26 ms 3676 KB Output is correct
58 Correct 21 ms 3676 KB Output is correct
59 Correct 20 ms 3664 KB Output is correct
60 Correct 20 ms 3672 KB Output is correct
61 Correct 27 ms 3668 KB Output is correct
62 Correct 26 ms 3676 KB Output is correct
63 Correct 21 ms 3672 KB Output is correct
64 Correct 20 ms 3676 KB Output is correct
65 Correct 20 ms 3672 KB Output is correct
66 Correct 30 ms 3676 KB Output is correct
67 Correct 27 ms 3828 KB Output is correct
68 Correct 21 ms 3672 KB Output is correct
69 Correct 29 ms 3664 KB Output is correct
70 Correct 21 ms 3676 KB Output is correct
71 Correct 23 ms 3672 KB Output is correct
72 Correct 20 ms 3676 KB Output is correct
73 Correct 20 ms 3728 KB Output is correct
74 Correct 21 ms 3724 KB Output is correct
75 Correct 25 ms 3816 KB Output is correct
76 Correct 46 ms 5456 KB Output is correct
77 Correct 45 ms 5460 KB Output is correct
78 Correct 46 ms 5204 KB Output is correct
79 Correct 46 ms 5456 KB Output is correct
80 Correct 46 ms 5460 KB Output is correct
81 Correct 51 ms 5388 KB Output is correct
82 Correct 55 ms 5456 KB Output is correct
83 Correct 45 ms 5456 KB Output is correct
84 Correct 45 ms 5456 KB Output is correct
85 Correct 78 ms 7428 KB Output is correct
86 Correct 78 ms 7508 KB Output is correct
87 Correct 78 ms 7424 KB Output is correct
88 Correct 78 ms 7504 KB Output is correct
89 Correct 109 ms 7504 KB Output is correct
90 Correct 83 ms 7552 KB Output is correct
91 Correct 79 ms 7556 KB Output is correct
92 Correct 78 ms 7508 KB Output is correct
93 Correct 82 ms 7424 KB Output is correct
94 Correct 185 ms 18308 KB Output is correct
95 Correct 183 ms 18188 KB Output is correct
96 Correct 185 ms 18060 KB Output is correct
97 Correct 179 ms 18272 KB Output is correct
98 Correct 185 ms 18052 KB Output is correct
99 Correct 211 ms 18260 KB Output is correct
100 Correct 180 ms 18220 KB Output is correct