oj.uz

답안 #482677

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
482677 2021-10-26T03:21:09 Z rk42745417 CONSUL (info1cup19_consul) C++17
100 / 100
 51 ms 328 KB 
#include "grader.h"

#include <bits/stdc++.h>
using namespace std;

#define EmiliaMyWife ios::sync_with_stdio(0); cin.tie(0);
using ll = int64_t;
using ull = uint64_t;
using uint = uint32_t;
using ld = long double;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
const ll LINF = ll(2e18) + ll(1e15);
const double EPS = 1e-8;

void solve(int n) {
	if(n <= 50) {
		map<int, int> cnt;
		for(int i = 0; i < n; i++) {
			cnt[kth(i + 1)]++;
		}
		for(const auto &[a, b] : cnt)
			if(b > n / 3)
				return say_answer(a), void();
		say_answer(-1);
		return;
	}
	vector<int> arr(n);
	for(int i = 0; i < n; i++)
		arr[i] = i + 1;
	shuffle(arr.begin(), arr.end(), mt19937(time(0)));
	set<int> has;
	int tmp = 0;
	for(int a : arr) {
		int x = kth(a);
		tmp++;
		if(tmp == 60)
			break;
		if(has.count(x))
			continue;
		has.insert(x);
		int w = cnt(x);
		tmp++;
		if(w > n / 3) {
			say_answer(x);
			return;
		}
		if(tmp == 60)
			break;
	}
	say_answer(-1);
}

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 51 ms 200 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 200 KB Output is correct
2 Correct 3 ms 200 KB Output is correct

Subtask #3
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 200 KB Output is correct
2 Correct 26 ms 200 KB Output is correct
3 Correct 8 ms 200 KB Output is correct
4 Correct 8 ms 276 KB Output is correct
5 Correct 23 ms 300 KB Output is correct
6 Correct 26 ms 200 KB Output is correct
7 Correct 26 ms 200 KB Output is correct
8 Correct 24 ms 296 KB Output is correct
9 Correct 28 ms 200 KB Output is correct
10 Correct 17 ms 300 KB Output is correct
11 Correct 19 ms 328 KB Output is correct
12 Correct 19 ms 200 KB Output is correct
13 Correct 32 ms 220 KB Output is correct
14 Correct 21 ms 200 KB Output is correct