Submission #1109389

#	Time	Username	Problem	Language	Result	Execution time	Memory
1109389		8pete8	COVID tests (CEOI24_covid)	C++17	10 / 100	4937 ms	592 KiB

Main

#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 base="";
string ra;
bool test_students(vector<int> &a) {
    for (auto x:a) base[x]='1';
    cout<<"Q "<<base<<endl;
    cout.flush();
    char answer;
    cin>>answer;
    for (auto x:a) base[x]='0';
    return answer == 'P';
}
int T;
int answer[1001+10];
void solve(int l,int r){
    vector<int> g;
    if(l==r){
        g.push_back(l);
        answer[l]=test_students(g);
        return;
    }
    int mid=l+(r-l)/2;
    for(int i=l;i<=mid;i++)g.push_back(i);
    if(test_students(g)){
        if(l==mid)answer[l]=1;
        else solve(l,mid);
    }
    g.clear();
    for(int i=mid+1;i<=r;i++)g.push_back(i);
    if(test_students(g)){
        if(mid+1==r)answer[r]=1;
        else solve(mid+1,r);
    }
}
int main() {
    cin>>N>>P>>T;
    for(int i=0;i<N;i++)base+='0';
    for (int i = 0; i < T; i++){
        //cin>>ra;
        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);
        for(int j=0;(j*gap)<N;j++){
            solve((j*gap),min(N-1,(j*gap)+gap-1));
        }
        string answer_str="";
        for (int j = 0; j < N; j++){
            if(answer[j])answer_str+='1';
            else answer_str+='0';
        }
        cout<<"A "<<answer_str<<endl;
        cout.flush();
        char verdict;
        cin>>verdict;
    }
    return 0;
}
 

Compilation message (stderr)

Main.cpp:36:40: warning: bad option '-funroll-lopps' to pragma 'optimize' [-Wpragmas]
   36 | #pragma GCC optimize ("03,unroll-lopps")
      |                                        ^
Main.cpp:41:34: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   41 | bool test_students(vector<int> &a) {
      |                                  ^
Main.cpp:52:23: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   52 | void solve(int l,int r){
      |                       ^
Main.cpp:72:10: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   72 | int main() {
      |          ^

• Subtask 0: 0 / 0
• Subtask 1: 10 / 10
• Subtask 2: 0 / 90