oj.uz

답안 #1073485

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1073485 2024-08-24T15:17:52 Z jer033 COVID tests (CEOI24_covid) C++17
73.43 / 100
 6333 ms 516 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 m)
{
    int currx = x;
    int curry = y;
    while (currx!=-4)
    {
        currx = range_first(currx, curry, 0);
        currx++;
        if (currx!=-4)
        {
            curry = currx+m-1;
            curry = min(999, curry);
        }
    }
    if (curry!=999)
    {
        currx = curry+1;
        curry = currx+m-1;
        curry = min(999, curry);
        if (m<30)
            if ((curry + (m/4))>999)
                curry = 999;
        range_query(currx, curry, m);
    }
}

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

int main()
{
    std::ios::sync_with_stdio(false);
    cin.tie(NULL);
    int N, T;
    long double P;
    cin >> N >> P >> T;
    if (T==1)
    {
        while (T--)
        {
            work(1);
            bool L = report(answer);
            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(30);
            else if (P < 0.05)
                work(24);
            else if (P < 0.10)
                work(20);
            else if (P < 0.15)
                work(8);
            else if (P < 0.19)
                work(4);
            else
                work(5);
            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 23 ms 344 KB Output is correct
2 Correct 36 ms 344 KB Output is correct
3 Correct 23 ms 344 KB Output is correct
4 Correct 28 ms 344 KB Output is correct
5 Correct 33 ms 344 KB Output is correct
6 Correct 27 ms 340 KB Output is correct
7 Correct 30 ms 344 KB Output is correct
8 Correct 27 ms 344 KB Output is correct
9 Correct 25 ms 508 KB Output is correct
10 Correct 34 ms 344 KB Output is correct
11 Correct 33 ms 344 KB Output is correct
12 Correct 31 ms 344 KB Output is correct
13 Correct 21 ms 344 KB Output is correct
14 Correct 22 ms 344 KB Output is correct
15 Correct 21 ms 344 KB Output is correct
16 Correct 29 ms 344 KB Output is correct
17 Correct 33 ms 344 KB Output is correct

Subtask #2
63.430000002 / 90.0

# 결과 실행 시간 메모리 Grader output
1 Correct 102 ms 344 KB Output is correct (P=0.001, F=15.1, Q=10.7) -> 90.00 points
2 Correct 394 ms 344 KB Output is correct (P=0.005256, F=51.1, Q=47.3) -> 90.00 points
3 Correct 728 ms 344 KB Output is correct (P=0.011546, F=94.9, Q=94.6) -> 90.00 points
4 Correct 1627 ms 344 KB Output is correct (P=0.028545, F=191.5, Q=190.1) -> 90.00 points
5 Correct 1933 ms 516 KB Output is correct (P=0.039856, F=246.3, Q=251.6) -> 82.87 points
6 Correct 3042 ms 344 KB Output is correct (P=0.068648, F=366.2, Q=397.5) -> 67.07 points
7 Correct 3864 ms 344 KB Output is correct (P=0.104571, F=490.3, Q=493.5) -> 87.71 points
8 Correct 5160 ms 344 KB Output is correct (P=0.158765, F=639.1, Q=633.1) -> 90.00 points
9 Correct 6333 ms 344 KB Output is correct (P=0.2, F=731.4, Q=808.0) -> 63.43 points