oj.uz

답안 #1109298

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1109298 2024-11-06T11:30:56 Z 8pete8 COVID tests (CEOI24_covid) C++17
10 / 100
 4954 ms 760 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) {
   // for(int i=0;i<N;i++)if(a[i]=='1'&&ra[i]=='1')return 1;
    //return 0;
    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++){
        //cin>>ra;
        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++){
            if(answer[j])answer_str+='1';
            else answer_str+='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:53:23: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   53 | void solve(int l,int r){
      |                       ^
Main.cpp:74:10: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   74 | int main() {
      |          ^

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 34 ms 584 KB Output is correct
2 Correct 26 ms 584 KB Output is correct
3 Correct 25 ms 336 KB Output is correct
4 Correct 27 ms 436 KB Output is correct
5 Correct 32 ms 448 KB Output is correct
6 Correct 33 ms 584 KB Output is correct
7 Correct 24 ms 336 KB Output is correct
8 Correct 23 ms 336 KB Output is correct
9 Correct 27 ms 336 KB Output is correct
10 Correct 18 ms 440 KB Output is correct
11 Correct 29 ms 436 KB Output is correct
12 Correct 29 ms 436 KB Output is correct
13 Correct 30 ms 444 KB Output is correct
14 Correct 22 ms 504 KB Output is correct
15 Correct 22 ms 584 KB Output is correct
16 Correct 40 ms 444 KB Output is correct
17 Correct 2 ms 336 KB Output is correct

Subtask #2
0.0 / 90.0

# 결과 실행 시간 메모리 Grader output
1 Correct 607 ms 760 KB Output is correct (P=0.001, F=15.1, Q=106.2) -> 3.58 points
2 Correct 773 ms 336 KB Output is correct (P=0.005256, F=51.1, Q=134.3) -> 11.98 points
3 Correct 1076 ms 336 KB Output is correct (P=0.011546, F=94.9, Q=176.0) -> 20.37 points
4 Correct 1760 ms 336 KB Output is correct (P=0.028545, F=191.5, Q=282.6) -> 31.00 points
5 Correct 2107 ms 336 KB Output is correct (P=0.039856, F=246.3, Q=350.4) -> 33.45 points
6 Correct 3072 ms 592 KB Output is correct (P=0.068648, F=366.2, Q=506.0) -> 35.61 points
7 Correct 4081 ms 440 KB Output is correct (P=0.104571, F=490.3, Q=675.6) -> 35.83 points
8 Execution timed out 4954 ms 444 KB Time limit exceeded (wall clock)
9 Halted 0 ms 0 KB -