Submission #1006488

#TimeUsernameProblemLanguageResultExecution timeMemory
1006488makanhuliaGame (IOI14_game)C++17
0 / 100
0 ms348 KiB
#include <bits/stdc++.h> #define ll int #define pb push_back #define pp pop_back #define mp make_pair #define fi first #define se second #define lb lower_bound #define ub upper_bound #define pll pair<ll,ll> #define pii pair<int,int> #define vl vector<ll> #define nikah ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); const ll maxn = 5e5+7, modn1 = 1e9+7, modn2 = 998244353; using namespace std; // kalo kamu ngga emas nanti nadya merasa bersalah, ayo san demi nadya!!! // Kalo emang soalnya susah, pindah soal dulu // Jangan sampe diem, pikirin sesuatu, pasti bisa!!! // Cobain semua approach, jangan ngestuck di satu pemikiran // Jangan overthinking, jangan panik, tenangin pikiranmu ll freq[1502], maks; void initialize(ll n) { maks = n-1; } bool hasEdge (ll u, ll v) { freq[u]++; freq[v]++; if (freq[u] == maks|| freq[v] == maks) return 1; else return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...