oj.uz

Submission #944014

# Submission time Handle Problem Language Result Execution time Memory
944014 2024-03-12T06:33:35 Z RadicaI Bitaro’s Party (JOI18_bitaro) C++17
7 / 100
 2000 ms 14156 KB 
#include <bits/stdc++.h>
#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());
		}
	}
	vi store(n, q+1);
	while(q--){
		int t,y; cin >> t>>y; 
		t--; 
		for(int i=0; i<y; i++){int x; cin >> x; store[x-1]=q;}
		if(y>=block){
			vi dp(t+1,-1);
			for(int i=0; i<=t; i++){
				if(store[i]!=q)dp[i]=max(dp[i],0);
				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(store[x.S]!=q) ans = x.F;
			cout<<ans<<endl;
		}
	}
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 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 348 KB Output is correct
5 Correct 10 ms 2212 KB Output is correct
6 Correct 11 ms 2352 KB Output is correct
7 Correct 10 ms 2176 KB Output is correct
8 Correct 68 ms 14060 KB Output is correct
9 Correct 64 ms 14156 KB Output is correct
10 Correct 66 ms 14036 KB Output is correct
11 Correct 83 ms 12240 KB Output is correct
12 Correct 33 ms 5724 KB Output is correct
13 Correct 71 ms 11732 KB Output is correct
14 Correct 55 ms 8640 KB Output is correct
15 Correct 31 ms 4432 KB Output is correct
16 Correct 54 ms 8184 KB Output is correct
17 Correct 55 ms 9256 KB Output is correct
18 Correct 33 ms 5204 KB Output is correct
19 Correct 58 ms 9448 KB Output is correct

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 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 348 KB Output is correct
5 Correct 10 ms 2212 KB Output is correct
6 Correct 11 ms 2352 KB Output is correct
7 Correct 10 ms 2176 KB Output is correct
8 Correct 68 ms 14060 KB Output is correct
9 Correct 64 ms 14156 KB Output is correct
10 Correct 66 ms 14036 KB Output is correct
11 Correct 83 ms 12240 KB Output is correct
12 Correct 33 ms 5724 KB Output is correct
13 Correct 71 ms 11732 KB Output is correct
14 Correct 55 ms 8640 KB Output is correct
15 Correct 31 ms 4432 KB Output is correct
16 Correct 54 ms 8184 KB Output is correct
17 Correct 55 ms 9256 KB Output is correct
18 Correct 33 ms 5204 KB Output is correct
19 Correct 58 ms 9448 KB Output is correct
20 Execution timed out 2013 ms 9372 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 348 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 348 KB Output is correct
5 Correct 10 ms 2212 KB Output is correct
6 Correct 11 ms 2352 KB Output is correct
7 Correct 10 ms 2176 KB Output is correct
8 Correct 68 ms 14060 KB Output is correct
9 Correct 64 ms 14156 KB Output is correct
10 Correct 66 ms 14036 KB Output is correct
11 Correct 83 ms 12240 KB Output is correct
12 Correct 33 ms 5724 KB Output is correct
13 Correct 71 ms 11732 KB Output is correct
14 Correct 55 ms 8640 KB Output is correct
15 Correct 31 ms 4432 KB Output is correct
16 Correct 54 ms 8184 KB Output is correct
17 Correct 55 ms 9256 KB Output is correct
18 Correct 33 ms 5204 KB Output is correct
19 Correct 58 ms 9448 KB Output is correct
20 Execution timed out 2013 ms 9372 KB Time limit exceeded
21 Halted 0 ms 0 KB -