oj.uz

답안 #1109293

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1109293 2024-11-06T11:10:21 Z 8pete8 COVID tests (CEOI24_covid) C++17
0 / 100
 27 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 base="";
string ra;
bool test_students(string a) {
    cout<<"Q "<<a<<endl;
    cout.flush();
    fflush(stdout);
    char answer;
    cin>>answer;
    return answer == 'P';
}
int T;
int answer[1001+10];
void solve(int l,int r){
    if(l==r){
        string g=base;
        g[l]='1';
        answer[l]=test_students(g);
        return;
    }
    int mid=l+(r-l)/2;
    string g=base;
    for(int i=l;i<=mid;i++)g[i]='1';
    if(test_students(g)){
        if(l==mid)answer[l]=1;
        else solve(l,mid);
    }
    for(int i=l;i<=mid;i++)g[i]='0';
    for(int i=mid+1;i<=r;i++)g[i]='1';
    if(test_students(g)){
        if(mid+1==r)answer[r]=1;
        else solve(mid+1,r);
    }
}
int main() {
    cin>>N>>P>>T;
    for(int i=0;i<N;i++)base+='0';
    for (int i = 0; i < T; i++){
        for(int j=0;j<N;j++)answer[j]=0;
        int gap=20;
        for(int j=0;(j*gap)<N;j++){
            solve((j*gap),min(N-1,(j*gap)+gap-1));
        }
        string answer_str="";
        for (int j = 0; j < N; j++)
            answer_str[j] += answer[j] ? '1' : '0';
        cout<<"A "<<answer_str<<endl;
        cout.flush();
        fflush(stdout);
        char verdict;
        cin>>verdict;
    }
    return 0;
}

//1001001

Compilation message

Main.cpp:36:40: warning: bad option '-funroll-lopps' to pragma 'optimize' [-Wpragmas]
   36 | #pragma GCC optimize ("03,unroll-lopps")
      |                                        ^
Main.cpp:41:28: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   41 | bool test_students(string a) {
      |                            ^
Main.cpp:51:23: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   51 | void solve(int l,int r){
      |                       ^
Main.cpp:72:10: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   72 | int main() {
      |          ^

Subtask #0
0.0 / 0.0

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

Subtask #1
0.0 / 10.0

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

Subtask #2
0.0 / 90.0

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