oj.uz

Submission #1108861

# Submission time Handle Problem Language Result Execution time Memory
1108861 2024-11-05T12:01:09 Z 8pete8 COVID tests (CEOI24_covid) C++17
10 / 100
 5218 ms 336 KB 
#include <cassert>
#include <cstdio>
#include <string>
#include <vector>
#include<iostream>
#include<stack>
#include<map>
#include<vector>
#include<string>
#include<cassert>
#include<unordered_map>
#include <queue>
#include <cstdint>
#include<cstring>
#include<limits.h>
#include<cmath>
#include<set>
#include<algorithm>
#include <iomanip>
#include<numeric>
#include<bitset>
using namespace std;
#define ll long long
#define f first
#define s second
#define pii pair<int,int>
#define ppii pair<int,pii>
#define vi vector<int>
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define F(n) for(int i=0;i<n;i++)
#define lb lower_bound
#define ub upper_bound
#define fastio ios::sync_with_stdio(false);cin.tie(NULL);
#pragma GCC optimize ("03,unroll-lopps")
/// You may use:

// The number of students
int N;

// 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 T;
/// 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.
vector<bool> find_positive() {
    std::vector<bool> answer(N,0);
    if(T==1){
        for(int i=0;i<N;i++){
            vector<bool>qry(N,0);
            qry[i]=1;
            answer[i]=test_students(qry);
        }
        return answer;
    }
    else{
        int l=0,r=N-1;
        vector<bool>qry(N,0);
        while(1){
            r=N-1;
            int pos=N;
            while(l<=r){
                for(int i=0;i<N;i++)qry[i]=0;
                int mid=l+(r-l)/2;
                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;
            }
            if(pos==N)break;
            l=pos+1;
            answer[pos]=1;
        }
        return answer;
    }
}

int main() {
    
    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:36:40: warning: bad option '-funroll-lopps' to pragma 'optimize' [-Wpragmas]
   36 | #pragma GCC optimize ("03,unroll-lopps")
      |                                        ^
Main.cpp:49:42: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   49 | bool test_students(std::vector<bool> mask) {
      |                                          ^
Main.cpp:71:28: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   71 | vector<bool> find_positive() {
      |                            ^
Main.cpp:102:10: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
  102 | int main() {
      |          ^
Main.cpp: In function 'bool test_students(std::vector<bool>)':
Main.cpp:60:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   60 |     scanf(" %c", &answer);
      |     ~~~~~^~~~~~~~~~~~~~~~
Main.cpp: In function 'int main()':
Main.cpp:104:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  104 |     scanf("%d %lf %d", &N, &P, &T);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:116:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  116 |         scanf(" %c", &verdict);
      |         ~~~~~^~~~~~~~~~~~~~~~~

Subtask #0
0.0 / 0.0

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

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 336 KB Output is correct
2 Correct 18 ms 336 KB Output is correct
3 Correct 18 ms 336 KB Output is correct
4 Correct 22 ms 336 KB Output is correct
5 Correct 14 ms 336 KB Output is correct
6 Correct 18 ms 336 KB Output is correct
7 Correct 16 ms 336 KB Output is correct
8 Correct 19 ms 336 KB Output is correct
9 Correct 18 ms 336 KB Output is correct
10 Correct 16 ms 336 KB Output is correct
11 Correct 17 ms 336 KB Output is correct
12 Correct 23 ms 336 KB Output is correct
13 Correct 21 ms 336 KB Output is correct
14 Correct 20 ms 336 KB Output is correct
15 Correct 18 ms 336 KB Output is correct
16 Correct 16 ms 336 KB Output is correct
17 Correct 16 ms 336 KB Output is correct

Subtask #2
0.0 / 90.0

# Verdict Execution time Memory Grader output
1 Correct 135 ms 336 KB Output is correct (P=0.001, F=15.1, Q=18.1) -> 50.15 points
2 Correct 391 ms 336 KB Output is correct (P=0.005256, F=51.1, Q=54.2) -> 72.43 points
3 Correct 758 ms 336 KB Output is correct (P=0.011546, F=94.9, Q=108.0) -> 57.98 points
4 Correct 1770 ms 336 KB Output is correct (P=0.028545, F=191.5, Q=253.0) -> 39.39 points
5 Correct 2449 ms 336 KB Output is correct (P=0.039856, F=246.3, Q=352.5) -> 33.03 points
6 Correct 4145 ms 336 KB Output is correct (P=0.068648, F=366.2, Q=597.4) -> 25.53 points
7 Execution timed out 5218 ms 336 KB Time limit exceeded (wall clock)
8 Halted 0 ms 0 KB -