oj.uz

Submission #960202

# Submission time Handle Problem Language Result Execution time Memory
960202 2024-04-09T21:19:54 Z vjudge1 Game (IOI14_game) C++17
0 / 100
 2 ms 2648 KB 
#include "game.h"
#include <bits/stdc++.h>
using namespace std;
 
const int N = 1500;
 
int n;
bitset<N> adj[N], edge[N];
 
void initialize(int nn) {
    n = nn;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if (i == j) continue;
            adj[i][j] = 1;
        }
    }
}
 
int hasEdge(int u, int v) {
        if (adj[u].count() == 1) {
        int x = 0;
        while (!adj[u][x]) x++;

        adj[u][x] = adj[x][u] = 0;
        edge[u][x] = edge[x][u] = 1;
    }

    if (adj[v].count() == 1) {
        int x = 0;
        while (!adj[v][x]) x++;
        
        adj[v][x] = adj[x][v] = 0;
        edge[v][x] = edge[x][v] = 1;
    }

    if (edge[u][v]) return 1;

    adj[u][v] = adj[v][u] = 0;

    return 0;
}

Subtask #1
0 / 15.0

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

Subtask #2
0 / 27.0

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

Subtask #3
0 / 58.0

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