oj.uz

답안 #1073422

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1073422 2024-08-24T14:29:55 Z jer033 COVID tests (CEOI24_covid) C++17
82.64 / 100
 5090 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 known)
{
    if (x>y)
        return -5;
    bool response;
    if (known)
        response = 1;
    else
        response = ask_query2(x, y);
    
    if (response == 0)
        return -5;
    if (x==y)
    {
        answer[x] = 1;
        return x;
    }
    int z = (x+y)/2;
    int k = range_first(x, z, 0);
    if (k!=-5)
        return k;
    return range_first(z+1, y, 1);
}

void range_query(int x, int y)
{
    int currx = x;
    while (currx!=-4)
    {
        currx = range_first(currx, y, 0);
        currx++;
    }
}

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(34);
            else if (P < 0.05)
                work(30);
            else if (P < 0.10)
                work(15);
            else if (P < 0.15)
                work(9);
            else if (P < 0.19)
                work(5);
            else
                work(4);
            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 33 ms 344 KB Output is correct
2 Correct 34 ms 344 KB Output is correct
3 Correct 32 ms 344 KB Output is correct
4 Correct 40 ms 344 KB Output is correct
5 Correct 33 ms 344 KB Output is correct
6 Correct 45 ms 344 KB Output is correct
7 Correct 33 ms 344 KB Output is correct
8 Correct 36 ms 344 KB Output is correct
9 Correct 39 ms 344 KB Output is correct
10 Correct 37 ms 344 KB Output is correct
11 Correct 33 ms 344 KB Output is correct
12 Correct 32 ms 344 KB Output is correct
13 Correct 33 ms 344 KB Output is correct
14 Correct 33 ms 344 KB Output is correct
15 Correct 33 ms 344 KB Output is correct
16 Correct 33 ms 344 KB Output is correct
17 Correct 34 ms 344 KB Output is correct

Subtask #2
72.639999999 / 90.0

# 결과 실행 시간 메모리 Grader output
1 Correct 77 ms 344 KB Output is correct (P=0.001, F=15.1, Q=10.7) -> 90.00 points
2 Correct 335 ms 344 KB Output is correct (P=0.005256, F=51.1, Q=47.8) -> 90.00 points
3 Correct 610 ms 344 KB Output is correct (P=0.011546, F=94.9, Q=94.8) -> 90.00 points
4 Correct 1276 ms 344 KB Output is correct (P=0.028545, F=191.5, Q=195.4) -> 83.22 points
5 Correct 1699 ms 344 KB Output is correct (P=0.039856, F=246.3, Q=257.3) -> 76.36 points
6 Correct 2646 ms 344 KB Output is correct (P=0.068648, F=366.2, Q=383.9) -> 75.42 points
7 Correct 3532 ms 344 KB Output is correct (P=0.104571, F=490.3, Q=519.6) -> 72.64 points
8 Correct 4530 ms 344 KB Output is correct (P=0.158765, F=639.1, Q=675.6) -> 73.26 points
9 Correct 5090 ms 344 KB Output is correct (P=0.2, F=731.4, Q=758.3) -> 78.46 points