oj.uz

답안 #94278

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
94278 2019-01-17T09:36:47 Z autumn_eel Bitaro’s Party (JOI18_bitaro) C++14
7 / 100
 2000 ms 31572 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 40

vector<int>E[200000];
set<P>dp[200000];
unordered_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

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 25336 KB Output is correct
2 Correct 25 ms 25336 KB Output is correct
3 Correct 25 ms 25336 KB Output is correct
4 Correct 24 ms 25336 KB Output is correct
5 Correct 35 ms 27896 KB Output is correct
6 Correct 42 ms 27896 KB Output is correct
7 Correct 38 ms 27896 KB Output is correct
8 Correct 38 ms 29176 KB Output is correct
9 Correct 45 ms 29148 KB Output is correct
10 Correct 44 ms 29176 KB Output is correct
11 Correct 47 ms 29048 KB Output is correct
12 Correct 43 ms 28664 KB Output is correct
13 Correct 48 ms 29052 KB Output is correct
14 Correct 37 ms 27768 KB Output is correct
15 Correct 37 ms 27484 KB Output is correct
16 Correct 39 ms 27900 KB Output is correct
17 Correct 39 ms 28280 KB Output is correct
18 Correct 39 ms 27896 KB Output is correct
19 Correct 39 ms 28280 KB Output is correct

Subtask #2
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 25336 KB Output is correct
2 Correct 25 ms 25336 KB Output is correct
3 Correct 25 ms 25336 KB Output is correct
4 Correct 24 ms 25336 KB Output is correct
5 Correct 35 ms 27896 KB Output is correct
6 Correct 42 ms 27896 KB Output is correct
7 Correct 38 ms 27896 KB Output is correct
8 Correct 38 ms 29176 KB Output is correct
9 Correct 45 ms 29148 KB Output is correct
10 Correct 44 ms 29176 KB Output is correct
11 Correct 47 ms 29048 KB Output is correct
12 Correct 43 ms 28664 KB Output is correct
13 Correct 48 ms 29052 KB Output is correct
14 Correct 37 ms 27768 KB Output is correct
15 Correct 37 ms 27484 KB Output is correct
16 Correct 39 ms 27900 KB Output is correct
17 Correct 39 ms 28280 KB Output is correct
18 Correct 39 ms 27896 KB Output is correct
19 Correct 39 ms 28280 KB Output is correct
20 Correct 1906 ms 31068 KB Output is correct
21 Execution timed out 2057 ms 31572 KB Time limit exceeded
22 Halted 0 ms 0 KB -

Subtask #3
0 / 86.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 25336 KB Output is correct
2 Correct 25 ms 25336 KB Output is correct
3 Correct 25 ms 25336 KB Output is correct
4 Correct 24 ms 25336 KB Output is correct
5 Correct 35 ms 27896 KB Output is correct
6 Correct 42 ms 27896 KB Output is correct
7 Correct 38 ms 27896 KB Output is correct
8 Correct 38 ms 29176 KB Output is correct
9 Correct 45 ms 29148 KB Output is correct
10 Correct 44 ms 29176 KB Output is correct
11 Correct 47 ms 29048 KB Output is correct
12 Correct 43 ms 28664 KB Output is correct
13 Correct 48 ms 29052 KB Output is correct
14 Correct 37 ms 27768 KB Output is correct
15 Correct 37 ms 27484 KB Output is correct
16 Correct 39 ms 27900 KB Output is correct
17 Correct 39 ms 28280 KB Output is correct
18 Correct 39 ms 27896 KB Output is correct
19 Correct 39 ms 28280 KB Output is correct
20 Correct 1906 ms 31068 KB Output is correct
21 Execution timed out 2057 ms 31572 KB Time limit exceeded
22 Halted 0 ms 0 KB -