oj.uz

Submission #1109084

# Submission time Handle Problem Language Result Execution time Memory
1109084 2024-11-06T02:05:16 Z 12345678 COVID tests (CEOI24_covid) C++17
10 / 100
 43 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<<'\n';
        cout.flush();
        fflush(stdout);
        char verdict;
        cin>>verdict;
      	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: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

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 336 KB Unexpected end of file - token expected
2 Halted 0 ms 0 KB -

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 592 KB Output is correct
2 Correct 29 ms 336 KB Output is correct
3 Correct 43 ms 336 KB Output is correct
4 Correct 28 ms 336 KB Output is correct
5 Correct 40 ms 336 KB Output is correct
6 Correct 22 ms 336 KB Output is correct
7 Correct 28 ms 336 KB Output is correct
8 Correct 26 ms 336 KB Output is correct
9 Correct 26 ms 336 KB Output is correct
10 Correct 14 ms 336 KB Output is correct
11 Correct 21 ms 336 KB Output is correct
12 Correct 30 ms 336 KB Output is correct
13 Correct 26 ms 336 KB Output is correct
14 Correct 21 ms 504 KB Output is correct
15 Correct 19 ms 504 KB Output is correct
16 Correct 32 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct

Subtask #2
0.0 / 90.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 336 KB Unexpected end of file - token expected
2 Halted 0 ms 0 KB -