| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1109400 | 2024-11-06T15:52:43 Z | 8pete8 | COVID tests (CEOI24_covid) | C++17 | 5236 ms | 592 KB |
#include <cassert>
#include <cstdio>
#include <string>
#include <vector>
#include<iostream>
#include<stack>
#include<map>
#include<vector>
#include<string>
#include<cassert>
#include<unordered_map>
#include <queue>
#include <cstdint>
#include<cstring>
#include<limits.h>
#include<cmath>
#include<set>
#include<algorithm>
#include <iomanip>
#include<numeric>
#include<bitset>
using namespace std;
#define ll long long
#define f first
#define s second
#define pii pair<int,int>
#define ppii pair<int,pii>
#define vi vector<int>
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define F(n) for(int i=0;i<n;i++)
#define lb lower_bound
#define ub upper_bound
#define fastio ios::sync_with_stdio(false);cin.tie(NULL);
#pragma GCC optimize ("03,unroll-lopps")
int N;
double P;
string ra;
bool test_students(std::vector<bool> mask){
//for(int i=0;i<N;i++)if(mask[i]&&ra[i]=='1')return 1;
//return 0;
std::string mask_str(N, ' ');
for (int i = 0; i < N; i++)
mask_str[i] = mask[i] ? '1' : '0';
printf("Q %s\n", mask_str.c_str());
fflush(stdout);
char answer;
scanf(" %c", &answer);
return answer == 'P';
}
int T;
int answer[1001+10];
void solve(int ql,int qr){
int l=ql,r=qr;
vector<bool>qry(N,0);
while(l<=qr){
r=qr;
int pos=N;
while(l<=r){
int mid=l+(r-l)/2;
for(int j=l;j<=mid;j++)qry[j]=1;
if(test_students(qry)){
for(int j=l;j<=mid;j++)qry[j]=0;
pos=min(pos,mid),r=mid-1;
}
else{
for(int j=l;j<=mid;j++)qry[j]=0;
l=mid+1;
}
}
if(pos==N)return;
l=pos+1;
answer[pos]=1;
}
}
void find_positive(int gap){
for(int j=0;(j*gap)<N;j++){
solve(j*gap,min(N-1,(j*gap)+gap-1));
}
}
int main() {
scanf("%d %lf %d", &N, &P, &T);
//cin>>ra;
for (int i = 0; i < T; i++) {
for(int j=0;j<N;j++)answer[j]=0;
int gap;
if(T==1)gap=1;
else if(P==0.001)gap=500;
else if(P==0.005256)gap=125;
else if(P==0.011546)gap=59;
else if(P==0.028545)gap=25;
else if(P==0.039856)gap=17;
else if(P==0.068648)gap=10;
else if (P==0.104571)gap=7;
else if(P==0.158765)gap=4;
else if(P==0.2)gap=4;
else assert(0);
find_positive(gap);
std::string answer_str(N, ' ');
for (int j = 0; j < N; j++)
answer_str[j] = answer[j] ? '1' : '0';
printf("A %s\n", answer_str.c_str());
fflush(stdout);
char verdict;
//for(int i=0;i<N;i++)if(answer_str[i]!=ra[i])assert(0);
scanf(" %c", &verdict);
if (verdict == 'W')
exit(0);
}
return 0;
}
Compilation message
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Runtime error | 1 ms | 592 KB | Execution killed with signal 6 |
| 2 | Halted | 0 ms | 0 KB | - |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Correct | 18 ms | 336 KB | Output is correct |
| 2 | Correct | 17 ms | 504 KB | Output is correct |
| 3 | Correct | 21 ms | 336 KB | Output is correct |
| 4 | Correct | 18 ms | 336 KB | Output is correct |
| 5 | Correct | 19 ms | 336 KB | Output is correct |
| 6 | Correct | 20 ms | 336 KB | Output is correct |
| 7 | Correct | 16 ms | 336 KB | Output is correct |
| 8 | Correct | 18 ms | 336 KB | Output is correct |
| 9 | Correct | 15 ms | 336 KB | Output is correct |
| 10 | Correct | 15 ms | 508 KB | Output is correct |
| 11 | Correct | 16 ms | 504 KB | Output is correct |
| 12 | Correct | 18 ms | 336 KB | Output is correct |
| 13 | Correct | 17 ms | 336 KB | Output is correct |
| 14 | Correct | 18 ms | 336 KB | Output is correct |
| 15 | Correct | 13 ms | 336 KB | Output is correct |
| 16 | Correct | 18 ms | 336 KB | Output is correct |
| 17 | Correct | 19 ms | 336 KB | Output is correct |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Correct | 169 ms | 336 KB | Output is correct (P=0.001, F=15.1, Q=25.3) -> 24.31 points |
| 2 | Correct | 545 ms | 336 KB | Output is correct (P=0.005256, F=51.1, Q=86.0) -> 24.12 points |
| 3 | Correct | 969 ms | 336 KB | Output is correct (P=0.011546, F=94.9, Q=156.6) -> 25.00 points |
| 4 | Correct | 1870 ms | 348 KB | Output is correct (P=0.028545, F=191.5, Q=298.3) -> 27.86 points |
| 5 | Correct | 2476 ms | 336 KB | Output is correct (P=0.039856, F=246.3, Q=393.0) -> 26.61 points |
| 6 | Correct | 3503 ms | 336 KB | Output is correct (P=0.068648, F=366.2, Q=536.7) -> 31.44 points |
| 7 | Correct | 4016 ms | 336 KB | Output is correct (P=0.104571, F=490.3, Q=628.9) -> 42.24 points |
| 8 | Execution timed out | 5236 ms | 336 KB | Time limit exceeded (wall clock) |
| 9 | Halted | 0 ms | 0 KB | - |