oj.uz

답안 #621352

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
621352 2022-08-03T17:58:21 Z Cyber_Wolf 사육제 (CEOI14_carnival) C++14
0 / 100
 2 ms 344 KB 
//Problem Name: Carnival
//Problem Link: https://oj.uz/problem/view/CEOI14_carnival
 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("Ofast")
 
using namespace std;
using namespace __gnu_pbds;
 
#define lg long long
#define ordered_set	tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define error(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args);
#define lbound(x, y) lower_bound(x.begin(), x.end(), y) 
#define ubound(x, y) upper_bound(x.begin(), x.end(), y) 
#define sortasc(v) sort(v.begin(), v.end())	
#define sortdesc(v) sort(v.rbegin(), v.rend())	
#define custom_array(a,l, r) int _##a[r-l+1]; int*a=_##a-l;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
 
const lg MOD = 1e9+7, N = 2e5+5, M = 1e7+1, SZ = 1e3+1;
/*
bitset<N> primes;
lg pwrs[N], inv[N];
 
lg fast_power(lg n, lg k)
{
	if(!k)	return 1;
	if(k&1)	return (fast_power(n, k-1)*n)%MOD;
	lg x = fast_power(n, k/2)%MOD;
	return (x*x)%MOD;
}
 
void sieve()
{
	primes.set();
	primes[0] = primes[1] = 0;
	for(lg i = 2; i < N; i++)
	{
		if(!primes[i])	continue;
		for(lg j = i*i; j < N; j += i)
		{
			primes[j] = 0;
		}
	}
	return;
}
 
struct matrix
{
	vector<vector<lg>> con = vector<vector<lg>> (SZ, vector<lg> (SZ));
	matrix operator *(const matrix& a)
	{
		matrix product;
		for(int i = 0; i < (lg)con.size(); i++)
		{
			for(int j = 0; j < (lg)a.con[0].size(); j++)
			{
				for(int k = 0; k < (lg)a.con.size(); k++)
				{
					product.con[i][j] = (product.con[i][j]+(con[i][k]*a.con[k][j])%MOD)%MOD; 
				}
			}
		}
		return product;
	}
};
 
void preprocess(lg x)
{
	inv[2e5] = fast_power(x, MOD-2);
	for(int i = 2e5-1; i > 1; i--)
	{
		inv[i] = (inv[i+1]*i)%MOD;
	}
	pwrs[0] = 1;
	for(int i = 1; i <= 2e5; i++)
	{
		pwrs[i] = (pwrs[i]*i)%MOD;
	}
	return;
}
 
*/
 
lg par[N], compSize[N];
 
lg getParent(lg src)
{
	if(src == par[src])	return src;
	return par[src] = getParent(par[src]);
}
 
void join(lg u, lg v)
{
	u = getParent(u), v = getParent(v);
	if(u == v)	return;
	if(compSize[u] > compSize[v])	swap(u, v);
	compSize[v] += compSize[u];
	par[u] = v;
	return;
}
 
int main()
{
	fastio;
	lg n;
	cin >> n;
	for(int i = 1; i <= n; i++)	par[i] = i, compSize[i] = 1;
	lg mxm = 0;
	for(int i = 1; i <= n; i++)
	{
		if(i == 1)	continue;
		cout << mxm+1 << " ";
		lg x = mxm+1;
		while(x--)	cout << x+1 << ' ';
		cout << endl;
		lg c;
		cin >> c;
		if(c != mxm)	continue;
		bool flag = true;
		if(!flag)	continue;
		for(int j = 1; j <= mxm; j++)
		{
			cout << "2 " << i << ' ' << j << endl;
			lg x;
			cin >> x;
			if(x == 1)	
			{
				join(i, j);
				break;
			}
		}
		mxm = max(mxm, getParent(i));
	}
	cout << "0 ";
	map<lg, lg> mp;
	lg id = 1;
	for(int i = 1; i <= n; i++)	
	{
		getParent(i);
		if(!mp[par[i]])
		{
			mp[par[i]] = id++;
		}
		cout << mp[par[i]] << ' ';
	}
	cout << endl;
 
    return 0;
}

Subtask #1
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 336 KB Integer 12 violates the range [1, 11]
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 344 KB Integer 6 violates the range [1, 5]
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 336 KB Integer 2 violates the range [1, 1]
2 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 336 KB Integer 5 violates the range [1, 4]
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 340 KB Integer 3 violates the range [1, 2]
2 Halted 0 ms 0 KB -