제출 #167498

#제출 시각아이디문제언어결과실행 시간메모리
167498Lightning사육제 (CEOI14_carnival)C++14
0 / 100
15 ms376 KiB
#include <iostream> #include <algorithm> #include <vector> #include <cmath> #include <set> #include <map> #include <iomanip> #include <stack> #include <queue> #include <deque> using namespace std; typedef long long ll; typedef pair <int, int> pii; #define sz(a) (int)a.size() #define all(a) a.begin(), a.end() #define pb push_back #define ppb pop_back #define mkp make_pair #define F first #define S second #define show(a) cerr << #a <<" -> "<< a <<"\n" #define fo(a, b, c, d) for(int (a) = (b); (a) <= (c); (a) += (d)) #define foo(a, b, c ,d) for(int (a) = (b); (a) >= (c); (a) -= (d)) //#define int ll const int N = 200; const int INF = 1e9; int n, ans[N], col; bool check(int pos, int x) { cout << pos <<" "; for(int i = 1; i <= pos; ++i) cout << i <<" "; cout << endl; int cnt; cin >> cnt; return (cnt == x); } int main () { cin >> n; int pre = 1; ans[1] = ++col; for(int i = 2; i <= n; ++i) { cout << i <<" "; for(int j = 1; j <= i; ++j) cout << j <<" "; cout << endl; int cur; cin >> cur; if(pre < cur) { ans[i] = ++col; } else { int l = 1, r = i; while(l < r) { int mid = (l + r) / 2; if(check(mid, cur)) r = mid; else l = mid + 1; } ans[i] = ans[l]; } pre = cur; } cout << 0 <<" "; for(int i = 1; i <= n; ++i) { cout << ans[i] <<" "; } return 0; } /* If you only do what you can do, You will never be more than you are now! ---------------------------------------- We must all suffer from one of two pains: the pain of discipline or the pain of regret. The difference is discipline weighs grams while regret weighs tons. */
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...