oj.uz

Submission #1094642

# Submission time Handle Problem Language Result Execution time Memory
1094642 2024-09-30T07:55:45 Z epicci23 COVID tests (CEOI24_covid) C++17
10 / 100
 7000 ms 352 KB 
#include "bits/stdc++.h"
//#define int long long
#define double long double
#define all(v) v.begin() , v.end()
#define sz(a) (int)a.size()
using namespace std;
 
int BL,n,tc;
double P;
vector<bool> cur,A;
vector<double> Store;
vector<int> sor;

bool test_students(){
  cout << "Q ";
  for(int x:cur) cout << x;
  cout << '\n' << flush; 
  char answer; cin >> answer;
  return answer == 'P';
}
 
bool Ask(){
  for(int x:sor) cur[x]=1;
  bool res = test_students();
  for(int x:sor) cur[x]=0;
  return res;
}

double Fast(double x,int u){
  if(u==0) return 1.0L;
  double res=Fast(x,u/2);
  res*=res;
  if(u&1) res*=x;
  return res;
}

inline double calc_prob(int g){
  return 1.0L - Fast(1.0L - P, g);
}

inline double eval(double d){
   return abs(d - 0.5L);
}
 
void find_positive(){
  A.assign(n,0);
  vector<int> g1(n,0),g2;
  iota(all(g1),0);

  while(sz(g1) || sz(g2)){
    if(sz(g2)){

     if(sz(g2)==1){
      A[g2[0]]=1;
      g2.clear();
      continue;
     }

     int cur_BL = 1;
     while(eval(Store[cur_BL+1]/Store[sz(g2)]) 
      < eval(Store[cur_BL]/Store[sz(g2)]))
      ++cur_BL;

     int hm = sz(g2);
     for(int j=0;j<min(hm,cur_BL);j++){
      sor.push_back(g2.back());
      g2.pop_back();
     }

     if(Ask()){
       g1.insert(end(g1),all(g2));
       g2=sor;
     }
     
     sor.clear();
    }
    else{
      int hm = sz(g1);
      for(int j=0;j<min(hm,BL);j++){
       sor.push_back(g1.back());
       g1.pop_back();
      }
      if(Ask()) g2=sor;

      sor.clear();
    }
  }
}
 
void _(){
  find_positive();
  cout << "A ";
  for(bool x:A) cout << x;
  cout << '\n' << flush;
  char son; cin >> son;
  if(son=='C') return;
  else exit(0);
}
 
int32_t main(){
  cin.tie(0); ios::sync_with_stdio(0);

  cin >> n >> P >> tc;
  cur.assign(n,0);
  Store.resize(n+5);

  for(int i=0;i<=n;i++) Store[i]=calc_prob(i);
  BL=1;
  while(eval(Store[BL+1])<eval(Store[BL])) ++BL;
  if(P==0.104571) ++BL;

  while(tc--) _();
  return 0;
}

Subtask #0
0.0 / 0.0

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

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 344 KB Output is correct
2 Correct 32 ms 344 KB Output is correct
3 Correct 32 ms 344 KB Output is correct
4 Correct 30 ms 344 KB Output is correct
5 Correct 44 ms 344 KB Output is correct
6 Correct 35 ms 344 KB Output is correct
7 Correct 37 ms 344 KB Output is correct
8 Correct 30 ms 344 KB Output is correct
9 Correct 30 ms 344 KB Output is correct
10 Correct 20 ms 348 KB Output is correct
11 Correct 34 ms 348 KB Output is correct
12 Correct 33 ms 344 KB Output is correct
13 Correct 30 ms 348 KB Output is correct
14 Correct 31 ms 352 KB Output is correct
15 Correct 31 ms 348 KB Output is correct
16 Correct 30 ms 344 KB Output is correct
17 Correct 30 ms 344 KB Output is correct

Subtask #2
0.0 / 90.0

# Verdict Execution time Memory Grader output
1 Correct 120 ms 348 KB Output is correct (P=0.001, F=15.1, Q=11.0) -> 90.00 points
2 Correct 484 ms 344 KB Output is correct (P=0.005256, F=51.1, Q=46.6) -> 90.00 points
3 Correct 927 ms 344 KB Output is correct (P=0.011546, F=94.9, Q=91.0) -> 90.00 points
4 Correct 1901 ms 344 KB Output is correct (P=0.028545, F=191.5, Q=188.4) -> 90.00 points
5 Correct 2517 ms 344 KB Output is correct (P=0.039856, F=246.3, Q=244.6) -> 90.00 points
6 Correct 3634 ms 344 KB Output is correct (P=0.068648, F=366.2, Q=364.9) -> 90.00 points
7 Correct 5023 ms 344 KB Output is correct (P=0.104571, F=490.3, Q=492.2) -> 88.63 points
8 Correct 6356 ms 344 KB Output is correct (P=0.158765, F=639.1, Q=633.0) -> 90.00 points
9 Execution timed out 7054 ms 344 KB Time limit exceeded
10 Halted 0 ms 0 KB -