oj.uz

Submission #468444

# Submission time Handle Problem Language Result Execution time Memory
468444 2021-08-28T10:09:22 Z Killer2501 Construction of Highway (JOI18_construction) C++14
100 / 100
 454 ms 164692 KB 
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define task "262144"
#define pll pair<ll, ll>
#define pi pair<ll, pll>
#define fi first
#define se second

using namespace std;
const ll mod = 1e9+7;
const ll N = 2e5+5;
const int base = 350;
const int base2 = 311;
ll n, m, t, k, T, ans, tong, a[N], b[N], c[N], d[N], par[N], fe[N], P[N][19], h[N], cnt, in[N], top[N], nchain[N], chain;
vector<ll> adj[N];
vector<pll> kq;
ll pw(ll k, ll n)
{
    ll total = 1;
    for(; n; n >>= 1)
    {
        if(n & 1)total = total * k % mod;
        k = k * k % mod;
    }
    return total;
}
string s[N];
void add(ll id, ll x)
{
    for(; id <= m; id += id & -id)fe[id] += x;
}
ll get(ll id)
{
    ll total = 0;
    for(; id; id -= id & -id)total += fe[id];
    return total;
}
void dfs(ll u)
{
    d[u] = 1;
    for(ll v : adj[u])
    {
        h[v] = h[u] + 1;
        par[v] = u;
        dfs(v);
        d[u] += d[v];
    }
}
void hld(ll u)
{
    if(!top[chain])top[chain] = u;
    nchain[u] = chain;
    ll big = -1;
    for(ll v: adj[u])
    {
        if(big == -1 || d[v] > d[big])big = v;
    }
    if(big != -1)hld(big);
    for(ll v: adj[u])
    {
        if(v == big)continue;
        ++chain;
        hld(v);
    }
}
deque<pll> st[N];
void fixv()
{
    vector<ll> vi;
    for(pll x: kq)vi.pb(x.se);
    sort(vi.begin(), vi.end());
    vi.erase(unique(vi.begin(), vi.end()), vi.end());
    for(int i = 0; i < kq.size(); i ++)kq[i].se = lower_bound(vi.begin(), vi.end(), kq[i].se)-vi.begin()+1;
    m = vi.size();
}
ll query(ll u, ll val)
{
    //cout << st[nchain[1]].back().se << '\n';
    ll r = u;
    while(u)
    {
        k = nchain[u];
        ll sz = h[u] - h[top[k]] + 1;
        vector<pll> vi;
        while(sz)
        {
            t = min(sz, st[k][0].fi);
            sz -= t;
            vi.pb({t, st[k][0].se});
            //if(u == 1)cout << t << " " << st[k][i].se <<'\n';
            if(t == st[k][0].fi)st[k].pop_front();
            else st[k][0].fi -= t;
        }
        st[k].push_front({h[u] - h[top[k]] + 1, val});
        while(!vi.empty())
        {
            kq.pb(vi.back());
            vi.pop_back();
        }
        u = par[top[k]];
    }
    //cout << r << '\n';
    //for(pll x: kq)cout << x.fi <<" "<<x.se<<'\n';
    fixv();
    ans = 0;
    for(pll x : kq)
    {

        ans += x.fi * get(x.se-1);
        add(x.se, x.fi);
    }
    fill_n(fe, m+1, 0);
    kq.clear();
    return ans;
}
void sol()
{
    cin >> n;
    for(int i = 1; i <= n; i ++)cin >> c[i];
    for(int i = 1; i < n; i ++)
    {
        cin >> a[i] >> b[i];
        adj[a[i]].pb(b[i]);
    }
    dfs(1);
    hld(1);
    st[nchain[1]].pb({1, c[1]});
    for(int i = 1; i < n; i ++)
    {
        cout << query(a[i], c[b[i]]) << '\n';
        k = nchain[b[i]];
        if(!st[k].empty() && st[k].back().se == c[b[i]])
        {
            st[k][st[k].size()-1].fi += 1;
            //cout << "same" << '\n';
        }
        else
        {
            //cout << k << " diff" << '\n';
            st[k].pb({1, c[b[i]]});
        }
    }
}
int main()
{
    if(fopen(task".in", "r"))
    {
       freopen(task".in", "r", stdin);
       freopen(task".out", "w", stdout);
    }
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int ntest = 1;
    //cin >> ntest;
    while(ntest -- > 0)
    sol();
}
/*
1
5
acbac
7
5
acbac
8
acabacba
12
aaaaaaaaaaaa
10
abacabadac
8
dcbaabcd
3
cba
6
sparky

*/

Compilation message

construction.cpp: In function 'void fixv()':
construction.cpp:74:22: 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]
   74 |     for(int i = 0; i < kq.size(); i ++)kq[i].se = lower_bound(vi.begin(), vi.end(), kq[i].se)-vi.begin()+1;
      |                    ~~^~~~~~~~~~~
construction.cpp: In function 'long long int query(long long int, long long int)':
construction.cpp:80:8: warning: unused variable 'r' [-Wunused-variable]
   80 |     ll r = u;
      |        ^
construction.cpp: In function 'int main()':
construction.cpp:149:15: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  149 |        freopen(task".in", "r", stdin);
      |        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
construction.cpp:150:15: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  150 |        freopen(task".out", "w", stdout);
      |        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 92 ms 145860 KB Output is correct
2 Correct 91 ms 145928 KB Output is correct
3 Correct 100 ms 145976 KB Output is correct
4 Correct 105 ms 145988 KB Output is correct
5 Correct 101 ms 146048 KB Output is correct
6 Correct 106 ms 145960 KB Output is correct
7 Correct 99 ms 146024 KB Output is correct
8 Correct 91 ms 146196 KB Output is correct
9 Correct 89 ms 145944 KB Output is correct
10 Correct 93 ms 145940 KB Output is correct
11 Correct 103 ms 146044 KB Output is correct
12 Correct 102 ms 146048 KB Output is correct
13 Correct 104 ms 146184 KB Output is correct
14 Correct 94 ms 145996 KB Output is correct
15 Correct 98 ms 145964 KB Output is correct
16 Correct 103 ms 145984 KB Output is correct
17 Correct 104 ms 146080 KB Output is correct
18 Correct 106 ms 146108 KB Output is correct
19 Correct 93 ms 146028 KB Output is correct
20 Correct 94 ms 145972 KB Output is correct
21 Correct 91 ms 145988 KB Output is correct
22 Correct 102 ms 146116 KB Output is correct
23 Correct 106 ms 145964 KB Output is correct
24 Correct 103 ms 146028 KB Output is correct
25 Correct 103 ms 145988 KB Output is correct
26 Correct 91 ms 145972 KB Output is correct
27 Correct 102 ms 146000 KB Output is correct
28 Correct 104 ms 146116 KB Output is correct
29 Correct 92 ms 146016 KB Output is correct
30 Correct 102 ms 146044 KB Output is correct
31 Correct 105 ms 145964 KB Output is correct
32 Correct 93 ms 146020 KB Output is correct
33 Correct 92 ms 145984 KB Output is correct
34 Correct 94 ms 145988 KB Output is correct
35 Correct 95 ms 145960 KB Output is correct
36 Correct 91 ms 145924 KB Output is correct
37 Correct 95 ms 145988 KB Output is correct
38 Correct 96 ms 145940 KB Output is correct
39 Correct 93 ms 145972 KB Output is correct
40 Correct 94 ms 145964 KB Output is correct
41 Correct 92 ms 145988 KB Output is correct
42 Correct 93 ms 146024 KB Output is correct
43 Correct 94 ms 145928 KB Output is correct
44 Correct 94 ms 146060 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 92 ms 145860 KB Output is correct
2 Correct 91 ms 145928 KB Output is correct
3 Correct 100 ms 145976 KB Output is correct
4 Correct 105 ms 145988 KB Output is correct
5 Correct 101 ms 146048 KB Output is correct
6 Correct 106 ms 145960 KB Output is correct
7 Correct 99 ms 146024 KB Output is correct
8 Correct 91 ms 146196 KB Output is correct
9 Correct 89 ms 145944 KB Output is correct
10 Correct 93 ms 145940 KB Output is correct
11 Correct 103 ms 146044 KB Output is correct
12 Correct 102 ms 146048 KB Output is correct
13 Correct 104 ms 146184 KB Output is correct
14 Correct 94 ms 145996 KB Output is correct
15 Correct 98 ms 145964 KB Output is correct
16 Correct 103 ms 145984 KB Output is correct
17 Correct 104 ms 146080 KB Output is correct
18 Correct 106 ms 146108 KB Output is correct
19 Correct 93 ms 146028 KB Output is correct
20 Correct 94 ms 145972 KB Output is correct
21 Correct 91 ms 145988 KB Output is correct
22 Correct 102 ms 146116 KB Output is correct
23 Correct 106 ms 145964 KB Output is correct
24 Correct 103 ms 146028 KB Output is correct
25 Correct 103 ms 145988 KB Output is correct
26 Correct 91 ms 145972 KB Output is correct
27 Correct 102 ms 146000 KB Output is correct
28 Correct 104 ms 146116 KB Output is correct
29 Correct 92 ms 146016 KB Output is correct
30 Correct 102 ms 146044 KB Output is correct
31 Correct 105 ms 145964 KB Output is correct
32 Correct 93 ms 146020 KB Output is correct
33 Correct 92 ms 145984 KB Output is correct
34 Correct 94 ms 145988 KB Output is correct
35 Correct 95 ms 145960 KB Output is correct
36 Correct 91 ms 145924 KB Output is correct
37 Correct 95 ms 145988 KB Output is correct
38 Correct 96 ms 145940 KB Output is correct
39 Correct 93 ms 145972 KB Output is correct
40 Correct 94 ms 145964 KB Output is correct
41 Correct 92 ms 145988 KB Output is correct
42 Correct 93 ms 146024 KB Output is correct
43 Correct 94 ms 145928 KB Output is correct
44 Correct 94 ms 146060 KB Output is correct
45 Correct 102 ms 146024 KB Output is correct
46 Correct 110 ms 146536 KB Output is correct
47 Correct 107 ms 146540 KB Output is correct
48 Correct 109 ms 146584 KB Output is correct
49 Correct 96 ms 146628 KB Output is correct
50 Correct 93 ms 146624 KB Output is correct
51 Correct 96 ms 146616 KB Output is correct
52 Correct 107 ms 146500 KB Output is correct
53 Correct 107 ms 146612 KB Output is correct
54 Correct 102 ms 146488 KB Output is correct
55 Correct 105 ms 146504 KB Output is correct
56 Correct 96 ms 146348 KB Output is correct
57 Correct 111 ms 146884 KB Output is correct
58 Correct 114 ms 146756 KB Output is correct
59 Correct 110 ms 146752 KB Output is correct
60 Correct 111 ms 146796 KB Output is correct
61 Correct 95 ms 146344 KB Output is correct
62 Correct 98 ms 146452 KB Output is correct
63 Correct 97 ms 146380 KB Output is correct
64 Correct 108 ms 146412 KB Output is correct
65 Correct 110 ms 146512 KB Output is correct
66 Correct 109 ms 146492 KB Output is correct
67 Correct 107 ms 146424 KB Output is correct
68 Correct 96 ms 146536 KB Output is correct
69 Correct 101 ms 146552 KB Output is correct
70 Correct 106 ms 146436 KB Output is correct
71 Correct 97 ms 146372 KB Output is correct
72 Correct 112 ms 146700 KB Output is correct
73 Correct 109 ms 146792 KB Output is correct
74 Correct 96 ms 146420 KB Output is correct
75 Correct 99 ms 146320 KB Output is correct
76 Correct 97 ms 146244 KB Output is correct
77 Correct 98 ms 146308 KB Output is correct
78 Correct 90 ms 146284 KB Output is correct
79 Correct 100 ms 146296 KB Output is correct
80 Correct 98 ms 146284 KB Output is correct
81 Correct 94 ms 146372 KB Output is correct
82 Correct 92 ms 146372 KB Output is correct
83 Correct 98 ms 146308 KB Output is correct
84 Correct 95 ms 146252 KB Output is correct
85 Correct 96 ms 146240 KB Output is correct
86 Correct 98 ms 146244 KB Output is correct

Subtask #3
84.0 / 84.0

# Verdict Execution time Memory Grader output
1 Correct 92 ms 145860 KB Output is correct
2 Correct 91 ms 145928 KB Output is correct
3 Correct 100 ms 145976 KB Output is correct
4 Correct 105 ms 145988 KB Output is correct
5 Correct 101 ms 146048 KB Output is correct
6 Correct 106 ms 145960 KB Output is correct
7 Correct 99 ms 146024 KB Output is correct
8 Correct 91 ms 146196 KB Output is correct
9 Correct 89 ms 145944 KB Output is correct
10 Correct 93 ms 145940 KB Output is correct
11 Correct 103 ms 146044 KB Output is correct
12 Correct 102 ms 146048 KB Output is correct
13 Correct 104 ms 146184 KB Output is correct
14 Correct 94 ms 145996 KB Output is correct
15 Correct 98 ms 145964 KB Output is correct
16 Correct 103 ms 145984 KB Output is correct
17 Correct 104 ms 146080 KB Output is correct
18 Correct 106 ms 146108 KB Output is correct
19 Correct 93 ms 146028 KB Output is correct
20 Correct 94 ms 145972 KB Output is correct
21 Correct 91 ms 145988 KB Output is correct
22 Correct 102 ms 146116 KB Output is correct
23 Correct 106 ms 145964 KB Output is correct
24 Correct 103 ms 146028 KB Output is correct
25 Correct 103 ms 145988 KB Output is correct
26 Correct 91 ms 145972 KB Output is correct
27 Correct 102 ms 146000 KB Output is correct
28 Correct 104 ms 146116 KB Output is correct
29 Correct 92 ms 146016 KB Output is correct
30 Correct 102 ms 146044 KB Output is correct
31 Correct 105 ms 145964 KB Output is correct
32 Correct 93 ms 146020 KB Output is correct
33 Correct 92 ms 145984 KB Output is correct
34 Correct 94 ms 145988 KB Output is correct
35 Correct 95 ms 145960 KB Output is correct
36 Correct 91 ms 145924 KB Output is correct
37 Correct 95 ms 145988 KB Output is correct
38 Correct 96 ms 145940 KB Output is correct
39 Correct 93 ms 145972 KB Output is correct
40 Correct 94 ms 145964 KB Output is correct
41 Correct 92 ms 145988 KB Output is correct
42 Correct 93 ms 146024 KB Output is correct
43 Correct 94 ms 145928 KB Output is correct
44 Correct 94 ms 146060 KB Output is correct
45 Correct 102 ms 146024 KB Output is correct
46 Correct 110 ms 146536 KB Output is correct
47 Correct 107 ms 146540 KB Output is correct
48 Correct 109 ms 146584 KB Output is correct
49 Correct 96 ms 146628 KB Output is correct
50 Correct 93 ms 146624 KB Output is correct
51 Correct 96 ms 146616 KB Output is correct
52 Correct 107 ms 146500 KB Output is correct
53 Correct 107 ms 146612 KB Output is correct
54 Correct 102 ms 146488 KB Output is correct
55 Correct 105 ms 146504 KB Output is correct
56 Correct 96 ms 146348 KB Output is correct
57 Correct 111 ms 146884 KB Output is correct
58 Correct 114 ms 146756 KB Output is correct
59 Correct 110 ms 146752 KB Output is correct
60 Correct 111 ms 146796 KB Output is correct
61 Correct 95 ms 146344 KB Output is correct
62 Correct 98 ms 146452 KB Output is correct
63 Correct 97 ms 146380 KB Output is correct
64 Correct 108 ms 146412 KB Output is correct
65 Correct 110 ms 146512 KB Output is correct
66 Correct 109 ms 146492 KB Output is correct
67 Correct 107 ms 146424 KB Output is correct
68 Correct 96 ms 146536 KB Output is correct
69 Correct 101 ms 146552 KB Output is correct
70 Correct 106 ms 146436 KB Output is correct
71 Correct 97 ms 146372 KB Output is correct
72 Correct 112 ms 146700 KB Output is correct
73 Correct 109 ms 146792 KB Output is correct
74 Correct 96 ms 146420 KB Output is correct
75 Correct 99 ms 146320 KB Output is correct
76 Correct 97 ms 146244 KB Output is correct
77 Correct 98 ms 146308 KB Output is correct
78 Correct 90 ms 146284 KB Output is correct
79 Correct 100 ms 146296 KB Output is correct
80 Correct 98 ms 146284 KB Output is correct
81 Correct 94 ms 146372 KB Output is correct
82 Correct 92 ms 146372 KB Output is correct
83 Correct 98 ms 146308 KB Output is correct
84 Correct 95 ms 146252 KB Output is correct
85 Correct 96 ms 146240 KB Output is correct
86 Correct 98 ms 146244 KB Output is correct
87 Correct 122 ms 147352 KB Output is correct
88 Correct 155 ms 150340 KB Output is correct
89 Correct 312 ms 160636 KB Output is correct
90 Correct 317 ms 160760 KB Output is correct
91 Correct 319 ms 160704 KB Output is correct
92 Correct 175 ms 163052 KB Output is correct
93 Correct 183 ms 163036 KB Output is correct
94 Correct 176 ms 163140 KB Output is correct
95 Correct 189 ms 161308 KB Output is correct
96 Correct 201 ms 161884 KB Output is correct
97 Correct 201 ms 161640 KB Output is correct
98 Correct 192 ms 161724 KB Output is correct
99 Correct 187 ms 159024 KB Output is correct
100 Correct 372 ms 164320 KB Output is correct
101 Correct 444 ms 164668 KB Output is correct
102 Correct 438 ms 164548 KB Output is correct
103 Correct 454 ms 164692 KB Output is correct
104 Correct 195 ms 158916 KB Output is correct
105 Correct 211 ms 158880 KB Output is correct
106 Correct 194 ms 158916 KB Output is correct
107 Correct 295 ms 159932 KB Output is correct
108 Correct 319 ms 160040 KB Output is correct
109 Correct 312 ms 160296 KB Output is correct
110 Correct 171 ms 162628 KB Output is correct
111 Correct 187 ms 161296 KB Output is correct
112 Correct 190 ms 161084 KB Output is correct
113 Correct 177 ms 158276 KB Output is correct
114 Correct 369 ms 164292 KB Output is correct
115 Correct 441 ms 163908 KB Output is correct
116 Correct 186 ms 158296 KB Output is correct
117 Correct 183 ms 157020 KB Output is correct
118 Correct 185 ms 156484 KB Output is correct
119 Correct 187 ms 156284 KB Output is correct
120 Correct 182 ms 156612 KB Output is correct
121 Correct 189 ms 156176 KB Output is correct
122 Correct 192 ms 155908 KB Output is correct
123 Correct 201 ms 157132 KB Output is correct
124 Correct 204 ms 156608 KB Output is correct
125 Correct 210 ms 156292 KB Output is correct
126 Correct 198 ms 156820 KB Output is correct
127 Correct 198 ms 156272 KB Output is correct
128 Correct 203 ms 155924 KB Output is correct