oj.uz

Submission #220899

# Submission time Handle Problem Language Result Execution time Memory
220899 2020-04-09T08:09:29 Z dorijanlendvaj Bitaro’s Party (JOI18_bitaro) C++14
100 / 100
 1125 ms 94192 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();
}

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=100010,M=1<<17,C=100;
int n,m,q,dp[N];
vi ord,ch[N];
ll re[N][C+10];
int id[N],sz[N];
bool bio[N];
vi sta;

void mer(int i,int j)
{
	int cn=0,a=0,b=0;
	while (a+b!=sz[i]+sz[j] && cn<C)
	{
		if (a==sz[i])
		{
			if (!bio[re[j][b]%M]) re[N-1][cn++]=re[j][b]+M,bio[re[j][b]%M]=1;
			++b;
			continue;
		}
		if (b==sz[j])
		{
			if (!bio[re[i][a]%M]) re[N-1][cn++]=re[i][a],bio[re[i][a]%M]=1;
			++a;
			continue;
		}
		if (re[i][a]>re[j][b]+M)
		{
			if (!bio[re[i][a]%M]) re[N-1][cn++]=re[i][a],bio[re[i][a]%M]=1;
			++a;
			continue;
		}
		if (!bio[re[j][b]%M]) re[N-1][cn++]=re[j][b]+M,bio[re[j][b]%M]=1;
		++b;
	}
	sz[i]=cn;
	for (int u=0;u<cn;++u) re[i][u]=re[N-1][u],bio[re[N-1][u]%M]=0;
}

void dfs(int i)
{
	if (id[i]) return;
	--id[i];
	ord.pb(i);
	for (auto a: ch[i])
	{
		--id[a];
		dfs(a);
	}
}

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>>m>>q;
	for (int i=0;i<m;++i)
	{
		int a,b;
		cin>>b>>a;
		ch[a].pb(b);
		++id[b];
	}
	for (int i=1;i<=n;++i) dfs(i),sz[i]=1,re[i][0]=i;
	reverse(all(ord));
	for (auto a: ord) for (auto b: ch[a]) mer(a,b);
	/*for (int i=1;i<=n;++i)
	{
		cout<<sz[i]<<en;
		for (int j=0;j<sz[i];++j) cout<<re[i][j]%M<<' '<<re[i][j]/M<<en;
		cout<<en;
	}*/
	while (q--)
	{
		int cn,i;
		vi v;
		cin>>i>>cn;
		while (cn--)
		{
			int x;
			cin>>x;
			v.pb(x);
			bio[x]=1;
		}
		bool don=0;
		for (int u=0;u<sz[i];++u) if (!bio[re[i][u]%M])
		{
			cout<<re[i][u]/M<<en;
			for (auto a: v) bio[a]=0;
			don=1;
			break;
		}
		if (don) continue;
		if (sz[i]<C)
		{
			cout<<-1<<en;
			for (auto a: v) bio[a]=0;
			continue;
		}
		memset(dp,0,sizeof(dp));
		for (auto a: v) dp[a]=-MOD;
		for (auto a: ord) for (auto b: ch[a]) dp[a]=max(dp[a],dp[b]+1);
		for (auto a: v) bio[a]=0;
		if (dp[i]>=0) cout<<dp[i]<<en;
		else cout<<-1<<en;
	}
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 2688 KB Output is correct
2 Correct 7 ms 2688 KB Output is correct
3 Correct 6 ms 2688 KB Output is correct
4 Correct 6 ms 2688 KB Output is correct
5 Correct 8 ms 3712 KB Output is correct
6 Correct 8 ms 3584 KB Output is correct
7 Correct 8 ms 3712 KB Output is correct
8 Correct 8 ms 3584 KB Output is correct
9 Correct 9 ms 3584 KB Output is correct
10 Correct 9 ms 3968 KB Output is correct
11 Correct 9 ms 3584 KB Output is correct
12 Correct 8 ms 3584 KB Output is correct
13 Correct 9 ms 3584 KB Output is correct
14 Correct 8 ms 3712 KB Output is correct
15 Correct 8 ms 3584 KB Output is correct
16 Correct 8 ms 3584 KB Output is correct
17 Correct 9 ms 3712 KB Output is correct
18 Correct 8 ms 3584 KB Output is correct
19 Correct 9 ms 3968 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 2688 KB Output is correct
2 Correct 7 ms 2688 KB Output is correct
3 Correct 6 ms 2688 KB Output is correct
4 Correct 6 ms 2688 KB Output is correct
5 Correct 8 ms 3712 KB Output is correct
6 Correct 8 ms 3584 KB Output is correct
7 Correct 8 ms 3712 KB Output is correct
8 Correct 8 ms 3584 KB Output is correct
9 Correct 9 ms 3584 KB Output is correct
10 Correct 9 ms 3968 KB Output is correct
11 Correct 9 ms 3584 KB Output is correct
12 Correct 8 ms 3584 KB Output is correct
13 Correct 9 ms 3584 KB Output is correct
14 Correct 8 ms 3712 KB Output is correct
15 Correct 8 ms 3584 KB Output is correct
16 Correct 8 ms 3584 KB Output is correct
17 Correct 9 ms 3712 KB Output is correct
18 Correct 8 ms 3584 KB Output is correct
19 Correct 9 ms 3968 KB Output is correct
20 Correct 236 ms 4856 KB Output is correct
21 Correct 237 ms 4856 KB Output is correct
22 Correct 244 ms 5216 KB Output is correct
23 Correct 247 ms 4728 KB Output is correct
24 Correct 373 ms 93428 KB Output is correct
25 Correct 376 ms 93300 KB Output is correct
26 Correct 377 ms 93428 KB Output is correct
27 Correct 330 ms 93808 KB Output is correct
28 Correct 339 ms 93932 KB Output is correct
29 Correct 334 ms 94192 KB Output is correct
30 Correct 350 ms 93808 KB Output is correct
31 Correct 356 ms 93812 KB Output is correct
32 Correct 352 ms 94064 KB Output is correct
33 Correct 300 ms 93556 KB Output is correct
34 Correct 294 ms 93296 KB Output is correct
35 Correct 299 ms 93296 KB Output is correct
36 Correct 321 ms 93428 KB Output is correct
37 Correct 334 ms 93424 KB Output is correct
38 Correct 322 ms 93784 KB Output is correct

Subtask #3
86.0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 2688 KB Output is correct
2 Correct 7 ms 2688 KB Output is correct
3 Correct 6 ms 2688 KB Output is correct
4 Correct 6 ms 2688 KB Output is correct
5 Correct 8 ms 3712 KB Output is correct
6 Correct 8 ms 3584 KB Output is correct
7 Correct 8 ms 3712 KB Output is correct
8 Correct 8 ms 3584 KB Output is correct
9 Correct 9 ms 3584 KB Output is correct
10 Correct 9 ms 3968 KB Output is correct
11 Correct 9 ms 3584 KB Output is correct
12 Correct 8 ms 3584 KB Output is correct
13 Correct 9 ms 3584 KB Output is correct
14 Correct 8 ms 3712 KB Output is correct
15 Correct 8 ms 3584 KB Output is correct
16 Correct 8 ms 3584 KB Output is correct
17 Correct 9 ms 3712 KB Output is correct
18 Correct 8 ms 3584 KB Output is correct
19 Correct 9 ms 3968 KB Output is correct
20 Correct 236 ms 4856 KB Output is correct
21 Correct 237 ms 4856 KB Output is correct
22 Correct 244 ms 5216 KB Output is correct
23 Correct 247 ms 4728 KB Output is correct
24 Correct 373 ms 93428 KB Output is correct
25 Correct 376 ms 93300 KB Output is correct
26 Correct 377 ms 93428 KB Output is correct
27 Correct 330 ms 93808 KB Output is correct
28 Correct 339 ms 93932 KB Output is correct
29 Correct 334 ms 94192 KB Output is correct
30 Correct 350 ms 93808 KB Output is correct
31 Correct 356 ms 93812 KB Output is correct
32 Correct 352 ms 94064 KB Output is correct
33 Correct 300 ms 93556 KB Output is correct
34 Correct 294 ms 93296 KB Output is correct
35 Correct 299 ms 93296 KB Output is correct
36 Correct 321 ms 93428 KB Output is correct
37 Correct 334 ms 93424 KB Output is correct
38 Correct 322 ms 93784 KB Output is correct
39 Correct 442 ms 93428 KB Output is correct
40 Correct 392 ms 93044 KB Output is correct
41 Correct 375 ms 93044 KB Output is correct
42 Correct 381 ms 93044 KB Output is correct
43 Correct 375 ms 93044 KB Output is correct
44 Correct 273 ms 5240 KB Output is correct
45 Correct 252 ms 4856 KB Output is correct
46 Correct 250 ms 4988 KB Output is correct
47 Correct 242 ms 4856 KB Output is correct
48 Correct 237 ms 4856 KB Output is correct
49 Correct 381 ms 94120 KB Output is correct
50 Correct 1119 ms 93936 KB Output is correct
51 Correct 272 ms 5240 KB Output is correct
52 Correct 379 ms 5240 KB Output is correct
53 Correct 363 ms 93428 KB Output is correct
54 Correct 395 ms 93300 KB Output is correct
55 Correct 370 ms 93424 KB Output is correct
56 Correct 335 ms 93048 KB Output is correct
57 Correct 276 ms 5240 KB Output is correct
58 Correct 279 ms 5368 KB Output is correct
59 Correct 378 ms 5240 KB Output is correct
60 Correct 379 ms 5240 KB Output is correct
61 Correct 488 ms 93804 KB Output is correct
62 Correct 480 ms 93784 KB Output is correct
63 Correct 556 ms 93428 KB Output is correct
64 Correct 785 ms 93836 KB Output is correct
65 Correct 794 ms 93440 KB Output is correct
66 Correct 348 ms 93172 KB Output is correct
67 Correct 1125 ms 93808 KB Output is correct
68 Correct 1104 ms 93556 KB Output is correct
69 Correct 336 ms 93172 KB Output is correct
70 Correct 350 ms 93804 KB Output is correct
71 Correct 356 ms 93556 KB Output is correct
72 Correct 348 ms 93352 KB Output is correct
73 Correct 390 ms 93932 KB Output is correct
74 Correct 378 ms 93428 KB Output is correct
75 Correct 399 ms 93556 KB Output is correct
76 Correct 379 ms 94064 KB Output is correct
77 Correct 341 ms 93556 KB Output is correct
78 Correct 337 ms 93560 KB Output is correct
79 Correct 285 ms 5368 KB Output is correct
80 Correct 242 ms 4856 KB Output is correct
81 Correct 237 ms 4856 KB Output is correct
82 Correct 407 ms 94184 KB Output is correct
83 Correct 409 ms 93808 KB Output is correct
84 Correct 364 ms 93620 KB Output is correct
85 Correct 368 ms 93428 KB Output is correct
86 Correct 369 ms 93652 KB Output is correct
87 Correct 368 ms 93552 KB Output is correct
88 Correct 279 ms 5240 KB Output is correct
89 Correct 278 ms 5240 KB Output is correct
90 Correct 252 ms 4984 KB Output is correct
91 Correct 248 ms 4728 KB Output is correct
92 Correct 240 ms 4728 KB Output is correct
93 Correct 245 ms 4856 KB Output is correct
94 Correct 349 ms 93428 KB Output is correct
95 Correct 360 ms 93296 KB Output is correct
96 Correct 364 ms 93144 KB Output is correct
97 Correct 305 ms 92916 KB Output is correct
98 Correct 300 ms 93048 KB Output is correct
99 Correct 301 ms 93040 KB Output is correct
100 Correct 285 ms 5240 KB Output is correct
101 Correct 282 ms 5112 KB Output is correct
102 Correct 254 ms 4728 KB Output is correct
103 Correct 252 ms 4728 KB Output is correct
104 Correct 250 ms 4728 KB Output is correct
105 Correct 252 ms 4728 KB Output is correct
106 Correct 367 ms 93556 KB Output is correct
107 Correct 378 ms 93316 KB Output is correct
108 Correct 327 ms 93048 KB Output is correct
109 Correct 349 ms 93172 KB Output is correct
110 Correct 334 ms 93172 KB Output is correct
111 Correct 344 ms 93168 KB Output is correct
112 Correct 278 ms 5240 KB Output is correct
113 Correct 279 ms 5240 KB Output is correct
114 Correct 280 ms 4860 KB Output is correct
115 Correct 247 ms 4856 KB Output is correct
116 Correct 238 ms 4984 KB Output is correct
117 Correct 245 ms 5112 KB Output is correct
118 Correct 346 ms 93556 KB Output is correct
119 Correct 338 ms 93196 KB Output is correct
120 Correct 342 ms 93048 KB Output is correct
121 Correct 345 ms 93556 KB Output is correct
122 Correct 339 ms 93048 KB Output is correct
123 Correct 344 ms 93172 KB Output is correct
124 Correct 338 ms 93556 KB Output is correct
125 Correct 328 ms 93044 KB Output is correct
126 Correct 333 ms 93088 KB Output is correct