oj.uz

Submission #289259

# Submission time Handle Problem Language Result Execution time Memory
289259 2020-09-02T13:46:52 Z stoyan_malinin Game (IOI14_game) C++14
100 / 100
 494 ms 9464 KB 
#include "game.h"
//#include "grader.cpp"
 
#include <vector>
#include <cstring>
#include <iostream>
 
using namespace std;
 
const int MAXN = 1505;
 
struct DSU
{
    int parent[MAXN];
    vector <int> nodes[MAXN];
 
    DSU(){}
    DSU(int n)
    {
        for(int i = 0;i<n;i++)
        {
            this->parent[i] = i;
            this->nodes[i] = {i};
        }
    }
 
    int Find(int x)
    {
        if(parent[x]==x) return x;
 
        parent[x] = Find(parent[x]);
        return parent[x];
    }
 
    bool Union(int u, int v)
    {
        u = Find(u);
        v = Find(v);
        if(u==v) return false;
        if(nodes[u].size()<nodes[v].size()) swap(u, v);
 
        parent[v] = u;
        for(int x: nodes[v]) nodes[u].push_back(x);
 
        return true;
    }
};
 
DSU T;
bool asked[MAXN][MAXN];
 
void initialize(int n)
{
    T = DSU(n);
    memset(asked, false, sizeof(asked));
}
 
int hasEdge(int u, int v)
{
    if(T.Find(u)==T.Find(v))
    {
        return 1;
    }
 
    asked[u][v] = true;
    asked[v][u] = true;
 
    vector <int> &v1 = T.nodes[T.Find(u)];
    vector <int> &v2 = T.nodes[T.Find(v)];
 
    /*
    cout << "v1:";
    for(int x: v1) cout << " " << x;
    cout << '\n';
 
    cout << "v2:";
    for(int x: v2) cout << " " << x;
    cout << '\n';
    */
 
    bool found = 0;
    for(int x: v1)
    {
        for(int y: v2)
        {
            if(asked[x][y]==false)
            {
                found = 1;
                break;
            }
        }
      
      	if(found==1) break;
    }
 
    if(found==false) T.Union(u, v);
    return found^1;
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2560 KB Output is correct
2 Correct 2 ms 2688 KB Output is correct
3 Correct 2 ms 2560 KB Output is correct
4 Correct 2 ms 2560 KB Output is correct
5 Correct 2 ms 2560 KB Output is correct
6 Correct 2 ms 2560 KB Output is correct
7 Correct 2 ms 2560 KB Output is correct
8 Correct 2 ms 2560 KB Output is correct
9 Correct 2 ms 2560 KB Output is correct
10 Correct 2 ms 2560 KB Output is correct
11 Correct 2 ms 2560 KB Output is correct
12 Correct 2 ms 2560 KB Output is correct
13 Correct 2 ms 2560 KB Output is correct
14 Correct 2 ms 2560 KB Output is correct
15 Correct 2 ms 2560 KB Output is correct
16 Correct 2 ms 2560 KB Output is correct
17 Correct 2 ms 2560 KB Output is correct
18 Correct 2 ms 2560 KB Output is correct
19 Correct 2 ms 2560 KB Output is correct
20 Correct 2 ms 2560 KB Output is correct
21 Correct 2 ms 2560 KB Output is correct
22 Correct 2 ms 2560 KB Output is correct
23 Correct 2 ms 2560 KB Output is correct
24 Correct 2 ms 2560 KB Output is correct

Subtask #2
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2560 KB Output is correct
2 Correct 2 ms 2560 KB Output is correct
3 Correct 2 ms 2560 KB Output is correct
4 Correct 2 ms 2560 KB Output is correct
5 Correct 3 ms 2560 KB Output is correct
6 Correct 2 ms 2560 KB Output is correct
7 Correct 2 ms 2560 KB Output is correct
8 Correct 2 ms 2560 KB Output is correct
9 Correct 3 ms 2688 KB Output is correct
10 Correct 2 ms 2560 KB Output is correct
11 Correct 2 ms 2560 KB Output is correct
12 Correct 2 ms 2560 KB Output is correct
13 Correct 2 ms 2560 KB Output is correct
14 Correct 2 ms 2560 KB Output is correct
15 Correct 2 ms 2560 KB Output is correct
16 Correct 2 ms 2560 KB Output is correct
17 Correct 2 ms 2560 KB Output is correct
18 Correct 2 ms 2560 KB Output is correct
19 Correct 2 ms 2560 KB Output is correct
20 Correct 2 ms 2560 KB Output is correct
21 Correct 2 ms 2560 KB Output is correct
22 Correct 2 ms 2560 KB Output is correct
23 Correct 2 ms 2560 KB Output is correct
24 Correct 2 ms 2560 KB Output is correct
25 Correct 2 ms 2560 KB Output is correct
26 Correct 2 ms 2560 KB Output is correct
27 Correct 2 ms 2560 KB Output is correct
28 Correct 2 ms 2560 KB Output is correct
29 Correct 2 ms 2560 KB Output is correct
30 Correct 2 ms 2560 KB Output is correct
31 Correct 2 ms 2560 KB Output is correct
32 Correct 2 ms 2560 KB Output is correct
33 Correct 2 ms 2560 KB Output is correct
34 Correct 3 ms 2688 KB Output is correct
35 Correct 3 ms 2688 KB Output is correct
36 Correct 3 ms 2688 KB Output is correct
37 Correct 3 ms 2692 KB Output is correct
38 Correct 3 ms 2688 KB Output is correct
39 Correct 3 ms 2688 KB Output is correct
40 Correct 3 ms 2688 KB Output is correct
41 Correct 3 ms 2688 KB Output is correct
42 Correct 3 ms 2688 KB Output is correct
43 Correct 3 ms 2688 KB Output is correct
44 Correct 3 ms 2688 KB Output is correct
45 Correct 3 ms 2688 KB Output is correct
46 Correct 3 ms 2688 KB Output is correct
47 Correct 3 ms 2688 KB Output is correct
48 Correct 3 ms 2688 KB Output is correct
49 Correct 3 ms 2688 KB Output is correct
50 Correct 3 ms 2688 KB Output is correct
51 Correct 3 ms 2688 KB Output is correct
52 Correct 3 ms 2688 KB Output is correct
53 Correct 3 ms 2688 KB Output is correct
54 Correct 3 ms 2688 KB Output is correct

Subtask #3
58.0 / 58.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2560 KB Output is correct
2 Correct 2 ms 2560 KB Output is correct
3 Correct 2 ms 2560 KB Output is correct
4 Correct 2 ms 2560 KB Output is correct
5 Correct 2 ms 2560 KB Output is correct
6 Correct 2 ms 2560 KB Output is correct
7 Correct 2 ms 2560 KB Output is correct
8 Correct 2 ms 2560 KB Output is correct
9 Correct 2 ms 2560 KB Output is correct
10 Correct 2 ms 2560 KB Output is correct
11 Correct 2 ms 2560 KB Output is correct
12 Correct 2 ms 2560 KB Output is correct
13 Correct 2 ms 2560 KB Output is correct
14 Correct 2 ms 2560 KB Output is correct
15 Correct 2 ms 2560 KB Output is correct
16 Correct 2 ms 2560 KB Output is correct
17 Correct 2 ms 2560 KB Output is correct
18 Correct 2 ms 2560 KB Output is correct
19 Correct 2 ms 2560 KB Output is correct
20 Correct 2 ms 2560 KB Output is correct
21 Correct 2 ms 2560 KB Output is correct
22 Correct 2 ms 2560 KB Output is correct
23 Correct 2 ms 2560 KB Output is correct
24 Correct 2 ms 2560 KB Output is correct
25 Correct 2 ms 2560 KB Output is correct
26 Correct 2 ms 2560 KB Output is correct
27 Correct 2 ms 2560 KB Output is correct
28 Correct 2 ms 2560 KB Output is correct
29 Correct 2 ms 2560 KB Output is correct
30 Correct 2 ms 2560 KB Output is correct
31 Correct 2 ms 2560 KB Output is correct
32 Correct 2 ms 2560 KB Output is correct
33 Correct 2 ms 2560 KB Output is correct
34 Correct 3 ms 2688 KB Output is correct
35 Correct 3 ms 2688 KB Output is correct
36 Correct 3 ms 2688 KB Output is correct
37 Correct 3 ms 2688 KB Output is correct
38 Correct 3 ms 2688 KB Output is correct
39 Correct 3 ms 2688 KB Output is correct
40 Correct 3 ms 2688 KB Output is correct
41 Correct 4 ms 2688 KB Output is correct
42 Correct 3 ms 2688 KB Output is correct
43 Correct 3 ms 2688 KB Output is correct
44 Correct 3 ms 2688 KB Output is correct
45 Correct 3 ms 2688 KB Output is correct
46 Correct 3 ms 2688 KB Output is correct
47 Correct 3 ms 2688 KB Output is correct
48 Correct 3 ms 2688 KB Output is correct
49 Correct 3 ms 2688 KB Output is correct
50 Correct 3 ms 2688 KB Output is correct
51 Correct 3 ms 2688 KB Output is correct
52 Correct 3 ms 2688 KB Output is correct
53 Correct 3 ms 2688 KB Output is correct
54 Correct 3 ms 2688 KB Output is correct
55 Correct 54 ms 3576 KB Output is correct
56 Correct 52 ms 3448 KB Output is correct
57 Correct 52 ms 3448 KB Output is correct
58 Correct 53 ms 3576 KB Output is correct
59 Correct 58 ms 3448 KB Output is correct
60 Correct 52 ms 3448 KB Output is correct
61 Correct 55 ms 3524 KB Output is correct
62 Correct 54 ms 3576 KB Output is correct
63 Correct 55 ms 3448 KB Output is correct
64 Correct 93 ms 3448 KB Output is correct
65 Correct 91 ms 3448 KB Output is correct
66 Correct 52 ms 3484 KB Output is correct
67 Correct 54 ms 3448 KB Output is correct
68 Correct 53 ms 3448 KB Output is correct
69 Correct 53 ms 3448 KB Output is correct
70 Correct 53 ms 3448 KB Output is correct
71 Correct 50 ms 3448 KB Output is correct
72 Correct 52 ms 3448 KB Output is correct
73 Correct 49 ms 3448 KB Output is correct
74 Correct 50 ms 3448 KB Output is correct
75 Correct 50 ms 3448 KB Output is correct
76 Correct 123 ms 4472 KB Output is correct
77 Correct 123 ms 4472 KB Output is correct
78 Correct 121 ms 4472 KB Output is correct
79 Correct 121 ms 4472 KB Output is correct
80 Correct 125 ms 4600 KB Output is correct
81 Correct 121 ms 4472 KB Output is correct
82 Correct 121 ms 4472 KB Output is correct
83 Correct 121 ms 4568 KB Output is correct
84 Correct 122 ms 4468 KB Output is correct
85 Correct 213 ms 5880 KB Output is correct
86 Correct 216 ms 5752 KB Output is correct
87 Correct 220 ms 5880 KB Output is correct
88 Correct 219 ms 5752 KB Output is correct
89 Correct 213 ms 5748 KB Output is correct
90 Correct 217 ms 5752 KB Output is correct
91 Correct 213 ms 5752 KB Output is correct
92 Correct 213 ms 5880 KB Output is correct
93 Correct 215 ms 5752 KB Output is correct
94 Correct 494 ms 9428 KB Output is correct
95 Correct 490 ms 9464 KB Output is correct
96 Correct 478 ms 9336 KB Output is correct
97 Correct 492 ms 9420 KB Output is correct
98 Correct 486 ms 9340 KB Output is correct
99 Correct 485 ms 9336 KB Output is correct
100 Correct 487 ms 9336 KB Output is correct