Submission #615885

#TimeUsernameProblemLanguageResultExecution timeMemory
615885nohaxjustsofloGame (IOI14_game)C++17
100 / 100
251 ms16372 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=1e6+5; const int mod=1e9+9; const int mxlogN=40; const int mxK=26; const int inf=2e9; const int K=600; int cnt[mxN]; void initialize(int n) { } int hasEdge(int u, int v) { return ++cnt[max(u,v)]==max(u,v); } /* int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n, m; cin >> n >> m; int ans=0; int h=0; for(int i=0; i<n; i++) { int x; cin >> x; if(x) } } */ /* 5 4 3 0 1 2 0 2 3 3 2 1 2 4 4 1 3 4 */
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...