제출 #413029

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
413029		Karliver	Game (IOI14_game)	C++14	100 / 100	355 ms	12392 KiB

game

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

#define FIXED_FLOAT(x)  std::fixed <<std::setprecision(20) << (x)
#define all(v) (v).begin(), (v).end()
using namespace  std;
#define forn(i,n) for (int i = 0; i < (n); ++i)
#define rforn(i, n) for(int i = (n) - 1;i >= 0;--i)
using ll = long long;
int mod = (ll)1e9 + 7;
#define PI acos(-1)
typedef pair<int, int> pairs;

const int INF = 1e9 + 1;
const int N = 2e5 + 100;
const double eps = 1e-7;

template <class T> using V = vector<T>;  // from yosupo 
template <class T> using VV = V<V<T>>;  // from yosupo


template <typename XPAX>
void ckma(XPAX &x, XPAX y) {
    x = (x < y ? y : x);
}
template <typename XPAX>
void ckmi(XPAX &x, XPAX y) {
    x = (x > y ? y : x);
}
V<int> deg(N, 0);
void initialize(int n) {
	

}

int hasEdge(int u, int v) {

  
    return ++deg[u > v ? u : v] == (u > v ? u : v);
    
}

// 1 -> 0, 3 -> 1, 
// 1 3
// 0 3
// 2 0
// 1 0
// 3 1
// 2 1

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