제출 #164963

#제출 시각아이디문제언어결과실행 시간메모리
164963kostia244사육제 (CEOI14_carnival)C++17
100 / 100
13 ms424 KiB
//#pragma GCC optimize("Ofast") //#pragma GCC target("avx2,tune=native") //#pragma GCC optimize("unroll-loops") #pragma GCC optimize("trapv") #include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> using namespace __gnu_pbds; #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() #define pb push_back using namespace std; using ll = long long; using ld = long double; using vi = vector<ll>; using vvi = vector<vi>; using pi = pair<ll, ll>; const ll mod = 7 * 17 * (1 << 23) + 1; const ll inf = 1e18; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); int uniq[200], col[200], c = 1; bool party(int l, int r) { vi p; for(; l <= r; l++) { if(uniq[l]) p.pb(l); } cout << p.size() << " "; for(auto i : p) cout << i << " "; cout << endl; int t; cin >> t; return t==p.size(); } int main() { //DINIC ORZ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; for(int i = n; i; i--) { uniq[i] = 1; int pos = i; for(int x = 1<<7; x; x>>=1) if(pos+x<=n&&party(i, pos+x))pos+=x; if(pos!=n) uniq[i] = 0, col[i]=col[pos+1]; else col[i] = c++; } cout << "0 "; for(int i = 1; i <= n; i++) cout << col[i] << " "; cout << endl; }

컴파일 시 표준 에러 (stderr) 메시지

carnival.cpp: In function 'bool party(int, int)':
carnival.cpp:32:10: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  return t==p.size();
         ~^~~~~~~~~~
#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...