oj.uz

Submission #1109381

# Submission time Handle Problem Language Result Execution time Memory
1109381 2024-11-06T15:29:10 Z 8pete8 COVID tests (CEOI24_covid) C++17
10 / 100
 5176 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){
    //for(int i=0;i<N;i++)if(mask[i]&&ra[i]=='1')return 1;
    //return 0;
    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]=0;
                l=mid+1;
            }
        }
        if(pos==N)return;
        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);
    //cin>>ra;
    for (int i = 0; i < T; i++) {
        for(int j=0;j<N;j++)answer[j]=0;
        find_positive(1);
        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;
        //for(int i=0;i<N;i++)if(answer_str[i]!=ra[i])assert(0);
        cin>>verdict;
        cout.flush();
        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:54:25: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   54 | void solve(int ql,int qr){
      |                         ^
Main.cpp:77:27: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   77 | void find_positive(int gap){
      |                           ^
Main.cpp:83:10: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   83 | int main() {
      |          ^
Main.cpp: In function 'bool test_students(std::vector<bool>)':
Main.cpp:49:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   49 |     scanf(" %c", &answer);
      |     ~~~~~^~~~~~~~~~~~~~~~
Main.cpp: In function 'int main()':
Main.cpp:84:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   84 |     scanf("%d %lf %d", &N, &P, &T);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

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 16 ms 336 KB Output is correct
3 Correct 17 ms 336 KB Output is correct
4 Correct 17 ms 336 KB Output is correct
5 Correct 15 ms 336 KB Output is correct
6 Correct 19 ms 336 KB Output is correct
7 Correct 15 ms 336 KB Output is correct
8 Correct 16 ms 336 KB Output is correct
9 Correct 21 ms 336 KB Output is correct
10 Correct 15 ms 336 KB Output is correct
11 Correct 17 ms 336 KB Output is correct
12 Correct 13 ms 336 KB Output is correct
13 Correct 19 ms 336 KB Output is correct
14 Correct 18 ms 336 KB Output is correct
15 Correct 15 ms 336 KB Output is correct
16 Correct 20 ms 336 KB Output is correct
17 Correct 19 ms 336 KB Output is correct

Subtask #2
0.0 / 90.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5176 ms 336 KB Time limit exceeded (wall clock)
2 Halted 0 ms 0 KB -