oj.uz

답안 #1071380

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1071380 2024-08-23T07:03:21 Z jer033 COVID tests (CEOI24_covid) C++17
10 / 100
 62 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++)
        scanf("%i", 0);
    for (int i=x; i<=y; i++)
        scanf("%i", 1);
    for (int i=y+1; i<1000; i++)
        scanf("%i", 0);
    cout << '\n';
    cout.flush();
    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 response = ask_query2(x, y);
    if (response==1)
    {
        if (x==y)
            answer[x] = 1;
        else
        {
            int z = (x+y)/2;
            range_query(x, z);
            range_query(z+1, y);
        }
        return 1;
    }
    return 0;
}

int main()
{
    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);
            else if (P < 0.05)
            {
                for (int i=1; i<=10; i++)
                    range_query(100*i-100, 100*i-1);
            }
            else if (P < 0.11)
            {
                for (int i=1; i<=50; i++)
                    range_query(20*i-20, 20*i-1);
            }
            else
            {
                for (int i=1; i<=100; i++)
                    range_query(10*i-10, 10*i-1);
            }
            bool L = report(answer);
            if (L==0)
                T = 0;
        }
    }
}

Compilation message

Main.cpp: In function 'bool ask_query2(int, int)':
Main.cpp:30:17: warning: format '%i' expects argument of type 'int*', but argument 2 has type 'int' [-Wformat=]
   30 |         scanf("%i", 0);
      |                ~^   ~
      |                 |   |
      |                 |   int
      |                 int*
Main.cpp:32:17: warning: format '%i' expects argument of type 'int*', but argument 2 has type 'int' [-Wformat=]
   32 |         scanf("%i", 1);
      |                ~^   ~
      |                 |   |
      |                 |   int
      |                 int*
Main.cpp:34:17: warning: format '%i' expects argument of type 'int*', but argument 2 has type 'int' [-Wformat=]
   34 |         scanf("%i", 0);
      |                ~^   ~
      |                 |   |
      |                 |   int
      |                 int*
Main.cpp:30:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |         scanf("%i", 0);
      |         ~~~~~^~~~~~~~~
Main.cpp:32:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   32 |         scanf("%i", 1);
      |         ~~~~~^~~~~~~~~
Main.cpp:34:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   34 |         scanf("%i", 0);
      |         ~~~~~^~~~~~~~~

Subtask #0
0.0 / 0.0

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

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 36 ms 344 KB Output is correct
2 Correct 36 ms 344 KB Output is correct
3 Correct 38 ms 344 KB Output is correct
4 Correct 37 ms 344 KB Output is correct
5 Correct 45 ms 344 KB Output is correct
6 Correct 36 ms 344 KB Output is correct
7 Correct 45 ms 344 KB Output is correct
8 Correct 36 ms 344 KB Output is correct
9 Correct 37 ms 344 KB Output is correct
10 Correct 50 ms 344 KB Output is correct
11 Correct 45 ms 344 KB Output is correct
12 Correct 62 ms 344 KB Output is correct
13 Correct 37 ms 344 KB Output is correct
14 Correct 45 ms 344 KB Output is correct
15 Correct 46 ms 344 KB Output is correct
16 Correct 37 ms 344 KB Output is correct
17 Correct 53 ms 344 KB Output is correct

Subtask #2
0.0 / 90.0

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