oj.uz

답안 #1073509

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1073509 2024-08-24T15:31:44 Z jer033 COVID tests (CEOI24_covid) C++17
88.96 / 100
 5026 ms 596 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;
bool spec = 0;

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;
    if ((z>x) and spec)
        z--;
    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/2))>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(16);
            else if (P < 0.10)
            {
                spec = 1;
                work(15);
            }
            else if (P < 0.15)
            {
                spec = 1;
                work(7);
            }
            else if (P < 0.19)
                work(4);
            else
            {
                spec = 1;
                work(3);
            }
            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 20 ms 344 KB Output is correct
2 Correct 26 ms 344 KB Output is correct
3 Correct 25 ms 344 KB Output is correct
4 Correct 22 ms 344 KB Output is correct
5 Correct 29 ms 344 KB Output is correct
6 Correct 20 ms 344 KB Output is correct
7 Correct 21 ms 344 KB Output is correct
8 Correct 31 ms 344 KB Output is correct
9 Correct 33 ms 344 KB Output is correct
10 Correct 19 ms 344 KB Output is correct
11 Correct 26 ms 344 KB Output is correct
12 Correct 19 ms 344 KB Output is correct
13 Correct 31 ms 344 KB Output is correct
14 Correct 20 ms 344 KB Output is correct
15 Correct 19 ms 344 KB Output is correct
16 Correct 20 ms 344 KB Output is correct
17 Correct 35 ms 344 KB Output is correct

Subtask #2
78.959999997 / 90.0

# 결과 실행 시간 메모리 Grader output
1 Correct 95 ms 344 KB Output is correct (P=0.001, F=15.1, Q=10.7) -> 90.00 points
2 Correct 331 ms 344 KB Output is correct (P=0.005256, F=51.1, Q=47.3) -> 90.00 points
3 Correct 698 ms 344 KB Output is correct (P=0.011546, F=94.9, Q=94.6) -> 90.00 points
4 Correct 1312 ms 344 KB Output is correct (P=0.028545, F=191.5, Q=190.1) -> 90.00 points
5 Correct 1626 ms 596 KB Output is correct (P=0.039856, F=246.3, Q=243.9) -> 90.00 points
6 Correct 2587 ms 344 KB Output is correct (P=0.068648, F=366.2, Q=379.0) -> 78.96 points
7 Correct 3497 ms 344 KB Output is correct (P=0.104571, F=490.3, Q=496.5) -> 85.67 points
8 Correct 4463 ms 344 KB Output is correct (P=0.158765, F=639.1, Q=633.1) -> 90.00 points
9 Correct 5026 ms 344 KB Output is correct (P=0.2, F=731.4, Q=729.4) -> 90.00 points