# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1044740 | dilanyan | COVID tests (CEOI24_covid) | C++17 | 37 ms | 344 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
//-------------dilanyan------------\\
#define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#include<stdio.h>
using namespace std;
//------------------Kargpefines--------------------\\
#define ll long long
#define pb push_back
#define all(u) (u).begin(), (u).end()
#define pqueue priority_queue
#define upper upper_bound
#define lower lower_bound
#define umap unordered_map
#define uset unordered_set
void KarginSet(string name = "") {
ios_base::sync_with_stdio(false); cin.tie(NULL);
if (name.size()) {
freopen((name + ".in").c_str(), "r", stdin);
freopen((name + ".out").c_str(), "w", stdout);
}
}
//-------------------KarginConstants------------------\\
const ll mod = 1e9 + 7;
const ll inf = 2e9;
//-------------------KarginCode-----------------------\\
const int N = 500005, M = 1000005;
int n;
double p;
bool ans[N], ask[N];
bool flag = true;
void rec(int l, int r) {
if (r - l == 1) {
ans[l] = 1;
return;
}
int m = (l + r) / 2;
for (int i = 0;i < n;i++) {
if (i < l || i >= m) ask[i] = 0;
else ask[i] = 1;
}
cout << "Q ";
for (int i = 0;i < n;i++) cout << (char)('0' + ask[i]);
cout << endl;
char c; cin >> c;
if (c == 'P') rec(l, m);
for (int i = 0;i < n;i++) {
if (i < m || i >= r) ask[i] = 0;
else ask[i] = 1;
}
cout << "Q ";
for (int i = 0;i < n;i++) cout << (char)('0' + ask[i]);
cout << endl;
cin >> c;
if (c == 'P') rec(m, r);
}
void KarginSolve() {
for (int i = 0;i < n;i++) ans[i] = 0;
rec(0, n);
cout << "A ";
for (int i = 0;i < n;i++) cout << (char)('0' + ask[i]);
cout << endl;
char c; cin >> c;
if (c == 'W') exit(0);
}
int main() {
KarginSet();
int test = 1;
cin >> n >> p >> test;
while (test--) {
KarginSolve();
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |