oj.uz

Submission #1044762

# Submission time Handle Problem Language Result Execution time Memory
1044762 2024-08-05T13:21:19 Z dilanyan COVID tests (CEOI24_covid) C++17
37.02 / 100
 6483 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;
bool ans[N], ask[N];
bool flag = true;

void rec(int l, int r) {
    if (r - l == 1) {
        ans[l] = 1;
        return;
    }
    int m = (l + r) / 2;
    for (int i = 0;i < n;i++) {
        if (i < l || i >= m) ask[i] = 0;
        else ask[i] = 1;
    }
    cout << "Q ";
    for (int i = 0;i < n;i++) cout << (char)('0' + ask[i]);
    cout << endl;
    char c; cin >> c;
    if (c == 'P') rec(l, m);
    for (int i = 0;i < n;i++) {
        if (i < m || i >= r) ask[i] = 0;
        else ask[i] = 1;
    }
    cout << "Q ";
    for (int i = 0;i < n;i++) cout << (char)('0' + ask[i]);
    cout << endl;
    cin >> c;
    if (c == 'P') rec(m, r);
}

void KarginSolve() {
    for (int i = 0;i < n;i++) ans[i] = 0;
    rec(0, n);
    cout << "A ";
    for (int i = 0;i < n;i++) cout << (char)('0' + 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 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
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 344 KB Output is correct
2 Correct 34 ms 344 KB Output is correct
3 Correct 35 ms 344 KB Output is correct
4 Correct 30 ms 344 KB Output is correct
5 Correct 35 ms 344 KB Output is correct
6 Correct 33 ms 344 KB Output is correct
7 Correct 29 ms 344 KB Output is correct
8 Correct 43 ms 344 KB Output is correct
9 Correct 30 ms 344 KB Output is correct
10 Correct 22 ms 344 KB Output is correct
11 Correct 26 ms 344 KB Output is correct
12 Correct 27 ms 344 KB Output is correct
13 Correct 28 ms 344 KB Output is correct
14 Correct 26 ms 344 KB Output is correct
15 Correct 27 ms 344 KB Output is correct
16 Correct 33 ms 344 KB Output is correct
17 Correct 0 ms 344 KB Output is correct

Subtask #2
27.019999998 / 90.0

# Verdict Execution time Memory Grader output
1 Correct 97 ms 340 KB Output is correct (P=0.001, F=15.1, Q=17.6) -> 54.14 points
2 Correct 450 ms 344 KB Output is correct (P=0.005256, F=51.1, Q=77.1) -> 29.65 points
3 Correct 873 ms 344 KB Output is correct (P=0.011546, F=94.9, Q=149.1) -> 27.40 points
4 Correct 1738 ms 344 KB Output is correct (P=0.028545, F=191.5, Q=303.1) -> 27.02 points
5 Correct 2232 ms 344 KB Output is correct (P=0.039856, F=246.3, Q=387.2) -> 27.37 points
6 Correct 3207 ms 344 KB Output is correct (P=0.068648, F=366.2, Q=568.3) -> 28.06 points
7 Correct 4246 ms 344 KB Output is correct (P=0.104571, F=490.3, Q=750.8) -> 28.80 points
8 Correct 5668 ms 344 KB Output is correct (P=0.158765, F=639.1, Q=966.7) -> 29.50 points
9 Correct 6483 ms 344 KB Output is correct (P=0.2, F=731.4, Q=1111.6) -> 29.23 points