oj.uz

Submission #263052

# Submission time Handle Problem Language Result Execution time Memory
263052 2020-08-13T12:37:28 Z dorijanlendvaj Mergers (JOI19_mergers) C++14
10 / 100
 3000 ms 1792 KB 
//DUEL
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define x first
#define y second
#define pii pair<int,int>
#define pb push_back
#define eb emplace_back
#pragma GCC optimize("unroll-loops")
#define shandom_ruffle(a, b) shuffle(a, b, rng)
#define vi vector<int>
#define vl vector<ll>
#define popcnt __builtin_popcount
#define popcntll __builtin_popcountll
#define all(a) begin(a),end(a)

using namespace std;
using namespace __gnu_pbds;

using ll=long long;
using ull=unsigned long long;
using ld=long double;
int MOD=1000000007;
int MOD2=998244353;
vector<int> bases;
const ll LLINF=1ll<<60;
const char en='\n';

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
void yes() {cout<<"YES"<<en; exit(0);}
void no() {cout<<"NO"<<en; exit(0);}
inline int rund() {int x576363482791fuweh=rng();return abs(x576363482791fuweh)%RAND_MAX;}
template<class T>
void prVec(vector<T> w,bool fl=false)
{
	cout<<w.size()<<en;
	for (int i=0;i<int(w.size())-1;++i) cout<<w[i]<<' ';
	if (w.size()) cout<<w[w.size()-1]<<en;
	if (fl) cout<<flush;
}

void M998()
{
	swap(MOD,MOD2);
}

ll raand()
{
	ll a=rund();
	a*=RAND_MAX;
	a+=rund();
    return a;
}

#define rand raand

ll raaand()
{
	return raand()*(MOD-7)+raand();
}

void compress(vi&v)
{
	set<int> s;
	for (auto a: v) s.insert(a);
	vi o(all(s));
	for (auto&a: v) a=lower_bound(all(o),a)-o.begin();
}

void compress(vl&v)
{
	set<ll> s;
	for (auto a: v) s.insert(a);
	vl o(all(s));
	for (auto&a: v) a=lower_bound(all(o),a)-o.begin();
}

string to_upper(string a)
{
	for (int i=0;i<(int)a.size();++i) if (a[i]>='a' && a[i]<='z') a[i]-='a'-'A';
	return a;
}

string to_lower(string a)
{
	for (int i=0;i<(int)a.size();++i) if (a[i]>='A' && a[i]<='Z') a[i]+='a'-'A';
	return a;
}

ll sti(string a,int base=10)
{
	ll k=0;
	for (int i=0;i<(int)a.size();++i)
	{
		k*=base;
		k+=a[i]-'0';
	}
	return k;
}

template<class T>
void eras(vector<T>& a,T b)
{
	a.erase(find(a.begin(),a.end(),b));
}

string its(ll k,int base=10)
{
	if (k==0) return "0";
	string a;
	while (k)
	{
		a.push_back((k%base)+'0');
		k/=base;
	}
	reverse(a.begin(),a.end());
	return a;
}

ll min(ll a,int b)
{
	if (a<b) return a;
	return b;
}

ll min(int a,ll b)
{
	if (a<b) return a;
	return b;
}

ll max(ll a,int b)
{
	if (a>b) return a;
	return b;
}

ll max(int a,ll b)
{
	if (a>b) return a;
	return b;
}

ll gcd(ll a,ll b)
{
	if (b==0) return a;
	return gcd(b,a%b);
}

ll lcm(ll a,ll b)
{
	return a/gcd(a,b)*b;
}

template<class T,class K>
pair<T,K> mp(T a,K b)
{
	return make_pair(a,b);
}

inline int mult(ll a,ll b)
{
	return (a*b)%MOD;
}

inline int pot(int n,int k)
{
	if (k==0) return 1;
	ll a=pot(n,k/2);
	a=mult(a,a);
	if (k%2) return mult(a,n);
	else return a;
}

int divide(int a,int b)
{
	return mult(a,pot(b,MOD-2));
}

inline int sub(int a,int b)
{
	if (a-b>=0) return a-b;
	return a-b+MOD;
}

inline int add(int a,int b)
{
	if (a+b>=MOD) return a+b-MOD;
	return a+b;
}

bool prime(ll a)
{
	if (a==1) return 0;
	for (int i=2;i<=round(sqrt(a));++i)
	{
		if (a%i==0) return 0;
	}
	return 1;
}

const int N=300010;
int k,n,st[N],par[N],x[N],y[N],re[N],mi=MOD,bb;

void rek(int a,int b,int cn)
{
	//cout<<a<<' '<<b<<endl;
	if (a==k)
	{
		bool ok=1;
		/*for (int i=0;i<k;++i) cout<<re[i]<<' ';
		cout<<en;*/
		++bb;
		for (int m=1;m<(1<<k)-1;++m)
		{
			int s=0;
			for (int i=1;i<n;++i)
			{
				if (((m>>re[st[x[i]]])&1)!=((m>>re[st[y[i]]])&1)) ++s;
			}
			if (s==1) ok=0;
		}
		if (ok) mi=min(mi,cn);
		return;
	}
	if (b==k)
	{
		rek(a+1,a+2,cn);
		return;
	}
	rek(a,b+1,cn);
	if (re[a]!=re[b])
	{
		vi v(re,re+k);
		int x=re[b];
		for (int i=0;i<k;++i) if (re[i]==x) re[i]=re[a];
		rek(a,b+1,cn+1);
		for (int i=0;i<k;++i) re[i]=v[i];
	}
}

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	for (int i=0;i<10;++i) bases.push_back(rand()%(MOD-13893829*2)+13893829);
	cin>>n>>k;
	for (int i=1;i<n;++i) cin>>x[i]>>y[i],--x[i],--y[i];
	for (int i=0;i<n;++i) cin>>st[i],--st[i];
	for (int i=0;i<k;++i) re[i]=i;
	rek(0,0,0);
	//cout<<bb<<en;
	cout<<mi<<en;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 78 ms 504 KB Output is correct
2 Correct 38 ms 536 KB Output is correct
3 Correct 36 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 919 ms 412 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 39 ms 384 KB Output is correct
12 Correct 832 ms 416 KB Output is correct
13 Correct 94 ms 416 KB Output is correct
14 Correct 778 ms 504 KB Output is correct
15 Correct 36 ms 384 KB Output is correct
16 Correct 70 ms 412 KB Output is correct
17 Correct 78 ms 412 KB Output is correct
18 Correct 936 ms 504 KB Output is correct
19 Correct 68 ms 384 KB Output is correct
20 Correct 84 ms 416 KB Output is correct
21 Correct 1004 ms 504 KB Output is correct
22 Correct 942 ms 420 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 165 ms 504 KB Output is correct

Subtask #2
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 78 ms 504 KB Output is correct
2 Correct 38 ms 536 KB Output is correct
3 Correct 36 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 919 ms 412 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 39 ms 384 KB Output is correct
12 Correct 832 ms 416 KB Output is correct
13 Correct 94 ms 416 KB Output is correct
14 Correct 778 ms 504 KB Output is correct
15 Correct 36 ms 384 KB Output is correct
16 Correct 70 ms 412 KB Output is correct
17 Correct 78 ms 412 KB Output is correct
18 Correct 936 ms 504 KB Output is correct
19 Correct 68 ms 384 KB Output is correct
20 Correct 84 ms 416 KB Output is correct
21 Correct 1004 ms 504 KB Output is correct
22 Correct 942 ms 420 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 165 ms 504 KB Output is correct
25 Execution timed out 3063 ms 384 KB Time limit exceeded
26 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 78 ms 504 KB Output is correct
2 Correct 38 ms 536 KB Output is correct
3 Correct 36 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 919 ms 412 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 39 ms 384 KB Output is correct
12 Correct 832 ms 416 KB Output is correct
13 Correct 94 ms 416 KB Output is correct
14 Correct 778 ms 504 KB Output is correct
15 Correct 36 ms 384 KB Output is correct
16 Correct 70 ms 412 KB Output is correct
17 Correct 78 ms 412 KB Output is correct
18 Correct 936 ms 504 KB Output is correct
19 Correct 68 ms 384 KB Output is correct
20 Correct 84 ms 416 KB Output is correct
21 Correct 1004 ms 504 KB Output is correct
22 Correct 942 ms 420 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 165 ms 504 KB Output is correct
25 Execution timed out 3072 ms 384 KB Time limit exceeded
26 Halted 0 ms 0 KB -

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3076 ms 1792 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 78 ms 504 KB Output is correct
2 Correct 38 ms 536 KB Output is correct
3 Correct 36 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 919 ms 412 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 39 ms 384 KB Output is correct
12 Correct 832 ms 416 KB Output is correct
13 Correct 94 ms 416 KB Output is correct
14 Correct 778 ms 504 KB Output is correct
15 Correct 36 ms 384 KB Output is correct
16 Correct 70 ms 412 KB Output is correct
17 Correct 78 ms 412 KB Output is correct
18 Correct 936 ms 504 KB Output is correct
19 Correct 68 ms 384 KB Output is correct
20 Correct 84 ms 416 KB Output is correct
21 Correct 1004 ms 504 KB Output is correct
22 Correct 942 ms 420 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 165 ms 504 KB Output is correct
25 Execution timed out 3063 ms 384 KB Time limit exceeded
26 Halted 0 ms 0 KB -