oj.uz

Submission #370897

# Submission time Handle Problem Language Result Execution time Memory
370897 2021-02-25T02:19:23 Z Fysty Game (IOI14_game) C++17
0 / 100
 1 ms 492 KB 
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define F first
#define S second
#define pb push_back
int N,d[1505],cnt=0;
void initialize(int n)
{
    N=n;
}
int hasEdge(int u,int v)
{
    if(d[u]==N-2||d[v]==N-2)
    {
        d[u]++,d[v]++;
        return 1;
    }
    else if(cnt==N*(N-1)/2-(N-1))
    {
        d[u]++,d[v]++;
        return 1;
    }
    else
    {
        cnt++;
        return 0;
    }
}

Subtask #1
0 / 15.0

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

Subtask #2
0 / 27.0

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

Subtask #3
0 / 58.0

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