oj.uz

Submission #464210

# Submission time Handle Problem Language Result Execution time Memory
464210 2021-08-12T13:57:00 Z idas Railway (BOI17_railway) C++11
100 / 100
 269 ms 54540 KB 
#include <bits/stdc++.h>
#define FOR(i, begin, end) for(int i = (begin); i < (end); i++)
#define FAST_IO ios_base::sync_with_stdio(false); cin.tie(nullptr)
#define F first
#define S second
#define PB push_back
#define MP make_pair

using namespace std;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef long long ll;

const int INF=1e9;

void setIO()
{
    FAST_IO;
}

void setIO(string s)
{
    FAST_IO;
    freopen((s+".in").c_str(), "r", stdin);
    freopen((s+".out").c_str(), "w", stdout);
}

const int N=1e5+10, M=5e4+10, L=27;

int n, m, k, cnt[N], par[N][L], dp[N];
vi ad[N], b[N];
map<pii, int> pth, con;

int id;
vi row[M];
unordered_set<int> in[M];
vector<pii> inf[M];
void ord(int u, int pst)
{
    for(auto x : b[u]){
        inf[x].PB({id, u});
    }
    id++;
    for(auto it : ad[u]){
        if(it==pst) continue;
        ord(it, u);
    }
}

void pre(int u, int pst)
{
    for(auto it : ad[u]){
        if(it==pst) continue;
        par[it][0]=u;
        dp[it]=dp[u]+1;
        pre(it, u);
    }
}

int lift(int p, int x)
{
    FOR(i, 0, L) if(x&(1<<i))
    {
        p=par[p][i];
    }
    return p;
}

int lca(int a, int b)
{
    if(dp[a]>dp[b]) swap(a, b);
    int dif=dp[b]-dp[a];
    b=lift(b, dif);
    if(a==b) return a;
    for(int i=L-1; i>=0; i--){
        if(par[a][i]!=par[b][i]){
            a=par[a][i];
            b=par[b][i];
        }
    }
    return par[a][0];
}

int sms(int u, int pst)
{
    int tot=0;
    for(auto it : ad[u]){
        if(it==pst) continue;
        int k=sms(it, u);
        pth[{min(u, it), max(u, it)}]+=k;
        tot+=k;
    }
    return tot+cnt[u];
}

int main()
{
    setIO();
    cin >> n >> m >> k;
    FOR(i, 0, n-1)
    {
        int a, b;
        cin >> a >> b;
        ad[a-1].PB(b-1);
        ad[b-1].PB(a-1);
        con[{min(a-1, b-1), max(a-1, b-1)}]=i+1;
    }

    pre(0, -1);
    FOR(i, 1, L)
    {
        FOR(j, 0, n)
        {
            par[j][i]=par[par[j][i-1]][i-1];
        }
    }

    FOR(i, 0, m)
    {
        int s; cin >> s;
        FOR(j, 0, s)
        {
            int x; cin >> x;
            cnt[x-1]++;
            b[x-1].PB(i);
        }
    }

    ord(0, -1);

    FOR(i, 0, m)
    {
        sort(inf[i].begin(), inf[i].end());
        FOR(j, 0, inf[i].size())
        {
            int b=lca(inf[i][j].S, inf[i][(j+1)%(int)inf[i].size()].S);
            cnt[b]--;
        }
    }

    sms(0, -1);

    vi ans;
    for(auto it : pth){
        if(it.S>=k){
            ans.PB(con[{min(it.F.F, it.F.S), max(it.F.F, it.F.S)}]);
        }
    }

    cout << ans.size() << '\n';
    for(auto x : ans){
        cout << x << " ";
    }
}

Compilation message

railway.cpp: In function 'int main()':
railway.cpp:2:51: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    2 | #define FOR(i, begin, end) for(int i = (begin); i < (end); i++)
      |                                                   ^
railway.cpp:134:9: note: in expansion of macro 'FOR'
  134 |         FOR(j, 0, inf[i].size())
      |         ^~~
railway.cpp: In function 'void setIO(std::string)':
railway.cpp:24:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   24 |     freopen((s+".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
railway.cpp:25:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   25 |     freopen((s+".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 10060 KB Output is correct
2 Correct 16 ms 12876 KB Output is correct
3 Correct 16 ms 12936 KB Output is correct
4 Correct 6 ms 10108 KB Output is correct
5 Correct 6 ms 10060 KB Output is correct
6 Correct 18 ms 13572 KB Output is correct
7 Correct 17 ms 13120 KB Output is correct
8 Correct 15 ms 12936 KB Output is correct
9 Correct 16 ms 12984 KB Output is correct
10 Correct 6 ms 10060 KB Output is correct
11 Correct 7 ms 10188 KB Output is correct
12 Correct 6 ms 10060 KB Output is correct
13 Correct 6 ms 10060 KB Output is correct
14 Correct 6 ms 10060 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 10060 KB Output is correct
2 Correct 16 ms 12876 KB Output is correct
3 Correct 16 ms 12936 KB Output is correct
4 Correct 6 ms 10108 KB Output is correct
5 Correct 6 ms 10060 KB Output is correct
6 Correct 18 ms 13572 KB Output is correct
7 Correct 17 ms 13120 KB Output is correct
8 Correct 15 ms 12936 KB Output is correct
9 Correct 16 ms 12984 KB Output is correct
10 Correct 6 ms 10060 KB Output is correct
11 Correct 7 ms 10188 KB Output is correct
12 Correct 6 ms 10060 KB Output is correct
13 Correct 6 ms 10060 KB Output is correct
14 Correct 6 ms 10060 KB Output is correct
15 Correct 39 ms 14880 KB Output is correct
16 Correct 40 ms 14908 KB Output is correct
17 Correct 40 ms 14916 KB Output is correct
18 Correct 17 ms 13576 KB Output is correct
19 Correct 17 ms 13060 KB Output is correct
20 Correct 45 ms 15292 KB Output is correct
21 Correct 49 ms 15104 KB Output is correct
22 Correct 7 ms 10060 KB Output is correct
23 Correct 16 ms 12916 KB Output is correct
24 Correct 17 ms 12876 KB Output is correct
25 Correct 6 ms 10108 KB Output is correct
26 Correct 7 ms 10112 KB Output is correct
27 Correct 17 ms 13516 KB Output is correct
28 Correct 16 ms 13092 KB Output is correct
29 Correct 16 ms 12936 KB Output is correct
30 Correct 16 ms 12932 KB Output is correct
31 Correct 6 ms 10060 KB Output is correct
32 Correct 6 ms 10060 KB Output is correct
33 Correct 7 ms 10080 KB Output is correct
34 Correct 6 ms 10060 KB Output is correct
35 Correct 6 ms 10060 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 216 ms 54280 KB Output is correct
2 Correct 6 ms 10004 KB Output is correct
3 Correct 217 ms 53968 KB Output is correct
4 Correct 207 ms 53328 KB Output is correct
5 Correct 226 ms 54088 KB Output is correct
6 Correct 207 ms 54508 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 180 ms 46344 KB Output is correct
2 Correct 229 ms 41652 KB Output is correct
3 Correct 224 ms 41164 KB Output is correct
4 Correct 227 ms 41228 KB Output is correct
5 Correct 242 ms 41164 KB Output is correct
6 Correct 184 ms 46536 KB Output is correct
7 Correct 185 ms 46404 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 180 ms 46344 KB Output is correct
2 Correct 229 ms 41652 KB Output is correct
3 Correct 224 ms 41164 KB Output is correct
4 Correct 227 ms 41228 KB Output is correct
5 Correct 242 ms 41164 KB Output is correct
6 Correct 184 ms 46536 KB Output is correct
7 Correct 185 ms 46404 KB Output is correct
8 Correct 201 ms 47232 KB Output is correct
9 Correct 194 ms 47188 KB Output is correct
10 Correct 210 ms 53700 KB Output is correct
11 Correct 205 ms 53532 KB Output is correct
12 Correct 188 ms 41572 KB Output is correct
13 Correct 177 ms 41680 KB Output is correct
14 Correct 214 ms 40904 KB Output is correct
15 Correct 223 ms 40864 KB Output is correct
16 Correct 217 ms 41132 KB Output is correct
17 Correct 220 ms 41112 KB Output is correct
18 Correct 224 ms 41168 KB Output is correct
19 Correct 211 ms 41700 KB Output is correct
20 Correct 180 ms 46772 KB Output is correct
21 Correct 193 ms 46792 KB Output is correct
22 Correct 189 ms 46764 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 10060 KB Output is correct
2 Correct 16 ms 12876 KB Output is correct
3 Correct 16 ms 12936 KB Output is correct
4 Correct 6 ms 10108 KB Output is correct
5 Correct 6 ms 10060 KB Output is correct
6 Correct 18 ms 13572 KB Output is correct
7 Correct 17 ms 13120 KB Output is correct
8 Correct 15 ms 12936 KB Output is correct
9 Correct 16 ms 12984 KB Output is correct
10 Correct 6 ms 10060 KB Output is correct
11 Correct 7 ms 10188 KB Output is correct
12 Correct 6 ms 10060 KB Output is correct
13 Correct 6 ms 10060 KB Output is correct
14 Correct 6 ms 10060 KB Output is correct
15 Correct 39 ms 14880 KB Output is correct
16 Correct 40 ms 14908 KB Output is correct
17 Correct 40 ms 14916 KB Output is correct
18 Correct 17 ms 13576 KB Output is correct
19 Correct 17 ms 13060 KB Output is correct
20 Correct 45 ms 15292 KB Output is correct
21 Correct 49 ms 15104 KB Output is correct
22 Correct 7 ms 10060 KB Output is correct
23 Correct 16 ms 12916 KB Output is correct
24 Correct 17 ms 12876 KB Output is correct
25 Correct 6 ms 10108 KB Output is correct
26 Correct 7 ms 10112 KB Output is correct
27 Correct 17 ms 13516 KB Output is correct
28 Correct 16 ms 13092 KB Output is correct
29 Correct 16 ms 12936 KB Output is correct
30 Correct 16 ms 12932 KB Output is correct
31 Correct 6 ms 10060 KB Output is correct
32 Correct 6 ms 10060 KB Output is correct
33 Correct 7 ms 10080 KB Output is correct
34 Correct 6 ms 10060 KB Output is correct
35 Correct 6 ms 10060 KB Output is correct
36 Correct 216 ms 54280 KB Output is correct
37 Correct 6 ms 10004 KB Output is correct
38 Correct 217 ms 53968 KB Output is correct
39 Correct 207 ms 53328 KB Output is correct
40 Correct 226 ms 54088 KB Output is correct
41 Correct 207 ms 54508 KB Output is correct
42 Correct 180 ms 46344 KB Output is correct
43 Correct 229 ms 41652 KB Output is correct
44 Correct 224 ms 41164 KB Output is correct
45 Correct 227 ms 41228 KB Output is correct
46 Correct 242 ms 41164 KB Output is correct
47 Correct 184 ms 46536 KB Output is correct
48 Correct 185 ms 46404 KB Output is correct
49 Correct 201 ms 47232 KB Output is correct
50 Correct 194 ms 47188 KB Output is correct
51 Correct 210 ms 53700 KB Output is correct
52 Correct 205 ms 53532 KB Output is correct
53 Correct 188 ms 41572 KB Output is correct
54 Correct 177 ms 41680 KB Output is correct
55 Correct 214 ms 40904 KB Output is correct
56 Correct 223 ms 40864 KB Output is correct
57 Correct 217 ms 41132 KB Output is correct
58 Correct 220 ms 41112 KB Output is correct
59 Correct 224 ms 41168 KB Output is correct
60 Correct 211 ms 41700 KB Output is correct
61 Correct 180 ms 46772 KB Output is correct
62 Correct 193 ms 46792 KB Output is correct
63 Correct 189 ms 46764 KB Output is correct
64 Correct 194 ms 47512 KB Output is correct
65 Correct 269 ms 42616 KB Output is correct
66 Correct 238 ms 42192 KB Output is correct
67 Correct 226 ms 41928 KB Output is correct
68 Correct 160 ms 40668 KB Output is correct
69 Correct 171 ms 40708 KB Output is correct
70 Correct 212 ms 47696 KB Output is correct
71 Correct 192 ms 47212 KB Output is correct
72 Correct 7 ms 10060 KB Output is correct
73 Correct 17 ms 12868 KB Output is correct
74 Correct 17 ms 12980 KB Output is correct
75 Correct 6 ms 10060 KB Output is correct
76 Correct 7 ms 10020 KB Output is correct
77 Correct 18 ms 13612 KB Output is correct
78 Correct 17 ms 13004 KB Output is correct
79 Correct 18 ms 13004 KB Output is correct
80 Correct 15 ms 13004 KB Output is correct
81 Correct 6 ms 10060 KB Output is correct
82 Correct 6 ms 10060 KB Output is correct
83 Correct 6 ms 10060 KB Output is correct
84 Correct 6 ms 10060 KB Output is correct
85 Correct 6 ms 10108 KB Output is correct
86 Correct 39 ms 14932 KB Output is correct
87 Correct 39 ms 14876 KB Output is correct
88 Correct 40 ms 14924 KB Output is correct
89 Correct 17 ms 13576 KB Output is correct
90 Correct 17 ms 13124 KB Output is correct
91 Correct 47 ms 15268 KB Output is correct
92 Correct 44 ms 15140 KB Output is correct
93 Correct 7 ms 10108 KB Output is correct
94 Correct 221 ms 54340 KB Output is correct
95 Correct 229 ms 53968 KB Output is correct
96 Correct 207 ms 53316 KB Output is correct
97 Correct 269 ms 54036 KB Output is correct
98 Correct 214 ms 54540 KB Output is correct
99 Correct 227 ms 41284 KB Output is correct
100 Correct 227 ms 41156 KB Output is correct
101 Correct 249 ms 41088 KB Output is correct
102 Correct 215 ms 41728 KB Output is correct
103 Correct 183 ms 46504 KB Output is correct
104 Correct 183 ms 46784 KB Output is correct
105 Correct 178 ms 46440 KB Output is correct
106 Correct 192 ms 47428 KB Output is correct
107 Correct 185 ms 47172 KB Output is correct
108 Correct 202 ms 53564 KB Output is correct
109 Correct 208 ms 53524 KB Output is correct
110 Correct 179 ms 41712 KB Output is correct
111 Correct 170 ms 41688 KB Output is correct
112 Correct 222 ms 40904 KB Output is correct
113 Correct 218 ms 41008 KB Output is correct