oj.uz

Submission #961330

# Submission time Handle Problem Language Result Execution time Memory
961330 2024-04-11T20:20:44 Z Ice_man Construction of Highway (JOI18_construction) C++14
100 / 100
 743 ms 35932 KB 
/**
 ____    ____    ____    __________________    ____    ____    ____
||I ||  ||c ||  ||e ||  ||                ||  ||M ||  ||a ||  ||n ||
||__||  ||__||  ||__||  ||________________||  ||__||  ||__||  ||__||
|/__\|  |/__\|  |/__\|  |/________________\|  |/__\|  |/__\|  |/__\|

*/

#include <iostream>
#include <chrono>
#include <algorithm>
#include <map>
#include <vector>

#define maxn 200005
#define maxlog 20
#define INF 1000000010
#define LINF 1000000000000000005
#define endl '\n'
#define pb(x) push_back(x)
#define X first
#define Y second
#define control cerr<<"passed"<<endl;

//#pragma GCC optimize("O3" , "Ofast" , "unroll-loops" , "fast-math")
//#pragma GCC target("avx2")

using namespace std;

/**std::chrono::high_resolution_clock::time_point startT, currT;
constexpr double TIME_MULT = 1;

double timePassed()
{
    using namespace std::chrono;
    currT = high_resolution_clock::now();
    double time = duration_cast<duration<double>>(currT - startT).count();
    return time * TIME_MULT;
}*/

typedef pair <int , int> pii;

pii _merge(pii e1 , pii e2)
{
    return {min(e1.X , e2.X) , max(e1.Y , e2.Y)};
}

int n;
vector <int> v[maxn];
int c[maxn];
int pom;
int x[maxn] , y[maxn];

void read()
{
    pom = 0;
    cin >> n;

    for(int i = 1; i <= n; i++)
        cin >> c[i];
    vector <int> sorted;
    for(int i = 1; i <= n; i++)
        sorted.pb(c[i]);
    sort(sorted.begin() , sorted.end());

    map <int , int> id;
    for(int i = 0; i < sorted.size(); i++)
    {
        if(i == 0)
            pom++;
        if(i != 0 && sorted[i] != sorted[i - 1])
            pom++;

        id[sorted[i]] = pom;
    }

    for(int i = 1; i <= n; i++)
        c[i] = id[c[i]];

    for(int i = 1; i < n; i++)
    {
        cin >> x[i] >> y[i];

        v[x[i]].pb(y[i]);
        v[y[i]].pb(x[i]);
    }
}


int lazy[maxn * 4];
pii tree[maxn * 4];

void push(int node)
{
    if(lazy[node] == 0)
        return;

    tree[node * 2].X = lazy[node];
    tree[node * 2].Y = lazy[node];

    tree[node * 2 + 1].X = lazy[node];
    tree[node * 2 + 1].Y = lazy[node];

    lazy[node * 2] = lazy[node];
    lazy[node * 2 + 1] = lazy[node];

    lazy[node] = 0;
}



pii query(int node , int l , int r , int ql , int qr)
{
    if(ql > qr)
        return {1e9 , 0};

    if(ql == l && qr == r)
        return tree[node];

    push(node);
    int mid = (l + r) / 2;
    int new_l = max(mid + 1 , ql);
    int new_r = min(mid , qr);

    pii res1 = query(node * 2 , l , mid , ql , new_r);
    pii res2 = query(node * 2 + 1 , mid + 1 , r , new_l , qr);

    return _merge(res1 , res2);
}


void update(int node , int l , int r , int ql , int qr , int qval)
{
    if(ql > qr)
        return;

    if(ql == l && qr == r)
    {
        tree[node].X = qval;
        tree[node].Y = qval;

        lazy[node] = qval;
        return;
    }

    push(node);
    int mid = (l + r) / 2;
    int new_l = max(mid + 1 , ql);
    int new_r = min(mid , qr);

    update(node * 2 , l , mid , ql , new_r , qval);
    update(node * 2 + 1 , mid + 1 , r , new_l , qr , qval);

    tree[node] = _merge(tree[node * 2] , tree[node * 2 + 1]);
}


int fenwick[maxn];

void update_fenwick(int idx , int qval)
{
    for(int i = idx; i <= pom; i += (i & (-i)))
        fenwick[i] += qval;
}

int query_fenwick(int idx)
{
    int ans = 0;
    for(int i = idx; i >= 1; i -= (i & (-i)))
        ans += fenwick[i];
    return ans;
}


vector <pii> _try;

void new_segment(int from , int to)
{
    int l , r , mid;
    while(from <= to)
    {
        l = from - 1;
        r = to;

        while(l + 1 < r)
        {
            mid = (l + r) / 2;
            pii pomm = query(1 , 1 , n , mid , to);
            if(pomm.X == pomm.Y)
                r = mid;
            else
                l = mid;
        }

        pii pomm = query(1 , 1 , n , r , to);
        _try.push_back({pomm.X , to - r + 1});
        to = r - 1;
    }
}



int par[maxn];
int depth[maxn];
int sz[maxn];
int h[maxn];

void dfs(int node , int _par = 0 , int de = 1)
{
    sz[node] = 1;
    depth[node] = de;
    par[node] = _par;

    for(int nb : v[node])
    {
        if(nb == _par)
            continue;

        dfs(nb , node , de + 1);
        if(sz[nb] > sz[h[node]])
            h[node] = nb;
        sz[node] += sz[nb];
    }

}


int idx;
int pp[maxn];
int lead[maxn];

void hld(int node , int _par = 0 , int head = 1)
{
    lead[node] = head;
    idx++;
    pp[node] = idx;

    if(h[node] != 0)
        hld(h[node] , node , head);

    for(int nb : v[node])
    {
        if(nb == _par)
            continue;
        if(nb == h[node])
            continue;

        hld(nb , node , nb);
    }

}


void solve()
{
    //control
    dfs(1);
    //control
    hld(1);

    for(int i = 1; i <= n; i++)
        update(1 , 1 , n , pp[i] , pp[i] , c[i]);

    long long inv = 0;

    for(int i = 1; i < n; i++)
    {
        //control
        inv = 0;
        _try.clear();

        int node = x[i];
        while(node)
        {
            new_segment(pp[lead[node]] , pp[node]);
            node = par[lead[node]];
        }

        for(pii e : _try)
        {
            inv += query_fenwick(e.X - 1) * 1LL * e.Y;
            update_fenwick(e.X , e.Y);
        }

        for(pii e : _try)
            update_fenwick(e.X , -e.Y);

        node = y[i];
        while(node)
        {
            update(1 ,1 , n , pp[lead[node]] , pp[node] , c[y[i]]);
            node = par[lead[node]];
        }

        cout << inv << endl;
    }

}




int main()
{

/**#ifdef ONLINE_JUDGE /// promeni
    freopen("taxi.in", "r", stdin);
    freopen("taxi.out", "w", stdout);
#endif*/

    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    //startT = std::chrono::high_resolution_clock::now();

    read();
    solve();


    return 0;
}

Compilation message

construction.cpp: In function 'void read()':
construction.cpp:67:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   67 |     for(int i = 0; i < sorted.size(); i++)
      |                    ~~^~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 11868 KB Output is correct
2 Correct 3 ms 11868 KB Output is correct
3 Correct 2 ms 11868 KB Output is correct
4 Correct 3 ms 11868 KB Output is correct
5 Correct 3 ms 11868 KB Output is correct
6 Correct 5 ms 11952 KB Output is correct
7 Correct 4 ms 11868 KB Output is correct
8 Correct 3 ms 11868 KB Output is correct
9 Correct 3 ms 12072 KB Output is correct
10 Correct 4 ms 12072 KB Output is correct
11 Correct 3 ms 11868 KB Output is correct
12 Correct 4 ms 11868 KB Output is correct
13 Correct 3 ms 11868 KB Output is correct
14 Correct 5 ms 11868 KB Output is correct
15 Correct 4 ms 11868 KB Output is correct
16 Correct 4 ms 12000 KB Output is correct
17 Correct 3 ms 11868 KB Output is correct
18 Correct 3 ms 11868 KB Output is correct
19 Correct 4 ms 12048 KB Output is correct
20 Correct 4 ms 12376 KB Output is correct
21 Correct 3 ms 11868 KB Output is correct
22 Correct 3 ms 11868 KB Output is correct
23 Correct 3 ms 11864 KB Output is correct
24 Correct 3 ms 11868 KB Output is correct
25 Correct 3 ms 11868 KB Output is correct
26 Correct 3 ms 12120 KB Output is correct
27 Correct 4 ms 11868 KB Output is correct
28 Correct 3 ms 11868 KB Output is correct
29 Correct 3 ms 11868 KB Output is correct
30 Correct 3 ms 11868 KB Output is correct
31 Correct 4 ms 11868 KB Output is correct
32 Correct 3 ms 11868 KB Output is correct
33 Correct 4 ms 11868 KB Output is correct
34 Correct 3 ms 11868 KB Output is correct
35 Correct 4 ms 11864 KB Output is correct
36 Correct 3 ms 11868 KB Output is correct
37 Correct 3 ms 11868 KB Output is correct
38 Correct 3 ms 12004 KB Output is correct
39 Correct 4 ms 11868 KB Output is correct
40 Correct 3 ms 11864 KB Output is correct
41 Correct 4 ms 11868 KB Output is correct
42 Correct 4 ms 11864 KB Output is correct
43 Correct 3 ms 11868 KB Output is correct
44 Correct 3 ms 11868 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 11868 KB Output is correct
2 Correct 3 ms 11868 KB Output is correct
3 Correct 2 ms 11868 KB Output is correct
4 Correct 3 ms 11868 KB Output is correct
5 Correct 3 ms 11868 KB Output is correct
6 Correct 5 ms 11952 KB Output is correct
7 Correct 4 ms 11868 KB Output is correct
8 Correct 3 ms 11868 KB Output is correct
9 Correct 3 ms 12072 KB Output is correct
10 Correct 4 ms 12072 KB Output is correct
11 Correct 3 ms 11868 KB Output is correct
12 Correct 4 ms 11868 KB Output is correct
13 Correct 3 ms 11868 KB Output is correct
14 Correct 5 ms 11868 KB Output is correct
15 Correct 4 ms 11868 KB Output is correct
16 Correct 4 ms 12000 KB Output is correct
17 Correct 3 ms 11868 KB Output is correct
18 Correct 3 ms 11868 KB Output is correct
19 Correct 4 ms 12048 KB Output is correct
20 Correct 4 ms 12376 KB Output is correct
21 Correct 3 ms 11868 KB Output is correct
22 Correct 3 ms 11868 KB Output is correct
23 Correct 3 ms 11864 KB Output is correct
24 Correct 3 ms 11868 KB Output is correct
25 Correct 3 ms 11868 KB Output is correct
26 Correct 3 ms 12120 KB Output is correct
27 Correct 4 ms 11868 KB Output is correct
28 Correct 3 ms 11868 KB Output is correct
29 Correct 3 ms 11868 KB Output is correct
30 Correct 3 ms 11868 KB Output is correct
31 Correct 4 ms 11868 KB Output is correct
32 Correct 3 ms 11868 KB Output is correct
33 Correct 4 ms 11868 KB Output is correct
34 Correct 3 ms 11868 KB Output is correct
35 Correct 4 ms 11864 KB Output is correct
36 Correct 3 ms 11868 KB Output is correct
37 Correct 3 ms 11868 KB Output is correct
38 Correct 3 ms 12004 KB Output is correct
39 Correct 4 ms 11868 KB Output is correct
40 Correct 3 ms 11864 KB Output is correct
41 Correct 4 ms 11868 KB Output is correct
42 Correct 4 ms 11864 KB Output is correct
43 Correct 3 ms 11868 KB Output is correct
44 Correct 3 ms 11868 KB Output is correct
45 Correct 6 ms 11868 KB Output is correct
46 Correct 12 ms 12464 KB Output is correct
47 Correct 13 ms 12380 KB Output is correct
48 Correct 12 ms 12380 KB Output is correct
49 Correct 13 ms 12636 KB Output is correct
50 Correct 14 ms 12748 KB Output is correct
51 Correct 13 ms 12740 KB Output is correct
52 Correct 15 ms 12376 KB Output is correct
53 Correct 15 ms 12376 KB Output is correct
54 Correct 15 ms 12380 KB Output is correct
55 Correct 16 ms 12376 KB Output is correct
56 Correct 20 ms 12720 KB Output is correct
57 Correct 16 ms 12380 KB Output is correct
58 Correct 17 ms 12452 KB Output is correct
59 Correct 17 ms 12380 KB Output is correct
60 Correct 17 ms 12380 KB Output is correct
61 Correct 17 ms 12380 KB Output is correct
62 Correct 17 ms 12380 KB Output is correct
63 Correct 17 ms 12476 KB Output is correct
64 Correct 10 ms 12244 KB Output is correct
65 Correct 11 ms 12124 KB Output is correct
66 Correct 12 ms 12124 KB Output is correct
67 Correct 14 ms 12380 KB Output is correct
68 Correct 12 ms 12380 KB Output is correct
69 Correct 16 ms 12380 KB Output is correct
70 Correct 15 ms 12408 KB Output is correct
71 Correct 15 ms 12380 KB Output is correct
72 Correct 16 ms 12380 KB Output is correct
73 Correct 16 ms 12248 KB Output is correct
74 Correct 16 ms 12212 KB Output is correct
75 Correct 15 ms 12380 KB Output is correct
76 Correct 15 ms 12632 KB Output is correct
77 Correct 15 ms 12380 KB Output is correct
78 Correct 18 ms 12316 KB Output is correct
79 Correct 18 ms 12124 KB Output is correct
80 Correct 13 ms 12272 KB Output is correct
81 Correct 17 ms 12380 KB Output is correct
82 Correct 21 ms 12376 KB Output is correct
83 Correct 15 ms 12380 KB Output is correct
84 Correct 16 ms 12320 KB Output is correct
85 Correct 15 ms 12124 KB Output is correct
86 Correct 14 ms 12124 KB Output is correct

Subtask #3
84.0 / 84.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 11868 KB Output is correct
2 Correct 3 ms 11868 KB Output is correct
3 Correct 2 ms 11868 KB Output is correct
4 Correct 3 ms 11868 KB Output is correct
5 Correct 3 ms 11868 KB Output is correct
6 Correct 5 ms 11952 KB Output is correct
7 Correct 4 ms 11868 KB Output is correct
8 Correct 3 ms 11868 KB Output is correct
9 Correct 3 ms 12072 KB Output is correct
10 Correct 4 ms 12072 KB Output is correct
11 Correct 3 ms 11868 KB Output is correct
12 Correct 4 ms 11868 KB Output is correct
13 Correct 3 ms 11868 KB Output is correct
14 Correct 5 ms 11868 KB Output is correct
15 Correct 4 ms 11868 KB Output is correct
16 Correct 4 ms 12000 KB Output is correct
17 Correct 3 ms 11868 KB Output is correct
18 Correct 3 ms 11868 KB Output is correct
19 Correct 4 ms 12048 KB Output is correct
20 Correct 4 ms 12376 KB Output is correct
21 Correct 3 ms 11868 KB Output is correct
22 Correct 3 ms 11868 KB Output is correct
23 Correct 3 ms 11864 KB Output is correct
24 Correct 3 ms 11868 KB Output is correct
25 Correct 3 ms 11868 KB Output is correct
26 Correct 3 ms 12120 KB Output is correct
27 Correct 4 ms 11868 KB Output is correct
28 Correct 3 ms 11868 KB Output is correct
29 Correct 3 ms 11868 KB Output is correct
30 Correct 3 ms 11868 KB Output is correct
31 Correct 4 ms 11868 KB Output is correct
32 Correct 3 ms 11868 KB Output is correct
33 Correct 4 ms 11868 KB Output is correct
34 Correct 3 ms 11868 KB Output is correct
35 Correct 4 ms 11864 KB Output is correct
36 Correct 3 ms 11868 KB Output is correct
37 Correct 3 ms 11868 KB Output is correct
38 Correct 3 ms 12004 KB Output is correct
39 Correct 4 ms 11868 KB Output is correct
40 Correct 3 ms 11864 KB Output is correct
41 Correct 4 ms 11868 KB Output is correct
42 Correct 4 ms 11864 KB Output is correct
43 Correct 3 ms 11868 KB Output is correct
44 Correct 3 ms 11868 KB Output is correct
45 Correct 6 ms 11868 KB Output is correct
46 Correct 12 ms 12464 KB Output is correct
47 Correct 13 ms 12380 KB Output is correct
48 Correct 12 ms 12380 KB Output is correct
49 Correct 13 ms 12636 KB Output is correct
50 Correct 14 ms 12748 KB Output is correct
51 Correct 13 ms 12740 KB Output is correct
52 Correct 15 ms 12376 KB Output is correct
53 Correct 15 ms 12376 KB Output is correct
54 Correct 15 ms 12380 KB Output is correct
55 Correct 16 ms 12376 KB Output is correct
56 Correct 20 ms 12720 KB Output is correct
57 Correct 16 ms 12380 KB Output is correct
58 Correct 17 ms 12452 KB Output is correct
59 Correct 17 ms 12380 KB Output is correct
60 Correct 17 ms 12380 KB Output is correct
61 Correct 17 ms 12380 KB Output is correct
62 Correct 17 ms 12380 KB Output is correct
63 Correct 17 ms 12476 KB Output is correct
64 Correct 10 ms 12244 KB Output is correct
65 Correct 11 ms 12124 KB Output is correct
66 Correct 12 ms 12124 KB Output is correct
67 Correct 14 ms 12380 KB Output is correct
68 Correct 12 ms 12380 KB Output is correct
69 Correct 16 ms 12380 KB Output is correct
70 Correct 15 ms 12408 KB Output is correct
71 Correct 15 ms 12380 KB Output is correct
72 Correct 16 ms 12380 KB Output is correct
73 Correct 16 ms 12248 KB Output is correct
74 Correct 16 ms 12212 KB Output is correct
75 Correct 15 ms 12380 KB Output is correct
76 Correct 15 ms 12632 KB Output is correct
77 Correct 15 ms 12380 KB Output is correct
78 Correct 18 ms 12316 KB Output is correct
79 Correct 18 ms 12124 KB Output is correct
80 Correct 13 ms 12272 KB Output is correct
81 Correct 17 ms 12380 KB Output is correct
82 Correct 21 ms 12376 KB Output is correct
83 Correct 15 ms 12380 KB Output is correct
84 Correct 16 ms 12320 KB Output is correct
85 Correct 15 ms 12124 KB Output is correct
86 Correct 14 ms 12124 KB Output is correct
87 Correct 39 ms 13416 KB Output is correct
88 Correct 110 ms 15700 KB Output is correct
89 Correct 473 ms 28220 KB Output is correct
90 Correct 454 ms 28200 KB Output is correct
91 Correct 448 ms 28464 KB Output is correct
92 Correct 487 ms 35848 KB Output is correct
93 Correct 498 ms 35928 KB Output is correct
94 Correct 498 ms 35932 KB Output is correct
95 Correct 613 ms 31368 KB Output is correct
96 Correct 626 ms 32128 KB Output is correct
97 Correct 632 ms 31960 KB Output is correct
98 Correct 619 ms 32064 KB Output is correct
99 Correct 625 ms 32092 KB Output is correct
100 Correct 716 ms 27828 KB Output is correct
101 Correct 726 ms 28316 KB Output is correct
102 Correct 727 ms 28276 KB Output is correct
103 Correct 720 ms 28104 KB Output is correct
104 Correct 743 ms 32004 KB Output is correct
105 Correct 710 ms 32104 KB Output is correct
106 Correct 715 ms 31896 KB Output is correct
107 Correct 354 ms 22588 KB Output is correct
108 Correct 414 ms 22876 KB Output is correct
109 Correct 454 ms 24380 KB Output is correct
110 Correct 463 ms 30596 KB Output is correct
111 Correct 614 ms 31552 KB Output is correct
112 Correct 562 ms 27284 KB Output is correct
113 Correct 589 ms 26700 KB Output is correct
114 Correct 681 ms 28056 KB Output is correct
115 Correct 642 ms 23040 KB Output is correct
116 Correct 669 ms 26704 KB Output is correct
117 Correct 627 ms 29324 KB Output is correct
118 Correct 628 ms 28888 KB Output is correct
119 Correct 595 ms 28572 KB Output is correct
120 Correct 571 ms 24724 KB Output is correct
121 Correct 548 ms 24128 KB Output is correct
122 Correct 548 ms 23824 KB Output is correct
123 Correct 686 ms 29504 KB Output is correct
124 Correct 738 ms 29552 KB Output is correct
125 Correct 662 ms 28536 KB Output is correct
126 Correct 664 ms 24636 KB Output is correct
127 Correct 658 ms 24172 KB Output is correct
128 Correct 615 ms 23948 KB Output is correct