Submission #612245

#TimeUsernameProblemLanguageResultExecution timeMemory
612245nohaxjustsofloGame (IOI14_game)C++17
0 / 100
1 ms324 KiB
#include <bits/stdc++.h> #include <iostream> using namespace std; typedef long long ll; typedef unsigned long long ull; typedef long double ld; #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> using namespace __gnu_pbds; typedef tree<ll,null_type,less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> order_set; mt19937 mt_rand(chrono::high_resolution_clock::now().time_since_epoch().count()); //uniform_int_distribution<int> gen; ///(min, max) //int random() {return gen(mt_rand);} const int mxN=3003; const int mod=998244353; const int mxlogN=40; const int mxK=26; const ll inf=1e18; const int K=600; int N, cnt[mxN]; void initialize(int n) { N=n; } int hasEdge(int u, int v) { cnt[u]++; cnt[v]++; return max(cnt[u],cnt[v])==N-1; } /* 7 3 4 1 3 4 0 2 3 */
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...