oj.uz

Submission #931006

# Submission time Handle Problem Language Result Execution time Memory
931006 2024-02-21T04:23:45 Z Baizho Carnival (CEOI14_carnival) C++14
84 / 100
 14 ms 596 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 {
		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 = 1; j < i; 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

carnival.cpp: In function 'void Freopen(std::string)':
carnival.cpp:35:34: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 | void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
      |                           ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
carnival.cpp:35:76: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 | void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
      |                                                                     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 344 KB Output is correct
2 Correct 10 ms 344 KB Output is correct
3 Correct 7 ms 596 KB Output is correct
4 Correct 2 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 6 ms 344 KB Output is correct

Subtask #2
20.0 / 20.0

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

Subtask #3
4.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 3 ms 344 KB Output is correct
3 Partially correct 14 ms 344 KB Partially correct
4 Correct 2 ms 344 KB Output is correct
5 Correct 2 ms 344 KB Output is correct
6 Correct 2 ms 344 KB Output is correct
7 Correct 12 ms 344 KB Output is correct

Subtask #4
20.0 / 20.0

# 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 Correct 5 ms 344 KB Output is correct
4 Correct 2 ms 344 KB Output is correct
5 Correct 2 ms 344 KB Output is correct
6 Correct 2 ms 344 KB Output is correct
7 Correct 12 ms 344 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 8 ms 344 KB Output is correct
3 Correct 9 ms 344 KB Output is correct
4 Correct 9 ms 344 KB Output is correct
5 Correct 2 ms 344 KB Output is correct
6 Correct 2 ms 344 KB Output is correct
7 Correct 3 ms 340 KB Output is correct