Submission #1151568

#TimeUsernameProblemLanguageResultExecution timeMemory
1151568asdasdCONSUL (info1cup19_consul)C++20
100 / 100
8 ms408 KiB
//gm --- akezhon #include <bits/stdc++.h> #include "grader.h" // #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3") // #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native") #define pb push_back #define pf push_front #define F first #define S second #define all(v) v.begin(),v.end() #define pii pair<int,int> #define tm (tl+tr)/2 #define TL v+v, tl, tm #define TR v+v+1, tm+1, tr #define DA l <= tl && tr <= r #define NE r < tl || tr < l #define double long double // #define int long long using namespace std; // const int N=2e5+7; // const int mod=998244353; // const int inf=2e18; void solve(int n){ vector<int>v; for(int i=1; i <= n; i++)v.pb(i); random_shuffle(all(v)); int r=30; if(n <= 50)r=25; for(int i=0; i < r; i++){ int x = kth(v[i]); if(cnt(x) > n/3){ say_answer(x); return; } } say_answer(-1); } // void AlemAmenov(){ // } // signed main(){ // ios_base::sync_with_stdio(0); // cin.tie(0); // int RealName=1; // cin >> RealName; // srand(time(0)); // while(RealName--) // // AlemAmenov(); // return 0; // }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...