oj.uz

Submission #764516

# Submission time Handle Problem Language Result Execution time Memory
764516 2023-06-23T14:05:00 Z Zflop Railway (BOI17_railway) C++14
100 / 100
 65 ms 25668 KB 
#include <bits/stdc++.h>
using namespace std;
 
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;

/*
ID: 10002181
LANG: C++
TASK: lamps
*/
 
using str = string; // yay python!
using ld = long double; // or double, if TL is tight
using ll = long long;
using int64 = ll;
using db = double;
using ull = unsigned long long;
 
#define ch() getchar()
#define pc(x) putchar(x)
#define tcT template<class T
#define tcTU tcT, class U
tcT> using V = vector<T>;
tcT, size_t SZ> using AR = array<T,SZ>;
using vi = V<int>;
using vb = V<bool>;
using vpi = V<pair<int,int>>;
using vvi = V<vi>;
using vl = V<ll>;
using vd = V<ld>;
using vstr = V<str>;
 
#define all(x) begin(x), end(x)
#define sor(x) sort(all(x))
#define rev(x) reverse(all(x))
#define sz(x) (int)(x).size()
#define rall(x) x.rbegin(), x.rend()
#define AR array
 
// loops
#define F0R(i, a, b) for (int i=a; i<b;++i)
#define FOR(i, a) for (int i=0; i<a;++i)
#define FORn(i, a) for (int i=1; i<=a;++i)
#define ROF(i,a) for(int i=a-1; i >= 0;--i)
#define R0F(i,a,b) for(int i=a; i > b;--i)
#define ROFn(i,a) for(int i=a; i > 0;--i)
#define rep(a) FOR(_, a)
#define trav(i,x) for(auto& i:x)
 
// pairs
#define mp make_pair
#define pi pair <int, int>
#define f first
#define s second
 
// vectors
#define lb lower_bound
#define ub upper_bound
#define SUM(v) accumulate(all(v), 0LL)
#define MN(v) *min_element(all(v))
#define MX(v) *max_element(all(v))
#define UNIQUE(a) (a).erase(unique((a).begin(),(a).end()),(a).end())
#define eb emplace_back
#define ft front()
#define bk back()
#define ins insert
#define pf push_front
#define pb push_back
#define emt empty()
#define rsz resize
 
#define pob pop_back()
#define pof pop_front()
 
#define ts to_string
 
#define setIO()  ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
 
ll MOD = 1e9+7;
const ll MAX = 100000000000;
const ll INF = 1e18; // not too close to LLONG_MAX
const ld PI = acos((ld)-1);
 
#ifdef _DEBUG
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
 
const int dx[4] = {1,0,-1,0}, dy[4] = {0,1,0,-1}; // for every grid problem!!
 
tcT> bool ckmin(T& a, const T& b) {
	return b < a ? a = b, 1 : 0; } // set a = min(a,b)
tcT> bool ckmax(T& a, const T& b) {
	return a < b ? a = b, 1 : 0; }
 
tcTU> T fstTrue(T lo, T hi, U f) {
	hi ++; assert(lo <= hi); // assuming f is increasing
	while (lo < hi) { // find first index such that f is true
		T mid = lo+(hi-lo)/2;
		f(mid) ? hi = mid : lo = mid+1;
	}
	return lo;
}
tcTU> T lstTrue(T lo, T hi, U f) {
	lo --; assert(lo <= hi); // assuming f is decreasing
	while (lo < hi) { // find first index such that f is true
		T mid = lo+(hi-lo+1)/2;
		f(mid) ? lo = mid : hi = mid-1;
	}
	return lo;
}
 
//INPUT
#define tcTUU tcT, class ...U
tcT> void re(complex<T>& c);
tcTU> void re(pair<T,U>& p);
tcT> void re(V<T>& v);
tcT, size_t SZ> void re(AR<T,SZ>& a);
 
tcT> void re(T& x) { cin >> x; }
void re(db& d) { str t; re(t); d = stod(t); }
void re(ld& d) { str t; re(t); d = stold(t); }
tcTUU> void re(T& t, U&... u) { re(t); re(u...); }
 
tcT> void re(complex<T>& c) { T a,b; re(a,b); c = {a,b}; }
tcTU> void re(pair<T,U>& p) { re(p.f,p.s); }
tcT> void re(V<T>& x) { trav(a,x) re(a); }
tcT> void rv(int n, V<T>& x) { x.rsz(n); re(x); }
 
//OUTPUT
namespace output {
	tcT> void PS(V<T>& x) { FOR(i,sz(x)) cout << x[i] << " \n"[i + 1 == sz(x)];}
	tcT> void W(pair<T,T>& x) { cout << x.f << ' ' << x.s << '\n'; }
	tcT> void PS(bool ok) { if(ok) cout << "YES\n"; else cout << "NO\n"; }
    template<class T1, class T2> void pr(const pair<T1,T2>& x);
    tcT, size_t SZ> void pr(const array<T,SZ>& x);
    tcT> void pr(const vector<T>& x);
    tcT> void pr(const set<T>& x);
    template<class T1, class T2> void pr(const map<T1,T2>& x);
 
    tcT> void pr(const T& x) { cout << x; }
    template<class Arg, class... Args> void pr(const Arg& first, const Args&... rest) {
        pr(first); pr(rest...);
    }
 
    template<class T1, class T2> void pr(const pair<T1,T2>& x) {
        pr("{",x.f,", ",x.s,"}");
    }
    tcT> void prContain(const T& x) {
        pr("{");
        bool fst = 1; trav(a,x) pr(!fst?", ":"",a), fst = 0;
        pr("}");
    }
    tcT, size_t SZ> void pr(const array<T,SZ>& x) { prContain(x); }
    tcT> void pr(const vector<T>& x) { prContain(x); }
    tcT> void pr(const set<T>& x) { prContain(x); }
    template<class T1, class T2> void pr(const map<T1,T2>& x) { prContain(x); }
 
    void ps() { pr("\n"); } // print w/ spaces
    template<class Arg> void ps(const Arg& first) { pr(first,"\n"); }
    template<class Arg, class... Args> void ps(const Arg& first, const Args&... rest) {
        pr(first," "); ps(rest...);
    }
}
 
using namespace output;
 
void setF(string fileName = "") {
	ios_base::sync_with_stdio(0); cin.tie(0);
	if((int)fileName.size()) {
		freopen((fileName+".in").c_str(), "r", stdin);
		freopen((fileName+".out").c_str(), "w", stdout);
	}
}
 
 
vb bb;
vi SIEVE(int N){ // sieve in O(N logN)
	vi pr;
	bb.rsz(N);
	bb[0] = bb[1] = true;
	vi g(N);
	F0R(i,2,N){
		if(!bb[i]){
			pr.pb(i);
			for (int j = i + i; j < N; j += i) bb[j] = true;
			}
		}
	return pr;
	}
 
 
 
template<class T> using ordset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
 
struct edge{
	int a;
	int b;
	int w;
	};
 
ll POW(ll x, ll y,ll mod){
    ll res = 1LL;
    x %= mod;
    while(y){
        if (y & 1LL)
            res *= x;
        res %= mod;
        x = (x*x) % mod;
        y >>= 1LL;
    }
    return res;
}
 
ll fact(ll x) { if(x) return x * fact(x - 1ll); return 1; }
 
vl fc;
void F(int N,ll MOD){
	fc.rsz(N + 1);
	fc[0] = 1;
	FORn(i,N) fc[i] = fc[i - 1] * i * 1ll % MOD;
	}
 
vl inv;
void I(int N,ll MOD){
	inv.rsz(N + 1);
	inv[N] = POW(fc[N],MOD - 2,MOD);
	for (int i = N; i ;--i) inv[i - 1] = inv[i] * 1ll * i % MOD;
	}
 
ll Cr(ll N,ll K,ll mod = MOD){
	if(K < 0) return 0;
	if(K > N) return 0;
	if(K == 0) return 1;
	return fc[N] * 1ll * inv[K] % mod * inv[N - K] % mod;
	}
ll Ar(ll N,ll K,ll mod){
	return fc[N] * inv[N - K] % mod;
	}
ll iv(int k,ll MOD){
  return POW(k,MOD-2,MOD);
}
ll gauss(ll x){
	return x * (x +  1) / 2;
	}
/*
 scanf("%lld", &testInteger);
 printf("%lld", testInteger);
 
 ____ ____ ____ ____ ____  ____
||f |||l |||o |||p |||p ||||y ||
||__|||__|||__|||__|||__||||__||
|/__\|/__\|/__\|/__\|/__\||/__\|
 
**/
const int NMAX = (int)1e5 + 1;
int N,M,K,t;
vi depth,A,ans;
vpi ad[NMAX];
int bj[20][NMAX];
int tin[NMAX];
void dfs(int node,int parent){
	depth[node] = depth[parent] + 1;
	bj[0][node] = parent;
	tin[node] = ++t;
	trav(x,ad[node])
		if(x.f != parent)
			dfs(x.f,node);
	}
void dfs1(int node,int parent,int id){
	trav(x,ad[node])
		if(x.f != parent){
			dfs1(x.f,node,x.s);
			A[node] += A[x.f];
			}
	//ps(node,A[node]);
	if(A[node] >= K * 2 && node != 1) ans.pb(id);
	}
int jmp(int a,int k){
	for (int i = 0; i < 20;++i) if(k & (1 << i)) a = bj[i][a];
	return a;
	}
int LCA(int a,int b){
	if(depth[a] < depth[b]) swap(a,b);
	a = jmp(a,depth[a] - depth[b]);
	if(a == b) return a;
	for (int j = 19; j >= 0;--j){
		int aT = bj[j][a];
		int bT = bj[j][b];
		if(aT != bT) {
			a = aT;
			b = bT;
			}
		}
	return bj[0][a];
	}
int dist(int a,int b){
	return depth[a] + depth[b] - 2 * depth[LCA(a,b)];
	}
void solve(){
	cin >> N >> M >> K;
	A = depth = vi(N + 1);
	FOR(i,N - 1){
		int a,b; cin >> a >> b;
		ad[a].pb({b,i + 1});
		ad[b].pb({a,i + 1});
		}
	dfs(1,0);
	for (int i = 1; i < 20;++i)
		for (int j = 1; j <= N;++j)
			bj[i][j] = bj[i - 1][bj[i - 1][j]];
	while(M--){
		int n; cin >> n;
		vi a(n); re(a);
		sort(all(a),[&] (int i,int j) { return tin[i] < tin[j]; });
		a.pb(a[0]);
		for (int i = 0; i < n;++i){
			int e = a[i];
			int w = a[i + 1];
			int c = LCA(e,w);
			A[e]++;
			A[w]++;
			A[c] -= 2;
			}
		}
	dfs1(1,0,0);
	ps(sz(ans));
	sor(ans);
	trav(x,ans) cout << x << ' ';
	}
main(){
	setIO();
	solve();
	}
 
// look out for out of bounds arrays
// And more importantly, is y a vowel? Damian:1
// <3 :L ._. <_<
// You have no idea how high I can fly
// code is my poetry

Compilation message

railway.cpp:332:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  332 | main(){
      | ^~~~
railway.cpp: In function 'void setF(std::string)':
railway.cpp:172:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  172 |   freopen((fileName+".in").c_str(), "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
railway.cpp:173:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  173 |   freopen((fileName+".out").c_str(), "w", stdout);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 4 ms 4052 KB Output is correct
3 Correct 6 ms 4120 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 1 ms 2772 KB Output is correct
6 Correct 5 ms 4612 KB Output is correct
7 Correct 4 ms 4228 KB Output is correct
8 Correct 4 ms 4168 KB Output is correct
9 Correct 4 ms 4052 KB Output is correct
10 Correct 1 ms 2772 KB Output is correct
11 Correct 2 ms 2772 KB Output is correct
12 Correct 1 ms 2772 KB Output is correct
13 Correct 1 ms 2772 KB Output is correct
14 Correct 1 ms 2772 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 4 ms 4052 KB Output is correct
3 Correct 6 ms 4120 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 1 ms 2772 KB Output is correct
6 Correct 5 ms 4612 KB Output is correct
7 Correct 4 ms 4228 KB Output is correct
8 Correct 4 ms 4168 KB Output is correct
9 Correct 4 ms 4052 KB Output is correct
10 Correct 1 ms 2772 KB Output is correct
11 Correct 2 ms 2772 KB Output is correct
12 Correct 1 ms 2772 KB Output is correct
13 Correct 1 ms 2772 KB Output is correct
14 Correct 1 ms 2772 KB Output is correct
15 Correct 15 ms 4436 KB Output is correct
16 Correct 15 ms 4448 KB Output is correct
17 Correct 16 ms 4568 KB Output is correct
18 Correct 5 ms 4496 KB Output is correct
19 Correct 5 ms 4180 KB Output is correct
20 Correct 15 ms 4644 KB Output is correct
21 Correct 17 ms 4564 KB Output is correct
22 Correct 2 ms 2772 KB Output is correct
23 Correct 5 ms 4056 KB Output is correct
24 Correct 4 ms 4052 KB Output is correct
25 Correct 1 ms 2772 KB Output is correct
26 Correct 1 ms 2772 KB Output is correct
27 Correct 5 ms 4608 KB Output is correct
28 Correct 4 ms 4220 KB Output is correct
29 Correct 4 ms 4164 KB Output is correct
30 Correct 4 ms 4180 KB Output is correct
31 Correct 2 ms 2772 KB Output is correct
32 Correct 1 ms 2772 KB Output is correct
33 Correct 1 ms 2680 KB Output is correct
34 Correct 2 ms 2680 KB Output is correct
35 Correct 2 ms 2684 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 23464 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 56 ms 23200 KB Output is correct
4 Correct 51 ms 22604 KB Output is correct
5 Correct 53 ms 23592 KB Output is correct
6 Correct 52 ms 23588 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 19196 KB Output is correct
2 Correct 47 ms 15692 KB Output is correct
3 Correct 51 ms 15384 KB Output is correct
4 Correct 62 ms 15476 KB Output is correct
5 Correct 57 ms 15420 KB Output is correct
6 Correct 47 ms 19332 KB Output is correct
7 Correct 46 ms 19276 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 19196 KB Output is correct
2 Correct 47 ms 15692 KB Output is correct
3 Correct 51 ms 15384 KB Output is correct
4 Correct 62 ms 15476 KB Output is correct
5 Correct 57 ms 15420 KB Output is correct
6 Correct 47 ms 19332 KB Output is correct
7 Correct 46 ms 19276 KB Output is correct
8 Correct 51 ms 19272 KB Output is correct
9 Correct 51 ms 21068 KB Output is correct
10 Correct 50 ms 25316 KB Output is correct
11 Correct 49 ms 25360 KB Output is correct
12 Correct 42 ms 16844 KB Output is correct
13 Correct 42 ms 16968 KB Output is correct
14 Correct 52 ms 17072 KB Output is correct
15 Correct 50 ms 17068 KB Output is correct
16 Correct 53 ms 17188 KB Output is correct
17 Correct 64 ms 17088 KB Output is correct
18 Correct 58 ms 17188 KB Output is correct
19 Correct 49 ms 17552 KB Output is correct
20 Correct 47 ms 21320 KB Output is correct
21 Correct 48 ms 21444 KB Output is correct
22 Correct 51 ms 21340 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 4 ms 4052 KB Output is correct
3 Correct 6 ms 4120 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 1 ms 2772 KB Output is correct
6 Correct 5 ms 4612 KB Output is correct
7 Correct 4 ms 4228 KB Output is correct
8 Correct 4 ms 4168 KB Output is correct
9 Correct 4 ms 4052 KB Output is correct
10 Correct 1 ms 2772 KB Output is correct
11 Correct 2 ms 2772 KB Output is correct
12 Correct 1 ms 2772 KB Output is correct
13 Correct 1 ms 2772 KB Output is correct
14 Correct 1 ms 2772 KB Output is correct
15 Correct 15 ms 4436 KB Output is correct
16 Correct 15 ms 4448 KB Output is correct
17 Correct 16 ms 4568 KB Output is correct
18 Correct 5 ms 4496 KB Output is correct
19 Correct 5 ms 4180 KB Output is correct
20 Correct 15 ms 4644 KB Output is correct
21 Correct 17 ms 4564 KB Output is correct
22 Correct 2 ms 2772 KB Output is correct
23 Correct 5 ms 4056 KB Output is correct
24 Correct 4 ms 4052 KB Output is correct
25 Correct 1 ms 2772 KB Output is correct
26 Correct 1 ms 2772 KB Output is correct
27 Correct 5 ms 4608 KB Output is correct
28 Correct 4 ms 4220 KB Output is correct
29 Correct 4 ms 4164 KB Output is correct
30 Correct 4 ms 4180 KB Output is correct
31 Correct 2 ms 2772 KB Output is correct
32 Correct 1 ms 2772 KB Output is correct
33 Correct 1 ms 2680 KB Output is correct
34 Correct 2 ms 2680 KB Output is correct
35 Correct 2 ms 2684 KB Output is correct
36 Correct 56 ms 23464 KB Output is correct
37 Correct 1 ms 2644 KB Output is correct
38 Correct 56 ms 23200 KB Output is correct
39 Correct 51 ms 22604 KB Output is correct
40 Correct 53 ms 23592 KB Output is correct
41 Correct 52 ms 23588 KB Output is correct
42 Correct 44 ms 19196 KB Output is correct
43 Correct 47 ms 15692 KB Output is correct
44 Correct 51 ms 15384 KB Output is correct
45 Correct 62 ms 15476 KB Output is correct
46 Correct 57 ms 15420 KB Output is correct
47 Correct 47 ms 19332 KB Output is correct
48 Correct 46 ms 19276 KB Output is correct
49 Correct 51 ms 19272 KB Output is correct
50 Correct 51 ms 21068 KB Output is correct
51 Correct 50 ms 25316 KB Output is correct
52 Correct 49 ms 25360 KB Output is correct
53 Correct 42 ms 16844 KB Output is correct
54 Correct 42 ms 16968 KB Output is correct
55 Correct 52 ms 17072 KB Output is correct
56 Correct 50 ms 17068 KB Output is correct
57 Correct 53 ms 17188 KB Output is correct
58 Correct 64 ms 17088 KB Output is correct
59 Correct 58 ms 17188 KB Output is correct
60 Correct 49 ms 17552 KB Output is correct
61 Correct 47 ms 21320 KB Output is correct
62 Correct 48 ms 21444 KB Output is correct
63 Correct 51 ms 21340 KB Output is correct
64 Correct 49 ms 21204 KB Output is correct
65 Correct 53 ms 17100 KB Output is correct
66 Correct 57 ms 17056 KB Output is correct
67 Correct 50 ms 17088 KB Output is correct
68 Correct 34 ms 16900 KB Output is correct
69 Correct 36 ms 16816 KB Output is correct
70 Correct 52 ms 21576 KB Output is correct
71 Correct 50 ms 20940 KB Output is correct
72 Correct 1 ms 2772 KB Output is correct
73 Correct 5 ms 4052 KB Output is correct
74 Correct 4 ms 4052 KB Output is correct
75 Correct 1 ms 2680 KB Output is correct
76 Correct 1 ms 2680 KB Output is correct
77 Correct 5 ms 4564 KB Output is correct
78 Correct 4 ms 4216 KB Output is correct
79 Correct 4 ms 4052 KB Output is correct
80 Correct 4 ms 4180 KB Output is correct
81 Correct 1 ms 2772 KB Output is correct
82 Correct 1 ms 2676 KB Output is correct
83 Correct 1 ms 2772 KB Output is correct
84 Correct 2 ms 2772 KB Output is correct
85 Correct 1 ms 2772 KB Output is correct
86 Correct 15 ms 4520 KB Output is correct
87 Correct 15 ms 4564 KB Output is correct
88 Correct 15 ms 4564 KB Output is correct
89 Correct 5 ms 4488 KB Output is correct
90 Correct 4 ms 4228 KB Output is correct
91 Correct 14 ms 4720 KB Output is correct
92 Correct 17 ms 4564 KB Output is correct
93 Correct 2 ms 2676 KB Output is correct
94 Correct 62 ms 25328 KB Output is correct
95 Correct 53 ms 24988 KB Output is correct
96 Correct 50 ms 24384 KB Output is correct
97 Correct 51 ms 25216 KB Output is correct
98 Correct 52 ms 25668 KB Output is correct
99 Correct 65 ms 17248 KB Output is correct
100 Correct 51 ms 17192 KB Output is correct
101 Correct 50 ms 17100 KB Output is correct
102 Correct 48 ms 17500 KB Output is correct
103 Correct 49 ms 21096 KB Output is correct
104 Correct 49 ms 21444 KB Output is correct
105 Correct 46 ms 20984 KB Output is correct
106 Correct 59 ms 21376 KB Output is correct
107 Correct 49 ms 21048 KB Output is correct
108 Correct 48 ms 25372 KB Output is correct
109 Correct 48 ms 25336 KB Output is correct
110 Correct 38 ms 16972 KB Output is correct
111 Correct 40 ms 16968 KB Output is correct
112 Correct 49 ms 17068 KB Output is correct
113 Correct 63 ms 17060 KB Output is correct