oj.uz

Submission #1026512

# Submission time Handle Problem Language Result Execution time Memory
1026512 2024-07-18T07:20:38 Z 정희우(#10948) COVID tests (CEOI24_covid) C++17
33.71 / 100
 2589 ms 600 KB 
#include<iostream>
#include<algorithm>
#include<vector>
#include<random>
#include<ctime>

using namespace std;
using lint = long long;
using intp = pair<int,int>;
using vint = vector<int>;

const int MAX_N=1010;

int n,q;
double p;
int sf[MAX_N];
char ask[MAX_N];
char ans[MAX_N];

int askq()
{
    char c;
    cout << "Q " << ask << endl;
    cin >> c;
    return (c=='P');
}

void calc(int s,int e)
{
    vint v;
    for(int i=s;i<e;i++)
        if(ans[sf[i]]=='0')
            v.push_back(sf[i]);
    if(v.empty())return;
    for(auto x : v)ask[x]='1';
    int a=askq();
    for(auto x : v)ask[x]='0';
    if(!a)
        return;
    int lb=0,ub=v.size()-1;
    while(lb<ub)
    {
        int m=(lb+ub)/2;
        for(int i=lb;i<=m;i++)ask[v[i]]='1';
        int a=askq();
        for(int i=lb;i<=m;i++)ask[v[i]]='0';
        if(a)ub=m;
        else lb=m+1;
    }
    ans[v[lb]]='1';
    calc(lb+1,e);
}

int main()
{
    ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
    cin >> n >> p >> q;
    fill(ask,ask+n,'0');
    fill(ans,ans+n,'0');
    if(q==1)
    {
        for(int i=0;i<n;i++)
        {
            ask[i]='1';
            ans[i]='0'+askq();
            ask[i]='0';
        }
        char c;
        cout << "A " << ans << endl;
        cin >> c;
        return 0;
    }
    srand(time(NULL));
    for(int i=0;i<n;i++)
        sf[i]=i;
    for(int i=0;i<n;i++)
        swap(sf[i],sf[i+(rand()%(n-i))]);
    int chunk=1/p;
    while(q--)
    {
        fill(ans,ans+n,'0');
        for(int i=0;i<n;i+=chunk)
            calc(i,min(n,i+chunk));
        char c;
        cout << "A " << ans << endl;
        cin >> c;
    }
    return 0;
}

Subtask #0
0.0 / 0.0

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

Subtask #1
10.0 / 10.0

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

Subtask #2
23.709999996 / 90.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 480 KB Output is correct (P=0.001, F=15.1, Q=10.8) -> 90.00 points
2 Correct 98 ms 448 KB Output is correct (P=0.005256, F=51.1, Q=50.8) -> 90.00 points
3 Correct 216 ms 472 KB Output is correct (P=0.011546, F=94.9, Q=104.0) -> 65.05 points
4 Correct 456 ms 344 KB Output is correct (P=0.028545, F=191.5, Q=230.7) -> 49.48 points
5 Correct 658 ms 344 KB Output is correct (P=0.039856, F=246.3, Q=313.6) -> 43.00 points
6 Correct 1012 ms 472 KB Output is correct (P=0.068648, F=366.2, Q=500.1) -> 36.55 points
7 Correct 1453 ms 460 KB Output is correct (P=0.104571, F=490.3, Q=716.0) -> 31.68 points
8 Correct 1991 ms 448 KB Output is correct (P=0.158765, F=639.1, Q=1003.9) -> 27.41 points
9 Correct 2589 ms 600 KB Output is correct (P=0.2, F=731.4, Q=1242.5) -> 23.71 points