oj.uz

Submission #241719

# Submission time Handle Problem Language Result Execution time Memory
241719 2020-06-25T10:55:21 Z Coroian_David Game (IOI14_game) C++11
100 / 100
 591 ms 25336 KB 
#include <bits/stdc++.h>

#include "game.h"

#define MAX_N 1500

using namespace std;
/*
int ap[MAX_N + 1];

int pos[MAX_N + 1][MAX_N + 1];
int p2[MAX_N + 1][MAX_N + 1];
*/
int N;

int comp[MAX_N + 1];
int h[MAX_N + 1];
int dp[MAX_N + 1][MAX_N + 1];

void initialize(int n)
{
    for(int i = 1; i <= n; i ++)
    {
        comp[i] = i;
        h[i] = 1;

        for(int j = 1; j <= n; j ++)
        {
            if(i != j)
                dp[i][j] = 1;
        }
    }

    N = n;
    return;
/*
    for(int i = 1; i <= n; i ++)
    {
        ap[i] = n - 1;

        for(int j = 1; j <= n; j ++)
        {
            if(i != j)
            {
                pos[i][j] = 1;

                p2[i][j] = 1;
            }
        }
    }*/
}
/*
void verif(int a)
{
    int n = N;
    if(ap[a] != 1)
        return;

    //cout << "BAGAM LA " << a << "\n";

    for(int i = 1; i <= n; i ++)
    {
        if(i != a && ap[i] > 0 && pos[a][i] == 1)
        {
          //  cout << "SE COMBINA CU " << i << "\n";

            pos[a][i] = pos[i][a] = 2;
            ap[i] --;
            ap[a] --;

            verif(i);

            return;
        }
    }
}

int viz[MAX_N + 1];

int cr, cnt;

void dfs(int a)
{
    cnt ++;
    viz[a] = cr;
    for(int i = 1; i <= N; i ++)
    {
        if(i != a && p2[i][a] == 1 && viz[i] < cr)
        {
            dfs(i);
        }
    }
}

int brut(int u, int v)
{
    p2[u][v] = p2[v][u] = 0;

    cr ++;
    cnt = 0;
    dfs(u);

    int rez = 0;
    if(cnt < N)
        rez = 1;

    p2[v][u] = p2[u][v] = rez;

    return rez;
}

*/
int getComp(int a)
{
    return (comp[a] = (comp[a] == a ? a : getComp(comp[a])));
}

void uneste(int a, int b)
{
    if(h[a] < h[b])
        swap(a, b);

    comp[b] = a;
    h[a] += (h[a] == h[b]);

    int n = N;
    for(int i = 1; i <= n; i ++)
    {
        int x = getComp(i);

        if(x != a)
        {
            dp[x][a] += dp[x][b];
            dp[x][b] = 0;

            dp[a][x] += dp[b][x];
            dp[b][x] = 0;
        }
    }
}

int hasEdge(int u, int v)
{
    u ++;
    v ++;

    int ca = getComp(u);
    int cb = getComp(v);

    if(ca == cb)
    {
        return 0;
    }

    else
    {
        if(dp[ca][cb] == 1)
        {
            uneste(ca, cb);

            return 1;
        }

        else
        {
            dp[ca][cb] --;
            dp[cb][ca] --;

            return 0;
        }
    }

    return 0;
/*
    int r2 = brut(u, v);

    if(r2 != rez)
    {
        cout << ap[v] << " " << ap[u] << "\n";
        cout << " POS " << pos[u][v] << " " << pos[v][u] << " \n";
        cout << " SUINTEM ACOACOAL L O " << u << " " << v << " " << cnt  << " " << cr << " si trebuie " << r2 << " iese " << rez << "\n";
    }


    assert(r2 == rez);

    return rez;*/
}

Subtask #1
15.0 / 15.0

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

Subtask #2
27.0 / 27.0

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

Subtask #3
58.0 / 58.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 6 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 4 ms 384 KB Output is correct
15 Correct 4 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 5 ms 384 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 5 ms 384 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Correct 5 ms 512 KB Output is correct
26 Correct 5 ms 512 KB Output is correct
27 Correct 5 ms 512 KB Output is correct
28 Correct 5 ms 512 KB Output is correct
29 Correct 5 ms 512 KB Output is correct
30 Correct 5 ms 512 KB Output is correct
31 Correct 5 ms 512 KB Output is correct
32 Correct 5 ms 512 KB Output is correct
33 Correct 5 ms 512 KB Output is correct
34 Correct 6 ms 768 KB Output is correct
35 Correct 6 ms 768 KB Output is correct
36 Correct 6 ms 768 KB Output is correct
37 Correct 6 ms 768 KB Output is correct
38 Correct 6 ms 768 KB Output is correct
39 Correct 6 ms 768 KB Output is correct
40 Correct 6 ms 768 KB Output is correct
41 Correct 6 ms 768 KB Output is correct
42 Correct 6 ms 768 KB Output is correct
43 Correct 6 ms 768 KB Output is correct
44 Correct 6 ms 768 KB Output is correct
45 Correct 6 ms 768 KB Output is correct
46 Correct 6 ms 768 KB Output is correct
47 Correct 6 ms 768 KB Output is correct
48 Correct 6 ms 768 KB Output is correct
49 Correct 6 ms 768 KB Output is correct
50 Correct 6 ms 768 KB Output is correct
51 Correct 6 ms 768 KB Output is correct
52 Correct 6 ms 768 KB Output is correct
53 Correct 6 ms 768 KB Output is correct
54 Correct 6 ms 768 KB Output is correct
55 Correct 55 ms 5112 KB Output is correct
56 Correct 62 ms 5112 KB Output is correct
57 Correct 54 ms 5112 KB Output is correct
58 Correct 54 ms 5112 KB Output is correct
59 Correct 53 ms 5112 KB Output is correct
60 Correct 54 ms 5112 KB Output is correct
61 Correct 54 ms 5160 KB Output is correct
62 Correct 57 ms 5112 KB Output is correct
63 Correct 56 ms 5112 KB Output is correct
64 Correct 51 ms 5112 KB Output is correct
65 Correct 52 ms 5112 KB Output is correct
66 Correct 54 ms 5112 KB Output is correct
67 Correct 55 ms 5112 KB Output is correct
68 Correct 58 ms 5088 KB Output is correct
69 Correct 55 ms 5112 KB Output is correct
70 Correct 54 ms 5088 KB Output is correct
71 Correct 57 ms 5112 KB Output is correct
72 Correct 58 ms 5116 KB Output is correct
73 Correct 60 ms 5240 KB Output is correct
74 Correct 53 ms 5112 KB Output is correct
75 Correct 53 ms 5120 KB Output is correct
76 Correct 141 ms 8952 KB Output is correct
77 Correct 121 ms 8952 KB Output is correct
78 Correct 121 ms 8952 KB Output is correct
79 Correct 118 ms 8956 KB Output is correct
80 Correct 117 ms 8952 KB Output is correct
81 Correct 116 ms 8952 KB Output is correct
82 Correct 119 ms 8952 KB Output is correct
83 Correct 125 ms 8952 KB Output is correct
84 Correct 120 ms 8952 KB Output is correct
85 Correct 214 ms 13480 KB Output is correct
86 Correct 240 ms 13560 KB Output is correct
87 Correct 211 ms 13432 KB Output is correct
88 Correct 211 ms 13560 KB Output is correct
89 Correct 217 ms 13560 KB Output is correct
90 Correct 230 ms 13432 KB Output is correct
91 Correct 224 ms 13564 KB Output is correct
92 Correct 248 ms 13536 KB Output is correct
93 Correct 226 ms 13560 KB Output is correct
94 Correct 475 ms 25208 KB Output is correct
95 Correct 471 ms 25184 KB Output is correct
96 Correct 491 ms 25208 KB Output is correct
97 Correct 513 ms 25336 KB Output is correct
98 Correct 489 ms 25228 KB Output is correct
99 Correct 513 ms 25248 KB Output is correct
100 Correct 591 ms 25208 KB Output is correct