oj.uz

답안 #246297

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
246297 2020-07-08T15:14:07 Z lovemathboy CONSUL (info1cup19_consul) C++14
85 / 100
 78 ms 384 KB 
#include <bits/stdc++.h>
#include "grader.h"
using namespace std;

void solve(int n)
{
	vector<int> r;
	for (int i = 1; i <= n; i++) r.push_back(i);
	random_shuffle(r.begin(), r.end());
	map<int, int> m;
	set<int> s;
	for (int i = 0; i < min(n, 50); i++) {
		int val = kth(r[i]);
		m[val]++;
		s.insert(val);
	}
	vector<pair<int, int> > totals;
	for (int i: s) {
		totals.emplace_back(-m[i], i);
	}
	sort(totals.begin(), totals.end());
	for (int i = 0; i < min((int)totals.size(), 10); i++) {
		if (totals[i].first > n/3) {
			say_answer(totals[i].second);
			return;
		}
		if (cnt(totals[i].second) > n/3) {
			say_answer(totals[i].second);
			return;
		}
	}
	say_answer(-1);
	return;
}

Subtask #1
0.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 59 ms 384 KB Output isn't correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 71 ms 384 KB Output is correct
2 Correct 48 ms 384 KB Output is correct

Subtask #3
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 57 ms 384 KB Output is correct
2 Correct 68 ms 256 KB Output is correct
3 Correct 52 ms 384 KB Output is correct
4 Correct 66 ms 384 KB Output is correct
5 Correct 53 ms 256 KB Output is correct
6 Correct 55 ms 256 KB Output is correct
7 Correct 59 ms 256 KB Output is correct
8 Correct 71 ms 256 KB Output is correct
9 Correct 68 ms 256 KB Output is correct
10 Correct 78 ms 384 KB Output is correct
11 Correct 74 ms 384 KB Output is correct
12 Correct 67 ms 384 KB Output is correct
13 Correct 70 ms 256 KB Output is correct
14 Correct 67 ms 256 KB Output is correct