oj.uz

Submission #553164

# Submission time Handle Problem Language Result Execution time Memory
553164 2022-04-25T00:03:16 Z farhan132 Carnival (CEOI14_carnival) C++17
100 / 100
 16 ms 344 KB 
/***Farhan132***/
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
//#pragma GCC optimization ("unroll-loops")
//#pragma GCC optimize("Ofast,fast-math")
 
#include <bits/stdc++.h>
 
 
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
typedef double dd;
typedef vector<ll> vll;
typedef pair<ll , ll> ii;
typedef vector< ii > vii;
typedef pair < pair < ll , ll > , pair < ll , ll > > cm; 
typedef tuple < ll,  ll, ll > tp;
 
#define ff first
#define ss second
#define pb push_back
#define in insert
#define f0(b) for(int i=0;i<(b);i++)
#define f00(b) for(int j=0;j<(b);j++)
#define f1(b) for(int i=1;i<=(b);i++)
#define f11(b) for(int j=1;j<=(b);j++)
#define f2(a,b) for(int i=(a);i<=(b);i++)
#define f22(a,b) for(int j=(a);j<=(b);j++)
#define sf(a) scanf("%lld",&a)
#define sff(a,b) scanf("%lld %lld", &a , &b)
#define pf(a) printf("%lld\n",a)
#define pff(a,b) printf("%lld %lld\n", a , b)
#define bug printf("**!\n")
#define mem(a , b) memset(a, b ,sizeof(a))
#define front_zero(n) __builtin_clzll(n)
#define back_zero(n) __builtin_ctzll(n)
#define total_one(n) __builtin_popcount(n)
#define clean fflush(stdout)
 
//const ll mod =  (ll) 998244353;
const ll mod =  (ll) 1e9 + 7;
const ll maxn = (ll)1e8 + 5;
const int nnn = 1048590;
const int inf = numeric_limits<int>::max()-1;
//const ll INF = numeric_limits<ll>::max()-1;
const ll INF = (ll)1e18;
 
ll dx[]={0,1,0,-1};
ll dy[]={1,0,-1,0};
ll dxx[]={0,1,0,-1,1,1,-1,-1};
ll dyy[]={1,0,-1,0,1,-1,1,-1};
 
bool USACO = 0;
 
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
 
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
 
template <typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

const ll N = 1e5 + 5;

ll ask(vector < ll > v){
    cout << v.size() << ' ';
    for(auto u : v) cout << u << ' ';
    cout << '\n';
    clean;
    ll x; cin >> x;
    return x;
}
ll par[N], sz[N];

void solve(){

  ll n;
  cin >> n;

  par[1] = 1;
  sz[1] = 1;
  vector < ll > v; v.pb(1);

  for(ll i = 2; i <= n; i++){
    ll lo = 0, hg = v.size() - 1, ans = -1;
    while(lo <= hg){
        ll mid = (lo + hg)/2;
        vector < ll > t;
        for(ll j = 0; j <= mid; j++) t.pb(v[j]);
        t.pb(i);
        ll x = ask(t);
        if(x == mid + 1){
            ans = mid;
            hg = mid - 1;
        }else{
            lo = mid + 1;
        }
    }
    if(ans == -1){
        par[i] = i;
        v.pb(i);
        sz[i] = v.size();
    }else{
        par[i] = v[ans];
    }
  }
  cout << "0 ";
  for(ll i = 1; i <= n; i++){
    cout << sz[par[i]] << ' ';
  }
  cout << '\n';

  
  return;
}
 
int main() {
    
    
    #ifdef LOCAL
        freopen("in", "r", stdin);
        freopen("out", "w", stdout);
        auto start_time = clock();
    #else 
       //ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
    #endif
 
    //pre(N);
 
    ll T = 1, CT = 0;  //cin >> T; 
 
    while(T--){

        solve();
    }
    #ifdef LOCAL
        auto end_time = clock();
        cerr<< "Execution time: "<<(end_time - start_time)*(int)1e3/CLOCKS_PER_SEC<<" ms\n";
    #endif
 
    return 0;
}

Compilation message

carnival.cpp: In function 'int main()':
carnival.cpp:133:15: warning: unused variable 'CT' [-Wunused-variable]
  133 |     ll T = 1, CT = 0;  //cin >> T;
      |               ^~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 316 KB Output is correct
2 Correct 7 ms 208 KB Output is correct
3 Correct 10 ms 320 KB Output is correct
4 Correct 11 ms 328 KB Output is correct
5 Correct 2 ms 208 KB Output is correct
6 Correct 1 ms 312 KB Output is correct
7 Correct 5 ms 208 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 208 KB Output is correct
2 Correct 7 ms 208 KB Output is correct
3 Correct 7 ms 328 KB Output is correct
4 Correct 11 ms 332 KB Output is correct
5 Correct 3 ms 208 KB Output is correct
6 Correct 4 ms 208 KB Output is correct
7 Correct 5 ms 320 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 4 ms 316 KB Output is correct
3 Correct 8 ms 320 KB Output is correct
4 Correct 16 ms 336 KB Output is correct
5 Correct 6 ms 208 KB Output is correct
6 Correct 6 ms 320 KB Output is correct
7 Correct 8 ms 316 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 208 KB Output is correct
2 Correct 4 ms 208 KB Output is correct
3 Correct 8 ms 336 KB Output is correct
4 Correct 14 ms 324 KB Output is correct
5 Correct 6 ms 208 KB Output is correct
6 Correct 10 ms 208 KB Output is correct
7 Correct 7 ms 208 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 208 KB Output is correct
2 Correct 7 ms 308 KB Output is correct
3 Correct 10 ms 328 KB Output is correct
4 Correct 14 ms 316 KB Output is correct
5 Correct 9 ms 320 KB Output is correct
6 Correct 9 ms 328 KB Output is correct
7 Correct 16 ms 344 KB Output is correct