oj.uz

답안 #1038209

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1038209 2024-07-29T14:21:31 Z sleepntsheep COVID tests (CEOI24_covid) C
24.29 / 100
 2943 ms 596 KB 
#include <stdio.h>
#include <math.h>
#include <stdlib.h>
#include <string.h>

int n, t;
double p;

char ask(char *q) {
    char result[2];
    printf("Q %s\n", q);
    fflush(stdout);
    scanf("%s", result);
    return result[0];
}

char a[1001] = { 0 }, q[1001] = { 0 };

int main() {
    scanf("%d%lf%d", &n, &p, &t);

    if (t == 1) {
        for (int i = 0; i < n; ++i) {
            for (int j = 0; j < n; ++j)
                q[j] = '0' + (j == i);
            a[i] = (ask(q) == 'P') + '0';
        }
        printf("A %s\n", a);
        return 0;
    }

    int x = -1;

    double P_[] = { 0.001, 0.005256, 0.011546, 0.028545, 0.039856, 0.068648, 0.104571, 0.158765, 0.2 };
    int X_[] = { 1000, 999, 999, 254, 246, 126, 62, 31, 30 };
    for (int i = 0; i < 9; ++i) {
        if (fabs(P_[i] - p) < 0.001)
            x = X_[i];
    }

    if (x == -1)
        x = 999;
    x = 1000;

    while (t--) {
        for (int i = 0; i < n; ++i)
            a[i] = '0';
        int at = 0;
        while (at < n) {
            char q[1001] = { 0 };

            int lb = at - 1, ub = at + x;

            if (ub > n)
                ub = n;
            int ub0 = ub;
            int nx = ub;

            while (ub - lb > 1) {
                int md = lb + (ub - lb) / 2;

                for (int i = 0; i < n; ++i)
                    q[i] = '0';
                for (int i = at; i <= md; ++i)
                    q[i] = '1';

                if (ask(q) == 'P') ub = md, nx = md + 1;
                else lb = md;
            }

            if (ub < ub0)
                a[ub] = '1';
            at = nx;
        }

        printf("A %s\n", a);
        fflush(stdout);
        char verdict[2];
        scanf("%s", verdict);
        if ('W' == verdict[0])
            return 0;
    }
}

Compilation message

Main.c: In function 'ask':
Main.c:13:5: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 |     scanf("%s", result);
      |     ^~~~~~~~~~~~~~~~~~~
Main.c: In function 'main':
Main.c:20:5: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   20 |     scanf("%d%lf%d", &n, &p, &t);
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.c:79:9: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   79 |         scanf("%s", verdict);
      |         ^~~~~~~~~~~~~~~~~~~~

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 344 KB Output is correct
2 Correct 5 ms 344 KB Output is correct
3 Correct 5 ms 344 KB Output is correct
4 Correct 5 ms 340 KB Output is correct
5 Correct 8 ms 344 KB Output is correct
6 Correct 9 ms 344 KB Output is correct
7 Correct 5 ms 344 KB Output is correct
8 Correct 5 ms 344 KB Output is correct
9 Correct 5 ms 344 KB Output is correct
10 Correct 5 ms 344 KB Output is correct
11 Correct 7 ms 596 KB Output is correct
12 Correct 8 ms 344 KB Output is correct
13 Correct 6 ms 344 KB Output is correct
14 Correct 5 ms 344 KB Output is correct
15 Correct 5 ms 344 KB Output is correct
16 Correct 6 ms 344 KB Output is correct
17 Correct 5 ms 344 KB Output is correct

Subtask #2
14.290000002 / 90.0

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 344 KB Output is correct (P=0.001, F=15.1, Q=18.1) -> 50.15 points
2 Correct 104 ms 344 KB Output is correct (P=0.005256, F=51.1, Q=54.2) -> 72.43 points
3 Correct 196 ms 344 KB Output is correct (P=0.011546, F=94.9, Q=108.0) -> 57.98 points
4 Correct 508 ms 344 KB Output is correct (P=0.028545, F=191.5, Q=253.0) -> 39.39 points
5 Correct 655 ms 344 KB Output is correct (P=0.039856, F=246.3, Q=352.5) -> 33.03 points
6 Correct 1093 ms 344 KB Output is correct (P=0.068648, F=366.2, Q=597.4) -> 25.53 points
7 Correct 1614 ms 344 KB Output is correct (P=0.104571, F=490.3, Q=900.1) -> 20.72 points
8 Correct 2448 ms 340 KB Output is correct (P=0.158765, F=639.1, Q=1342.6) -> 16.66 points
9 Correct 2943 ms 344 KB Output is correct (P=0.2, F=731.4, Q=1700.3) -> 14.29 points