oj.uz

답안 #980680

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
980680 2024-05-12T10:12:29 Z penguin133 CONSUL (info1cup19_consul) C++17
85 / 100
 11 ms 600 KB 
#include <bits/stdc++.h>
using namespace std;
#include "grader.h"
//#define int long long
#define pi pair<int, int>
#define pii pair<int, pi>
#define fi first
#define se second
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#endif
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

void solve(int n)
{
    for(int i = 1; i <= 30; i++){
		int res = kth(rng()%n + 1);
		int x = cnt(res);
		if(x > n / 3){
			say_answer(res);
			return;
		}
	}
	say_answer(-1);
}

Subtask #1
0.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 6 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
20.0 / 20.0

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

Subtask #3
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 344 KB Output is correct
2 Correct 10 ms 344 KB Output is correct
3 Correct 3 ms 344 KB Output is correct
4 Correct 3 ms 600 KB Output is correct
5 Correct 8 ms 344 KB Output is correct
6 Correct 9 ms 344 KB Output is correct
7 Correct 10 ms 344 KB Output is correct
8 Correct 10 ms 340 KB Output is correct
9 Correct 9 ms 344 KB Output is correct
10 Correct 9 ms 344 KB Output is correct
11 Correct 9 ms 344 KB Output is correct
12 Correct 8 ms 344 KB Output is correct
13 Correct 11 ms 344 KB Output is correct
14 Correct 9 ms 344 KB Output is correct