oj.uz

답안 #1109365

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1109365 2024-11-06T15:05:16 Z 8pete8 COVID tests (CEOI24_covid) C++17
10 / 100
 5151 ms 504 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]=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);
    //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);
        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:55:25: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   55 | void solve(int ql,int qr){
      |                         ^
Main.cpp:78:27: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   78 | void find_positive(int gap){
      |                           ^
Main.cpp:84:10: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   84 | int main() {
      |          ^
Main.cpp: In function 'bool test_students(std::vector<bool>)':
Main.cpp:50:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   50 |     scanf(" %c", &answer);
      |     ~~~~~^~~~~~~~~~~~~~~~
Main.cpp: In function 'int main()':
Main.cpp:85:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   85 |     scanf("%d %lf %d", &N, &P, &T);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:97:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   97 |         scanf(" %c", &verdict);
      |         ~~~~~^~~~~~~~~~~~~~~~~

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 336 KB Output is correct
2 Correct 17 ms 336 KB Output is correct
3 Correct 17 ms 336 KB Output is correct
4 Correct 14 ms 336 KB Output is correct
5 Correct 13 ms 336 KB Output is correct
6 Correct 16 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 17 ms 336 KB Output is correct
10 Correct 15 ms 336 KB Output is correct
11 Correct 21 ms 336 KB Output is correct
12 Correct 18 ms 504 KB Output is correct
13 Correct 18 ms 504 KB Output is correct
14 Correct 22 ms 336 KB Output is correct
15 Correct 13 ms 336 KB Output is correct
16 Correct 21 ms 336 KB Output is correct
17 Correct 23 ms 336 KB Output is correct

Subtask #2
0.0 / 90.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5151 ms 336 KB Time limit exceeded (wall clock)
2 Halted 0 ms 0 KB -