oj.uz

Submission #100990

# Submission time Handle Problem Language Result Execution time Memory
100990 2019-03-16T00:54:48 Z TAISA_ Bitaro’s Party (JOI18_bitaro) C++14
14 / 100
 139 ms 9248 KB 
#include<bits/stdc++.h>
#define all(vec) vec.begin(),vec.end()
using namespace std;
using ll=long long;
using P=pair<int,int>;
const ll MOD=1000000007LL;
const ll INF=(1<<30);
const ll LINF=(1LL<<60);
template<typename T> void chmax(T &a,T b){a=max(a,b);}
template<typename T> void chmin(T &a,T b){a=min(a,b);} 
int main(){
	int n,m,qu;cin>>n>>m>>qu;if(qu>1)return 0;
	vector<vector<int>> G(n);
	for(int i=0;i<m;i++){
		int a,b;scanf("%d%d",&a,&b);--a;--b;
		G[b].push_back(a);
	}
	int t,y;cin>>t>>y;--t;
	vector<int> x(n);
	for(int i=0;i<y;i++){
		int c;scanf("%d",&c);--c;x[c]=1;
	}
	vector<int> d(n,-INF);
	d[t]=0;
	for(int i=t;i>=0;i--){
		for(auto e:G[i]){
			chmax(d[e],d[i]+1);
		}
	}
	int ma=-1;
	for(int i=0;i<n;i++){
		if(x[i])continue;
		chmax(ma,d[i]);
	}
	cout<<ma<<endl;
}

Compilation message

bitaro.cpp: In function 'int main()':
bitaro.cpp:15:16: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   int a,b;scanf("%d%d",&a,&b);--a;--b;
           ~~~~~^~~~~~~~~~~~~~
bitaro.cpp:21:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   int c;scanf("%d",&c);--c;x[c]=1;
         ~~~~~^~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 4 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 3 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 4 ms 384 KB Output is correct
16 Correct 3 ms 384 KB Output is correct
17 Correct 4 ms 384 KB Output is correct
18 Correct 3 ms 384 KB Output is correct
19 Correct 3 ms 384 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 4 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 3 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 4 ms 384 KB Output is correct
16 Correct 3 ms 384 KB Output is correct
17 Correct 4 ms 384 KB Output is correct
18 Correct 3 ms 384 KB Output is correct
19 Correct 3 ms 384 KB Output is correct
20 Correct 42 ms 1656 KB Output is correct
21 Correct 44 ms 1656 KB Output is correct
22 Correct 44 ms 1576 KB Output is correct
23 Correct 57 ms 1528 KB Output is correct
24 Correct 122 ms 6296 KB Output is correct
25 Correct 119 ms 6264 KB Output is correct
26 Correct 120 ms 6332 KB Output is correct
27 Correct 104 ms 6724 KB Output is correct
28 Correct 139 ms 9212 KB Output is correct
29 Correct 108 ms 9208 KB Output is correct
30 Correct 106 ms 9248 KB Output is correct
31 Correct 94 ms 9208 KB Output is correct
32 Correct 109 ms 9180 KB Output is correct
33 Correct 108 ms 8780 KB Output is correct
34 Correct 104 ms 8724 KB Output is correct
35 Correct 116 ms 8696 KB Output is correct
36 Correct 101 ms 8796 KB Output is correct
37 Correct 107 ms 8764 KB Output is correct
38 Correct 112 ms 8804 KB Output is correct

Subtask #3
0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 4 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 3 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 4 ms 384 KB Output is correct
16 Correct 3 ms 384 KB Output is correct
17 Correct 4 ms 384 KB Output is correct
18 Correct 3 ms 384 KB Output is correct
19 Correct 3 ms 384 KB Output is correct
20 Correct 42 ms 1656 KB Output is correct
21 Correct 44 ms 1656 KB Output is correct
22 Correct 44 ms 1576 KB Output is correct
23 Correct 57 ms 1528 KB Output is correct
24 Correct 122 ms 6296 KB Output is correct
25 Correct 119 ms 6264 KB Output is correct
26 Correct 120 ms 6332 KB Output is correct
27 Correct 104 ms 6724 KB Output is correct
28 Correct 139 ms 9212 KB Output is correct
29 Correct 108 ms 9208 KB Output is correct
30 Correct 106 ms 9248 KB Output is correct
31 Correct 94 ms 9208 KB Output is correct
32 Correct 109 ms 9180 KB Output is correct
33 Correct 108 ms 8780 KB Output is correct
34 Correct 104 ms 8724 KB Output is correct
35 Correct 116 ms 8696 KB Output is correct
36 Correct 101 ms 8796 KB Output is correct
37 Correct 107 ms 8764 KB Output is correct
38 Correct 112 ms 8804 KB Output is correct
39 Incorrect 3 ms 384 KB Output isn't correct
40 Halted 0 ms 0 KB -