oj.uz

Submission #902160

# Submission time Handle Problem Language Result Execution time Memory
902160 2024-01-10T06:36:06 Z Jawad_Akbar_JJ Game (IOI14_game) C++17
0 / 100
 1 ms 360 KB 
#include <iostream>
#include <vector>
#include <set>

#include "game.h"

using namespace std;
const int N = 85;
vector<int> nei[N],nei2[N];
int block[N][N];
bool seen[N];
int n;
set<pair<int,int>> e;

void initialize(int N){
	n = N;

	for (int i=0;i<n;i++)
		for (int j=i+1;j<n;j++){
			e.insert({i,j});
			nei[i].push_back(j);
			nei[j].push_back(i);
			block[i][j] = block[j][i] = true;
		}
	return;
}

void clear(){
	for (int i=0;i<=n;i++)
		seen[i] = false;
}

int dfs(int u){
	seen[u] = true;
	int a = 1;
	for (int i : nei[u])
		if (!seen[i] and !block[u][i])
			a += dfs(i);
	return a;
}

int hasEdge(int u,int v){
	clear();
	block[u][v] = block[v][u] = false;

	if (dfs(u)==n){
		block[u][v] = block[v][u] = true;
		return 0;
	}
	return 1;
}

Subtask #1
0 / 15.0

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

Subtask #2
0 / 27.0

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

Subtask #3
0 / 58.0

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