이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <algorithm>
#include <bitset>
#include <cstdint>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <math.h>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
//#include "cpp-combo/combo.h"
//#define int long long
#define loop(X, N) for(int X = 0; X < (N); X++)
#define all(V) V.begin(), V.end()
#define rall(V) V.rbegin(), V.rend()
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;
typedef uint64_t u64;
typedef int64_t i64;
int press(string p);
string guess_sequence(int N)
{
string result = "";
loop(i, N)
{
int guessA = press(result + 'A');
int guessB = press(result + 'B');
int guessX = press(result + 'X');
int guessY = press(result + 'Y');
int best = max({ guessA, guessB, guessX, guessY });
if (guessA == best)
result.push_back('A');
else if (guessB == best)
result.push_back('B');
else if (guessX == best)
result.push_back('X');
else if (guessY == best)
result.push_back('Y');
}
return result;
}
//signed main()
//{
// ios::sync_with_stdio(0);
// cin.tie(0);
//
//
//
// return 0;
//}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |