oj.uz

Submission #1038258

# Submission time Handle Problem Language Result Execution time Memory
1038258 2024-07-29T14:56:37 Z sleepntsheep COVID tests (CEOI24_covid) C
34.05 / 100
 2315 ms 344 KB 
#include <stdio.h>
#include <assert.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, y;

    double P_[] = { 0.001, 0.005256, 0.011546, 0.028545, 0.039856, 0.068648, 0.104571, 0.158765, 0.2 };
    int X_[] = { 1000, 128, 64, 28, 16, 8, 6, 1, 1, };
    int Y_[] = { 0, 0, 0, 0, 0, 9, 7, 4, 4, };

    for (int i = 0; i < 9; ++i)
        if (P_[i] == p)
            x = X_[i], y = Y_[i];

    assert(x != -1);

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

            if (y > 0) {
                int aa = n < at + y ? n : at + y;
                for (int i = 0; i < n; ++i) q[i] = '0';
                for (int i = at; i < aa; ++i) q[i] = '1';
                if (ask(q) == 'N') {
                    at = aa;
                    continue;
                }
            }

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

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


            for (int i = 0; i < n; ++i) q[i] = '0';
            for (int i = at; i < ub; ++i) q[i] = '1';
            if (ask(q) == 'N') {
                at = ub;
            } else {
                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:14:5: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 |     scanf("%s", result);
      |     ^~~~~~~~~~~~~~~~~~~
Main.c: In function 'main':
Main.c:21:5: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   21 |     scanf("%d%lf%d", &n, &p, &t);
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.c:96:9: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   96 |         scanf("%s", verdict);
      |         ^~~~~~~~~~~~~~~~~~~~
Main.c:53:33: warning: 'y' may be used uninitialized in this function [-Wmaybe-uninitialized]
   53 |                 int aa = n < at + y ? n : at + y;
      |                              ~~~^~~

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Runtime error 0 ms 344 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 344 KB Output is correct
2 Correct 6 ms 344 KB Output is correct
3 Correct 5 ms 344 KB Output is correct
4 Correct 6 ms 344 KB Output is correct
5 Correct 5 ms 344 KB Output is correct
6 Correct 5 ms 344 KB Output is correct
7 Correct 5 ms 344 KB Output is correct
8 Correct 6 ms 344 KB Output is correct
9 Correct 7 ms 344 KB Output is correct
10 Correct 7 ms 344 KB Output is correct
11 Correct 5 ms 340 KB Output is correct
12 Correct 5 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 7 ms 344 KB Output is correct

Subtask #2
24.049999998 / 90.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 340 KB Output is correct (P=0.001, F=15.1, Q=10.7) -> 90.00 points
2 Correct 77 ms 344 KB Output is correct (P=0.005256, F=51.1, Q=46.6) -> 90.00 points
3 Correct 164 ms 344 KB Output is correct (P=0.011546, F=94.9, Q=90.9) -> 90.00 points
4 Correct 325 ms 344 KB Output is correct (P=0.028545, F=191.5, Q=190.2) -> 90.00 points
5 Correct 455 ms 344 KB Output is correct (P=0.039856, F=246.3, Q=245.7) -> 90.00 points
6 Correct 810 ms 344 KB Output is correct (P=0.068648, F=366.2, Q=439.1) -> 50.10 points
7 Correct 1033 ms 344 KB Output is correct (P=0.104571, F=490.3, Q=604.4) -> 46.61 points
8 Correct 1902 ms 344 KB Output is correct (P=0.158765, F=639.1, Q=1037.1) -> 25.78 points
9 Correct 2315 ms 344 KB Output is correct (P=0.2, F=731.4, Q=1232.8) -> 24.05 points