oj.uz

Submission #1044363

# Submission time Handle Problem Language Result Execution time Memory
1044363 2024-08-05T09:04:00 Z dilanyan COVID tests (CEOI24_covid) C++17
0 / 100
 7000 ms 344 KB 
//-------------dilanyan------------\\ 
 
#define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#include<stdio.h>
using namespace std;
 
//------------------Kargpefines--------------------\\ 
 
#define ll long long
#define pb push_back
#define all(u) (u).begin(), (u).end()
#define pqueue priority_queue
#define upper upper_bound
#define lower lower_bound
#define umap unordered_map
#define uset unordered_set
 
void KarginSet(string name = "") {
    ios_base::sync_with_stdio(false); cin.tie(NULL);
    if (name.size()) {
        freopen((name + ".in").c_str(), "r", stdin);
        freopen((name + ".out").c_str(), "w", stdout);
    }
}
 
//-------------------KarginConstants------------------\\ 
 
const ll mod = 1e9 + 7;
const ll inf = 2e9;
 
//-------------------KarginCode-----------------------\\ 
 
const int N = 500005, M = 1000005;

int n;
double p;

void KarginSolve() {
    vector<bool> ans(n, 0);
    vector<bool> ask(n, 0);
    while (true) {
        int l = 0, r = n, x = 0;
        while (r - l != 1) {
            int m = (l + r) / 2;
            for (int i = 0;i < n;i++) {
                if (i < l || i >= m) ask[i] = false;
                else {
                    if (ans[i]) ask[i] = false;
                    else ask[i] = true;
                }
            }
            if (count(ask.begin(), ask.end(), 1) == 0) l = m;
            else {
                cout << "Q ";
                for (int i : ask) cout << i;
                cout << endl;
                char c; cin >> c;
                if (c == 'P') r = m;
                else l = m;
            }
        }
        if (l == n - 1) {
            fill(ask.begin(), ask.end(), false);
            ask[l] = true;
            cout << "Q ";
            for (int i : ask) cout << i;
            cout << endl;
            char c; cin >> c;
            if (c == 'P') ans[l] = true;
            break;
        }
        ans[l] = true;
    }
    cout << "A ";
    for (int i = 0;i < n;i++) cout << ans[i];
    cout << endl;
    char c; cin >> c;
    if (c == 'W') exit(0);
}

int main() {
    KarginSet();
    int test = 1;
    cin >> n >> p >> test;
    while (test--) {
        KarginSolve();
    }
    return 0;
}

Compilation message

Main.cpp:1:1: warning: multi-line comment [-Wcomment]
    1 | //-------------dilanyan------------\\
      | ^
Main.cpp:8:1: warning: multi-line comment [-Wcomment]
    8 | //------------------Kargpefines--------------------\\
      | ^
Main.cpp:27:1: warning: multi-line comment [-Wcomment]
   27 | //-------------------KarginConstants------------------\\
      | ^
Main.cpp:32:1: warning: multi-line comment [-Wcomment]
   32 | //-------------------KarginCode-----------------------\\
      | ^
Main.cpp: In function 'void KarginSolve()':
Main.cpp:43:27: warning: unused variable 'x' [-Wunused-variable]
   43 |         int l = 0, r = n, x = 0;
      |                           ^
Main.cpp: In function 'void KarginSet(std::string)':
Main.cpp:22:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   22 |         freopen((name + ".in").c_str(), "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:23:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   23 |         freopen((name + ".out").c_str(), "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #0
0.0 / 0.0

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

Subtask #1
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 212 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 90.0

# Verdict Execution time Memory Grader output
1 Correct 194 ms 344 KB Output is correct (P=0.001, F=15.1, Q=20.1) -> 38.72 points
2 Correct 653 ms 344 KB Output is correct (P=0.005256, F=51.1, Q=61.7) -> 49.19 points
3 Correct 1205 ms 344 KB Output is correct (P=0.011546, F=94.9, Q=124.7) -> 39.89 points
4 Correct 2742 ms 344 KB Output is correct (P=0.028545, F=191.5, Q=294.0) -> 28.65 points
5 Correct 4405 ms 344 KB Output is correct (P=0.039856, F=246.3, Q=409.5) -> 24.65 points
6 Execution timed out 7034 ms 344 KB Time limit exceeded
7 Halted 0 ms 0 KB -