oj.uz

Submission #1095548

# Submission time Handle Problem Language Result Execution time Memory
1095548 2024-10-02T14:31:53 Z razivo COVID tests (CEOI24_covid) C++14
0 / 100
 7000 ms 600 KB 
#include <iostream>
#include <queue>
#include <set>
#include <vector>
#include <math.h>
using namespace std;
void answer(vector<bool> &res) {
    cout<<"A ";
    for (int i = 0; i < res.size(); ++i) {
        if(res[i]) cout<<"1";
        else cout<<"0";
    }
    cout<<endl;
    string c; cin>>c;
    flush(cout);
    if(c=="W") exit(0);
}
bool test(vector<int> &i,int n) {
    cin.tie(0);
    cout<<"Q ";
    vector<bool> t(n,false);
    for(auto u:i) {
        t[u]=true;
    }
    for(auto u:t) {
        if(u) cout<<1;
        else cout<<0;
    }
    cout<<endl;
    string c; cin>>c;
    flush(cout);
    return c=="P";
}
void check(vector<int> &n, vector<bool> &res,vector<int> &free,vector<int> &k,int N) {
    if(n.size()==0) return;
    if(n.size()==1) {
        res[n[0]]=true;
        return;
    }
    vector<int> toTest(k[n.size()]);
    for (int i = 0; i < k[n.size()]; ++i) {
        toTest[i]=n[i];
    }
    if(test(toTest,N)) {
        check(toTest,res,free,k,N);
        for (int i = k[n.size()]; i < n.size(); ++i) {
            free.push_back(n[i]);
        }
    }else {
        vector<int> u;
        for (int i = k[n.size()]; i < n.size(); ++i) {
            u.push_back(n[i]);
        }
        for (int i = 0; i < k[n.size()]; ++i) {
            res[i]=false;
        }
        check(u,res,free,k,N);
    }

}
int main()
{
    int N,T;
    double p;
    cin>>N>>p>>T;
    int background = -1/log2(1-p);
    if(background==0) background=1;
    vector<int> k(N);
    for (int i = 0; i < N; ++i) {
        double d =(log2(1-(1-pow(1-p,i))/2)/log2(1-p));
        k[i] = d;
        if(k[i]==0)k[i]=1;
    }
    for (int mi = 0; mi < T; ++mi) {
        vector<bool> res(N);
        vector<int> free;
        for (int i= 0; i < N; ++i) {
            free.push_back(i);
        }
        while(!free.empty()) {
            vector<int> o;
            for (int i = 0; i < background; ++i) {
                if(!free.empty()) {
                    o.push_back(free.back()); free.pop_back();
                }
            }
            if(test(o,N)) {
                check(o,res,free,k,N);
            }else {
                for (int i :o) {
                    res[i]=false;
                }
            }
        }
        answer(res);
    }
}

Compilation message

Main.cpp: In function 'void answer(std::vector<bool>&)':
Main.cpp:9:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<bool>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    9 |     for (int i = 0; i < res.size(); ++i) {
      |                     ~~^~~~~~~~~~~~
Main.cpp: In function 'void check(std::vector<int>&, std::vector<bool>&, std::vector<int>&, std::vector<int>&, int)':
Main.cpp:46:37: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 |         for (int i = k[n.size()]; i < n.size(); ++i) {
      |                                   ~~^~~~~~~~~~
Main.cpp:51:37: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   51 |         for (int i = k[n.size()]; i < n.size(); ++i) {
      |                                   ~~^~~~~~~~~~

Subtask #0
0.0 / 0.0

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

Subtask #1
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 344 KB Output is correct
2 Correct 43 ms 344 KB Output is correct
3 Correct 36 ms 344 KB Output is correct
4 Correct 40 ms 344 KB Output is correct
5 Correct 37 ms 344 KB Output is correct
6 Correct 37 ms 344 KB Output is correct
7 Correct 55 ms 596 KB Output is correct
8 Correct 42 ms 344 KB Output is correct
9 Correct 61 ms 344 KB Output is correct
10 Correct 28 ms 344 KB Output is correct
11 Correct 37 ms 344 KB Output is correct
12 Correct 60 ms 344 KB Output is correct
13 Correct 55 ms 344 KB Output is correct
14 Correct 36 ms 344 KB Output is correct
15 Correct 36 ms 344 KB Output is correct
16 Correct 44 ms 344 KB Output is correct
17 Execution timed out 7010 ms 344 KB Time limit exceeded
18 Halted 0 ms 0 KB -

Subtask #2
0.0 / 90.0

# Verdict Execution time Memory Grader output
1 Incorrect 69 ms 600 KB translate:wrong
2 Halted 0 ms 0 KB -