| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1315338 | muhammad-mutahir | CONSUL (info1cup19_consul) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
#include "grader.h"
using namespace std;
#define print(l) for(auto i:l) cout<<i<<" ";cout<<endl;
#define input(t,l,n) vector<t>l(n);for(int i = 0;i<n;i++)cin>>l[i];
#define int long long
#define pb push_back
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define all(l) l.begin(),l.end()
#define pii pair<int,int>
#define fi first
#define se second
const int M = 1e9+7;
const int inf = 1e18;
int bp(int x, int y, int p){
int res = 1;
x = x % p;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
int MI(int n, int p){
return bp(n, p - 2, p);
}
int mul(int x,int y, int p){
return x * 1ull * y % p;
}
int di(int x,int y, int p){
return mul(x, MI(y, p), p);
}
int n , m , k , q;
void solve(int n){
// cin>>n;
srand(std::time({}));
map<int,int>cn;
for(int i = 0;i<=30;i++){
int v = rand();
v%=n;
v++;
int x = kth(v);
if(cn[x] == 0){
cn[x] = cnt(x);
}
if(cn[x] > n/3){
say_answer(x);
return;
}
}
say_answer(-1);
}
//
// signed main(){
// ios::sync_with_stdio(0);//DO NOT USE IN INTERACTIVE
// cin.tie(0), cout.tie(0);
// cout << fixed<<setprecision(9);
//
// int t = 1;
// cin>>t;
// for(int i = 1;i<=t;i++){
// solve(i);
// }
//
// }