oj.uz

답안 #1109508

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1109508 2024-11-07T00:50:04 Z 8pete8 COVID tests (CEOI24_covid) C++17
10 / 100
 5273 ms 508 KB 
#include <cassert>
#include <cstdio>
#include <string>
#include <vector>
using namespace std;
int N;
double P;
bool test_students(std::vector<bool> mask) {
    assert(mask.size() == (size_t)N);
    std::string mask_str(N, ' ');
    for (int i = 0; i < N; i++)
        mask_str[i] = mask[i] ? '1' : '0';
 
    printf("Q %s\n", mask_str.c_str());
    fflush(stdout);
 
    char answer;
    scanf(" %c", &answer);
    return answer == 'P';
}
 
int T;
int answer[1001];
vector<bool>qry;
void solve(int gap){
    int l=0,r=N-1;
    while(l<=N-1){
        r=min(l+gap-1,N-1);
        int pos=min(l+gap-1,N-1);
        for(int j=0;j<N;j++)qry[j]=0;
        for(int j=l;j<=r;j++)qry[j]=1;
        if(test_students(qry)){
            while(l<=r){
                int mid=l+(r-l)/2;
                for(int j=0;j<N;j++)qry[j]=0;
                for(int j=l;j<=mid;j++)qry[j]=1;
                if(test_students(qry))pos=min(pos,mid),r=mid-1;
                else l=mid+1;
            }
            answer[pos]=1;
        }
        l=pos+1;
        
    }
}
void find_positive(int gap){
    solve(gap);
}
int main() {
    scanf("%d %lf %d", &N, &P, &T);
    qry.resize(N);
    for (int i = 0; i < T; i++) {
        for(int j=0;j<N;j++)answer[j]=0;
        int gap;
        if(T==1)gap=1;
        else if(P==0.001)gap=700;
        else if(P==0.005256)gap=138;
        else if(P==0.011546)gap=63;
        else if(P==0.028545)gap=25;
        else if(P==0.039856)gap=17;
        else if(P==0.068648)gap=10;
        else if (P==0.104571)gap=7;
        else if(P==0.158765)gap=5;
        else if(P==0.2)gap=3;
        else assert(0);
        find_positive(gap);
        std::string answer_str(N, ' ');
        for (int j = 0; j < N; j++)
            answer_str[j] = answer[j] ? '1' : '0';
        printf("A %s\n", answer_str.c_str());
        fflush(stdout);
        char verdict;
        scanf(" %c", &verdict);
        if (verdict == 'W')
            exit(0);
    }
    return 0;
}

Compilation message

Main.cpp: In function 'bool test_students(std::vector<bool>)':
Main.cpp:18:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   18 |     scanf(" %c", &answer);
      |     ~~~~~^~~~~~~~~~~~~~~~
Main.cpp: In function 'int main()':
Main.cpp:50:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   50 |     scanf("%d %lf %d", &N, &P, &T);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:73:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   73 |         scanf(" %c", &verdict);
      |         ~~~~~^~~~~~~~~~~~~~~~~

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 336 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 336 KB Output is correct
2 Correct 38 ms 336 KB Output is correct
3 Correct 34 ms 336 KB Output is correct
4 Correct 32 ms 336 KB Output is correct
5 Correct 39 ms 336 KB Output is correct
6 Correct 33 ms 336 KB Output is correct
7 Correct 30 ms 336 KB Output is correct
8 Correct 26 ms 336 KB Output is correct
9 Correct 29 ms 336 KB Output is correct
10 Correct 24 ms 336 KB Output is correct
11 Correct 26 ms 336 KB Output is correct
12 Correct 24 ms 336 KB Output is correct
13 Correct 27 ms 336 KB Output is correct
14 Correct 32 ms 508 KB Output is correct
15 Correct 24 ms 336 KB Output is correct
16 Correct 36 ms 336 KB Output is correct
17 Correct 19 ms 336 KB Output is correct

Subtask #2
0.0 / 90.0

# 결과 실행 시간 메모리 Grader output
1 Correct 82 ms 336 KB Output is correct (P=0.001, F=15.1, Q=10.9) -> 90.00 points
2 Correct 301 ms 336 KB Output is correct (P=0.005256, F=51.1, Q=46.6) -> 90.00 points
3 Correct 622 ms 336 KB Output is correct (P=0.011546, F=94.9, Q=91.0) -> 90.00 points
4 Correct 1288 ms 336 KB Output is correct (P=0.028545, F=191.5, Q=190.5) -> 90.00 points
5 Correct 1702 ms 336 KB Output is correct (P=0.039856, F=246.3, Q=247.0) -> 88.99 points
6 Correct 2567 ms 336 KB Output is correct (P=0.068648, F=366.2, Q=373.5) -> 83.35 points
7 Correct 3474 ms 336 KB Output is correct (P=0.104571, F=490.3, Q=509.4) -> 77.87 points
8 Correct 4455 ms 336 KB Output is correct (P=0.158765, F=639.1, Q=677.7) -> 72.49 points
9 Execution timed out 5273 ms 336 KB Time limit exceeded (wall clock)
10 Halted 0 ms 0 KB -