oj.uz

Submission #365289

# Submission time Handle Problem Language Result Execution time Memory
365289 2021-02-11T11:37:40 Z Mlxa CONSUL (info1cup19_consul) C++14
0 / 100
 18 ms 364 KB 
#ifdef LC
#include "pch.h"
#else
#include <bits/stdc++.h>
#include "grader.h"
#endif
using namespace std;
#define all(x) x.begin(), x.end()
#define x first
#define y second
#define mp make_pair
#define mt make_tuple

int kth(int i);
int cnt(int x);
void say_answer(int a);

mt19937 rnd;

void solve(int n) {
	int q = 48;
	set<int> ind;
	set<int> was;
	while (q > 0 && (int)ind.size() < n) {
		int i = (int)(rnd() % n);
		while (ind.count(i)) {
			i = (int)(rnd() % n);
		}
		int v = kth(i);
		--q;
		if (was.count(v)) {
			continue;
		}
		int c = cnt(v);
		--q;
		if (3 * c > n) {
			say_answer(v);
			return;
		}
	}
	say_answer(-1);
}

#ifdef LC

const int N = 1000;
map<int, int> cn;
int v[N];

int kth(int i) {
	return v[i];
}
int cnt(int x) {
	return cn[x];
}
void say_answer(int x) {
	cout << "answer " << x << endl;
}

signed main() {
	assert(freopen("input.txt", "r", stdin));
	ios::sync_with_stdio(0); cin.tie(0);
	for (int i = 0; i < N; ++i) {
		v[i] = i / (N / 3) % 3;
		++cn[v[i]];
	}
	// for (auto e : cn) {
	// 	cout << e.x << " " << e.y << endl;
	// }
	solve(N);
	return 0;
}

#endif

Subtask #1
0.0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB Wrong query format

Subtask #2
0.0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB Wrong query format
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 364 KB Output is correct
2 Incorrect 1 ms 364 KB Wrong query format
3 Halted 0 ms 0 KB -