oj.uz

Submission #1109363

# Submission time Handle Problem Language Result Execution time Memory
1109363 2024-11-06T15:03:21 Z 8pete8 COVID tests (CEOI24_covid) C++17
0 / 100
 1617 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")
int N;
double P;
string ra;
bool test_students(std::vector<bool> mask){
    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+10];
void solve(int ql,int qr){
    int l=ql,r=qr;
    vector<bool>qry(N,0);
    while(1){
        r=qr;
        int pos=N;
        while(l<=r){
            int mid=l+(r-l)/2;
            for(int j=l;j<=mid;j++)qry[j]=1;
            if(test_students(qry)){
                for(int j=l;j<=mid;j++)qry[j]=0;
                pos=min(pos,mid),r=mid-1;
            }
            else{
                for(int j=l;j<=mid;j++)qry[j]=1;
                l=mid+1;
            }
        }
        if(pos==N)break;
        l=pos+1;
        answer[pos]=1;
    }
}
void find_positive(int gap){
    for(int j=0;j*gap<N;j++){
        solve(j*gap,min(N-1,j*gap+gap-1));
    }
}
 
int main() {
    scanf("%d %lf %d", &N, &P, &T);
    for (int i = 0; i < T; i++) {
        for(int j=0;j<N;j++)answer[j]=0;
        find_positive(20);
        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:40:42: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   40 | bool test_students(std::vector<bool> mask){
      |                                          ^
Main.cpp:53:25: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   53 | void solve(int ql,int qr){
      |                         ^
Main.cpp:76:27: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   76 | void find_positive(int gap){
      |                           ^
Main.cpp:82:10: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   82 | int main() {
      |          ^
Main.cpp: In function 'bool test_students(std::vector<bool>)':
Main.cpp:48:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   48 |     scanf(" %c", &answer);
      |     ~~~~~^~~~~~~~~~~~~~~~
Main.cpp: In function 'int main()':
Main.cpp:83:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   83 |     scanf("%d %lf %d", &N, &P, &T);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:93:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   93 |         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
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 38 ms 336 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 90.0

# Verdict Execution time Memory Grader output
1 Incorrect 1617 ms 336 KB Incorrect
2 Halted 0 ms 0 KB -