oj.uz

Submission #944001

# Submission time Handle Problem Language Result Execution time Memory
944001 2024-03-12T06:28:15 Z RadicaI Bitaro’s Party (JOI18_bitaro) C++17
7 / 100
 2000 ms 18768 KB 
#include <bits/stdc++.h>
#define int long long
#define pi pair<int,int>
#define pb push_back
#define V vector
#define vi V<int>
#define mi map<int,int>
#define MOD 1000000007
#define MOD2 998244353
#define mp make_pair
#define ins insert
#define qi queue<int>
#define pqi priority_queue<int>
#define si set<int>
#define v2i V<vi>
#define v3i V<v2i>
#define v4i V<v3i>
#define v5i V<v4i>
#define INF 1e18
#define all(x) begin(x), end(x)
#define sz(x) (int) (x).size()
#define fastio ios_base::sync_with_stdio(false); cin.tie(nullptr);
#define endl "\n"
#define lb lower_bound
#define ub upper_bound
#define print(x) cout << x<<" ";
#define vpi V<pi>
#define Y cout<<"YES"<<endl;
#define NO cout<<"NO"<<endl;
#define msi multiset<int>
#define F first
#define S second
#define ld long double
#define RE return;
#define IMP cout<<-1<<endl;return;
using namespace std;

template <typename T>
std::istream& operator>>(std::istream& in, std::vector<T>& vec) {
    for (T& x : vec) {
        in >> x;
    }
    return in;
}

const int block = 350;

 
signed main(){
	fastio;
	int n,m,q; cin>>n>>m>>q;
	v2i adj(n); 
	for(int i=0; i<m; i++){
		int s,e; cin>>s>>e; s--;e--;
		adj[e].pb(s);
	}
	V<set<pi>> mx(n); 
	for(int i=0; i<n; i++){
		mx[i].ins({0,i});
		map<int,si> jhxt;
		for(auto &x: adj[i]){
			for(auto &y: mx[x]){
				jhxt[y.S].ins(y.F+1);
			}
		}
		for(auto &x: jhxt){
			mx[i].ins({*x.S.rbegin(), x.F}); 
			if(sz(mx[i])>block) mx[i].erase(mx[i].begin());
		}
	}
	while(q--){
		int t,y; cin >> t>>y; 
		t--; 
		si notal; for(int i=0; i<y; i++){int x; cin >> x; notal.ins(x-1);}
		if(y>=block){
			vi dp(n,-1);
			for(int i=0; i<n; i++){
				if(!notal.count(i))dp[i]=max(dp[i],0ll);
				for(auto &x: adj[i]){
					if(dp[x]!=-1)dp[i] = max(dp[x]+1, dp[i]);
				}
			}
			cout << dp[t]<<endl;
		}else{
			int ans = -1;
			for(auto &x: mx[t])if(!notal.count(x.S)) ans = x.F;
			cout<<ans<<endl;
		}
	}
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 456 KB Output is correct
5 Correct 11 ms 2908 KB Output is correct
6 Correct 11 ms 2908 KB Output is correct
7 Correct 10 ms 2652 KB Output is correct
8 Correct 68 ms 18768 KB Output is correct
9 Correct 68 ms 18668 KB Output is correct
10 Correct 69 ms 18632 KB Output is correct
11 Correct 76 ms 16464 KB Output is correct
12 Correct 42 ms 7648 KB Output is correct
13 Correct 77 ms 15700 KB Output is correct
14 Correct 59 ms 11252 KB Output is correct
15 Correct 32 ms 5716 KB Output is correct
16 Correct 53 ms 10804 KB Output is correct
17 Correct 56 ms 12368 KB Output is correct
18 Correct 32 ms 7004 KB Output is correct
19 Correct 58 ms 12576 KB Output is correct

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 456 KB Output is correct
5 Correct 11 ms 2908 KB Output is correct
6 Correct 11 ms 2908 KB Output is correct
7 Correct 10 ms 2652 KB Output is correct
8 Correct 68 ms 18768 KB Output is correct
9 Correct 68 ms 18668 KB Output is correct
10 Correct 69 ms 18632 KB Output is correct
11 Correct 76 ms 16464 KB Output is correct
12 Correct 42 ms 7648 KB Output is correct
13 Correct 77 ms 15700 KB Output is correct
14 Correct 59 ms 11252 KB Output is correct
15 Correct 32 ms 5716 KB Output is correct
16 Correct 53 ms 10804 KB Output is correct
17 Correct 56 ms 12368 KB Output is correct
18 Correct 32 ms 7004 KB Output is correct
19 Correct 58 ms 12576 KB Output is correct
20 Execution timed out 2076 ms 14268 KB Time limit exceeded
21 Halted 0 ms 0 KB -

Subtask #3
0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 456 KB Output is correct
5 Correct 11 ms 2908 KB Output is correct
6 Correct 11 ms 2908 KB Output is correct
7 Correct 10 ms 2652 KB Output is correct
8 Correct 68 ms 18768 KB Output is correct
9 Correct 68 ms 18668 KB Output is correct
10 Correct 69 ms 18632 KB Output is correct
11 Correct 76 ms 16464 KB Output is correct
12 Correct 42 ms 7648 KB Output is correct
13 Correct 77 ms 15700 KB Output is correct
14 Correct 59 ms 11252 KB Output is correct
15 Correct 32 ms 5716 KB Output is correct
16 Correct 53 ms 10804 KB Output is correct
17 Correct 56 ms 12368 KB Output is correct
18 Correct 32 ms 7004 KB Output is correct
19 Correct 58 ms 12576 KB Output is correct
20 Execution timed out 2076 ms 14268 KB Time limit exceeded
21 Halted 0 ms 0 KB -