oj.uz

Submission #107379

# Submission time Handle Problem Language Result Execution time Memory
107379 2019-04-23T14:19:58 Z alishahali1382 Bitaro’s Party (JOI18_bitaro) C++14
7 / 100
 2000 ms 410772 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];
int dist[MAXN];

bool cmp(int i, int j){ return dist[i]>dist[j];}

void merg(vector<pii> &a, vector<pii> &b){
	vector<int> tmp, v1, v2;
	for (pii p:a){
		v1.pb(p.second);
		dist[p.second]=p.first;
	}
	for (pii p:b){
		if (dist[p.second]==-1) v2.pb(p.second);
		dist[p.second]=max(p.first+1, dist[p.second]);
	}
	for (int i=0, j=0; i<v1.size(); i++){
		while (j<SZ(v2) && dist[v1[i]]<dist[v2[j]]) tmp.pb(v2[j++]);
		tmp.pb(v1[i]);
	}
	//sort(all(tmp), cmp);
	int sz=min(SZ(tmp), SQ);
	a.clear();
	for (int i=0; i<sz; i++) a.pb({dist[tmp[i]], tmp[i]});
	for (int i:tmp) dist[i]=-1;
}

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(){
	vector<int> vec;
	while (y--){
		cin>>x;
		vec.pb(x);
		mark[x]=1;
	}
	for (pii p:good[v]){
		if (mark[p.second]) continue ;
		if (p.first<0) kill(-1);
		for (int i:vec) mark[i]=0;
		kill(p.first);
	}
	for (int i:vec) mark[i]=0;
	cout<<"-1\n";
}

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

void query(){
	cin>>v>>y;
	if (y>=SQ-1) bigquery();
	else if (y > (int)good[v].size()+1) 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);
	memset(dist, -1, sizeof(dist));
	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(good[i], good[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 'void merg(std::vector<std::pair<int, int> >&, std::vector<std::pair<int, int> >&)':
bitaro.cpp:44:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i=0, j=0; i<v1.size(); i++){
                     ~^~~~~~~~~~
bitaro.cpp: In function 'int badquery()':
bitaro.cpp:86:1: warning: no return statement in function returning non-void [-Wreturn-type]
 }
 ^
bitaro.cpp: In function 'int smallquery()':
bitaro.cpp:81: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 5504 KB Output is correct
2 Correct 7 ms 5504 KB Output is correct
3 Correct 6 ms 5504 KB Output is correct
4 Correct 6 ms 5376 KB Output is correct
5 Correct 12 ms 6272 KB Output is correct
6 Correct 13 ms 6272 KB Output is correct
7 Correct 11 ms 6272 KB Output is correct
8 Correct 25 ms 9216 KB Output is correct
9 Correct 25 ms 9216 KB Output is correct
10 Correct 25 ms 9216 KB Output is correct
11 Correct 24 ms 8824 KB Output is correct
12 Correct 21 ms 7168 KB Output is correct
13 Correct 20 ms 8576 KB Output is correct
14 Correct 21 ms 7928 KB Output is correct
15 Correct 20 ms 6784 KB Output is correct
16 Correct 24 ms 7800 KB Output is correct
17 Correct 22 ms 8064 KB Output is correct
18 Correct 16 ms 7040 KB Output is correct
19 Correct 31 ms 7992 KB Output is correct

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5504 KB Output is correct
2 Correct 7 ms 5504 KB Output is correct
3 Correct 6 ms 5504 KB Output is correct
4 Correct 6 ms 5376 KB Output is correct
5 Correct 12 ms 6272 KB Output is correct
6 Correct 13 ms 6272 KB Output is correct
7 Correct 11 ms 6272 KB Output is correct
8 Correct 25 ms 9216 KB Output is correct
9 Correct 25 ms 9216 KB Output is correct
10 Correct 25 ms 9216 KB Output is correct
11 Correct 24 ms 8824 KB Output is correct
12 Correct 21 ms 7168 KB Output is correct
13 Correct 20 ms 8576 KB Output is correct
14 Correct 21 ms 7928 KB Output is correct
15 Correct 20 ms 6784 KB Output is correct
16 Correct 24 ms 7800 KB Output is correct
17 Correct 22 ms 8064 KB Output is correct
18 Correct 16 ms 7040 KB Output is correct
19 Correct 31 ms 7992 KB Output is correct
20 Correct 1446 ms 10348 KB Output is correct
21 Correct 1436 ms 10408 KB Output is correct
22 Correct 1389 ms 10316 KB Output is correct
23 Correct 1224 ms 10344 KB Output is correct
24 Correct 1660 ms 178892 KB Output is correct
25 Correct 1864 ms 192264 KB Output is correct
26 Correct 1885 ms 197676 KB Output is correct
27 Execution timed out 2065 ms 410772 KB Time limit exceeded
28 Halted 0 ms 0 KB -

Subtask #3
0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5504 KB Output is correct
2 Correct 7 ms 5504 KB Output is correct
3 Correct 6 ms 5504 KB Output is correct
4 Correct 6 ms 5376 KB Output is correct
5 Correct 12 ms 6272 KB Output is correct
6 Correct 13 ms 6272 KB Output is correct
7 Correct 11 ms 6272 KB Output is correct
8 Correct 25 ms 9216 KB Output is correct
9 Correct 25 ms 9216 KB Output is correct
10 Correct 25 ms 9216 KB Output is correct
11 Correct 24 ms 8824 KB Output is correct
12 Correct 21 ms 7168 KB Output is correct
13 Correct 20 ms 8576 KB Output is correct
14 Correct 21 ms 7928 KB Output is correct
15 Correct 20 ms 6784 KB Output is correct
16 Correct 24 ms 7800 KB Output is correct
17 Correct 22 ms 8064 KB Output is correct
18 Correct 16 ms 7040 KB Output is correct
19 Correct 31 ms 7992 KB Output is correct
20 Correct 1446 ms 10348 KB Output is correct
21 Correct 1436 ms 10408 KB Output is correct
22 Correct 1389 ms 10316 KB Output is correct
23 Correct 1224 ms 10344 KB Output is correct
24 Correct 1660 ms 178892 KB Output is correct
25 Correct 1864 ms 192264 KB Output is correct
26 Correct 1885 ms 197676 KB Output is correct
27 Execution timed out 2065 ms 410772 KB Time limit exceeded
28 Halted 0 ms 0 KB -