oj.uz

Submission #1044465

# Submission time Handle Problem Language Result Execution time Memory
1044465 2024-08-05T09:59:01 Z VahanAbraham COVID tests (CEOI24_covid) C++14
36.95 / 100
 2531 ms 600 KB 
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <string>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <sstream>
#include <map>
#include <stack>
#include <set>
#include <queue>
#include <list>
#include <unordered_set>
#include <unordered_map>
#include <math.h>
#include <bitset>
#include <cmath>
#include <vector>
#include <iomanip>
#include <random>
#include <chrono>
#include <cassert>
#include <cassert>
#include <cstdio>
#include <string>
#include <vector>

/// You may use:

using namespace std;


// The number of students
int N;

#define ll long long
#define fr first
#define sc second
#define pb push_back

// The probability any given student is positive
double P;

// This function performs a test on a subset of samples.
// Its argument is a vector of Booleans of length N,
// where the i-th element is true if the i-th sample should be added to the mix.
// It returns true if (and only if) at least one of the samples in the mix is positive.
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 ans[10000];

void rec(int l, int r) {
    vector<bool> v;
    v.resize(N);
    for (int i = 0; i < N; ++i) {
        if (i >= l && i <= r) {
            v[i] = 1;
        }
        else {
            v[i] = 0;
        }
    }
    if (l == r) {
        if (test_students(v) == 0) {
            for (int i = l; i <= r; ++i) {
                ans[i] = -1;
            }
            return;
        }
        return;
    }
    if (test_students(v) == 0) {
        for (int i = l; i <= r; ++i) {
            ans[i] = -1;
        }
        return;
    }
    else {
        int mid = (l + r) / 2;
        rec(l, mid);
        rec(mid + 1, r);
    }
}
/// You should implement:

// This function will be called once for each test instance.
// It should use test_students to determine which samples are positive.
// It must return a vector of Booleans of length N,
// where the i-th element is true if and only if the i-th sample is positive.
std::vector<bool> find_positive() {
    std::vector<bool> answer(N);
    rec(0, N - 1);
    for (int i = 0; i < N; ++i) {
        if (ans[i] == -1) {
            answer[i] = 0;
        }
        else {
            answer[i] = 1;
        }
    }
    for (int i = 0; i < N; ++i) {
        ans[i] = 0;
    }
    return answer;
}

int main() {
    int T;
    scanf("%d %lf %d", &N, &P, &T);

    // You may perform any extra initialization here.

    for (int i = 0; i < T; i++) {
        std::vector<bool> answer = find_positive();
        assert(answer.size() == (size_t)N);

        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:59:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   59 |     scanf(" %c", &answer);
      |     ~~~~~^~~~~~~~~~~~~~~~
Main.cpp: In function 'int main()':
Main.cpp:122:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  122 |     scanf("%d %lf %d", &N, &P, &T);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:138:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  138 |         scanf(" %c", &verdict);
      |         ~~~~~^~~~~~~~~~~~~~~~~

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 420 KB Output is correct
2 Correct 11 ms 344 KB Output is correct
3 Correct 11 ms 344 KB Output is correct
4 Correct 13 ms 592 KB Output is correct
5 Correct 12 ms 600 KB Output is correct
6 Correct 11 ms 440 KB Output is correct
7 Correct 12 ms 592 KB Output is correct
8 Correct 9 ms 440 KB Output is correct
9 Correct 10 ms 344 KB Output is correct
10 Correct 6 ms 344 KB Output is correct
11 Correct 10 ms 344 KB Output is correct
12 Correct 9 ms 344 KB Output is correct
13 Correct 14 ms 592 KB Output is correct
14 Correct 13 ms 444 KB Output is correct
15 Correct 9 ms 444 KB Output is correct
16 Correct 15 ms 344 KB Output is correct
17 Correct 0 ms 344 KB Output is correct

Subtask #2
26.949999996 / 90.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 344 KB Output is correct (P=0.001, F=15.1, Q=17.8) -> 52.47 points
2 Correct 181 ms 344 KB Output is correct (P=0.005256, F=51.1, Q=78.0) -> 28.98 points
3 Correct 352 ms 344 KB Output is correct (P=0.011546, F=94.9, Q=150.0) -> 27.09 points
4 Correct 675 ms 344 KB Output is correct (P=0.028545, F=191.5, Q=303.5) -> 26.95 points
5 Correct 924 ms 344 KB Output is correct (P=0.039856, F=246.3, Q=388.5) -> 27.20 points
6 Correct 1370 ms 344 KB Output is correct (P=0.068648, F=366.2, Q=569.4) -> 27.95 points
7 Correct 1707 ms 344 KB Output is correct (P=0.104571, F=490.3, Q=751.4) -> 28.75 points
8 Correct 2273 ms 344 KB Output is correct (P=0.158765, F=639.1, Q=967.6) -> 29.45 points
9 Correct 2531 ms 440 KB Output is correct (P=0.2, F=731.4, Q=1112.6) -> 29.18 points