oj.uz

Submission #953857

# Submission time Handle Problem Language Result Execution time Memory
953857 2024-03-26T18:22:30 Z RadicaI Railway (BOI17_railway) C++17
23 / 100
 1000 ms 59960 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;
}

vi cnt;
V<mi> arr;
v2i adj; 
int k; 
map<pi, int> edge; 
si ans;
mi dfs(int node, int p){
	mi curr = arr[node];
	for(auto &x: adj[node])if(x!=p){
		mi nxt = dfs(x, node);
		if(sz(nxt)<sz(curr)) curr.swap(nxt);
		for(auto &z: nxt){
			curr[z.F] += z.S;
			if(curr[z.F] == cnt[z.F]) curr.erase(z.F);
		}
	}
	if(sz(curr)>=k) ans.ins(edge[{node,p}]);
	return curr;
}


signed main(){
	int n,m;cin>>n>>m>>k; cnt.resize(m); adj.resize(n); arr.resize(n);
	for(int i=1; i<n; i++){
		int x,y; cin>>x>>y; x--;y--;
		edge[{x,y}]=i; edge[{y,x}]=i;
		adj[x].pb(y); adj[y].pb(x);
	}
	for(int i=0; i<m; i++){
		int s; cin>>s;
		cnt[i]=s;
		while(s--){
			int t; cin>> t; 
			arr[t-1][i]++;
		}
	}
	dfs(0,0);
	cout<<sz(ans)<<endl;
	for(auto &x: ans) cout<<x<<" ";
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 11 ms 2908 KB Output is correct
3 Correct 12 ms 3040 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 120 ms 4220 KB Output is correct
7 Correct 10 ms 3164 KB Output is correct
8 Correct 125 ms 2908 KB Output is correct
9 Correct 31 ms 3340 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 11 ms 2908 KB Output is correct
3 Correct 12 ms 3040 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 120 ms 4220 KB Output is correct
7 Correct 10 ms 3164 KB Output is correct
8 Correct 125 ms 2908 KB Output is correct
9 Correct 31 ms 3340 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 90 ms 8240 KB Output is correct
16 Correct 93 ms 8272 KB Output is correct
17 Correct 79 ms 8524 KB Output is correct
18 Correct 415 ms 4432 KB Output is correct
19 Correct 98 ms 3300 KB Output is correct
20 Correct 950 ms 10324 KB Output is correct
21 Correct 957 ms 9736 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 12 ms 2908 KB Output is correct
24 Correct 11 ms 2908 KB Output is correct
25 Correct 0 ms 432 KB Output is correct
26 Correct 0 ms 344 KB Output is correct
27 Correct 129 ms 4236 KB Output is correct
28 Correct 10 ms 3164 KB Output is correct
29 Correct 105 ms 3336 KB Output is correct
30 Correct 29 ms 3032 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct

Subtask #3
0 / 7.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1059 ms 59960 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1044 ms 48940 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 16.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1044 ms 48940 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 11 ms 2908 KB Output is correct
3 Correct 12 ms 3040 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 120 ms 4220 KB Output is correct
7 Correct 10 ms 3164 KB Output is correct
8 Correct 125 ms 2908 KB Output is correct
9 Correct 31 ms 3340 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 90 ms 8240 KB Output is correct
16 Correct 93 ms 8272 KB Output is correct
17 Correct 79 ms 8524 KB Output is correct
18 Correct 415 ms 4432 KB Output is correct
19 Correct 98 ms 3300 KB Output is correct
20 Correct 950 ms 10324 KB Output is correct
21 Correct 957 ms 9736 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 12 ms 2908 KB Output is correct
24 Correct 11 ms 2908 KB Output is correct
25 Correct 0 ms 432 KB Output is correct
26 Correct 0 ms 344 KB Output is correct
27 Correct 129 ms 4236 KB Output is correct
28 Correct 10 ms 3164 KB Output is correct
29 Correct 105 ms 3336 KB Output is correct
30 Correct 29 ms 3032 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Execution timed out 1059 ms 59960 KB Time limit exceeded
37 Halted 0 ms 0 KB -