Submission #445026

#TimeUsernameProblemLanguageResultExecution timeMemory
445026KhizriCarnival (CEOI14_carnival)C++17
20 / 100
129 ms200 KiB
#include <bits/stdc++.h> using namespace std; //------------------------------DEFINE------------------------------ //****************************************************************** #define IOS ios_base::sync_with_stdio(false); cin.tie(0),cout.tie(0) #define ll long long #define pb push_back #define F first #define S second #define INF 1e18 #define all(v) (v).begin(),(v).end() #define rall(v) (v).rbegin(),(v).rend() #define pii pair<int,int> #define pll pair<ll,ll> #define OK cout<<"Ok"<<endl; #define MOD (ll)(1e9+7) //****************************************************************** //----------------------------FUNCTION------------------------------ //****************************************************************** ll gcd(ll a,ll b){ if(a>b) swap(a,b); if(a==0) return a+b; return gcd(b%a,a); } ll lcm(ll a,ll b){ return a/gcd(a,b)*b; } bool is_prime(ll n){ ll k=sqrt(n); if(n==2) return true; if(n<2||n%2==0||k*k==n) return false; for(int i=3;i<=k;i+=2){ if(n%i==0){ return false; } } return true; } //***************************************************************** //--------------------------MAIN-CODE------------------------------ const int mxn=2e5+5; int t=1,n,arr[mxn],k; void solve(){ cin>>n; vector<int>vt; for(int i=1;i<=n;i++){ vt.pb(i); } cout<<n<<' '; for(int i=1;i<=n;i++){ cout<<i<<' '; } cout<<endl; cin>>k; if(k==n){ cout<<0<<' '; for(int i=1;i<=n;i++){ cout<<i<<' '; } cout<<endl; return; } int x=0; while(vt.size()){ x++; arr[vt[0]]=x; int ind=vt[0]; vt.erase(vt.begin()); for(int i=0;i<vt.size();i++){ cout<<2<<' '<<ind<<' '<<vt[i]<<endl; cin>>k; if(k==1){ arr[vt[i]]=x; vt.erase(vt.begin()+i); i--; } } } cout<<0<<' '; for(int i=1;i<=n;i++){ cout<<arr[i]<<' '; } cout<<endl; } int main(){ //IOS; //cin>>t; while(t--){ solve(); } return 0; }

Compilation message (stderr)

carnival.cpp: In function 'void solve()':
carnival.cpp:69:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   69 |   for(int i=0;i<vt.size();i++){
      |               ~^~~~~~~~~~
#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...