oj.uz

Submission #785032

# Submission time Handle Problem Language Result Execution time Memory
785032 2023-07-17T00:28:53 Z tolbi Railway (BOI17_railway) C++17
100 / 100
 167 ms 53952 KB 
#pragma optimize("Bismillahirrahmanirrahim")
//█▀█─█──█──█▀█─█─█
//█▄█─█──█──█▄█─█■█
//█─█─█▄─█▄─█─█─█─█
//ahmet23 orz...
//FatihSultanMehmedHan
//YavuzSultanSelimHan
//AbdulhamidHan
//Sani buyuk Osman Pasa Plevneden cikmam diyor
#define author tolbi
#include <bits/stdc++.h>
using namespace std;
template<typename X, typename Y> istream& operator>>(istream& is, pair<X,Y> &pr){return is>>pr.first>>pr.second;}
#ifdef tolbi
template<typename X, typename Y> ostream& operator<<(ostream& os, pair<X,Y> pr){return os<<"{ "<<pr.first<<", "<<pr.second<<" }";}
#else
template<typename X, typename Y> ostream& operator<<(ostream& os, pair<X,Y> pr){return os<<pr.first<<" "<<pr.second;}
#endif
ostream& operator<<(ostream& os, bool bl){return os<<(int32_t)bl;}
template<typename X> istream& operator>>(istream& is, vector<X> &arr){for (auto &it : arr) is>>it; return is;}
template<typename X, size_t Y> istream& operator>>(istream& is, array<X,Y> &arr){for (auto &it : arr) is>>it; return is;}
template<typename X> ostream& operator<<(ostream& os, vector<X> &arr){for (auto &it : arr) os<<" "<<it;os<<endl;return os;}
template<typename X, size_t Y> ostream& operator<<(ostream& os, array<X,Y> &arr){for (auto &it : arr) os<<" "<<it;os<<endl;return os;}
#define int long long
#define endl '\n'
#define deci(x) int x;cin>>x;
#define decstr(x) string x;cin>>x;
#define cinarr(x) for (auto &it : x) cin>>it;
#define coutarr(x) for(auto &it : x) cout<<it<<" ";cout<<endl;
#define sortarr(x) sort(x.begin(), x.end())
#define sortrarr(x) sort(x.rbegin(), x.rend())
#define rev(x) reverse(x.begin(), x.end())
#define tol(bi) (1LL<<((int)(bi)))
#define ios ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
const int INF = LONG_LONG_MAX;
const int MOD = 1e9+7;
mt19937 ayahya(chrono::high_resolution_clock().now().time_since_epoch().count());
int32_t main(){
	ios;
	int T = 1;
	if (!T) cin>>T;
	int tno = 0;
	while (T-(tno++)){
		deci(n);deci(m);deci(k);
		vector<map<int,int>> mp(n);
		vector<int> sz(m);
		vector<vector<int>> arr(n);
		vector<vector<int>> ed(n);
		for (int i = 0; i < n-1; ++i)
		{
			deci(u);deci(v);
			arr[u-1].push_back(v-1);
			arr[v-1].push_back(u-1);
			ed[u-1].push_back(i+1);
			ed[v-1].push_back(i+1);
		}
		for (int i = 0; i < m; ++i)
		{
			cin>>sz[i];
			for (int j = 0; j < sz[i]; ++j)
			{
				deci(x);
				mp[x-1][i]=1;
			}
		}
		vector<int> pared(n);
		vector<int> ansarr;
		auto f = [&](int node, int lnode, auto f)->void{
			for (int i = 0; i < arr[node].size(); i++){
				if (arr[node][i]==lnode) continue;
				pared[arr[node][i]]=ed[node][i];
				f(arr[node][i],node,f);
				if (mp[arr[node][i]].size()>mp[node].size()) swap(mp[node],mp[arr[node][i]]);
				for (auto it : mp[arr[node][i]]){
					mp[node][it.first]+=it.second;
					if (mp[node][it.first]==sz[it.first]) mp[node].erase(it.first);
				}
				mp[arr[node][i]].clear();
			}
			if (mp[node].size()>=k){
				ansarr.push_back(pared[node]);
			}
		};
		f(0,-1,f);
		cout<<ansarr.size()<<endl;
		sortarr(ansarr);
		coutarr(ansarr);
	}
}

Compilation message

railway.cpp:1: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    1 | #pragma optimize("Bismillahirrahmanirrahim")
      | 
railway.cpp: In instantiation of 'main()::<lambda(long long int, long long int, auto:23)> [with auto:23 = main()::<lambda(long long int, long long int, auto:23)>]':
railway.cpp:84:11:   required from here
railway.cpp:69:22: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   69 |    for (int i = 0; i < arr[node].size(); i++){
      |                    ~~^~~~~~~~~~~~~~~~~~
railway.cpp:80:23: warning: comparison of integer expressions of different signedness: 'std::map<long long int, long long int>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   80 |    if (mp[node].size()>=k){
      |        ~~~~~~~~~~~~~~~^~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 5 ms 2260 KB Output is correct
3 Correct 5 ms 2260 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 6 ms 3792 KB Output is correct
7 Correct 4 ms 2516 KB Output is correct
8 Correct 4 ms 2384 KB Output is correct
9 Correct 4 ms 2388 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 324 KB Output is correct
13 Correct 1 ms 328 KB Output is correct
14 Correct 1 ms 212 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 5 ms 2260 KB Output is correct
3 Correct 5 ms 2260 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 6 ms 3792 KB Output is correct
7 Correct 4 ms 2516 KB Output is correct
8 Correct 4 ms 2384 KB Output is correct
9 Correct 4 ms 2388 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 324 KB Output is correct
13 Correct 1 ms 328 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 34 ms 7380 KB Output is correct
16 Correct 33 ms 7456 KB Output is correct
17 Correct 33 ms 7464 KB Output is correct
18 Correct 6 ms 3784 KB Output is correct
19 Correct 7 ms 2516 KB Output is correct
20 Correct 37 ms 9016 KB Output is correct
21 Correct 39 ms 8908 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 4 ms 2260 KB Output is correct
24 Correct 5 ms 2260 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 6 ms 3668 KB Output is correct
28 Correct 5 ms 2516 KB Output is correct
29 Correct 4 ms 2388 KB Output is correct
30 Correct 5 ms 2388 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 340 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 124 ms 49556 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 130 ms 50916 KB Output is correct
4 Correct 110 ms 50252 KB Output is correct
5 Correct 97 ms 51036 KB Output is correct
6 Correct 125 ms 53948 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 106 ms 36980 KB Output is correct
2 Correct 120 ms 28232 KB Output is correct
3 Correct 143 ms 27364 KB Output is correct
4 Correct 144 ms 27008 KB Output is correct
5 Correct 141 ms 26912 KB Output is correct
6 Correct 107 ms 39064 KB Output is correct
7 Correct 109 ms 38888 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 106 ms 36980 KB Output is correct
2 Correct 120 ms 28232 KB Output is correct
3 Correct 143 ms 27364 KB Output is correct
4 Correct 144 ms 27008 KB Output is correct
5 Correct 141 ms 26912 KB Output is correct
6 Correct 107 ms 39064 KB Output is correct
7 Correct 109 ms 38888 KB Output is correct
8 Correct 104 ms 38800 KB Output is correct
9 Correct 100 ms 38708 KB Output is correct
10 Correct 88 ms 51344 KB Output is correct
11 Correct 84 ms 51112 KB Output is correct
12 Correct 62 ms 25860 KB Output is correct
13 Correct 62 ms 25992 KB Output is correct
14 Correct 116 ms 25968 KB Output is correct
15 Correct 114 ms 25900 KB Output is correct
16 Correct 139 ms 26956 KB Output is correct
17 Correct 142 ms 27324 KB Output is correct
18 Correct 135 ms 26956 KB Output is correct
19 Correct 136 ms 28392 KB Output is correct
20 Correct 110 ms 39240 KB Output is correct
21 Correct 109 ms 39372 KB Output is correct
22 Correct 113 ms 39292 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 5 ms 2260 KB Output is correct
3 Correct 5 ms 2260 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 6 ms 3792 KB Output is correct
7 Correct 4 ms 2516 KB Output is correct
8 Correct 4 ms 2384 KB Output is correct
9 Correct 4 ms 2388 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 324 KB Output is correct
13 Correct 1 ms 328 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 34 ms 7380 KB Output is correct
16 Correct 33 ms 7456 KB Output is correct
17 Correct 33 ms 7464 KB Output is correct
18 Correct 6 ms 3784 KB Output is correct
19 Correct 7 ms 2516 KB Output is correct
20 Correct 37 ms 9016 KB Output is correct
21 Correct 39 ms 8908 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 4 ms 2260 KB Output is correct
24 Correct 5 ms 2260 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 6 ms 3668 KB Output is correct
28 Correct 5 ms 2516 KB Output is correct
29 Correct 4 ms 2388 KB Output is correct
30 Correct 5 ms 2388 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 124 ms 49556 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 130 ms 50916 KB Output is correct
39 Correct 110 ms 50252 KB Output is correct
40 Correct 97 ms 51036 KB Output is correct
41 Correct 125 ms 53948 KB Output is correct
42 Correct 106 ms 36980 KB Output is correct
43 Correct 120 ms 28232 KB Output is correct
44 Correct 143 ms 27364 KB Output is correct
45 Correct 144 ms 27008 KB Output is correct
46 Correct 141 ms 26912 KB Output is correct
47 Correct 107 ms 39064 KB Output is correct
48 Correct 109 ms 38888 KB Output is correct
49 Correct 104 ms 38800 KB Output is correct
50 Correct 100 ms 38708 KB Output is correct
51 Correct 88 ms 51344 KB Output is correct
52 Correct 84 ms 51112 KB Output is correct
53 Correct 62 ms 25860 KB Output is correct
54 Correct 62 ms 25992 KB Output is correct
55 Correct 116 ms 25968 KB Output is correct
56 Correct 114 ms 25900 KB Output is correct
57 Correct 139 ms 26956 KB Output is correct
58 Correct 142 ms 27324 KB Output is correct
59 Correct 135 ms 26956 KB Output is correct
60 Correct 136 ms 28392 KB Output is correct
61 Correct 110 ms 39240 KB Output is correct
62 Correct 109 ms 39372 KB Output is correct
63 Correct 113 ms 39292 KB Output is correct
64 Correct 102 ms 38988 KB Output is correct
65 Correct 167 ms 26592 KB Output is correct
66 Correct 140 ms 26040 KB Output is correct
67 Correct 116 ms 26028 KB Output is correct
68 Correct 54 ms 23488 KB Output is correct
69 Correct 54 ms 23420 KB Output is correct
70 Correct 115 ms 39636 KB Output is correct
71 Correct 97 ms 38476 KB Output is correct
72 Correct 1 ms 212 KB Output is correct
73 Correct 5 ms 2256 KB Output is correct
74 Correct 4 ms 2256 KB Output is correct
75 Correct 1 ms 212 KB Output is correct
76 Correct 1 ms 212 KB Output is correct
77 Correct 6 ms 3668 KB Output is correct
78 Correct 4 ms 2516 KB Output is correct
79 Correct 4 ms 2388 KB Output is correct
80 Correct 5 ms 2388 KB Output is correct
81 Correct 1 ms 212 KB Output is correct
82 Correct 1 ms 212 KB Output is correct
83 Correct 1 ms 212 KB Output is correct
84 Correct 1 ms 212 KB Output is correct
85 Correct 1 ms 212 KB Output is correct
86 Correct 31 ms 7428 KB Output is correct
87 Correct 33 ms 7372 KB Output is correct
88 Correct 31 ms 7500 KB Output is correct
89 Correct 6 ms 3792 KB Output is correct
90 Correct 5 ms 2516 KB Output is correct
91 Correct 38 ms 8992 KB Output is correct
92 Correct 38 ms 8924 KB Output is correct
93 Correct 1 ms 212 KB Output is correct
94 Correct 124 ms 51544 KB Output is correct
95 Correct 113 ms 51004 KB Output is correct
96 Correct 112 ms 50172 KB Output is correct
97 Correct 97 ms 51096 KB Output is correct
98 Correct 123 ms 53952 KB Output is correct
99 Correct 153 ms 26980 KB Output is correct
100 Correct 144 ms 27084 KB Output is correct
101 Correct 143 ms 27196 KB Output is correct
102 Correct 127 ms 28200 KB Output is correct
103 Correct 106 ms 38860 KB Output is correct
104 Correct 110 ms 39392 KB Output is correct
105 Correct 110 ms 38856 KB Output is correct
106 Correct 94 ms 38832 KB Output is correct
107 Correct 97 ms 38656 KB Output is correct
108 Correct 79 ms 51184 KB Output is correct
109 Correct 81 ms 51168 KB Output is correct
110 Correct 58 ms 25920 KB Output is correct
111 Correct 61 ms 25992 KB Output is correct
112 Correct 124 ms 26044 KB Output is correct
113 Correct 114 ms 25996 KB Output is correct