oj.uz

답안 #491188

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
491188 2021-11-30T17:22:32 Z Carmel_Ab1 Railway (BOI17_railway) C++17
100 / 100
 365 ms 76256 KB 
#include<bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

//using namespace __gnu_pbds;
using namespace std;

typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef vector<pl> vpl;
typedef vector<ld> vld;
typedef pair<ld, ld> pld;
typedef vector<pi> vpi;

//typedef tree<ll, null_type, less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
template<typename T>
ostream &operator<<(ostream &os, vector<T> &a) {
    os << "[";
    for (int i = 0; i < ll(a.size()); i++) { os << a[i] << ((i != ll(a.size() - 1) ? " " : "")); }
    os << "]\n";
    return os;
}

#define all(x) x.begin(),x.end()
#define YES out("YES")
#define NO out("NO")
#define out(x){cout << x << "\n"; return;}
#define GLHF ios_base::sync_with_stdio(false); cin.tie(NULL);cout.tie(NULL)
#define print(x){for(auto ait:x) cout << ait << " "; cout << "\n";}
#define pb push_back
#define umap unordered_map

template<typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
    is >> p.first >> p.second;
    return is;
}

template<typename T1, typename T2>
ostream &operator<<(ostream &os, pair<T1, T2> &p) {
    os << "" << p.first << " " << p.second << "";
    return os;
}

void usaco(string taskname) {
    string fin = taskname + ".in";
    string fout = taskname + ".out";
    const char *FIN = fin.c_str();
    const char *FOUT = fout.c_str();
    freopen(FIN, "r", stdin);
    freopen(FOUT, "w", stdout);
}

template<typename T>
void read(vector<T> &v) {
    int n = v.size();
    for (int i = 0; i < n; i++)
        cin >> v[i];
}

template<typename T>
vector<T> UNQ(vector<T> a) {
    vector<T> ans;
    for (T t: a)
        if (ans.empty() || t != ans.back())
            ans.push_back(t);
    return ans;
}

ll ceil(ll a, ll b) {
    ll ans = a / b;
    if (a % b)ans++;
    return ans;
}

ld log(ld a, ld b) { return log(b) / log(a); }

ll power(ll base, ll exp, ll M = 1e18) {//(base^exp)%M
    ll ans = 1;
    while (exp) {
        if (exp % 2 == 1)ans = ((ans % M) * (base % M)) % M;
        base = ((base % M) * (base % M)) % M;
        exp /= 2;
    }
    return ans;
}

string to_base(int n, int new_base) {
    string s;
    int nn = n;
    while (nn) {
        s += to_string(nn % new_base);
        nn /= new_base;
    }
    reverse(all(s));
    return s;
}

ll gcd(ll a, ll b) {
    if (a < b)swap(a, b);
    if (b == 0)return a;
    return gcd(b, a % b);
}

ll lcm(ll a, ll b) {
    ll x = (a / gcd(a, b));
    return b * x;
}

vl generate_array(ll n, ll mn = 1, ll mx = 1e18 + 1) {
    if (mx == 1e18 + 1)
        mx = n;
    vl ans(n);
    for (int i = 0; i < n; i++)
        ans[i] = (mn + rand() % (mx - mn + 1));
    return ans;
}

string substr(string s, int l, int r) {
    string ans;
    for (int i = l; i <= r; i++)
        ans += s[i];
    return ans;
}


void solve();

int main() {
    GLHF;
    int t = 1;
    //cin >> t;
    while (t--)
        solve();
}

int n,m,k;
vvi g,colors;
vi d,up,limit;

vector<map<int,int>>cnt;
vector<set<int>>ok;

void dfs(int src,int par){
    up[src]=par;

    for(int nbr:g[src]) {
        if (nbr == par)
            continue;
        dfs(nbr, src);
    }

    for(int nbr:g[src]){
        if (nbr == par)
            continue;
        if(cnt[src].size()<cnt[nbr].size())
            swap(cnt[src],cnt[nbr]);
        if(ok[src].size()<ok[nbr].size())
            swap(ok[src],ok[nbr]);

        for(int x:ok[nbr])
            ok[src].insert(x);
        for(auto x:cnt[nbr]) {
            cnt[src][x.first] += x.second;
            if(cnt[src][x.first]==limit[x.first])
                ok[src].erase(x.first);
        }
    }

    for(int c:colors[src])
        cnt[src][c]++;

    for(int c:colors[src]){
        if (cnt[src][c] >= limit[c])
            ok[src].erase(c);
        else if(cnt[src][c]==1)
            ok[src].insert(c);
    }

    d[src]=int(ok[src].size());
}
void solve() {
    cin >> n >> m >> k;
    g.resize(n+1);
    colors.resize(n+1);

    map<pi,int>id;
    for(int i=0; i<n-1; i++){
        int u,v;
        cin >> u >> v;
        g[u].pb(v);
        g[v].pb(u);

        id[{u,v}]=id[{v,u}]=i+1;
    }

    limit.resize(m+1);

    for(int i=1; i<=m; i++){
        int len;
        cin >> len;
        limit[i]=len;
        for(int j=0; j<len; j++){
            int x;
            cin >> x;
            colors[x].pb(i);
        }
    }

    ok.resize(n+1);
    up.resize(n+1);
    cnt.resize(n+1);
    d.resize(n+1);
    dfs(1,-1);

    vi ans;
    for(int i=2; i<=n; i++)
        if(d[i]>=k)
            ans.pb(id[{i,up[i]}]);
    sort(all(ans));
    cout << ans.size() << "\n";
    print(ans)
}

Compilation message

railway.cpp: In function 'void usaco(std::string)':
railway.cpp:57:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   57 |     freopen(FIN, "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~
railway.cpp:58:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   58 |     freopen(FOUT, "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 10 ms 3692 KB Output is correct
3 Correct 11 ms 3660 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 9 ms 4372 KB Output is correct
7 Correct 11 ms 3860 KB Output is correct
8 Correct 10 ms 3788 KB Output is correct
9 Correct 11 ms 4044 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 10 ms 3692 KB Output is correct
3 Correct 11 ms 3660 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 9 ms 4372 KB Output is correct
7 Correct 11 ms 3860 KB Output is correct
8 Correct 10 ms 3788 KB Output is correct
9 Correct 11 ms 4044 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 57 ms 11312 KB Output is correct
16 Correct 54 ms 11336 KB Output is correct
17 Correct 57 ms 11432 KB Output is correct
18 Correct 11 ms 4520 KB Output is correct
19 Correct 11 ms 3916 KB Output is correct
20 Correct 67 ms 14276 KB Output is correct
21 Correct 63 ms 14172 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 10 ms 3696 KB Output is correct
24 Correct 10 ms 3660 KB Output is correct
25 Correct 0 ms 204 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 10 ms 4428 KB Output is correct
28 Correct 10 ms 3780 KB Output is correct
29 Correct 10 ms 3856 KB Output is correct
30 Correct 10 ms 3912 KB Output is correct
31 Correct 0 ms 204 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 0 ms 204 KB Output is correct
35 Correct 0 ms 204 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 203 ms 53676 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 195 ms 53328 KB Output is correct
4 Correct 174 ms 52804 KB Output is correct
5 Correct 153 ms 50848 KB Output is correct
6 Correct 178 ms 50520 KB Output is correct

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 202 ms 46916 KB Output is correct
2 Correct 278 ms 46960 KB Output is correct
3 Correct 279 ms 58216 KB Output is correct
4 Correct 308 ms 58028 KB Output is correct
5 Correct 298 ms 58692 KB Output is correct
6 Correct 204 ms 47940 KB Output is correct
7 Correct 215 ms 47868 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 202 ms 46916 KB Output is correct
2 Correct 278 ms 46960 KB Output is correct
3 Correct 279 ms 58216 KB Output is correct
4 Correct 308 ms 58028 KB Output is correct
5 Correct 298 ms 58692 KB Output is correct
6 Correct 204 ms 47940 KB Output is correct
7 Correct 215 ms 47868 KB Output is correct
8 Correct 197 ms 48156 KB Output is correct
9 Correct 190 ms 47612 KB Output is correct
10 Correct 133 ms 51124 KB Output is correct
11 Correct 132 ms 51152 KB Output is correct
12 Correct 165 ms 44048 KB Output is correct
13 Correct 158 ms 43972 KB Output is correct
14 Correct 248 ms 48516 KB Output is correct
15 Correct 243 ms 49092 KB Output is correct
16 Correct 283 ms 60408 KB Output is correct
17 Correct 316 ms 61276 KB Output is correct
18 Correct 282 ms 56788 KB Output is correct
19 Correct 268 ms 48828 KB Output is correct
20 Correct 228 ms 48256 KB Output is correct
21 Correct 205 ms 48396 KB Output is correct
22 Correct 210 ms 48428 KB Output is correct

Subtask #6
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 10 ms 3692 KB Output is correct
3 Correct 11 ms 3660 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 9 ms 4372 KB Output is correct
7 Correct 11 ms 3860 KB Output is correct
8 Correct 10 ms 3788 KB Output is correct
9 Correct 11 ms 4044 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 57 ms 11312 KB Output is correct
16 Correct 54 ms 11336 KB Output is correct
17 Correct 57 ms 11432 KB Output is correct
18 Correct 11 ms 4520 KB Output is correct
19 Correct 11 ms 3916 KB Output is correct
20 Correct 67 ms 14276 KB Output is correct
21 Correct 63 ms 14172 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 10 ms 3696 KB Output is correct
24 Correct 10 ms 3660 KB Output is correct
25 Correct 0 ms 204 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 10 ms 4428 KB Output is correct
28 Correct 10 ms 3780 KB Output is correct
29 Correct 10 ms 3856 KB Output is correct
30 Correct 10 ms 3912 KB Output is correct
31 Correct 0 ms 204 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 0 ms 204 KB Output is correct
35 Correct 0 ms 204 KB Output is correct
36 Correct 203 ms 53676 KB Output is correct
37 Correct 0 ms 204 KB Output is correct
38 Correct 195 ms 53328 KB Output is correct
39 Correct 174 ms 52804 KB Output is correct
40 Correct 153 ms 50848 KB Output is correct
41 Correct 178 ms 50520 KB Output is correct
42 Correct 202 ms 46916 KB Output is correct
43 Correct 278 ms 46960 KB Output is correct
44 Correct 279 ms 58216 KB Output is correct
45 Correct 308 ms 58028 KB Output is correct
46 Correct 298 ms 58692 KB Output is correct
47 Correct 204 ms 47940 KB Output is correct
48 Correct 215 ms 47868 KB Output is correct
49 Correct 197 ms 48156 KB Output is correct
50 Correct 190 ms 47612 KB Output is correct
51 Correct 133 ms 51124 KB Output is correct
52 Correct 132 ms 51152 KB Output is correct
53 Correct 165 ms 44048 KB Output is correct
54 Correct 158 ms 43972 KB Output is correct
55 Correct 248 ms 48516 KB Output is correct
56 Correct 243 ms 49092 KB Output is correct
57 Correct 283 ms 60408 KB Output is correct
58 Correct 316 ms 61276 KB Output is correct
59 Correct 282 ms 56788 KB Output is correct
60 Correct 268 ms 48828 KB Output is correct
61 Correct 228 ms 48256 KB Output is correct
62 Correct 205 ms 48396 KB Output is correct
63 Correct 210 ms 48428 KB Output is correct
64 Correct 206 ms 48764 KB Output is correct
65 Correct 365 ms 76256 KB Output is correct
66 Correct 319 ms 66748 KB Output is correct
67 Correct 278 ms 57036 KB Output is correct
68 Correct 169 ms 40132 KB Output is correct
69 Correct 160 ms 40256 KB Output is correct
70 Correct 267 ms 50260 KB Output is correct
71 Correct 194 ms 47684 KB Output is correct
72 Correct 1 ms 204 KB Output is correct
73 Correct 9 ms 3576 KB Output is correct
74 Correct 11 ms 3688 KB Output is correct
75 Correct 1 ms 204 KB Output is correct
76 Correct 0 ms 204 KB Output is correct
77 Correct 14 ms 4460 KB Output is correct
78 Correct 9 ms 3788 KB Output is correct
79 Correct 9 ms 3916 KB Output is correct
80 Correct 11 ms 4044 KB Output is correct
81 Correct 0 ms 204 KB Output is correct
82 Correct 1 ms 204 KB Output is correct
83 Correct 1 ms 204 KB Output is correct
84 Correct 1 ms 204 KB Output is correct
85 Correct 1 ms 312 KB Output is correct
86 Correct 55 ms 11324 KB Output is correct
87 Correct 58 ms 11360 KB Output is correct
88 Correct 56 ms 11404 KB Output is correct
89 Correct 11 ms 4556 KB Output is correct
90 Correct 10 ms 3916 KB Output is correct
91 Correct 70 ms 14308 KB Output is correct
92 Correct 71 ms 14276 KB Output is correct
93 Correct 1 ms 204 KB Output is correct
94 Correct 196 ms 54524 KB Output is correct
95 Correct 186 ms 54084 KB Output is correct
96 Correct 171 ms 53604 KB Output is correct
97 Correct 143 ms 51584 KB Output is correct
98 Correct 141 ms 51516 KB Output is correct
99 Correct 314 ms 66080 KB Output is correct
100 Correct 324 ms 60136 KB Output is correct
101 Correct 301 ms 60820 KB Output is correct
102 Correct 265 ms 47792 KB Output is correct
103 Correct 260 ms 48068 KB Output is correct
104 Correct 207 ms 48496 KB Output is correct
105 Correct 199 ms 47760 KB Output is correct
106 Correct 187 ms 47832 KB Output is correct
107 Correct 191 ms 47816 KB Output is correct
108 Correct 140 ms 51188 KB Output is correct
109 Correct 128 ms 51160 KB Output is correct
110 Correct 155 ms 44076 KB Output is correct
111 Correct 162 ms 44064 KB Output is correct
112 Correct 229 ms 48288 KB Output is correct
113 Correct 224 ms 48240 KB Output is correct