Submission #1108334

#	Time	Username	Problem	Language	Result	Execution time	Memory
1108334		Ariadna	Game (IOI14_game)	C++14	0 / 100	1 ms	508 KiB

game

#include <bits/stdc++.h>
#define fi first 
#define se second
using namespace std;
 
int n;
vector<vector<int>> edge, con;
int aux = 0;
 
void initialize(int N) {
    n = N;
    edge = con = vector<vector<int>>(n, vector<int>(n, 0));
}
 
int hasEdge(int u, int v) {
    for (int i = 0; i < n; ++i) {
        ++edge[u][i]; ++edge[i][u];
        ++edge[v][i]; ++edge[i][v];
    }
    if (edge[u][v] == 2) {
        for (int i = 0; i < n; ++i) {
            if (i != v) {
                ++con[i][u];
                ++con[u][i];
            } else if (i != u) {
                ++con[i][v]; 
                ++con[v][i];
            } 
        }
        return 1;
    }
    bool ok1 = true;
    for (int i = 0; i < n; ++i) {
        if (i == v) continue;
        if (edge[i][v] == 2*(n-1) && !con[i][v]) {
            ok1 = false;
        }
    }
    bool ok2 = true;
    for (int i = 0; i < n; ++i) {
        if (i == u) continue;
        if (edge[i][u] == 2*(n-1) && !con[i][u]) {
            ok2 = false;
        }
    }

    if (!ok1 || !ok2) {
        for (int i = 0; i < n; ++i) {
            ++edge[u][i]; ++edge[i][u];
            ++edge[v][i]; ++edge[i][v];
            if (i != v) {
                ++con[i][u];
                ++con[u][i];
            } else if (i != u) {
                ++con[i][v]; 
                ++con[v][i];
            } 
        }
        return 1;
    }

    return 0;
}

• Subtask 1: 0 / 15
• Subtask 2: 0 / 27
• Subtask 3: 0 / 58