oj.uz

답안 #1109286

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1109286 2024-11-06T10:52:37 Z 8pete8 COVID tests (CEOI24_covid) C++17
0 / 100
 4975 ms 460 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")
/// You may use:

// The number of students
int N;

// The probability any given student is positive
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))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))solve(mid+1,r);
}
int main() {
    scanf("%d %lf %d", &N, &P, &T);
    //cin>>ra;
    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));
        }
        std::string answer_str(N, ' ');
        for (int j = 0; j < N; j++)
            answer_str[j] = answer[j] ? '1' : '0';
        cout<<"A "<<answer_str<<endl;
        //for(int i=0;i<N;i++)if(answer_str[i]!=ra[i])assert(0);
        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:46:28: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   46 | bool test_students(string a) {
      |                            ^
Main.cpp:60:23: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   60 | void solve(int l,int r){
      |                       ^
Main.cpp:75:10: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   75 | int main() {
      |          ^
Main.cpp: In function 'int main()':
Main.cpp:76:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   76 |     scanf("%d %lf %d", &N, &P, &T);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #0
0.0 / 0.0

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

Subtask #1
0.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 42 ms 336 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 90.0

# 결과 실행 시간 메모리 Grader output
1 Correct 673 ms 336 KB Output is correct (P=0.001, F=15.1, Q=107.1) -> 3.55 points
2 Correct 840 ms 336 KB Output is correct (P=0.005256, F=51.1, Q=139.4) -> 11.38 points
3 Correct 1135 ms 336 KB Output is correct (P=0.011546, F=94.9, Q=187.4) -> 18.37 points
4 Correct 1918 ms 336 KB Output is correct (P=0.028545, F=191.5, Q=311.1) -> 25.73 points
5 Correct 2335 ms 460 KB Output is correct (P=0.039856, F=246.3, Q=390.4) -> 26.94 points
6 Correct 3503 ms 336 KB Output is correct (P=0.068648, F=366.2, Q=575.0) -> 27.43 points
7 Correct 4752 ms 336 KB Output is correct (P=0.104571, F=490.3, Q=780.6) -> 26.72 points
8 Execution timed out 4975 ms 336 KB Time limit exceeded (wall clock)
9 Halted 0 ms 0 KB -