제출 #1135420

#제출 시각아이디문제언어결과실행 시간메모리
1135420lopkusCONSUL (info1cup19_consul)C++20
100 / 100
7 ms412 KiB
// author : thembululquaUwU // 3.9.2024 #include <bits/stdc++.h> #include "grader.h" #define pb push_back #define fi first #define se second #define endl '\n' using namespace std; using ll = long long; using ii = pair <int, int>; using vi = vector <int>; const int N = 1e6; const int mod = 1e9 + 7; void maxl(auto &a, auto b) {a = max(a, b);} void minl(auto &a, auto b) {a = min(a, b);} mt19937_64 rd(chrono::steady_clock::now().time_since_epoch().count()); #define rand rd void solve(int n){ srand(time(NULL)); vector <int> ap; for (int loops = 0; loops < min(30, n / 2); ++ loops){ int i = rd() % n + 1; int v = kth(i); if (cnt(v) * 3 > n){ say_answer(v); return; } } say_answer(-1); } //int main(){ // if (fopen("pqh.inp", "r")){ // freopen("pqh.inp", "r", stdin); // freopen("pqh.out", "w", stdout); // } // ios_base::sync_with_stdio(0); // cin.tie(0); cout.tie(0); // // int t = 1; // cin >> t; // while (t --) solve(); // return 0; //}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...