oj.uz

Submission #1075083

# Submission time Handle Problem Language Result Execution time Memory
1075083 2024-08-25T18:12:03 Z pawned COVID tests (CEOI24_covid) C++17
59.17 / 100
 1616 ms 344 KB 
#pragma GCC optimize("O1,O2,O3,Ofast,unroll-loops")

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

#define fi first
#define se second
#define pb push_back
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;

const char nl = '\n';

void fastIO() {
	ios::sync_with_stdio(false);
	cin.tie(0);
}

int N, T;
double P;

char query(vi v) {
	string s(N, '0');
	for (int x : v)
		s[x] = '1';
	cout<<"Q "<<s<<endl;
	cout.flush();
	char c;
	cin>>c;
	return c;
}

char query(int l, int r) {
	string s(N, '0');
	for (int i = l; i <= r; i++) {
		s[i] = '1';
	}
	cout<<"Q "<<s<<endl;
	cout.flush();
	char c;
	cin>>c;
	return c;
}

string ans(N, '0');

void solve(int left, int right) {	// know there's positive on range
	if (left == right) {
		ans[left] = '1';
		return;
	}
	int mid = (left + right) / 2;
	if (query(left, mid) == 'P') {
		solve(left, mid);
		if (query(mid + 1, right) == 'P')
			solve(mid + 1, right);
	}
	else {	// surely has in right
		solve(mid + 1, right);
	}
}

int main() {
	fastIO();
	cin>>N>>P>>T;
	int len = max(5, min((int)(0.5 / P), N));
	for (int i = 0; i < T; i++) {
		ans = string(N, '0');
		for (int j = 0; j < N; j += len) {
			int lp = j;
			int rp = min(j + len - 1, N - 1);
			if (query(lp, rp) == 'P')
				solve(lp, rp);
		}
//		cout<<"ANSWER: ";
		cout<<"A "<<ans<<endl;
		cout.flush();
		char c;
		cin>>c;
		if (c == 'W')
			break;
	}
}

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 344 KB Output is correct
2 Correct 7 ms 344 KB Output is correct
3 Correct 6 ms 344 KB Output is correct
4 Correct 8 ms 344 KB Output is correct
5 Correct 9 ms 344 KB Output is correct
6 Correct 5 ms 344 KB Output is correct
7 Correct 7 ms 344 KB Output is correct
8 Correct 6 ms 344 KB Output is correct
9 Correct 7 ms 344 KB Output is correct
10 Correct 4 ms 344 KB Output is correct
11 Correct 8 ms 344 KB Output is correct
12 Correct 3 ms 344 KB Output is correct
13 Correct 6 ms 344 KB Output is correct
14 Correct 4 ms 344 KB Output is correct
15 Correct 8 ms 344 KB Output is correct
16 Correct 8 ms 344 KB Output is correct
17 Correct 1 ms 344 KB Output is correct

Subtask #2
49.169999997 / 90.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 344 KB Output is correct (P=0.001, F=15.1, Q=14.0) -> 90.00 points
2 Correct 105 ms 344 KB Output is correct (P=0.005256, F=51.1, Q=59.5) -> 54.30 points
3 Correct 229 ms 344 KB Output is correct (P=0.011546, F=94.9, Q=114.6) -> 49.17 points
4 Correct 451 ms 344 KB Output is correct (P=0.028545, F=191.5, Q=225.7) -> 52.50 points
5 Correct 551 ms 344 KB Output is correct (P=0.039856, F=246.3, Q=293.0) -> 51.18 points
6 Correct 822 ms 344 KB Output is correct (P=0.068648, F=366.2, Q=423.2) -> 55.47 points
7 Correct 1066 ms 344 KB Output is correct (P=0.104571, F=490.3, Q=559.9) -> 57.40 points
8 Correct 1342 ms 344 KB Output is correct (P=0.158765, F=639.1, Q=712.5) -> 61.67 points
9 Correct 1616 ms 344 KB Output is correct (P=0.2, F=731.4, Q=828.6) -> 58.76 points