oj.uz

답안 #1071460

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1071460 2024-08-23T07:33:36 Z jer033 COVID tests (CEOI24_covid) C++17
10 / 100
 56 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;
}

bool range_query(int x, int y, bool known)
{
    bool response;
    if (known==1)
        response = 1;
    else
        response = ask_query2(x, y);
    if (response==1)
    {
        if (x==y)
            answer[x] = 1;
        else
        {
            int z = (x+y)/2;
            bool a = range_query(x, z, 0);
            if (a==0)
                range_query(z+1, y, 1);
        }
        return 1;
    }
    return 0;
}

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
    {
        while (T--)
        {
            answer_clear();
            if (P < 0.01)
                range_query(0, 999, 0);
            else if (P < 0.05)
            {
                for (int i=1; i<=10; i++)
                    range_query(100*i-100, 100*i-1, 0);
            }
            else if (P < 0.11)
            {
                for (int i=1; i<=50; i++)
                    range_query(20*i-20, 20*i-1, 0);
            }
            else
            {
                for (int i=1; i<=100; i++)
                    range_query(10*i-10, 10*i-1, 0);
            }
            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 48 ms 344 KB Output is correct
2 Correct 33 ms 344 KB Output is correct
3 Correct 43 ms 344 KB Output is correct
4 Correct 37 ms 344 KB Output is correct
5 Correct 33 ms 344 KB Output is correct
6 Correct 34 ms 344 KB Output is correct
7 Correct 43 ms 344 KB Output is correct
8 Correct 43 ms 344 KB Output is correct
9 Correct 38 ms 344 KB Output is correct
10 Correct 34 ms 344 KB Output is correct
11 Correct 34 ms 344 KB Output is correct
12 Correct 37 ms 344 KB Output is correct
13 Correct 35 ms 344 KB Output is correct
14 Correct 42 ms 344 KB Output is correct
15 Correct 37 ms 344 KB Output is correct
16 Correct 56 ms 344 KB Output is correct
17 Correct 33 ms 344 KB Output is correct

Subtask #2
0.0 / 90.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 344 KB translate:wrong
2 Halted 0 ms 0 KB -