oj.uz

답안 #901971

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
901971 2024-01-10T05:04:32 Z Faisal_Saqib 게임 (IOI14_game) C++17
0 / 100
 1 ms 348 KB 
// #pragma once
#include <map>
#include "game.h"
using namespace std;
const int N=100;
int deg[N];
map<pair<int,int>,int> done;
int l=0;
void initialize(int n)
{
	l=(n*(n-1))/2;
	done.clear();
	for(int i=0;i<=n;i++)
		deg[i]=n-1;
}
int hasEdge(int u, int v)
{
	l--;
	if(l==0)
		return 0;
	if(done.find({u,v})==done.end())
	{
		deg[u]--;
		deg[v]--;
		if(deg[u]==0 or deg[v]==0)
		{
			done[{u,v}]=done[{v,u}]=1;
		}
		else
		{
			done[{u,v}]=done[{v,u}]=0;
		}
	}
	return done[{u,v}];
	// We have 
}

Subtask #1
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Incorrect 0 ms 344 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 58.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -