oj.uz

Submission #701942

# Submission time Handle Problem Language Result Execution time Memory
701942 2023-02-22T11:28:38 Z deadboy Railway (BOI17_railway) C++14
100 / 100
 305 ms 47608 KB 
// :)

#include <bits/stdc++.h>
     
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
     
     
//-----------------debug--------------------------
vector<string> vec_splitter(string s) {
	s += ',';
	vector<string> res;
	while(!s.empty()) {
		res.push_back(s.substr(0, s.find(',')));
		s = s.substr(s.find(',') + 1);
	}
	return res;
}
void debug_out(
vector<string> __attribute__ ((unused)) args,
__attribute__ ((unused)) int idx, 
__attribute__ ((unused)) int LINE_NUM) { cerr << endl; } 
template <typename Head, typename... Tail>
void debug_out(vector<string> args, int idx, int LINE_NUM, Head H, Tail... T) {
	if(idx > 0) cerr << ", "; else cerr << "Line(" << LINE_NUM << ") ";
	stringstream ss; ss << H;
	cerr << args[idx] << " = " << ss.str();
	debug_out(args, idx + 1, LINE_NUM, T...);
}
#define deb(...) debug_out(vec_splitter(#__VA_ARGS__), 0, __LINE__, __VA_ARGS__)
 
 
template <class T1, class T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
  return os << '{' << p.first << ", " << p.second << '}';
}
 
template <class T, class = decay_t<decltype(*begin(declval<T>()))>,
          class = enable_if_t<!is_same<T, string>::value>>
ostream &operator<<(ostream &os, const T &c) {
  os << '[';
  for (auto it = c.begin(); it != c.end(); ++it)
    os << &", "[2 * (it == c.begin())] << *it;
  return os << ']';
}
//support up to 5 args
#define _NTH_ARG(_1, _2, _3, _4, _5, _6, N, ...) N
#define _FE_0(_CALL, ...)
#define _FE_1(_CALL, x) _CALL(x)
#define _FE_2(_CALL, x, ...) _CALL(x) _FE_1(_CALL, __VA_ARGS__)
#define _FE_3(_CALL, x, ...) _CALL(x) _FE_2(_CALL, __VA_ARGS__)
#define _FE_4(_CALL, x, ...) _CALL(x) _FE_3(_CALL, __VA_ARGS__)
#define _FE_5(_CALL, x, ...) _CALL(x) _FE_4(_CALL, __VA_ARGS__)
#define FOR_EACH_MACRO(MACRO, ...)                                             \
  _NTH_ARG(dummy, ##__VA_ARGS__, _FE_5, _FE_4, _FE_3, _FE_2, _FE_1, _FE_0)     \
  (MACRO, ##__VA_ARGS__)
//Change output format here
#define out(x) #x " = " << x << "; "
#define debug(...)                                                              \
  cerr << "Line " << __LINE__ << ": " FOR_EACH_MACRO(out, __VA_ARGS__) << endl
//----------------------------------------------
 
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define FIO ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define no cout << "NO\n"; return;
#define yes cout << "YES\n"; return;
#define SP fixed << setprecision(10)
     
//FILE *fin = freopen("in","r",stdin);
//FILE *fout = freopen("out","w",stdout);
     
const ll mod = 1e9+7;
const ll oo = 1e18;
const ll N = 1e5*2 + 10, N2 = 1e6;
ll n, m, k, ans;

vector<ll> g[N];
ll cnt[N], re[N], sz[N], mx[N], a[N];

vector<ll> t[N];
void get_sz(ll v, ll fa){
  sz[v]=t[v].size()+1;
  for(auto u : g[v]){
    if(u==fa) continue;
    get_sz(u, v); sz[v]+=sz[u];
  }
}
void cle(ll v, ll fa){
  for(auto c:t[v])
    cnt[c]=0;
  for(auto u : g[v])
    if(u!=fa) cle(u, v);
}
ll sum = 0;
void add(ll c){
  cnt[c]++;
  if(cnt[c]==1) sum++;
  if(cnt[c]==mx[c]) sum--;
}
void ade(ll v, ll fa){
  for(auto c : t[v])
    add(c);
  for(auto u : g[v])
    if(u!=fa) ade(u, v);
}
map<pll, ll> dd;
void dfs(ll v, ll fa, ll tt = 0){
  sum = 0;
  
  pll mx = {0, -1};
  for(auto u : g[v]) if(u!=fa)
    mx = max(mx, {sz[u], u});
  for(auto u : g[v])
    if(u!=mx.ss && u!=fa) dfs(u, v);

  if(mx.ss != -1) dfs(mx.ss, v, 1);
  for(auto c:t[v])
    add(c);
  for(auto u : g[v])
    if(u!=mx.ss && u!=fa) ade(u, v);

  dd[mp(v, fa)]=sum;

  if(tt==0){ 
    cle(v, fa);
    sum = 0;
  }
}
vector<pll> ms;
void code(){
  get_sz(1, 1);
  dfs(1, 1, 1);
  vector<ll> ans;
  for(int i = 0; i < ms.size(); i++){
    ll su = dd[mp(ms[i].ff, ms[i].ss)];
    su += dd[mp(ms[i].ss, ms[i].ff)];
    if(su >= k) ans.pb(i+1);
  }
  cout<< ans.size()<<"\n";
  for(auto u : ans) cout<< u<<" ";
}
int main(){
  FIO;
  cin>> n>> m>> k;
  for(int i = 1; i < n; i++){
    ll v, u; cin>> v>> u;
    g[v].pb(u); g[u].pb(v);
    ms.pb({v,u}) ;
  }
  for(int i = 1; i <= m; i++){
    ll si; cin>> si;
    mx[i] = si;
    while(si--){
      ll x; cin>> x;
      t[x].pb(i);
    }
  }
  code();
}

Compilation message

railway.cpp: In function 'void code()':
railway.cpp:139:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  139 |   for(int i = 0; i < ms.size(); i++){
      |                  ~~^~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 14 ms 11728 KB Output is correct
3 Correct 15 ms 11628 KB Output is correct
4 Correct 5 ms 9684 KB Output is correct
5 Correct 5 ms 9724 KB Output is correct
6 Correct 13 ms 12496 KB Output is correct
7 Correct 14 ms 11856 KB Output is correct
8 Correct 12 ms 11720 KB Output is correct
9 Correct 14 ms 11700 KB Output is correct
10 Correct 5 ms 9684 KB Output is correct
11 Correct 5 ms 9684 KB Output is correct
12 Correct 5 ms 9684 KB Output is correct
13 Correct 5 ms 9724 KB Output is correct
14 Correct 6 ms 9684 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 14 ms 11728 KB Output is correct
3 Correct 15 ms 11628 KB Output is correct
4 Correct 5 ms 9684 KB Output is correct
5 Correct 5 ms 9724 KB Output is correct
6 Correct 13 ms 12496 KB Output is correct
7 Correct 14 ms 11856 KB Output is correct
8 Correct 12 ms 11720 KB Output is correct
9 Correct 14 ms 11700 KB Output is correct
10 Correct 5 ms 9684 KB Output is correct
11 Correct 5 ms 9684 KB Output is correct
12 Correct 5 ms 9684 KB Output is correct
13 Correct 5 ms 9724 KB Output is correct
14 Correct 6 ms 9684 KB Output is correct
15 Correct 26 ms 13008 KB Output is correct
16 Correct 26 ms 13112 KB Output is correct
17 Correct 34 ms 13088 KB Output is correct
18 Correct 14 ms 12536 KB Output is correct
19 Correct 15 ms 11904 KB Output is correct
20 Correct 24 ms 13436 KB Output is correct
21 Correct 24 ms 13412 KB Output is correct
22 Correct 6 ms 9720 KB Output is correct
23 Correct 14 ms 11696 KB Output is correct
24 Correct 15 ms 11648 KB Output is correct
25 Correct 5 ms 9684 KB Output is correct
26 Correct 5 ms 9720 KB Output is correct
27 Correct 14 ms 12416 KB Output is correct
28 Correct 14 ms 11904 KB Output is correct
29 Correct 11 ms 11812 KB Output is correct
30 Correct 15 ms 11708 KB Output is correct
31 Correct 6 ms 9744 KB Output is correct
32 Correct 5 ms 9684 KB Output is correct
33 Correct 5 ms 9724 KB Output is correct
34 Correct 5 ms 9720 KB Output is correct
35 Correct 5 ms 9684 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 120 ms 47540 KB Output is correct
2 Correct 5 ms 9724 KB Output is correct
3 Correct 113 ms 47180 KB Output is correct
4 Correct 111 ms 46584 KB Output is correct
5 Correct 112 ms 46904 KB Output is correct
6 Correct 110 ms 47608 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 125 ms 39044 KB Output is correct
2 Correct 171 ms 32696 KB Output is correct
3 Correct 181 ms 32024 KB Output is correct
4 Correct 211 ms 32084 KB Output is correct
5 Correct 200 ms 32096 KB Output is correct
6 Correct 120 ms 39064 KB Output is correct
7 Correct 122 ms 39032 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 125 ms 39044 KB Output is correct
2 Correct 171 ms 32696 KB Output is correct
3 Correct 181 ms 32024 KB Output is correct
4 Correct 211 ms 32084 KB Output is correct
5 Correct 200 ms 32096 KB Output is correct
6 Correct 120 ms 39064 KB Output is correct
7 Correct 122 ms 39032 KB Output is correct
8 Correct 142 ms 39456 KB Output is correct
9 Correct 131 ms 39480 KB Output is correct
10 Correct 112 ms 46924 KB Output is correct
11 Correct 108 ms 46824 KB Output is correct
12 Correct 134 ms 32064 KB Output is correct
13 Correct 120 ms 32008 KB Output is correct
14 Correct 183 ms 31276 KB Output is correct
15 Correct 181 ms 31280 KB Output is correct
16 Correct 202 ms 32236 KB Output is correct
17 Correct 182 ms 32044 KB Output is correct
18 Correct 180 ms 32028 KB Output is correct
19 Correct 171 ms 32704 KB Output is correct
20 Correct 122 ms 39320 KB Output is correct
21 Correct 126 ms 39420 KB Output is correct
22 Correct 122 ms 39372 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 14 ms 11728 KB Output is correct
3 Correct 15 ms 11628 KB Output is correct
4 Correct 5 ms 9684 KB Output is correct
5 Correct 5 ms 9724 KB Output is correct
6 Correct 13 ms 12496 KB Output is correct
7 Correct 14 ms 11856 KB Output is correct
8 Correct 12 ms 11720 KB Output is correct
9 Correct 14 ms 11700 KB Output is correct
10 Correct 5 ms 9684 KB Output is correct
11 Correct 5 ms 9684 KB Output is correct
12 Correct 5 ms 9684 KB Output is correct
13 Correct 5 ms 9724 KB Output is correct
14 Correct 6 ms 9684 KB Output is correct
15 Correct 26 ms 13008 KB Output is correct
16 Correct 26 ms 13112 KB Output is correct
17 Correct 34 ms 13088 KB Output is correct
18 Correct 14 ms 12536 KB Output is correct
19 Correct 15 ms 11904 KB Output is correct
20 Correct 24 ms 13436 KB Output is correct
21 Correct 24 ms 13412 KB Output is correct
22 Correct 6 ms 9720 KB Output is correct
23 Correct 14 ms 11696 KB Output is correct
24 Correct 15 ms 11648 KB Output is correct
25 Correct 5 ms 9684 KB Output is correct
26 Correct 5 ms 9720 KB Output is correct
27 Correct 14 ms 12416 KB Output is correct
28 Correct 14 ms 11904 KB Output is correct
29 Correct 11 ms 11812 KB Output is correct
30 Correct 15 ms 11708 KB Output is correct
31 Correct 6 ms 9744 KB Output is correct
32 Correct 5 ms 9684 KB Output is correct
33 Correct 5 ms 9724 KB Output is correct
34 Correct 5 ms 9720 KB Output is correct
35 Correct 5 ms 9684 KB Output is correct
36 Correct 120 ms 47540 KB Output is correct
37 Correct 5 ms 9724 KB Output is correct
38 Correct 113 ms 47180 KB Output is correct
39 Correct 111 ms 46584 KB Output is correct
40 Correct 112 ms 46904 KB Output is correct
41 Correct 110 ms 47608 KB Output is correct
42 Correct 125 ms 39044 KB Output is correct
43 Correct 171 ms 32696 KB Output is correct
44 Correct 181 ms 32024 KB Output is correct
45 Correct 211 ms 32084 KB Output is correct
46 Correct 200 ms 32096 KB Output is correct
47 Correct 120 ms 39064 KB Output is correct
48 Correct 122 ms 39032 KB Output is correct
49 Correct 142 ms 39456 KB Output is correct
50 Correct 131 ms 39480 KB Output is correct
51 Correct 112 ms 46924 KB Output is correct
52 Correct 108 ms 46824 KB Output is correct
53 Correct 134 ms 32064 KB Output is correct
54 Correct 120 ms 32008 KB Output is correct
55 Correct 183 ms 31276 KB Output is correct
56 Correct 181 ms 31280 KB Output is correct
57 Correct 202 ms 32236 KB Output is correct
58 Correct 182 ms 32044 KB Output is correct
59 Correct 180 ms 32028 KB Output is correct
60 Correct 171 ms 32704 KB Output is correct
61 Correct 122 ms 39320 KB Output is correct
62 Correct 126 ms 39420 KB Output is correct
63 Correct 122 ms 39372 KB Output is correct
64 Correct 141 ms 39640 KB Output is correct
65 Correct 236 ms 32968 KB Output is correct
66 Correct 212 ms 32248 KB Output is correct
67 Correct 199 ms 32004 KB Output is correct
68 Correct 126 ms 31196 KB Output is correct
69 Correct 128 ms 31240 KB Output is correct
70 Correct 135 ms 39992 KB Output is correct
71 Correct 144 ms 39204 KB Output is correct
72 Correct 5 ms 9684 KB Output is correct
73 Correct 15 ms 11644 KB Output is correct
74 Correct 16 ms 11728 KB Output is correct
75 Correct 5 ms 9684 KB Output is correct
76 Correct 5 ms 9684 KB Output is correct
77 Correct 14 ms 12496 KB Output is correct
78 Correct 14 ms 11940 KB Output is correct
79 Correct 11 ms 11728 KB Output is correct
80 Correct 13 ms 11776 KB Output is correct
81 Correct 5 ms 9632 KB Output is correct
82 Correct 5 ms 9720 KB Output is correct
83 Correct 5 ms 9644 KB Output is correct
84 Correct 5 ms 9684 KB Output is correct
85 Correct 5 ms 9684 KB Output is correct
86 Correct 26 ms 13052 KB Output is correct
87 Correct 25 ms 13128 KB Output is correct
88 Correct 26 ms 13136 KB Output is correct
89 Correct 14 ms 12548 KB Output is correct
90 Correct 13 ms 11908 KB Output is correct
91 Correct 23 ms 13524 KB Output is correct
92 Correct 23 ms 13420 KB Output is correct
93 Correct 5 ms 9724 KB Output is correct
94 Correct 120 ms 47584 KB Output is correct
95 Correct 123 ms 47164 KB Output is correct
96 Correct 118 ms 46444 KB Output is correct
97 Correct 110 ms 46944 KB Output is correct
98 Correct 115 ms 47564 KB Output is correct
99 Correct 190 ms 32240 KB Output is correct
100 Correct 210 ms 32028 KB Output is correct
101 Correct 200 ms 32020 KB Output is correct
102 Correct 154 ms 32704 KB Output is correct
103 Correct 127 ms 39096 KB Output is correct
104 Correct 125 ms 39364 KB Output is correct
105 Correct 123 ms 39044 KB Output is correct
106 Correct 134 ms 39580 KB Output is correct
107 Correct 142 ms 39304 KB Output is correct
108 Correct 117 ms 46892 KB Output is correct
109 Correct 113 ms 46816 KB Output is correct
110 Correct 120 ms 31984 KB Output is correct
111 Correct 161 ms 32108 KB Output is correct
112 Correct 305 ms 31268 KB Output is correct
113 Correct 207 ms 31300 KB Output is correct