oj.uz

Submission #94277

# Submission time Handle Problem Language Result Execution time Memory
94277 2019-01-17T09:34:50 Z autumn_eel Bitaro’s Party (JOI18_bitaro) C++14
7 / 100
 2000 ms 277496 KB 
#include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
#define INF 0x3f3f3f3f
using namespace std;
typedef pair<int,int>P;

#define B 30

vector<int>E[200000];
set<P>dp[200000];
map<int,int>mp[200000];

int dp2[200000];

int main(){
	int n,m,q;cin>>n>>m>>q;
	rep(i,m){
		int s,t;scanf("%d%d",&s,&t);s--;t--;
		E[s].push_back(t);
	}
	rep(i,n)dp[i].insert(P(0,i));
	int cnt=0;
	rep(i,n){
		for(auto&p:dp[i]){
			for(int u:E[i]){
				cnt++;
				int&d=mp[u][p.second];
				if(d<=p.first){
					dp[u].erase(P(d,p.second));
					d=p.first+1;
					dp[u].insert(P(d,p.second));
				}
				while(dp[u].size()>B)dp[u].erase(dp[u].begin());
			}
		}
	}
	rep(i,q){
		int t,y;scanf("%d%d",&t,&y);t--;
		set<int>v;
		rep(j,y){
			int c;scanf("%d",&c);c--;
			v.insert(c);
		}
		if(y<B){
			int Max=-1;
			for(auto p:dp[t]){
				if(!v.count(p.second)){
					Max=max(Max,p.first);
				}
			}
			printf("%d\n",Max);
		}
		else{
			rep(i,n){
				if(!v.count(i))dp2[i]=0;
				else dp2[i]=-INF;
			}
			rep(i,n){
				for(int u:E[i]){
					dp2[u]=max(dp2[u],dp2[i]+1);
				}
			}
			printf("%d\n",dp2[t]<0?-1:dp2[t]);
		}
	}
}

Compilation message

bitaro.cpp: In function 'int main()':
bitaro.cpp:18:16: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   int s,t;scanf("%d%d",&s,&t);s--;t--;
           ~~~~~^~~~~~~~~~~~~~
bitaro.cpp:38:16: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   int t,y;scanf("%d%d",&t,&y);t--;
           ~~~~~^~~~~~~~~~~~~~
bitaro.cpp:41:15: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    int c;scanf("%d",&c);c--;
          ~~~~~^~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 23800 KB Output is correct
2 Correct 19 ms 23800 KB Output is correct
3 Correct 18 ms 23800 KB Output is correct
4 Correct 23 ms 23800 KB Output is correct
5 Correct 37 ms 25976 KB Output is correct
6 Correct 30 ms 25976 KB Output is correct
7 Correct 31 ms 25956 KB Output is correct
8 Correct 32 ms 26616 KB Output is correct
9 Correct 33 ms 26616 KB Output is correct
10 Correct 32 ms 26616 KB Output is correct
11 Correct 36 ms 26616 KB Output is correct
12 Correct 33 ms 26452 KB Output is correct
13 Correct 33 ms 26616 KB Output is correct
14 Correct 28 ms 25720 KB Output is correct
15 Correct 28 ms 25720 KB Output is correct
16 Correct 30 ms 25848 KB Output is correct
17 Correct 30 ms 26076 KB Output is correct
18 Correct 29 ms 25848 KB Output is correct
19 Correct 29 ms 26104 KB Output is correct

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 23800 KB Output is correct
2 Correct 19 ms 23800 KB Output is correct
3 Correct 18 ms 23800 KB Output is correct
4 Correct 23 ms 23800 KB Output is correct
5 Correct 37 ms 25976 KB Output is correct
6 Correct 30 ms 25976 KB Output is correct
7 Correct 31 ms 25956 KB Output is correct
8 Correct 32 ms 26616 KB Output is correct
9 Correct 33 ms 26616 KB Output is correct
10 Correct 32 ms 26616 KB Output is correct
11 Correct 36 ms 26616 KB Output is correct
12 Correct 33 ms 26452 KB Output is correct
13 Correct 33 ms 26616 KB Output is correct
14 Correct 28 ms 25720 KB Output is correct
15 Correct 28 ms 25720 KB Output is correct
16 Correct 30 ms 25848 KB Output is correct
17 Correct 30 ms 26076 KB Output is correct
18 Correct 29 ms 25848 KB Output is correct
19 Correct 29 ms 26104 KB Output is correct
20 Correct 1376 ms 27744 KB Output is correct
21 Correct 1765 ms 28380 KB Output is correct
22 Correct 1525 ms 28280 KB Output is correct
23 Correct 1581 ms 28352 KB Output is correct
24 Execution timed out 2076 ms 277496 KB Time limit exceeded
25 Halted 0 ms 0 KB -

Subtask #3
0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 23800 KB Output is correct
2 Correct 19 ms 23800 KB Output is correct
3 Correct 18 ms 23800 KB Output is correct
4 Correct 23 ms 23800 KB Output is correct
5 Correct 37 ms 25976 KB Output is correct
6 Correct 30 ms 25976 KB Output is correct
7 Correct 31 ms 25956 KB Output is correct
8 Correct 32 ms 26616 KB Output is correct
9 Correct 33 ms 26616 KB Output is correct
10 Correct 32 ms 26616 KB Output is correct
11 Correct 36 ms 26616 KB Output is correct
12 Correct 33 ms 26452 KB Output is correct
13 Correct 33 ms 26616 KB Output is correct
14 Correct 28 ms 25720 KB Output is correct
15 Correct 28 ms 25720 KB Output is correct
16 Correct 30 ms 25848 KB Output is correct
17 Correct 30 ms 26076 KB Output is correct
18 Correct 29 ms 25848 KB Output is correct
19 Correct 29 ms 26104 KB Output is correct
20 Correct 1376 ms 27744 KB Output is correct
21 Correct 1765 ms 28380 KB Output is correct
22 Correct 1525 ms 28280 KB Output is correct
23 Correct 1581 ms 28352 KB Output is correct
24 Execution timed out 2076 ms 277496 KB Time limit exceeded
25 Halted 0 ms 0 KB -