Submission #760771

#TimeUsernameProblemLanguageResultExecution timeMemory
760771voliaanykCONSUL (info1cup19_consul)C++14
0 / 100
1 ms208 KiB
#include "bits/stdc++.h" #include "grader.h" using namespace std; #define DIM 100007 #define DIM2 2007 #define fi first #define se second #define mod 1000000007 typedef long long ll; typedef long double ld; typedef pair<ll, ll> pll; /* int kth(int i){ int c; cout<<"value "<<i<<endl; cin>>c; return c; } int cnt(int x){ int c; cout<<"frequency "<<x<<endl; cin>>c; return c; } void say_answer(int a){ cout<<a<<endl; }*/ void solve(int n){ bool w = 0; for(int i=1;i<=20;i++){ int x = rand() % n + 1; x = kth(x); int c = cnt(x); if(c>n*1.0/3){ w = x; break; } } if(w) say_answer(w); else say_answer(-1); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...