oj.uz

답안 #1108867

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1108867 2024-11-05T12:24:39 Z 8pete8 COVID tests (CEOI24_covid) C++17
10 / 100
 4982 ms 592 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="";
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)return void(answer[l]=1);
    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);
    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;
        solve(0,N-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;
        cout.flush();
        fflush(stdout);
        char verdict;
        cin>>verdict;
    }
    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:45:28: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   45 | bool test_students(string a) {
      |                            ^
Main.cpp:56:23: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   56 | void solve(int l,int r){
      |                       ^
Main.cpp:66:10: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   66 | int main() {
      |          ^
Main.cpp: In function 'int main()':
Main.cpp:67:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   67 |     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
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 336 KB Output is correct
2 Correct 33 ms 336 KB Output is correct
3 Correct 29 ms 336 KB Output is correct
4 Correct 30 ms 336 KB Output is correct
5 Correct 29 ms 336 KB Output is correct
6 Correct 29 ms 336 KB Output is correct
7 Correct 35 ms 336 KB Output is correct
8 Correct 27 ms 336 KB Output is correct
9 Correct 27 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 17 ms 336 KB Output is correct
13 Correct 27 ms 336 KB Output is correct
14 Correct 26 ms 336 KB Output is correct
15 Correct 25 ms 336 KB Output is correct
16 Correct 30 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct

Subtask #2
0.0 / 90.0

# 결과 실행 시간 메모리 Grader output
1 Correct 103 ms 592 KB Output is correct (P=0.001, F=15.1, Q=17.7) -> 53.29 points
2 Correct 474 ms 336 KB Output is correct (P=0.005256, F=51.1, Q=77.0) -> 29.73 points
3 Correct 924 ms 336 KB Output is correct (P=0.011546, F=94.9, Q=149.0) -> 27.44 points
4 Correct 1799 ms 336 KB Output is correct (P=0.028545, F=191.5, Q=302.5) -> 27.12 points
5 Correct 2329 ms 336 KB Output is correct (P=0.039856, F=246.3, Q=387.5) -> 27.33 points
6 Correct 3393 ms 336 KB Output is correct (P=0.068648, F=366.2, Q=568.4) -> 28.05 points
7 Correct 4553 ms 336 KB Output is correct (P=0.104571, F=490.3, Q=750.4) -> 28.83 points
8 Execution timed out 4982 ms 336 KB Time limit exceeded (wall clock)
9 Halted 0 ms 0 KB -