# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1280813 | cuervo2320 | 콤보 (IOI18_combo) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
#include "combo.h"
using namespace std;
// typedef ********************************************
typedef long long ll;
typedef pair<int, int> ii;
typedef pair<int,pair<int,int>> iii;
typedef map<int, int> mp;
typedef map<int, string> mps;
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<long long> vll;
typedef vector<vector<int>> vvi;
typedef vector<vector<ii>> vvii;
// definiciones ****************************************
#define s second
#define f first
#define pb push_back
#define sz(x) (int)(x.size())
#define all(x) x.begin(), x.end()
#define FOR(i, n) for (int i = 0; i < n; i++)
#define YES cout << 'Y' << 'E' << 'S' << endl;
#define NO cout << 'N' << 'O' << endl;
void setIO() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
// freopen(" .in","r",stdin);
// freopen(" .out","w",stdout);
}
// grafos **********************************************
vector<vector<pair<int, int>>> leergraph(int n, int m) {
vector<vector<pair<int, int>>> adj(n + 1);
for (int i = 0; i < m; ++i) {
int u, v, w;
cin >> u >> v >> w;
adj[u].push_back({v, w});
}
return adj;
}
/*
void dfs(int u) {
vector<bool> visitado;
visitado[u] = true;
for (int i = 0; i < adj[u].size(); i++) {
int v = adj[u][i].first;
int w = adj[u][i].second;
if (!visitado[v]) dfs(v);
}
}
*/
// inicio ***********************************************
string guess_sequence(int N) {
string ans = "";
string letters = "ABXY";
for (char c : letters) {
string t(1, c);
if (press(t) == 1) {
ans += c;
break;
}
}
for (int i = 1; i < N; ++i) {
for (char c : letters) {
string t = ans + c;
if (press(t) == i + 1) {
ans += c;
break;
}
}
}
guess(ans);
return ans;
}