oj.uz

답안 #1101569

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1101569 2024-10-16T10:43:52 Z Mighilon COVID tests (CEOI24_covid) C++17
52.27 / 100
 2405 ms 508 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;
double p;
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';
}

void f(int l, int r){
    int m=(l+r)/2;
    bool b1=ask(l,m);
    dbg(l,r,m,b1)
    if(b1&&l==m){
        ans[l]=1;
    }
    else if(b1){
        f(l,m);
    }
    else if(!b1&&r==m+1){
        ans[r]=1;
        return;
    }
    else{
        f(m+1,r);
        return;
    }
    bool b2=ask(m+1,r);
    dbg(b2)
    if(b2&&m+1==r){
        ans[r]=1;
    }
    else if(b2){
        f(m+1,r);
    }
}

void solve(){
    if(ask(0,n-1))
        f(0,n-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;
    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
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 336 KB Output is correct
2 Correct 13 ms 336 KB Output is correct
3 Correct 15 ms 336 KB Output is correct
4 Correct 9 ms 336 KB Output is correct
5 Correct 12 ms 508 KB Output is correct
6 Correct 13 ms 336 KB Output is correct
7 Correct 13 ms 336 KB Output is correct
8 Correct 9 ms 336 KB Output is correct
9 Correct 14 ms 336 KB Output is correct
10 Correct 7 ms 336 KB Output is correct
11 Correct 12 ms 336 KB Output is correct
12 Correct 10 ms 336 KB Output is correct
13 Correct 12 ms 336 KB Output is correct
14 Correct 11 ms 336 KB Output is correct
15 Correct 10 ms 336 KB Output is correct
16 Correct 14 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct

Subtask #2
42.270000003 / 90.0

# 결과 실행 시간 메모리 Grader output
1 Correct 46 ms 336 KB Output is correct (P=0.001, F=15.1, Q=13.9) -> 90.00 points
2 Correct 162 ms 336 KB Output is correct (P=0.005256, F=51.1, Q=61.5) -> 49.61 points
3 Correct 294 ms 336 KB Output is correct (P=0.011546, F=94.9, Q=119.1) -> 44.55 points
4 Correct 603 ms 336 KB Output is correct (P=0.028545, F=191.5, Q=242.3) -> 43.67 points
5 Correct 846 ms 336 KB Output is correct (P=0.039856, F=246.3, Q=313.1) -> 43.17 points
6 Correct 1175 ms 336 KB Output is correct (P=0.068648, F=366.2, Q=462.9) -> 43.77 points
7 Correct 1556 ms 336 KB Output is correct (P=0.104571, F=490.3, Q=619.0) -> 43.90 points
8 Correct 2044 ms 336 KB Output is correct (P=0.158765, F=639.1, Q=807.6) -> 43.80 points
9 Correct 2405 ms 336 KB Output is correct (P=0.2, F=731.4, Q=937.9) -> 42.27 points