제출 #1151856

#제출 시각아이디문제언어결과실행 시간메모리
1151856arsen23CONSUL (info1cup19_consul)C++20
100 / 100
9 ms420 KiB
#include <bits/stdc++.h> #include "grader.h" #define all(v) v.begin(), v.end() #define pb push_back #define F first #define S second #define in insert using namespace std; typedef long long ll; typedef unsigned long long ull; const int N = 1e5 + 123; const int P = 320; const int mod = 1e9 + 7; int n, m, k; int a[N]; int b[N]; bool used[N]; bool usedd[N]; void solve(int n) { vector <int> v; for(int i = 1; i <= n; i++) { v.pb(i); } random_shuffle(all(v)); for(int i = 0; i < min(n / 2 + 1, 30); i++) { int cur = kth(v[i]); if(cnt(cur) > n / 3) { say_answer(cur); return; } } say_answer(-1); } // 28 37 48 49 55 56 57 58 67 9 // 9 + 1 +
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...