oj.uz

Submission #853317

# Submission time Handle Problem Language Result Execution time Memory
853317 2023-09-24T05:29:41 Z hariaakas646 Combo (IOI18_combo) C++17
100 / 100
 15 ms 2208 KB 
#include <bits/stdc++.h>
#include "combo.h"

using namespace std;

#define scd(t) scanf("%d", &t)
#define scld(t) scanf("%ld", &t)
#define sclld(t) scanf("%lld", &t)
#define scc(t) scanf("%c", &t)
#define scs(t) scanf("%s", t)
#define scf(t) scanf("%f", &t)
#define sclf(t) scanf("%lf", &t)
#define forr(i, j, k) for (int i = j; i < k; i++)
#define frange(i, j) forr(i, 0, j)
#define all(cont) cont.begin(), cont.end()
#define mp make_pair
#define pb push_back
#define f first
#define s second
typedef long int li;
typedef unsigned long int uli;
typedef long long int lli;
typedef unsigned long long int ulli;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<lli> vll;
typedef vector<string> vs;
typedef vector<pii> vii;
typedef vector<vi> vvi;
typedef map<int, int> mpii;
typedef set<int> seti;
typedef multiset<int> mseti;
typedef long double ld;

void usaco()
{
    freopen("/media/hariaakash646/785EF1075EF0BF46/CompetitiveProgramming/input.in", "r", stdin);
//    freopen("problem.out", "w", stdout);
}

// namespace {

// constexpr int MAX_N = 2000;
// constexpr int MAX_NUM_MOVES = 8000;

// int N;
// std::string S;

// int num_moves;

// void wrong_answer(const char *MSG) {
//   printf("Wrong Answer: %s\n", MSG);
//   exit(0);
// }

// }  // namespace

// int press(std::string p) {
//   if (++num_moves > MAX_NUM_MOVES) {
//     wrong_answer("too many moves");
//   }
//   int len = p.length();
//   if (len > 4 * N) {
//     wrong_answer("invalid press");
//   }
//   for (int i = 0; i < len; ++i) {
//     if (p[i] != 'A' && p[i] != 'B' && p[i] != 'X' && p[i] != 'Y') {
//       wrong_answer("invalid press");
//     }
//   }
//   int coins = 0;
//   for (int i = 0, j = 0; i < len; ++i) {
//     if (j < N && S[j] == p[i]) {
//       ++j;
//     } else if (S[0] == p[i]) {
//       j = 1;
//     } else {
//       j = 0;
//     }
//     coins = std::max(coins, j);
//   }
//   return coins;
// }


string guess_sequence(int n) {
	string conf = "";

	string check = "AB";
	string fi;
	if(press(check)) {
		check = "A";
		if(press(check)) fi = "A";
		else fi = "B";
	} 
	else {
		check = "X";
		if(press(check)) fi = "X";
		else fi = "Y";
	}
	conf += fi;
	string c1, c2, c3;

	if(fi == "A") {
		c1 = "B";
		c2 = "X";
		c3 = "Y";
	}
	else if(fi == "B") {
		c1 = "A";
		c2 = "X";
		c3 = "Y";
	}
	else if(fi == "X") {
		c1 = "A";
		c2 = "B";
		c3 = "Y";
	}
	else if(fi == "Y") {
		c1 = "A";
		c2 = "B";
		c3 = "X";
	}
	if(n == 1) return fi;
	forr(i, 1, n-1) {
		check = conf;
		check += c1;
		check += conf + c2 + c1;
		check += conf + c2 + c2;
		check += conf + c2 + c3;

		int p = press(check);
		if(p == i) {
			conf += c3;
		}
		else if(p == i+1) {
			conf += c1;
		}
		else {
			conf += c2;
		}
	}
	if(press(conf + c1)==n) {
		conf += c1;
	}
	else if(press(conf + c2)==n) {
		conf += c2;
	} 
	else conf += c3;

	return conf;
}

// int main() {
// 	usaco();
//   char buffer[MAX_N + 1];
//   if (scanf("%s", buffer) != 1) {
//     fprintf(stderr, "Error while reading input\n");
//     exit(1);
//   }
//   S = buffer;
//   N = S.length();

//   num_moves = 0;
//   std::string answer = guess_sequence(N);
//   if (answer != S) {
//     wrong_answer("wrong guess");
//     exit(0);
//   }
//   printf("Accepted: %d\n", num_moves);
//   return 0;
// }

Compilation message

combo.cpp: In function 'void usaco()':
combo.cpp:38:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   38 |     freopen("/media/hariaakash646/785EF1075EF0BF46/CompetitiveProgramming/input.in", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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 1 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 0 ms 344 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 344 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 344 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 0 ms 344 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 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 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 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 0 ms 344 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 10 ms 996 KB Output is correct
18 Correct 12 ms 1336 KB Output is correct
19 Correct 11 ms 1560 KB Output is correct
20 Correct 11 ms 1564 KB Output is correct
21 Correct 11 ms 1420 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 436 KB Output is correct
25 Correct 1 ms 432 KB Output is correct
26 Correct 1 ms 444 KB Output is correct
27 Correct 1 ms 692 KB Output is correct
28 Correct 1 ms 440 KB Output is correct
29 Correct 1 ms 692 KB Output is correct
30 Correct 1 ms 696 KB Output is correct
31 Correct 1 ms 452 KB Output is correct
32 Correct 10 ms 1492 KB Output is correct
33 Correct 15 ms 988 KB Output is correct
34 Correct 11 ms 1200 KB Output is correct
35 Correct 11 ms 1480 KB Output is correct
36 Correct 10 ms 1212 KB Output is correct
37 Correct 11 ms 1680 KB Output is correct
38 Correct 13 ms 1472 KB Output is correct
39 Correct 10 ms 1592 KB Output is correct
40 Correct 11 ms 1276 KB Output is correct
41 Correct 13 ms 1116 KB Output is correct
42 Correct 11 ms 1492 KB Output is correct
43 Correct 12 ms 1580 KB Output is correct
44 Correct 11 ms 1596 KB Output is correct
45 Correct 11 ms 1496 KB Output is correct
46 Correct 12 ms 1640 KB Output is correct
47 Correct 11 ms 1552 KB Output is correct
48 Correct 12 ms 1084 KB Output is correct
49 Correct 11 ms 1000 KB Output is correct
50 Correct 10 ms 1240 KB Output is correct
51 Correct 11 ms 1924 KB Output is correct
52 Correct 12 ms 1452 KB Output is correct
53 Correct 12 ms 1348 KB Output is correct
54 Correct 10 ms 1204 KB Output is correct
55 Correct 10 ms 896 KB Output is correct
56 Correct 12 ms 1484 KB Output is correct
57 Correct 11 ms 1552 KB Output is correct
58 Correct 11 ms 1420 KB Output is correct
59 Correct 11 ms 1740 KB Output is correct
60 Correct 11 ms 1364 KB Output is correct
61 Correct 13 ms 1944 KB Output is correct
62 Correct 13 ms 1916 KB Output is correct
63 Correct 11 ms 1496 KB Output is correct
64 Correct 11 ms 1732 KB Output is correct
65 Correct 11 ms 1152 KB Output is correct
66 Correct 10 ms 1232 KB Output is correct
67 Correct 11 ms 1696 KB Output is correct
68 Correct 11 ms 1580 KB Output is correct
69 Correct 11 ms 1160 KB Output is correct
70 Correct 14 ms 1220 KB Output is correct
71 Correct 11 ms 1364 KB Output is correct
72 Correct 13 ms 1528 KB Output is correct
73 Correct 10 ms 1476 KB Output is correct
74 Correct 12 ms 1640 KB Output is correct
75 Correct 10 ms 1724 KB Output is correct
76 Correct 11 ms 2208 KB Output is correct
77 Correct 11 ms 1652 KB Output is correct
78 Correct 0 ms 344 KB Output is correct
79 Correct 0 ms 344 KB Output is correct
80 Correct 0 ms 344 KB Output is correct
81 Correct 0 ms 344 KB Output is correct
82 Correct 0 ms 596 KB Output is correct
83 Correct 0 ms 344 KB Output is correct
84 Correct 0 ms 344 KB Output is correct
85 Correct 1 ms 344 KB Output is correct
86 Correct 1 ms 500 KB Output is correct
87 Correct 1 ms 344 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 0 ms 344 KB Output is correct
94 Correct 0 ms 344 KB Output is correct
95 Correct 0 ms 344 KB Output is correct
96 Correct 0 ms 344 KB Output is correct
97 Correct 0 ms 344 KB Output is correct
98 Correct 1 ms 688 KB Output is correct
99 Correct 0 ms 436 KB Output is correct
100 Correct 1 ms 436 KB Output is correct
101 Correct 0 ms 432 KB Output is correct
102 Correct 1 ms 344 KB Output is correct
103 Correct 1 ms 344 KB Output is correct
104 Correct 0 ms 344 KB Output is correct
105 Correct 0 ms 344 KB Output is correct
106 Correct 0 ms 344 KB Output is correct
107 Correct 0 ms 344 KB Output is correct
108 Correct 1 ms 344 KB Output is correct
109 Correct 0 ms 344 KB Output is correct
110 Correct 0 ms 596 KB Output is correct
111 Correct 1 ms 344 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 0 ms 344 KB Output is correct
117 Correct 1 ms 344 KB Output is correct
118 Correct 0 ms 344 KB Output is correct
119 Correct 1 ms 344 KB Output is correct
120 Correct 0 ms 344 KB Output is correct
121 Correct 0 ms 344 KB Output is correct
122 Correct 0 ms 432 KB Output is correct
123 Correct 1 ms 432 KB Output is correct