oj.uz

Submission #1101690

# Submission time Handle Problem Language Result Execution time Memory
1101690 2024-10-16T15:27:09 Z Mighilon COVID tests (CEOI24_covid) C++17
10 / 100
 16 ms 504 KB 
#include <bits/stdc++.h>
using namespace std;
 
#ifdef DEBUG
#include "../Library/debug.h"
#else
#define dbg(x...)
#endif
 
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl; 
 
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define F0R(i, a) for (int i = 0; i < (a); ++i)
#define FORd(i, a, b) for (int i = (b) - 1; i >= (a); --i)
#define F0Rd(i, a) for (int i = (a) - 1; i >= 0; --i)
#define trav(a, x) for (auto& a : x)
#define f first 
#define s second
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) x.begin(), x.end()
 
const char nl = '\n';
const int INF = 1e9;
const int MOD = 1e9 + 7;
 
int n, LOG;
double p;
int block;
vector<bool> ans;

bool ask(int l, int r){
    cout<<"Q ";
    string s(n,'0');
    FOR(i,l,r+1)
        s[i]='1';
    cout<<s;
    cout<<endl;
    char ans;
    cin>>ans;
    return ans=='P';
}
bool ask2(int l,int sz){
    return ask(l,l+sz-1);
}

int f(int L, int R){
    int l=L, r=R;
    int res=R;
    while(l<=r){
        int m=(l+r)/2;
        bool b=ask(L,m);
        if(!b&&l+1==r){
            return r;
        }
        if(b){
            res=m;
            r=m-1;
        }
        else{
            l=m+1;
        }
    }
    return res;

    // int m=R-L+1;
    // int l=L;
    // int sz=0;
    // F0Rd(k,LOG+1){
    //     if(sz+(1<<k)>m)
    //         continue;
    //     if(sz==m-1){
    //         return R;
    //     }
    //     dbg(k, L+sz+(1<<k))
    //     bool b=ask2(L, sz+(1<<k));
    //     if(!b)
    //         sz+=1<<k;
    // }
    // return L+sz;
}

void solve(){
    int i=0;
    while(i<n){
        bool b=ask(i,min(n-1,i+block-1));
        if(!b)
            i+=block;
        else{
            int j=f(i,min(n-1,i+block-1));
            ans[j]=1;
            i=j+1;
        }
    }
    cout<<"A ";
    F0R(i,n)
        cout<<ans[i];
    cout<<endl;
    char c;
    cin>>c;
}
 
int32_t main(){
    ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
    
    int TC = 1;
    // cin >> TC;
    cin>>n>>p>>TC;
    block=1;
    double tmp=p;
    while(tmp+p<=0.5&&p!=0){
        block++;
        tmp+=p;
    }
    LOG=block?__builtin_clz(1)-__builtin_clz(block):-1;
    ans.resize(n);
    while(TC--){
        ans.assign(n,0);
        solve();
    }
    return 0;
}

Subtask #0
0.0 / 0.0

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

Subtask #1
10.0 / 10.0

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

Subtask #2
0.0 / 90.0

# Verdict Execution time Memory Grader output
1 Runtime error 3 ms 336 KB Execution killed with signal 13
2 Halted 0 ms 0 KB -