oj.uz

Submission #939348

# Submission time Handle Problem Language Result Execution time Memory
939348 2024-03-06T09:39:15 Z xynex Combo (IOI18_combo) C++17
100 / 100
 18 ms 2092 KB 
/**
  * Author: Tenjin
  * Created: 27.04.2022 18:58
  * Why am I so stupid? :c
  * Slishkom slab
**/
#include "combo.h"
#include <bits/stdc++.h>

 #pragma GCC optimize("inline")
 #pragma GCC optimize("-fgcse,-fgcse-lm")
 #pragma GCC optimize("-ftree-pre,-ftree-vrp")
 #pragma GCC optimize("-ffast-math")
 #pragma GCC optimize("-fipa-sra")
 #pragma GCC optimize("-fpeephole2")
 #pragma GCC optimize("-fsched-spec")
 #pragma GCC optimize("Ofast,no-stack-protector")
 #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
 #pragma GCC optimize("unroll-loops")

using namespace std;

#define ll long long
#define pr pair
#define vt vector
#define ff first
#define ss second
#define sz(a) (int)a.size()
#define pb push_back
#define pf push_front
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()

template<typename T> T get_rand(T l, T r) {
  random_device rd;
  mt19937 gen(rd());
  return uniform_int_distribution<T>(l, r)(gen);
}

template<class A> void read(vt<A>& v);
template<class A, size_t S> void read(array<A, S>& a);
template<class T> void read(T& x) { cin >> x; }
void read(double& d) { string t; read(t); d = stod(t); }
void read(long double& d) { string t; read(t); d = stold(t); }
template<class H, class... T> void read(H& h, T&... t) { read(h); read(t...); }
template<class A> void read(vt<A>& x) { for (auto& a : x) read(a); }
template<class A, size_t S> void read(array<A, S>& x) { for (auto& a : x) read(a); }

string to_string(char c) { return string(1, c); }
string to_string(bool b) { return b ? "true" : "false"; }
string to_string(const char* s) { return string(s); }
string to_string(string s) { return s; }
string to_string(vt<bool> v) { string res; for (int i = 0; i < sz(v); ++i) res += char('0' + v[i]); return res; }
template<size_t S> string to_string(bitset<S> b) { string res; for (int i = 0; i < S; ++i) res += char('0' + b[i]); return res; }
template<class T> string to_string(T v) { bool f = 1; string res; for (auto x : v) { if (!f) res += ' '; f = 0; res += to_string(x); } return res; }

template<class A> void write(A x) { cout << to_string(x); }
template<class H, class... T> void write(const H& h, const T&... t) { write(h); write(t...); }

void print() { write("\n"); }
template<class H, class... T> void print(const H& h, const T&... t) { write(h); if (sizeof...(t)) write(' '); print(t...); }

void freop(string s) {
  freopen((s + ".in").c_str(), "r", stdin);
  freopen((s + ".out").c_str(), "w", stdout);
}

const int MOD = 1e9 + 7;
const ll INF = 1e14;
const int M = 4e5 + 5;
const double long pi = acos(-1);
const double long eps = 1e-12;
const int sq = 700;

int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};
/* ll vs int*/

//const int N = 1e6 + 5;

std::string guess_sequence(int N) {
  char x, y, z;
  string ans = "";
  if(press("AB")) {
    if(press("A")) ans += "A", x = 'B', y = 'X', z = 'Y';
    else ans += "B", x = 'A', y = 'X', z = 'Y';
  }
  else {
    if(press("X")) ans += "X", x = 'A', y = 'B', z = 'Y';
    else ans += "Y", x = 'A', y = 'B', z = 'X';
  }
  if(N == 1) {
    return ans;
  }
  for(int i = 2; i <= N - 1; ++i) {
    int cur = press(ans + y + x + ans + y + y + ans + y + z + ans + x);
    if(cur == i) {
      ans += x;
    }
    else if(cur >= i + 1) {
      ans += y;
    }
    else {
      ans += z;
    }
  }
  if(press(ans + x) == N) {
    ans += x;
  }
  else if(press(ans + y) == N) {
    ans += y;
  }
  else ans += z;
 // print(ans, num_moves);
  return ans;
}

Compilation message

combo.cpp: In function 'void freop(std::string)':
combo.cpp:64:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   64 |   freopen((s + ".in").c_str(), "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
combo.cpp:65:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   65 |   freopen((s + ".out").c_str(), "w", stdout);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
95.0 / 95.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 13 ms 1512 KB Output is correct
18 Correct 15 ms 1512 KB Output is correct
19 Correct 13 ms 1408 KB Output is correct
20 Correct 14 ms 1520 KB Output is correct
21 Correct 11 ms 1540 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 0 ms 432 KB Output is correct
24 Correct 1 ms 432 KB Output is correct
25 Correct 1 ms 444 KB Output is correct
26 Correct 1 ms 448 KB Output is correct
27 Correct 1 ms 440 KB Output is correct
28 Correct 1 ms 448 KB Output is correct
29 Correct 1 ms 696 KB Output is correct
30 Correct 1 ms 700 KB Output is correct
31 Correct 1 ms 432 KB Output is correct
32 Correct 11 ms 1552 KB Output is correct
33 Correct 10 ms 1636 KB Output is correct
34 Correct 10 ms 1416 KB Output is correct
35 Correct 11 ms 1412 KB Output is correct
36 Correct 11 ms 1200 KB Output is correct
37 Correct 10 ms 1160 KB Output is correct
38 Correct 11 ms 1624 KB Output is correct
39 Correct 10 ms 1444 KB Output is correct
40 Correct 9 ms 1240 KB Output is correct
41 Correct 10 ms 1616 KB Output is correct
42 Correct 11 ms 1572 KB Output is correct
43 Correct 12 ms 1432 KB Output is correct
44 Correct 12 ms 1352 KB Output is correct
45 Correct 14 ms 1464 KB Output is correct
46 Correct 15 ms 1216 KB Output is correct
47 Correct 12 ms 1284 KB Output is correct
48 Correct 18 ms 1188 KB Output is correct
49 Correct 11 ms 1588 KB Output is correct
50 Correct 12 ms 1216 KB Output is correct
51 Correct 12 ms 1636 KB Output is correct
52 Correct 13 ms 1356 KB Output is correct
53 Correct 14 ms 1312 KB Output is correct
54 Correct 13 ms 1408 KB Output is correct
55 Correct 11 ms 1140 KB Output is correct
56 Correct 15 ms 1404 KB Output is correct
57 Correct 13 ms 1144 KB Output is correct
58 Correct 11 ms 1552 KB Output is correct
59 Correct 14 ms 1336 KB Output is correct
60 Correct 12 ms 1212 KB Output is correct
61 Correct 12 ms 1348 KB Output is correct
62 Correct 12 ms 1320 KB Output is correct
63 Correct 13 ms 1400 KB Output is correct
64 Correct 14 ms 1360 KB Output is correct
65 Correct 13 ms 1140 KB Output is correct
66 Correct 15 ms 1348 KB Output is correct
67 Correct 11 ms 1288 KB Output is correct
68 Correct 11 ms 2092 KB Output is correct
69 Correct 11 ms 1232 KB Output is correct
70 Correct 11 ms 1764 KB Output is correct
71 Correct 11 ms 1964 KB Output is correct
72 Correct 10 ms 1204 KB Output is correct
73 Correct 11 ms 1352 KB Output is correct
74 Correct 10 ms 1240 KB Output is correct
75 Correct 9 ms 1452 KB Output is correct
76 Correct 11 ms 1368 KB Output is correct
77 Correct 14 ms 1612 KB Output is correct
78 Correct 0 ms 344 KB Output is correct
79 Correct 0 ms 344 KB Output is correct
80 Correct 1 ms 344 KB Output is correct
81 Correct 0 ms 344 KB Output is correct
82 Correct 1 ms 344 KB Output is correct
83 Correct 1 ms 340 KB Output is correct
84 Correct 1 ms 436 KB Output is correct
85 Correct 0 ms 432 KB Output is correct
86 Correct 1 ms 436 KB Output is correct
87 Correct 1 ms 436 KB Output is correct
88 Correct 0 ms 344 KB Output is correct
89 Correct 0 ms 344 KB Output is correct
90 Correct 0 ms 344 KB Output is correct
91 Correct 0 ms 344 KB Output is correct
92 Correct 0 ms 344 KB Output is correct
93 Correct 1 ms 344 KB Output is correct
94 Correct 1 ms 432 KB Output is correct
95 Correct 1 ms 432 KB Output is correct
96 Correct 0 ms 440 KB Output is correct
97 Correct 0 ms 436 KB Output is correct
98 Correct 0 ms 436 KB Output is correct
99 Correct 1 ms 436 KB Output is correct
100 Correct 0 ms 436 KB Output is correct
101 Correct 0 ms 436 KB Output is correct
102 Correct 0 ms 432 KB Output is correct
103 Correct 0 ms 432 KB Output is correct
104 Correct 1 ms 684 KB Output is correct
105 Correct 0 ms 436 KB Output is correct
106 Correct 1 ms 344 KB Output is correct
107 Correct 1 ms 340 KB Output is correct
108 Correct 0 ms 344 KB Output is correct
109 Correct 0 ms 344 KB Output is correct
110 Correct 1 ms 344 KB Output is correct
111 Correct 0 ms 596 KB Output is correct
112 Correct 0 ms 344 KB Output is correct
113 Correct 0 ms 344 KB Output is correct
114 Correct 0 ms 344 KB Output is correct
115 Correct 0 ms 344 KB Output is correct
116 Correct 1 ms 344 KB Output is correct
117 Correct 0 ms 344 KB Output is correct
118 Correct 1 ms 440 KB Output is correct
119 Correct 0 ms 436 KB Output is correct
120 Correct 1 ms 436 KB Output is correct
121 Correct 1 ms 432 KB Output is correct
122 Correct 1 ms 440 KB Output is correct
123 Correct 1 ms 856 KB Output is correct