oj.uz

Submission #705459

# Submission time Handle Problem Language Result Execution time Memory
705459 2023-03-04T12:37:32 Z YassineBenYounes Combo (IOI18_combo) C++17
100 / 100
 36 ms 560 KB 
/*
ID: Yassine BenYounes
TASK: time
LANG: C++
*/
#include<bits/stdc++.h>
 
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef double db;
/*#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pbds tree<int, null_type, less<int>,rb_tree_tag, tree_order_statistics_node_update>
using namespace __gnu_pbds;*/
ll gcd(ll a , ll b) {return b ? gcd(b , a % b) : a ;} // greatest common divisor (PGCD)
ll lcm(ll a , ll b) {return (a * b) / gcd(a , b);} // least common multiple (PPCM)
ll modd(ll x, ll n){while(x < 0){x += n;}return (x % n);} // modulo for negative numbers
int dx[8] = {0, -1, 0, 1, 1, 1, -1, -1};
int dy[8] = {-1, 0, 1, 0, -1, 1, -1, 1};
#define endl "\n"
#define ss second
#define ff first
#define all(x) (x).begin() , (x).end()
#define pb push_back
#define vi vector<int>
#define vii vector<pair<int,int>>
#define vl vector<ll>
#define vll vector<pair<ll,ll>>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pdd  pair<double,double>
#define vdd  vector<pdd>
#define speed ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
 
void init(){
    #ifndef ONLINE_JUDGE
 
freopen("input.txt", "r", stdin);
 
freopen("output.txt", "w", stdout);
 
#endif // ONLINE_JUDGE
}
 
const int mx = 1e6+9;
const ll mod = 1e9+7;
const int inf = 1e9;

int press(string p);

string guess_sequence(int N){
    string s;
    if(press("AB")!=0){
        if(press("A") != 0)s = "A";
        else s = "B";
    }
    else{
        if(press("X") != 0)s = "X";
        else s = "Y";
    }
    vector<string> v;
    if(s != "A")v.pb("A");
    if(s != "B")v.pb("B");
    if(s != "X")v.pb("X");
    if(s != "Y")v.pb("Y");
    for(int i = 2; i <= N;i++){
        if(i == N){
            int a = press(s + v[0]);
            int b = press(s + v[1]);
            if(a == b){
                s += v[2];
            }
            else{
                if(a > b){
                    s += v[0];
                }
                else s += v[1];
            }
            continue;
        }
        string res = s+v[0]+s+v[1]+v[0]+s+v[1]+v[1]+s+v[1]+v[2];
        int c = press(res);
        if(c == i+1){
            s += v[1];
        }
        else if(c == i){
            s += v[0];
        }
        else{
            s += v[2];
        }
    }
    return s;
}
/*
int main(){
    //ofstream fout ("teamwork.out");
    //ifstream fin ("teamwork.in");
    init();
    speed;
    cout << guess_sequence(10) << endl;
}*/

/*
    NEVER GIVE UP!
    DOING SMTHNG IS BETTER THAN DOING NTHNG!!!
*/

Compilation message

combo.cpp: In function 'void init()':
combo.cpp:40:8: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   40 | freopen("input.txt", "r", stdin);
      | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
combo.cpp:42:8: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   42 | freopen("output.txt", "w", stdout);
      | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 0 ms 208 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 0 ms 208 KB Output is correct
13 Correct 0 ms 208 KB Output is correct
14 Correct 0 ms 208 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 1 ms 208 KB Output is correct
17 Correct 0 ms 208 KB Output is correct
18 Correct 1 ms 208 KB Output is correct
19 Correct 0 ms 208 KB Output is correct
20 Correct 1 ms 208 KB Output is correct
21 Correct 0 ms 208 KB Output is correct
22 Correct 1 ms 208 KB Output is correct
23 Correct 0 ms 208 KB Output is correct
24 Correct 1 ms 208 KB Output is correct
25 Correct 0 ms 208 KB Output is correct
26 Correct 0 ms 208 KB Output is correct
27 Correct 1 ms 208 KB Output is correct
28 Correct 1 ms 208 KB Output is correct
29 Correct 1 ms 208 KB Output is correct
30 Correct 1 ms 208 KB Output is correct
31 Correct 0 ms 208 KB Output is correct
32 Correct 0 ms 208 KB Output is correct
33 Correct 1 ms 208 KB Output is correct
34 Correct 0 ms 208 KB Output is correct
35 Correct 1 ms 208 KB Output is correct
36 Correct 0 ms 208 KB Output is correct

Subtask #2
95.0 / 95.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 276 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 0 ms 208 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 0 ms 208 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 1 ms 208 KB Output is correct
13 Correct 0 ms 208 KB Output is correct
14 Correct 1 ms 208 KB Output is correct
15 Correct 0 ms 208 KB Output is correct
16 Correct 1 ms 244 KB Output is correct
17 Correct 23 ms 352 KB Output is correct
18 Correct 30 ms 352 KB Output is correct
19 Correct 28 ms 456 KB Output is correct
20 Correct 34 ms 352 KB Output is correct
21 Correct 27 ms 348 KB Output is correct
22 Correct 0 ms 208 KB Output is correct
23 Correct 1 ms 208 KB Output is correct
24 Correct 1 ms 208 KB Output is correct
25 Correct 1 ms 208 KB Output is correct
26 Correct 1 ms 220 KB Output is correct
27 Correct 1 ms 208 KB Output is correct
28 Correct 1 ms 208 KB Output is correct
29 Correct 2 ms 208 KB Output is correct
30 Correct 2 ms 208 KB Output is correct
31 Correct 2 ms 312 KB Output is correct
32 Correct 20 ms 352 KB Output is correct
33 Correct 31 ms 348 KB Output is correct
34 Correct 25 ms 456 KB Output is correct
35 Correct 31 ms 452 KB Output is correct
36 Correct 34 ms 352 KB Output is correct
37 Correct 36 ms 348 KB Output is correct
38 Correct 27 ms 392 KB Output is correct
39 Correct 24 ms 352 KB Output is correct
40 Correct 24 ms 348 KB Output is correct
41 Correct 22 ms 348 KB Output is correct
42 Correct 28 ms 472 KB Output is correct
43 Correct 26 ms 468 KB Output is correct
44 Correct 17 ms 560 KB Output is correct
45 Correct 31 ms 352 KB Output is correct
46 Correct 25 ms 468 KB Output is correct
47 Correct 24 ms 388 KB Output is correct
48 Correct 34 ms 472 KB Output is correct
49 Correct 27 ms 480 KB Output is correct
50 Correct 25 ms 548 KB Output is correct
51 Correct 16 ms 432 KB Output is correct
52 Correct 21 ms 428 KB Output is correct
53 Correct 22 ms 356 KB Output is correct
54 Correct 22 ms 356 KB Output is correct
55 Correct 26 ms 396 KB Output is correct
56 Correct 16 ms 444 KB Output is correct
57 Correct 24 ms 372 KB Output is correct
58 Correct 33 ms 360 KB Output is correct
59 Correct 25 ms 352 KB Output is correct
60 Correct 23 ms 356 KB Output is correct
61 Correct 22 ms 516 KB Output is correct
62 Correct 23 ms 464 KB Output is correct
63 Correct 34 ms 524 KB Output is correct
64 Correct 17 ms 348 KB Output is correct
65 Correct 18 ms 352 KB Output is correct
66 Correct 26 ms 348 KB Output is correct
67 Correct 25 ms 416 KB Output is correct
68 Correct 27 ms 356 KB Output is correct
69 Correct 26 ms 352 KB Output is correct
70 Correct 16 ms 352 KB Output is correct
71 Correct 19 ms 352 KB Output is correct
72 Correct 26 ms 484 KB Output is correct
73 Correct 26 ms 464 KB Output is correct
74 Correct 24 ms 392 KB Output is correct
75 Correct 24 ms 480 KB Output is correct
76 Correct 28 ms 452 KB Output is correct
77 Correct 21 ms 452 KB Output is correct
78 Correct 0 ms 208 KB Output is correct
79 Correct 1 ms 208 KB Output is correct
80 Correct 1 ms 208 KB Output is correct
81 Correct 1 ms 208 KB Output is correct
82 Correct 1 ms 208 KB Output is correct
83 Correct 1 ms 208 KB Output is correct
84 Correct 0 ms 296 KB Output is correct
85 Correct 2 ms 208 KB Output is correct
86 Correct 1 ms 208 KB Output is correct
87 Correct 1 ms 208 KB Output is correct
88 Correct 1 ms 208 KB Output is correct
89 Correct 1 ms 208 KB Output is correct
90 Correct 1 ms 208 KB Output is correct
91 Correct 1 ms 208 KB Output is correct
92 Correct 1 ms 208 KB Output is correct
93 Correct 1 ms 208 KB Output is correct
94 Correct 1 ms 208 KB Output is correct
95 Correct 1 ms 208 KB Output is correct
96 Correct 1 ms 208 KB Output is correct
97 Correct 2 ms 208 KB Output is correct
98 Correct 1 ms 208 KB Output is correct
99 Correct 1 ms 208 KB Output is correct
100 Correct 1 ms 304 KB Output is correct
101 Correct 1 ms 208 KB Output is correct
102 Correct 1 ms 296 KB Output is correct
103 Correct 1 ms 208 KB Output is correct
104 Correct 1 ms 208 KB Output is correct
105 Correct 1 ms 296 KB Output is correct
106 Correct 1 ms 208 KB Output is correct
107 Correct 1 ms 208 KB Output is correct
108 Correct 1 ms 208 KB Output is correct
109 Correct 0 ms 208 KB Output is correct
110 Correct 0 ms 208 KB Output is correct
111 Correct 1 ms 208 KB Output is correct
112 Correct 0 ms 208 KB Output is correct
113 Correct 0 ms 208 KB Output is correct
114 Correct 1 ms 208 KB Output is correct
115 Correct 0 ms 208 KB Output is correct
116 Correct 1 ms 208 KB Output is correct
117 Correct 1 ms 296 KB Output is correct
118 Correct 1 ms 208 KB Output is correct
119 Correct 1 ms 208 KB Output is correct
120 Correct 1 ms 208 KB Output is correct
121 Correct 1 ms 208 KB Output is correct
122 Correct 1 ms 208 KB Output is correct
123 Correct 1 ms 208 KB Output is correct