oj.uz

답안 #1101607

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1101607 2024-10-16T11:38:11 Z Mighilon COVID tests (CEOI24_covid) C++17
55.25 / 100
 7000 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<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';
}

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

    // res=0;
    // F0Rd(k,LOG+1){
    //     if(L+res+(1<<k)>R)
    //         continue;
    //     dbg(k, L+res+(1<<k))
    //     bool b=ask(L, L+res+(1<<k)-1);
    //     if(!b)
    //         res+=1<<k;
    // }
    return res;
}

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){
        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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct

Subtask #1
0.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 336 KB Output is correct
2 Correct 11 ms 336 KB Output is correct
3 Correct 13 ms 336 KB Output is correct
4 Correct 11 ms 336 KB Output is correct
5 Correct 13 ms 336 KB Output is correct
6 Correct 16 ms 336 KB Output is correct
7 Correct 13 ms 504 KB Output is correct
8 Correct 8 ms 336 KB Output is correct
9 Correct 11 ms 336 KB Output is correct
10 Correct 6 ms 336 KB Output is correct
11 Correct 9 ms 336 KB Output is correct
12 Correct 9 ms 336 KB Output is correct
13 Correct 8 ms 336 KB Output is correct
14 Correct 9 ms 336 KB Output is correct
15 Correct 11 ms 336 KB Output is correct
16 Correct 15 ms 336 KB Output is correct
17 Execution timed out 7074 ms 336 KB Time limit exceeded
18 Halted 0 ms 0 KB -

Subtask #2
55.250000001 / 90.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 336 KB Output is correct (P=0.001, F=15.1, Q=11.3) -> 90.00 points
2 Correct 114 ms 336 KB Output is correct (P=0.005256, F=51.1, Q=47.5) -> 90.00 points
3 Correct 242 ms 336 KB Output is correct (P=0.011546, F=94.9, Q=92.6) -> 90.00 points
4 Correct 486 ms 336 KB Output is correct (P=0.028545, F=191.5, Q=192.0) -> 89.07 points
5 Correct 644 ms 336 KB Output is correct (P=0.039856, F=246.3, Q=252.9) -> 81.29 points
6 Correct 966 ms 336 KB Output is correct (P=0.068648, F=366.2, Q=382.9) -> 76.12 points
7 Correct 1323 ms 336 KB Output is correct (P=0.104571, F=490.3, Q=525.0) -> 70.14 points
8 Correct 1751 ms 336 KB Output is correct (P=0.158765, F=639.1, Q=707.3) -> 63.08 points
9 Correct 2062 ms 336 KB Output is correct (P=0.2, F=731.4, Q=846.4) -> 55.25 points