oj.uz

Submission #46536

# Submission time Handle Problem Language Result Execution time Memory
46536 2018-04-21T10:50:33 Z RayaBurong25_1 Game (IOI14_game) C++17
0 / 100
 2 ms 760 KB 
#include "game.h"
int Cut[1505][1505];
int P[1505], Sz[1505];
int N;
int UF(int u)
{
    return (P[u] == -1)?u:(P[u] = UF(P[u]));
}
void initialize(int n)
{
    N = n;
    int i;
    for (i = 0; i < n; i++)
    {
        P[i] = -1;
        Sz[i] = 1;
    }
}

int hasEdge(int u, int v)
{
    int pu = UF(u);
    int pv = UF(v);
    int i;
    if (Cut[pu][pv] + 1 == Sz[pu]*Sz[pv])
    {
        P[pu] = pv;
        for (i = 0; i < N; i++)
        {
            Cut[pv][UF(i)] += Cut[pu][UF(i)];
            Cut[UF(i)][pv] = Cut[pv][UF(i)];
        }
        Sz[pv] += Sz[pu];
        return 1;
    }
    Cut[pu][pv]++;
    Cut[pv][pu]++;
    return 0;
}

Subtask #1
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Incorrect 2 ms 496 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 552 KB Output is correct
2 Incorrect 2 ms 552 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 58.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 596 KB Output is correct
2 Incorrect 2 ms 760 KB Output isn't correct
3 Halted 0 ms 0 KB -