Submission #1257644

#	Time	Username	Problem	Language	Result	Execution time	Memory
1257644		hihihihaw	사육제 (CEOI14_carnival)	C++20	0 / 100	8 ms	536 KiB

carnival

#pragma GCC optimize("O3,unroll-loops")    
#include <bits/stdc++.h>
using namespace std;
 
#define int long long
#define pb push_back
#define pii pair<int,int>
#define sz(v) (int)v.size()
#define fi first
#define se second
#define INF 1223372036854775807
#define INF2 122337203
#define MOD 998244353ll
#define cint(x) int x;cin>>x;
#define cinarr(a,n) int a[n];for (int i=0;i<n;i++) cin>>a[i];
#define coutarr(a) for (auto d:a)cout<<d<<" "; cout<<endl;
#define coutarrD(a) for (auto d:a) cout<<d.fi<<","<<d.se<<" "; cout<<endl;
#define BERKAY_TUP ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define endl '\n'
#define ld long double
#define mid (start+end)/2
#define vvi vector<vector<int>>
int t=1;
int interactive=1;
int usaco=0;
int testCase=0;
int ans[153];
int c=1;
int n;
int ask(vector<int> h){
    cout<<sz(h)<<" ";
    for (int d:h) cout<<d<<" ";
    int x;
    cin>>x;
    return x;
}
bool inn(int z,vector<int> k){
    vector<int> j=k;
    j.pb(z);
    if (ask(j)!=ask(k)){
        return false;
    }
    return true;
}
int fin(int z,vector<int> k){
    if (sz(k)==1) return k[0];
    vector<int> j;
    for (int i=0;i<sz(k)/2;i++) j.pb(k[i]);
    vector<int> j2=j;
    j2.pb(z);
    if (ask(j2)==ask(j)){
        return fin(z,j);
    }
    else{
        vector<int> j3;
        for (int i=sz(k)/2;i<sz(k);i++) j3.pb(k[i]);
        return fin(z,j3);
    }

}

void solv(int z,vector<int> k){
    ans[z]=c;
    c++;
    if (sz(k)==0) return;
    while (inn(z,k)){
        int g=fin(z,k);
        ans[g]=ans[z];
        k.erase(find(k.begin(),k.end(),g));
    }
    if (sz(k)==0) return;
    z=k[0];
    k.erase(k.begin());
    solv(z,k);




}
void solve(){
    cin>>n;
    vector<int> k;
    for (int i=2;i<=n;i++) k.pb(i);
    solv(1,k);
    for (int i=1;i<=n;i++) cout<<ans[i]<<" ";


    


   




    
   

    
}

 
 
 
 
 
 

 
int32_t main(){
    
    //BERKAY_TUP;
    if (usaco){
        freopen("team.in", "r", stdin);
        freopen("team.out", "w", stdout);
    }
    if (!interactive){
    #ifdef Local
        freopen("in.txt", "r", stdin);
        freopen("out.txt", "w", stdout);
        //freopen("wormsort.out", "w", stdout);
    #endif
    }
    if (t==1) solve();
    else{
        cin>>t;
        while (t--){testCase++;solve();}
    }
    
        
    return 0;
}

Compilation message (stderr)

carnival.cpp: In function 'int32_t main()':
carnival.cpp:114:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  114 |         freopen("team.in", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
carnival.cpp:115:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  115 |         freopen("team.out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 20
• Subtask 2: 0 / 20
• Subtask 3: 0 / 20
• Subtask 4: 0 / 20
• Subtask 5: 0 / 20