oj.uz

Submission #64880

# Submission time Handle Problem Language Result Execution time Memory
64880 2018-08-06T02:56:48 Z MatheusLealV Game (IOI14_game) C++17
0 / 100
 4 ms 568 KB 
#include <bits/stdc++.h>
#define N 1550
using namespace std;
typedef long long ll;

int block[N], n;

vector<int> grafo[N];

int hasEdge(int u, int v)
{
	if(block[u] == n - 2 || block[v] == n - 2) return 1;

	block[u] ++, block[v] ++;

	return 0;
}

void initialize(int N_)
{
	memset(block, 0, sizeof block);

	n = N_;
}

Subtask #1
0 / 15.0

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

Subtask #2
0 / 27.0

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

Subtask #3
0 / 58.0

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