Submission #534665

#TimeUsernameProblemLanguageResultExecution timeMemory
534665YaserFaisalCarnival (CEOI14_carnival)C++17
0 / 100
1 ms200 KiB
#include <bits/stdc++.h> using namespace std ; #define int long long #define X first #define Y second #define F first #define S second //#define endl "\n" #define pii pair < int , int > int pre[155] , ans[155] , v[155] ; void BS( int l , int r , int cur ) { int mid = 0 ; while(l<=r) { cout << " " << l << " " << r << " " << cur << endl ; mid = l + (r-l)/2 ; cout << (mid-l+2) << " " << cur << " " ; for ( int i = l ; i <= mid ; i++ ) cout << v[i] << " " ; cout << endl ; int x ; cin >> x ; if ( x == (mid-l+2) ) l = mid+1 ; else r = mid-1 ; } ans[cur] = ans[v[mid]] ; } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int n ; cin >> n ; int c = 0 ; for ( int i = 1 ; i <= n ; i++ ) { cout << i << " " ; for ( int j = 1 ; j <= i ; j++ ) cout << j << " " ; cout << endl ; cin >> pre[i] ; if ( pre[i] != pre[i-1] ) { c++ ; ans[i] = c ; v[c] = i ; } else BS( 1 , c , i ) ; } cout << 0 << " " ; for ( int i = 1 ; i <= n ; i++ ) cout << ans[i] << " " ; cout << endl ; }
#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...