oj.uz

답안 #107362

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
107362 2019-04-23T12:41:22 Z alishahali1382 Bitaro’s Party (JOI18_bitaro) C++14
14 / 100
 1917 ms 411128 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;
#define SZ(x) ((int) x.size())

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];
unordered_map<int, int> mp;
bool mark[MAXN];

void merg(int a, int b){
	vector<pii> tmp;
	int sz=min(SZ(good[a])+SZ(good[b])-1, SQ);
	for (int i=0, j=0, t=0; i+j<SZ(good[a])+SZ(good[b]);){
		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++;
		if (mark[tmp.back().second]) tmp.pop_back();
		else t++;
		if (t>=sz) break ;
	}
	good[a].clear();
	for (pii p:tmp)/* if (!mark[p.second])*/{
		good[a].pb(p);
		//mark[p.second]=1;
		//if (good[a].size()>SQ) break ;
	}
	for (pii p:good[a]) mark[p.second]=0;
}

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";
}

int badquery(){
	while (y--) cin>>x;
	cout<<"-1\n";
}

void query(){
	cin>>v>>y;
	if (y>=SQ-10) bigquery();
	else if (y > (int)good[v].size()+5) badquery();
	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);
	}
	
	while (q--) query();
	
	return 0;
}
/*
5 6 3
1 2
2 4
3 4
1 3
3 5
4 5
4 1 1
5 2 2 3
2 3 1 4 5
*/

Compilation message

bitaro.cpp: In function 'int badquery()':
bitaro.cpp:79:1: warning: no return statement in function returning non-void [-Wreturn-type]
 }
 ^
bitaro.cpp: In function 'int smallquery()':
bitaro.cpp:74:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 4992 KB Output is correct
2 Correct 6 ms 5120 KB Output is correct
3 Correct 7 ms 5120 KB Output is correct
4 Correct 5 ms 4992 KB Output is correct
5 Correct 19 ms 7936 KB Output is correct
6 Correct 16 ms 7680 KB Output is correct
7 Correct 17 ms 7680 KB Output is correct
8 Correct 25 ms 9500 KB Output is correct
9 Correct 25 ms 9472 KB Output is correct
10 Correct 33 ms 9464 KB Output is correct
11 Correct 23 ms 9216 KB Output is correct
12 Correct 27 ms 8312 KB Output is correct
13 Correct 22 ms 9344 KB Output is correct
14 Correct 23 ms 7552 KB Output is correct
15 Correct 16 ms 6528 KB Output is correct
16 Correct 21 ms 7424 KB Output is correct
17 Correct 22 ms 8448 KB Output is correct
18 Correct 18 ms 7288 KB Output is correct
19 Correct 25 ms 8448 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 4992 KB Output is correct
2 Correct 6 ms 5120 KB Output is correct
3 Correct 7 ms 5120 KB Output is correct
4 Correct 5 ms 4992 KB Output is correct
5 Correct 19 ms 7936 KB Output is correct
6 Correct 16 ms 7680 KB Output is correct
7 Correct 17 ms 7680 KB Output is correct
8 Correct 25 ms 9500 KB Output is correct
9 Correct 25 ms 9472 KB Output is correct
10 Correct 33 ms 9464 KB Output is correct
11 Correct 23 ms 9216 KB Output is correct
12 Correct 27 ms 8312 KB Output is correct
13 Correct 22 ms 9344 KB Output is correct
14 Correct 23 ms 7552 KB Output is correct
15 Correct 16 ms 6528 KB Output is correct
16 Correct 21 ms 7424 KB Output is correct
17 Correct 22 ms 8448 KB Output is correct
18 Correct 18 ms 7288 KB Output is correct
19 Correct 25 ms 8448 KB Output is correct
20 Correct 767 ms 10704 KB Output is correct
21 Correct 858 ms 10788 KB Output is correct
22 Correct 917 ms 10876 KB Output is correct
23 Correct 806 ms 10620 KB Output is correct
24 Correct 1719 ms 322932 KB Output is correct
25 Correct 1743 ms 322224 KB Output is correct
26 Correct 1772 ms 322464 KB Output is correct
27 Correct 1878 ms 411128 KB Output is correct
28 Correct 1758 ms 411012 KB Output is correct
29 Correct 1643 ms 411088 KB Output is correct
30 Correct 1869 ms 411056 KB Output is correct
31 Correct 1689 ms 401312 KB Output is correct
32 Correct 1713 ms 410940 KB Output is correct
33 Correct 1341 ms 252864 KB Output is correct
34 Correct 1218 ms 206812 KB Output is correct
35 Correct 1284 ms 250984 KB Output is correct
36 Correct 1663 ms 334712 KB Output is correct
37 Correct 1562 ms 307244 KB Output is correct
38 Correct 1685 ms 335152 KB Output is correct

Subtask #3
0 / 86.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 4992 KB Output is correct
2 Correct 6 ms 5120 KB Output is correct
3 Correct 7 ms 5120 KB Output is correct
4 Correct 5 ms 4992 KB Output is correct
5 Correct 19 ms 7936 KB Output is correct
6 Correct 16 ms 7680 KB Output is correct
7 Correct 17 ms 7680 KB Output is correct
8 Correct 25 ms 9500 KB Output is correct
9 Correct 25 ms 9472 KB Output is correct
10 Correct 33 ms 9464 KB Output is correct
11 Correct 23 ms 9216 KB Output is correct
12 Correct 27 ms 8312 KB Output is correct
13 Correct 22 ms 9344 KB Output is correct
14 Correct 23 ms 7552 KB Output is correct
15 Correct 16 ms 6528 KB Output is correct
16 Correct 21 ms 7424 KB Output is correct
17 Correct 22 ms 8448 KB Output is correct
18 Correct 18 ms 7288 KB Output is correct
19 Correct 25 ms 8448 KB Output is correct
20 Correct 767 ms 10704 KB Output is correct
21 Correct 858 ms 10788 KB Output is correct
22 Correct 917 ms 10876 KB Output is correct
23 Correct 806 ms 10620 KB Output is correct
24 Correct 1719 ms 322932 KB Output is correct
25 Correct 1743 ms 322224 KB Output is correct
26 Correct 1772 ms 322464 KB Output is correct
27 Correct 1878 ms 411128 KB Output is correct
28 Correct 1758 ms 411012 KB Output is correct
29 Correct 1643 ms 411088 KB Output is correct
30 Correct 1869 ms 411056 KB Output is correct
31 Correct 1689 ms 401312 KB Output is correct
32 Correct 1713 ms 410940 KB Output is correct
33 Correct 1341 ms 252864 KB Output is correct
34 Correct 1218 ms 206812 KB Output is correct
35 Correct 1284 ms 250984 KB Output is correct
36 Correct 1663 ms 334712 KB Output is correct
37 Correct 1562 ms 307244 KB Output is correct
38 Correct 1685 ms 335152 KB Output is correct
39 Correct 1917 ms 316748 KB Output is correct
40 Incorrect 1703 ms 322760 KB Output isn't correct
41 Halted 0 ms 0 KB -