oj.uz

Submission #947700

# Submission time Handle Problem Language Result Execution time Memory
947700 2024-03-16T21:19:42 Z Roupiq Game (IOI14_game) C++17
42 / 100
 1000 ms 4184 KB 
#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using vi = vector<int>;
#define len(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define pb push_back
#define x first
#define y second

vi p;
vector<vi> s;
int sajz, q;

int Find(int v)
{
    if (p[v] == v)
        return v;
    return p[v] = Find(p[v]);
}

void Union(int u, int v)
{
    u = Find(u);
    v = Find(v);
    if (u == v)
        return;
    sajz--;

    for (int i = 0; i < len(p); i++)
    {
        s[i][u] += s[i][v];
        s[i][v] = 0;
    }
    for (int i = 0; i < len(p); i++)
    {
        s[u][i] += s[v][i];
    }

    p[v] = u;
}

void initialize(int n)
{
    q = n * (n - 1) / 2;
    p.assign(n, 0);
    s.assign(n, vi(n));
    sajz = 0;
    for (int i = 0; i < n; i++)
        p[i] = i;
    for (int i = 0; i < n; i++)
        for (int j = 0; j < n; j++)
            if(i != j)
                s[i][j] = 1;
    sajz = n;
}

void print()
{
    vector<vector<int>> ve(len(p));
    for (int i = 0; i < len(p); i++)
    {
        ve[Find(i)].emplace_back(i);
    }
    for (int i = 0; i < len(p); i++)
    {
        // cout << i << ": ";
        // for (auto v : ve[i])
        //     cout << v << " ";
        // cout << "\n";
        // for (auto l : s[i])
        //     cout << l << " ";
        // cout << "\n";
    }
}

int hasEdge(int u, int v)
{
    print();
    q--;
    u = Find(u);
    v = Find(v);
    s[u][v]--;
    s[v][u]--;
    bool jest = 0;
    if (s[u][v] == 0)
    {
        Union(u, v);
        jest = 1;
    }
    if (q && sajz == 1)
    {
        cerr << "Bardzo źle 1\n";
        exit(2137);
    }
    if (!q && sajz != 1)
    {
        cerr << "Bardzo źle 2\n";
        exit(2137);
    }
    return jest;
}

/*
5
2 3
0 4
2 4
3 4
1 3
0 3
1 4
0 2
0 1
1 2

*/

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 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 344 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 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

Subtask #2
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 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 444 KB Output is correct
10 Correct 1 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 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 600 KB Output is correct
18 Correct 0 ms 440 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 344 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 8 ms 496 KB Output is correct
35 Correct 8 ms 500 KB Output is correct
36 Correct 9 ms 344 KB Output is correct
37 Correct 9 ms 348 KB Output is correct
38 Correct 9 ms 348 KB Output is correct
39 Correct 8 ms 488 KB Output is correct
40 Correct 13 ms 348 KB Output is correct
41 Correct 8 ms 500 KB Output is correct
42 Correct 9 ms 344 KB Output is correct
43 Correct 7 ms 344 KB Output is correct
44 Correct 6 ms 344 KB Output is correct
45 Correct 9 ms 348 KB Output is correct
46 Correct 9 ms 428 KB Output is correct
47 Correct 9 ms 348 KB Output is correct
48 Correct 11 ms 344 KB Output is correct
49 Correct 11 ms 348 KB Output is correct
50 Correct 6 ms 348 KB Output is correct
51 Correct 6 ms 348 KB Output is correct
52 Correct 5 ms 492 KB Output is correct
53 Correct 6 ms 348 KB Output is correct
54 Correct 5 ms 348 KB Output is correct

Subtask #3
0 / 58.0

# 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 1 ms 344 KB Output is correct
5 Correct 1 ms 344 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 1 ms 360 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 444 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 352 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 800 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 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 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 8 ms 496 KB Output is correct
35 Correct 8 ms 348 KB Output is correct
36 Correct 8 ms 348 KB Output is correct
37 Correct 9 ms 452 KB Output is correct
38 Correct 8 ms 344 KB Output is correct
39 Correct 8 ms 348 KB Output is correct
40 Correct 8 ms 348 KB Output is correct
41 Correct 8 ms 348 KB Output is correct
42 Correct 9 ms 348 KB Output is correct
43 Correct 7 ms 500 KB Output is correct
44 Correct 6 ms 348 KB Output is correct
45 Correct 9 ms 348 KB Output is correct
46 Correct 9 ms 348 KB Output is correct
47 Correct 9 ms 348 KB Output is correct
48 Correct 9 ms 744 KB Output is correct
49 Correct 11 ms 348 KB Output is correct
50 Correct 6 ms 348 KB Output is correct
51 Correct 5 ms 348 KB Output is correct
52 Correct 6 ms 488 KB Output is correct
53 Correct 6 ms 344 KB Output is correct
54 Correct 6 ms 512 KB Output is correct
55 Execution timed out 1022 ms 4184 KB Time limit exceeded
56 Halted 0 ms 0 KB -