Submission #1326844

#TimeUsernameProblemLanguageResultExecution timeMemory
1326844tkm_algorithmsGame (IOI14_game)C++20
0 / 100
0 ms332 KiB
#include "game.h"
#include <bits/stdc++.h>

using namespace std;
using ll = long long;
//#define int ll
using P = pair<int, int>;
#define all(x) x.begin(), x.end()
#define rep(i, l, n) for (int i = l; i < (n); ++i)
#define sz(x) (int)x.size()
const char nl = '\n';
const int mod = 998244353;
const int N = 1600;
//int cnt[N];
int nn;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int rand(int x,int y) {
    return x + rng() % (y - x + 1);
}

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

int cnt = 0;

int hasEdge(int u, int v) {
	if (u>v)swap(u, v);
	if (u == 1 && v == 2)return 1;
	if (u == 3 && v == 4)return 1;
	cnt += 1;
	if (cnt == 4)return 1;
	return 0;
}

//void solve() {
	
//}

//int32_t main() {
    //ios_base::sync_with_stdio(0);
    //cin.tie(0);
    //solve();
    //return 0;
//}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...