oj.uz

Submission #95932

# Submission time Handle Problem Language Result Execution time Memory
95932 2019-02-04T12:41:43 Z alishahali1382 Bitaro’s Party (JOI18_bitaro) C++14
14 / 100
 1458 ms 411092 KB 
#include <bits/stdc++.h>
#if defined(__GNUC__)
#pragma GCC optimize ("Ofast")
#endif
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<ll, ll> pll;
#define debug(x) cerr<<#x<<'='<<x<<endl;
#define debugp(x) cerr<<#x<<"= {"<<x.first<<", "<<x.second<<"}"<<endl;
#define all(x) x.begin(), x.end()
#define pb push_back
#define kill(x) return cout<<x<<'\n', 0;

const ld eps=1e-7;
const int inf=1000000010;
const ll INF=10000000000000010LL;
const int mod = 1000000007;
const int MAXN = 100010, SQ=320;

int n, m, q, u, v, x, y, t, a, b, ans;
vector<pii> good[MAXN];
int dp[MAXN];
vector<int> G[MAXN];

void merg(int a, int b){
	vector<pii> tmp;
	for (int i=0, j=0; i+j<SQ && i+j<good[a].size()+good[b].size()-1;){
		pii pp={good[b][j].first+1, good[b][j].second};
		if (good[a][i]>pp) tmp.pb(good[a][i++]);
		else tmp.pb(pp), j++;
	}
	good[a].clear();
	for (pii p:tmp) good[a].pb(p);
}

void bigquery(){
	while (y--){
		cin>>x;
		dp[x]=-inf;
	}
	for (int i=1; i<=v; i++) for (int j:G[i]) dp[i]=max(dp[i], dp[j]+1);
	if (dp[v]<0) dp[v]=-1;
	cout<<dp[v]<<'\n';
	memset(dp, 0, sizeof(dp));
}

int smallquery(){
	set<int> st;
	while (y--){
		cin>>x;
		st.insert(x);
	}
	for (pii p:good[v]){
		if (st.count(p.second)) continue ;
		if (p.first<0) kill(-1);
		kill(p.first);
	}
	cout<<"-1\n";
}

void query(){
	cin>>v>>y;
	if (y>=SQ-10) bigquery();
	else smallquery();
}

int main(){
	ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	//freopen("input.txt", "r", stdin);
	//freopen("output.txt", "w", stdout);
	cin>>n>>m>>q;
	while (m--){
		cin>>u>>v;
		G[v].pb(u);
	}
	for (int i=1; i<=n; i++){
		good[i].pb({0, i});
		good[i].pb({-inf, 0});
		for (int j:G[i]) merg(i, j);
	}
	//for (int i=1; i<=n; i++) good[i].pop_back();
	while (q--) query();
	
	return 0;
}

Compilation message

bitaro.cpp: In function 'void merg(int, int)':
bitaro.cpp:30:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i=0, j=0; i+j<SQ && i+j<good[a].size()+good[b].size()-1;){
                               ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bitaro.cpp: In function 'int smallquery()':
bitaro.cpp:62:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4984 KB Output is correct
2 Correct 5 ms 4984 KB Output is correct
3 Correct 6 ms 5084 KB Output is correct
4 Correct 5 ms 4984 KB Output is correct
5 Correct 16 ms 7928 KB Output is correct
6 Correct 15 ms 7672 KB Output is correct
7 Correct 15 ms 7672 KB Output is correct
8 Correct 19 ms 9464 KB Output is correct
9 Correct 19 ms 9392 KB Output is correct
10 Correct 19 ms 9464 KB Output is correct
11 Correct 19 ms 9336 KB Output is correct
12 Correct 16 ms 8260 KB Output is correct
13 Correct 19 ms 9336 KB Output is correct
14 Correct 15 ms 7544 KB Output is correct
15 Correct 11 ms 6520 KB Output is correct
16 Correct 15 ms 7416 KB Output is correct
17 Correct 17 ms 8432 KB Output is correct
18 Correct 13 ms 7160 KB Output is correct
19 Correct 17 ms 8440 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4984 KB Output is correct
2 Correct 5 ms 4984 KB Output is correct
3 Correct 6 ms 5084 KB Output is correct
4 Correct 5 ms 4984 KB Output is correct
5 Correct 16 ms 7928 KB Output is correct
6 Correct 15 ms 7672 KB Output is correct
7 Correct 15 ms 7672 KB Output is correct
8 Correct 19 ms 9464 KB Output is correct
9 Correct 19 ms 9392 KB Output is correct
10 Correct 19 ms 9464 KB Output is correct
11 Correct 19 ms 9336 KB Output is correct
12 Correct 16 ms 8260 KB Output is correct
13 Correct 19 ms 9336 KB Output is correct
14 Correct 15 ms 7544 KB Output is correct
15 Correct 11 ms 6520 KB Output is correct
16 Correct 15 ms 7416 KB Output is correct
17 Correct 17 ms 8432 KB Output is correct
18 Correct 13 ms 7160 KB Output is correct
19 Correct 17 ms 8440 KB Output is correct
20 Correct 604 ms 10648 KB Output is correct
21 Correct 586 ms 10872 KB Output is correct
22 Correct 591 ms 10744 KB Output is correct
23 Correct 593 ms 10556 KB Output is correct
24 Correct 1454 ms 323064 KB Output is correct
25 Correct 1393 ms 322076 KB Output is correct
26 Correct 1410 ms 322444 KB Output is correct
27 Correct 1333 ms 411092 KB Output is correct
28 Correct 1320 ms 410892 KB Output is correct
29 Correct 1362 ms 411072 KB Output is correct
30 Correct 1318 ms 410744 KB Output is correct
31 Correct 1337 ms 401168 KB Output is correct
32 Correct 1373 ms 410872 KB Output is correct
33 Correct 1072 ms 252792 KB Output is correct
34 Correct 1000 ms 206584 KB Output is correct
35 Correct 1079 ms 251084 KB Output is correct
36 Correct 1311 ms 334328 KB Output is correct
37 Correct 1234 ms 307064 KB Output is correct
38 Correct 1251 ms 334948 KB Output is correct

Subtask #3
0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4984 KB Output is correct
2 Correct 5 ms 4984 KB Output is correct
3 Correct 6 ms 5084 KB Output is correct
4 Correct 5 ms 4984 KB Output is correct
5 Correct 16 ms 7928 KB Output is correct
6 Correct 15 ms 7672 KB Output is correct
7 Correct 15 ms 7672 KB Output is correct
8 Correct 19 ms 9464 KB Output is correct
9 Correct 19 ms 9392 KB Output is correct
10 Correct 19 ms 9464 KB Output is correct
11 Correct 19 ms 9336 KB Output is correct
12 Correct 16 ms 8260 KB Output is correct
13 Correct 19 ms 9336 KB Output is correct
14 Correct 15 ms 7544 KB Output is correct
15 Correct 11 ms 6520 KB Output is correct
16 Correct 15 ms 7416 KB Output is correct
17 Correct 17 ms 8432 KB Output is correct
18 Correct 13 ms 7160 KB Output is correct
19 Correct 17 ms 8440 KB Output is correct
20 Correct 604 ms 10648 KB Output is correct
21 Correct 586 ms 10872 KB Output is correct
22 Correct 591 ms 10744 KB Output is correct
23 Correct 593 ms 10556 KB Output is correct
24 Correct 1454 ms 323064 KB Output is correct
25 Correct 1393 ms 322076 KB Output is correct
26 Correct 1410 ms 322444 KB Output is correct
27 Correct 1333 ms 411092 KB Output is correct
28 Correct 1320 ms 410892 KB Output is correct
29 Correct 1362 ms 411072 KB Output is correct
30 Correct 1318 ms 410744 KB Output is correct
31 Correct 1337 ms 401168 KB Output is correct
32 Correct 1373 ms 410872 KB Output is correct
33 Correct 1072 ms 252792 KB Output is correct
34 Correct 1000 ms 206584 KB Output is correct
35 Correct 1079 ms 251084 KB Output is correct
36 Correct 1311 ms 334328 KB Output is correct
37 Correct 1234 ms 307064 KB Output is correct
38 Correct 1251 ms 334948 KB Output is correct
39 Correct 1458 ms 316540 KB Output is correct
40 Correct 1391 ms 319992 KB Output is correct
41 Correct 1410 ms 319756 KB Output is correct
42 Correct 1424 ms 320548 KB Output is correct
43 Correct 1436 ms 319352 KB Output is correct
44 Incorrect 633 ms 10616 KB Output isn't correct
45 Halted 0 ms 0 KB -