oj.uz

Submission #1109386

# Submission time Handle Problem Language Result Execution time Memory
1109386 2024-11-06T15:34:49 Z 8pete8 COVID tests (CEOI24_covid) C++17
10 / 100
 4929 ms 584 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(vector<int> &a) {
    for (auto x:a) base[x]='1';
    cout<<"Q "<<base<<endl;
    cout.flush();
    char answer;
    cin>>answer;
    for (auto x:a) base[x]='0';
    return answer == 'P';
}
int T;
int answer[1001+10];
void solve(int l,int r){
    vector<int> g;
    if(l==r){
        g.push_back(l);
        answer[l]=test_students(g);
        return;
    }
    int mid=l+(r-l)/2;
    for(int i=l;i<=mid;i++)g.push_back(i);
    if(test_students(g)){
        if(l==mid)answer[l]=1;
        else solve(l,mid);
    }
    g.clear();
    for(int i=mid+1;i<=r;i++)g.push_back(i);
    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;
        if(T==1)gap=1;
        else if(P==0.001)gap=N;
        else if(P==0.005256)gap=N;
        else if(P==0.011546)gap=15;
        else if(P==0.028545)gap=40;
        else if(P==0.039856)gap=57;
        else if(P==0.068648)gap=98;
        else if(P==0.158765)gap=216;
        else if(P==0.2)gap=288;
        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();
        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:41:34: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   41 | bool test_students(vector<int> &a) {
      |                                  ^
Main.cpp:52:23: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   52 | void solve(int l,int r){
      |                       ^
Main.cpp:72:10: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   72 | int main() {
      |          ^
Main.cpp: In function 'int main()':
Main.cpp:78:13: warning: 'gap' may be used uninitialized in this function [-Wmaybe-uninitialized]
   78 |         int gap;
      |             ^~~

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 336 KB Output is correct
2 Correct 20 ms 508 KB Output is correct
3 Correct 15 ms 336 KB Output is correct
4 Correct 16 ms 336 KB Output is correct
5 Correct 15 ms 336 KB Output is correct
6 Correct 17 ms 336 KB Output is correct
7 Correct 15 ms 336 KB Output is correct
8 Correct 12 ms 504 KB Output is correct
9 Correct 13 ms 336 KB Output is correct
10 Correct 16 ms 504 KB Output is correct
11 Correct 15 ms 336 KB Output is correct
12 Correct 16 ms 336 KB Output is correct
13 Correct 11 ms 336 KB Output is correct
14 Correct 19 ms 336 KB Output is correct
15 Correct 14 ms 336 KB Output is correct
16 Correct 11 ms 336 KB Output is correct
17 Correct 18 ms 504 KB Output is correct

Subtask #2
0.0 / 90.0

# Verdict Execution time Memory Grader output
1 Correct 95 ms 336 KB Output is correct (P=0.001, F=15.1, Q=17.7) -> 53.29 points
2 Correct 493 ms 336 KB Output is correct (P=0.005256, F=51.1, Q=77.0) -> 29.73 points
3 Correct 1006 ms 336 KB Output is correct (P=0.011546, F=94.9, Q=199.6) -> 16.63 points
4 Correct 1432 ms 336 KB Output is correct (P=0.028545, F=191.5, Q=276.9) -> 32.33 points
5 Correct 1957 ms 336 KB Output is correct (P=0.039856, F=246.3, Q=360.2) -> 31.58 points
6 Correct 3166 ms 584 KB Output is correct (P=0.068648, F=366.2, Q=557.9) -> 29.09 points
7 Correct 4374 ms 336 KB Output is correct (P=0.104571, F=490.3, Q=750.4) -> 28.83 points
8 Execution timed out 4929 ms 336 KB Time limit exceeded (wall clock)
9 Halted 0 ms 0 KB -