| # | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 931009 | 2024-02-21T04:26:39 Z | Baizho | Carnival (CEOI14_carnival) | C++14 | 3 ms | 456 KB |
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
// #pragma GCC optimize("Ofast,unroll-loops,fast-math")
// #pragma GCC target("popcnt")
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll,ll> pll;
#define sz size()
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
#define pb push_back
const int mod = ll(1e9)+7; //(b + (a%b)) % b (to mod -1%(10^9+7) correctly in c++ its -1 but its suppose to be 10^9+6
const ll MOD = 998244353; // (a%mod)*(binpow(b,mod-2,mod) = (a/b)%mod
const int N = ll(1e6)+100;
const int M = ll(2e5) + 100;
const long long inf = 5e18;
const long double eps = 1e-15L;
ll lcm(ll a, ll b) { return (a / __gcd(a,b))*b; }
ll binpow(ll a, ll b, ll m) { ll res=1; a %= m; while(b>0){ if(b&1)res=(res * a) % m; a=(a * a) % m; b/=2; } return res%m;}
void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
int ask(int i, int j) {
cout<<"2 "<<i<<" "<<j<<endl;
int res; cin>>res;
return res;
}
int ask1(int i) {
cout<<i<<" ";
for(int j = 1; j <= i; j ++) cout<<j<<" ";
cout<<endl;
int res; cin>>res;
return res;
}
void Baizho() {
int n; cin>>n;
cout<<n<<" ";
for(int i = 1; i <= n; i ++) cout<<i<<" ";
cout<<endl;
int dis; cin>>dis;
if(dis <= sqrt(n)) {
int cur = 0;
vector<int> ans(n + 1);
for(int i = 1; i <= n; i ++) {
if(ans[i]) continue;
ans[i] = ++ cur;
for(int j = i + 1; j <= n; j ++) {
if(ans[j]) continue;
int res = ask(i, j);
if(res == 1) ans[j] = cur;
}
}
cout<<"0 ";
for(int i = 1; i <= n; i ++) cout<<ans[i]<<" ";
cout<<endl;
} else {
assert(0);
int curdis = 1;
vector<int> ans(n + 1);
ans[1] = curdis;
for(int i = 2; i <= n; i ++) {
int res = ask1(i);
if(res == curdis) {
// this is a duplicate
for(int j = i - 1; j >= 1; j --) {
int res1 = ask(i, j);
if(res1 == 1) {
ans[i] = ans[j];
break;
}
}
} else {
// distinct new
curdis ++;
ans[i] = curdis;
}
}
cout<<"0 ";
for(int i = 1; i <= n; i ++) cout<<ans[i]<<" ";
cout<<endl;
}
}
signed main() {
// Freopen("nondec");
ios_base::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
// precalc();
int ttt = 1;
// cin>>ttt;
for(int i=1; i<=ttt; i++) {Baizho(); }
}
Compilation message
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 3 ms | 344 KB | Output is correct |
| 2 | Runtime error | 1 ms | 452 KB | Execution killed with signal 6 |
| 3 | Halted | 0 ms | 0 KB | - |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 2 ms | 344 KB | Output is correct |
| 2 | Runtime error | 1 ms | 456 KB | Execution killed with signal 6 |
| 3 | Halted | 0 ms | 0 KB | - |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 1 ms | 344 KB | Output is correct |
| 2 | Correct | 2 ms | 344 KB | Output is correct |
| 3 | Runtime error | 1 ms | 448 KB | Execution killed with signal 6 |
| 4 | Halted | 0 ms | 0 KB | - |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 2 ms | 344 KB | Output is correct |
| 2 | Correct | 2 ms | 344 KB | Output is correct |
| 3 | Runtime error | 1 ms | 448 KB | Execution killed with signal 6 |
| 4 | Halted | 0 ms | 0 KB | - |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 1 ms | 344 KB | Output is correct |
| 2 | Runtime error | 1 ms | 452 KB | Execution killed with signal 6 |
| 3 | Halted | 0 ms | 0 KB | - |