Submission #713258

#TimeUsernameProblemLanguageResultExecution timeMemory
713258mseebacher게임 (IOI14_game)C++17
0 / 100
1 ms312 KiB
//#include <bits/stdc++.h>
#include "game.h"
#include <stdio.h>
#include <stdlib.h>
#include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <iomanip>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <functional>
#include <iostream>
#include <fstream>
#include <string>
using namespace std;

#define mp make_pair
#define f first
#define s second
#define pb push_back

typedef long long ll;
typedef long double lld;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpi;
typedef vector<pll> vpl;

const lld pi = 3.14159265358979323846;

vector<int> in(1505,0);
map<pair<int,int>,bool> m;
int x;

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

int hasEdge(int u,int v){
	in[u]++;
	in[v]++;
	if(in[u] == x-1 || in[v] == x-1) return 1;
	return 0;

}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...