Submission #1295751

#	Time	Username	Problem	Language	Result	Execution time	Memory
1295751		Alex_tz307	Game (IOI14_game)	C++17	0 / 100	1 ms	348 KiB

game

#include <bits/stdc++.h>
#include "game.h"

using namespace std;

int N;

void initialize(int n) {
  N = n;
}

int cnt[1500];

/// Construind asa, sti ca pe parcurs nu ai cicluri si sti ca la ultimul
/// pas adaugi muchia n - 1 si obtii graf conex, iar pe parcurs nu vei
/// putea afla mai repede de pasul r starea de conectivitate a grafului

int hasEdge(int u, int v) {
    cnt[u] += 1;
    cnt[v] += 1;
    return max(cnt[u], cnt[v]) == N - 1;
}

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