oj.uz

답안 #1073401

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1073401 2024-08-24T14:07:53 Z jer033 COVID tests (CEOI24_covid) C++17
10 / 100
 7000 ms 344 KB 
#include <bits/stdc++.h>
using namespace std;

vector<bool> answer(1000, 0);

void answer_clear()
{
    for (int i=0; i<1000; i++)
        answer[i] = 0;
}

bool ask_query(vector<bool> a)
{
    cout << "Q ";
    for (int i=0; i<1000; i++)
        cout << a[i];
    cout << '\n';
    cout.flush();
    char x;
    cin >> x;
    if (x=='P')
        return 1;
    return 0;
}

bool ask_query2(int x, int y)
{
    cout << "Q ";
    for (int i=0; i<x; i++)
        cout << '0';
    for (int i=x; i<=y; i++)
        cout << '1';
    for (int i=y+1; i<1000; i++)
        cout << '0';
    cout << endl;
    char k;
    cin >> k;
    if (k=='P')
        return 1;
    return 0;
}

bool report(vector<bool> a)
{
    cout << "A ";
    for (int i=0; i<1000; i++)
        cout << a[i];
    cout << '\n';
    cout.flush();
    char x;
    cin >> x;
    if (x=='C')
        return 1;
    return 0;
}

long double prob;

int range_first(int x, int y)
{
    bool response = ask_query2(x, y);
    if (response == 0)
        return -1;
    if (x==y)
        return x;
    int z = (x+y)/2;
    int k = range_first(x, z);
    if (k!=-1)
        return k;
    return range_first(z+1, y);
}

void range_query(int x, int y)
{
    int currx = x;
    while (currx!=-1)
    {
        currx = range_first(currx, y);
        if (currx!=-1)
            answer[currx] = 1;
    }
}

void work(int m)
{
    int curr = 0;
    bool go_on = 1;
    while (go_on)
    {
        range_query(curr, min(curr+m-1, 999));
        if ((curr+m-1)>=999)
            go_on = 0;
        curr+=m;
    }
}

int main()
{
    std::ios::sync_with_stdio(false);
    int N, T;
    long double P;
    cin >> N >> P >> T;
    if (T==1)
    {
        while (T--)
        {
            vector<bool> query(N, 0);
            vector<bool> ans(N, 0);
            for (int i=0; i<N; i++)
            {
                query[i] = 1;
                ans[i] = ask_query(query);
                query[i] = 0;
            }
            bool L = report(ans);
            if (L==0)
                T = 0;
        }
    }
    else
    {
        prob = P;
        while (T--)
        {
            answer_clear();
            if (P < 0.005)
                work(1000);
            else if (P < 0.01)
                work(200);
            else if (P < 0.02)
                work(125);
            else if (P < 0.03)
                work(25);
            else if (P < 0.05)
                work(13);
            else if (P < 0.10)
                work(8);
            else if (P < 0.15)
                work(4);
            else if (P < 0.19)
                work(4);
            else
                work(2);
            bool L = report(answer);
            if (L==0)
                T = 0;
        }
    }
}

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 0 ms 344 KB Execution killed with signal 13
2 Halted 0 ms 0 KB -

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 47 ms 344 KB Output is correct
2 Correct 33 ms 344 KB Output is correct
3 Correct 33 ms 344 KB Output is correct
4 Correct 32 ms 344 KB Output is correct
5 Correct 34 ms 344 KB Output is correct
6 Correct 60 ms 344 KB Output is correct
7 Correct 34 ms 344 KB Output is correct
8 Correct 33 ms 344 KB Output is correct
9 Correct 34 ms 344 KB Output is correct
10 Correct 34 ms 344 KB Output is correct
11 Correct 55 ms 344 KB Output is correct
12 Correct 37 ms 344 KB Output is correct
13 Correct 55 ms 344 KB Output is correct
14 Correct 34 ms 344 KB Output is correct
15 Correct 53 ms 344 KB Output is correct
16 Correct 36 ms 344 KB Output is correct
17 Correct 32 ms 344 KB Output is correct

Subtask #2
0.0 / 90.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 7042 ms 344 KB Time limit exceeded
2 Halted 0 ms 0 KB -