oj.uz

Submission #524267

# Submission time Handle Problem Language Result Execution time Memory
524267 2022-02-09T00:57:49 Z maks007 CONSUL (info1cup19_consul) C++14
19 / 100
 738 ms 292 KB 
#include <bits/stdc++.h>
#include <map>
#include "grader.h"
using namespace std;

void solve(int n)
{
	map <int,int> mp;
    for(int i = 0; i < n; i ++) {
    	int k = kth(i+1);
    	mp[k] ++;
    	if(mp[k] > n/3) {
    		say_answer(k);
    		return;
    	}
    }

    say_answer(-1);
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 200 KB Output is correct

Subtask #2
4.0 / 20.0

# Verdict Execution time Memory Grader output
1 Partially correct 85 ms 200 KB Output is partially correct
2 Partially correct 48 ms 200 KB Output is partially correct

Subtask #3
0.0 / 65.0

# Verdict Execution time Memory Grader output
1 Partially correct 738 ms 292 KB Output is partially correct
2 Halted 0 ms 0 KB -