| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 645656 | notme | CONSUL (info1cup19_consul) | C++14 | 29 ms | 296 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#define endl '\n'
#include "grader.h"
using namespace std;
map < int , int > mp;
void solve(int N)
{
mp.clear();
int total = 0;
for (int i = 1; i <= N && total < N; ++ i)
{
int num = kth(i);
if(!mp[num])
{
int times = cnt(num);
mp[num] = 1;
total += times;
if(times > N/3)
{
say_answer(num);
return;
}
}
}
say_answer(-1);
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
