oj.uz

Submission #677994

# Submission time Handle Problem Language Result Execution time Memory
677994 2023-01-04T23:33:46 Z Mher777 CONSUL (info1cup19_consul) C++17
0 / 100
 143 ms 296 KB 
#include <bits/stdc++.h>
using namespace std;

int kth(int k);
void say_answer(int k);
int cnt(int k);

void solve(int n) {
	map<int, int> mp;
	int sum = 0;
	for (int i = 1; i <= n; i++) {
		int k1 = kth(i); 
		if (!mp[k1]) {
			int k2 = cnt(k1);
			mp[k1] += k2;
			if (k2 > n / 3) {
				say_answer(k1);
				return;
			}
			sum += k2;
		}
		if (sum >= (n / 3) * 2) {
			say_answer(-1);
			return;
		}
	}
}

Subtask #1
0.0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 208 KB Wrong answer
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 296 KB Output is correct
2 Incorrect 1 ms 208 KB Wrong answer
3 Halted 0 ms 0 KB -

Subtask #3
0.0 / 65.0

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