/** made by amunduzbaev **/
#include "grader.h"
#include <bits/stdc++.h>
#ifndef EVAL
#include "grader.cpp"
#endif
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define NeedForSpeed ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
//#define int long long
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<ll> vll;
typedef vector<int> vii;
typedef vector<pll> vpll;
typedef vector<pii> vpii;
template<class T> bool umin(T& a, const T& b) {return a > b? a = b, true:false;}
template<class T> bool umax(T& a, const T& b) {return a < b? a = b, true:false;}
const int mod = 1e9+7;
const ll inf = 1e18;
const ld Pi = acos(-1);
#define MULTI 1
int n, m, k, ans, res;
void solve(int n){
//vii res;
map<int, int> used;
for(int i=1;i<=n/2;i++){
int cur = kth(i);
if(used[cur]) continue;
used[cur] = 1;
int ncur = cnt(cur);
if(ncur > n/3){
say_answer(cur);
return;
}
}
say_answer(-1);
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
8 ms |
364 KB |
Wrong answer |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
21 ms |
364 KB |
Output is correct |
| 2 |
Incorrect |
5 ms |
364 KB |
Wrong answer |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Partially correct |
108 ms |
364 KB |
Output is partially correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
