oj.uz

답안 #466711

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
466711 2021-08-20T13:11:54 Z NhatMinh0208 Construction of Highway (JOI18_construction) C++17
100 / 100
 1369 ms 30272 KB 
#ifndef CPL_TEMPLATE
#define CPL_TEMPLATE
/*
	Normie's Template v2.5
	Changes:
    Added warning against using pragmas on USACO.
*/
// Standard library in one include.
#include <bits/stdc++.h>
using namespace std;
 
// ordered_set library.
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set(el) tree<el,null_type,less<el>,rb_tree_tag,tree_order_statistics_node_update>
 
// AtCoder library. (Comment out these two lines if you're not submitting in AtCoder.) (Or if you want to use it in other judges, run expander.py first.)
//#include <atcoder/all>
//using namespace atcoder;

//Pragmas (Comment out these three lines if you're submitting in szkopul or USACO.)
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast,unroll-loops,tree-vectorize")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
 
//File I/O.
#define FILE_IN "cseq.inp"
#define FILE_OUT "cseq.out"
#define ofile freopen(FILE_IN,"r",stdin);freopen(FILE_OUT,"w",stdout)
 
//Fast I/O.
#define fio ios::sync_with_stdio(0);cin.tie(0)
#define nfio cin.tie(0)
#define endl "\n"
 
//Order checking.
#define ord(a,b,c) ((a>=b)and(b>=c))
 
//min/max redefines, so i dont have to resolve annoying compile errors.
#define min(a,b) (((a)<(b))?(a):(b))
#define max(a,b) (((a)>(b))?(a):(b))

// Fast min/max assigns to use with AVX.
// Requires g++ 9.2.0.
template<typename T>
__attribute__((always_inline)) void chkmin(T& a, const T& b) {
    a=(a<b)?a:b;
}

template<typename T>
__attribute__((always_inline)) void chkmax(T& a, const T& b) {
    a=(a>b)?a:b;
}
 
//Constants.
#define MOD (ll(998244353))
#define MAX 300001
#define mag 320
const long double PI=3.14159265358979;
 
//Pairs and 3-pairs.
#define p1 first
#define p2 second.first
#define p3 second.second
#define fi first
#define se second
#define pii(element_type) pair<element_type,element_type>
#define piii(element_type) pair<element_type,pii(element_type)>
 
//Quick power of 2.
#define pow2(x) (ll(1)<<x)
 
//Short for-loops.
#define ff(i,__,___) for(int i=__;i<=___;i++)
#define rr(i,__,___) for(int i=__;i>=___;i--)
 
//Typedefs.
#define bi BigInt
typedef long long ll;
typedef long double ld;
typedef short sh;

// Binpow and stuff
ll BOW(ll a, ll x, ll p)
{
	if (!x) return 1;
	ll res=BOW(a,x/2,p);
	res*=res;
	res%=p;
	if (x%2) res*=a;
	return res%p;
}
ll INV(ll a, ll p)
{
	return BOW(a,p-2,p);
}
//---------END-------//
#endif

// A list of preset merge functions.
//The segement tree itself.
struct seg
{
    ll val[800001];
    ll def=0;
    ll (*merg)(ll,ll); // Merge function. It must be associative.
    void reset(ll c, ll l, ll r)
    {
        if (l<r)
        {
            ll mid=(l+r)/2;
            reset((c<<1),l,mid);
            reset((c<<1)+1,mid+1,r);
            val[c]=(val[(c<<1)]+val[(c<<1)+1]);
        }
        else val[c]=0;
    }
    void upd(ll c, ll l, ll r, ll x, ll t)
    {
        if ((l<=x)and(x<=r))
        {
            if (l==r) val[c]=t;
            else
            {
                ll mid=(l+r)/2;
                upd((c<<1),l,mid,x,t);
                upd((c<<1)+1,mid+1,r,x,t);
                val[c]=(val[(c<<1)]+val[(c<<1)+1]);
            }
        }
    }
    ll get(ll c, ll l, ll r, ll tl, ll tr)
    {
        if ((tl>r)or(tr<l)) return def;
        if ((tl<=l)and(tr>=r)) return val[c];
        else 
        {
            ll mid=(l+r)/2;
            ll a=get((c<<1),l,mid,tl,tr);
            ll b=get((c<<1)+1,mid+1,r,tl,tr);
            return (a+b);
        }
    }
};
seg st;






vector<int> gt[100001];
int n,m,i,j,k,t,t1,u,v,a,b;
ll res=0;
int ea[100001],eb[100001],crr[100001];
int cnt[100001];
int rn[100001],rp[100001];
int head[100001];
int par[100001];
vector<pii(int)> sta[100001];
map<int,int> lmao;
vector<pii(int)> req;
vector<int> cleanup;
void dfs(int x, int p)
{
    cnt[x]=1;
    for (auto g : gt[x]) if (g-p)
    {
        dfs(g,x);
        cnt[x]+=cnt[g];
    }
}
void build_path(int x)
{
    if (rp[x]==1) head[rn[x]]=x;
    sort(gt[x].begin(),gt[x].end(),[](int a, int b){
        return (cnt[a]>cnt[b]);
    });
    if (gt[x].size())
    {
        rn[gt[x][0]]=t;
        rp[gt[x][0]]=rp[x]+1;
        build_path(gt[x][0]);
        for (int i = 1; i<gt[x].size();i++)
        {
            t++;
            rn[gt[x][i]]=t;
            rp[gt[x][i]]=1;
            build_path(gt[x][i]);
        }
    }
    sta[rn[x]].push_back({crr[x],1});
}
int main()
{
	fio;
    cin>>n;
    for (i=1;i<=n;i++) 
    {
        cin>>crr[i];
        lmao[crr[i]]=1;
    }
    t=0;
    for (auto g : lmao)
    {
        t++;
        lmao[g.fi]=t;
    }
    for (i=1;i<=n;i++)
    {
        crr[i]=lmao[crr[i]];
    }
    for (i=1;i<n;i++)
    {
        cin>>ea[i]>>eb[i];
        par[eb[i]]=ea[i];
        gt[ea[i]].push_back(eb[i]);
    }
    dfs(1,-1);
    t=1;
    rn[1]=1;
    rp[1]=1;
    build_path(1);


    for (i=1;i<=n;i++)
    {
        // cout<<i<<' '<<rn[i]<<' '<<rp[i]<<endl;
    }

    st.reset(1,1,n);

    for (t=1;t<n;t++)
    {
        res=0;
        req.clear();
        cleanup.clear();
        u=ea[t];
        while(u)
        {
            req.push_back({rn[u],rp[u]});
            // cout<<u<<' '<<'{'<<rn[u]<<' '<<rp[u]<<'}'<<endl;
            u=par[head[rn[u]]];
        }
        reverse(req.begin(),req.end());
        for (auto g : req)
        {
            u=0;
            while(u<g.se)
            {
                auto pp=sta[g.fi].back();
                cleanup.push_back(pp.fi);
                if (u+pp.se>g.se)
                {
                    a=st.get(1,1,n,pp.fi+1,n);
                    res+=(ll)a*(g.se-u);
                    a=st.get(1,1,n,pp.fi,pp.fi);
                    st.upd(1,1,n,pp.fi,a+g.se-u);
                    sta[g.fi].back().se-=g.se-u;
                    u+=g.se-u;
                }
                else
                {
                    a=st.get(1,1,n,pp.fi+1,n);
                    res+=(ll)a*(pp.se);
                    a=st.get(1,1,n,pp.fi,pp.fi);
                    st.upd(1,1,n,pp.fi,a+pp.se);
                    sta[g.fi].pop_back();
                    u+=pp.se;
                }
            }
            sta[g.fi].push_back({crr[eb[t]],g.se});
        }
        for (auto g : cleanup) st.upd(1,1,n,g,0);
        cout<<res<<endl;
        // cout<<endl;

    }
}
// Normie28;

Compilation message

construction.cpp:23: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
   23 | #pragma comment(linker, "/stack:200000000")
      | 
construction.cpp: In function 'void build_path(int)':
construction.cpp:185:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  185 |         for (int i = 1; i<gt[x].size();i++)
      |                         ~^~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4992 KB Output is correct
3 Correct 3 ms 5068 KB Output is correct
4 Correct 4 ms 5068 KB Output is correct
5 Correct 5 ms 5032 KB Output is correct
6 Correct 5 ms 5068 KB Output is correct
7 Correct 5 ms 5068 KB Output is correct
8 Correct 4 ms 5068 KB Output is correct
9 Correct 5 ms 5164 KB Output is correct
10 Correct 5 ms 5168 KB Output is correct
11 Correct 4 ms 5068 KB Output is correct
12 Correct 4 ms 5036 KB Output is correct
13 Correct 4 ms 5036 KB Output is correct
14 Correct 4 ms 5068 KB Output is correct
15 Correct 5 ms 5028 KB Output is correct
16 Correct 6 ms 5068 KB Output is correct
17 Correct 6 ms 5068 KB Output is correct
18 Correct 5 ms 5032 KB Output is correct
19 Correct 4 ms 5036 KB Output is correct
20 Correct 4 ms 5040 KB Output is correct
21 Correct 4 ms 5068 KB Output is correct
22 Correct 4 ms 5068 KB Output is correct
23 Correct 4 ms 5068 KB Output is correct
24 Correct 4 ms 5032 KB Output is correct
25 Correct 4 ms 5068 KB Output is correct
26 Correct 4 ms 5164 KB Output is correct
27 Correct 4 ms 5028 KB Output is correct
28 Correct 4 ms 5068 KB Output is correct
29 Correct 4 ms 5028 KB Output is correct
30 Correct 5 ms 5068 KB Output is correct
31 Correct 5 ms 5068 KB Output is correct
32 Correct 4 ms 5068 KB Output is correct
33 Correct 4 ms 5068 KB Output is correct
34 Correct 4 ms 5068 KB Output is correct
35 Correct 4 ms 5068 KB Output is correct
36 Correct 5 ms 5068 KB Output is correct
37 Correct 4 ms 5068 KB Output is correct
38 Correct 4 ms 5028 KB Output is correct
39 Correct 6 ms 5028 KB Output is correct
40 Correct 5 ms 5028 KB Output is correct
41 Correct 5 ms 5068 KB Output is correct
42 Correct 4 ms 5028 KB Output is correct
43 Correct 4 ms 5068 KB Output is correct
44 Correct 4 ms 5068 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4992 KB Output is correct
3 Correct 3 ms 5068 KB Output is correct
4 Correct 4 ms 5068 KB Output is correct
5 Correct 5 ms 5032 KB Output is correct
6 Correct 5 ms 5068 KB Output is correct
7 Correct 5 ms 5068 KB Output is correct
8 Correct 4 ms 5068 KB Output is correct
9 Correct 5 ms 5164 KB Output is correct
10 Correct 5 ms 5168 KB Output is correct
11 Correct 4 ms 5068 KB Output is correct
12 Correct 4 ms 5036 KB Output is correct
13 Correct 4 ms 5036 KB Output is correct
14 Correct 4 ms 5068 KB Output is correct
15 Correct 5 ms 5028 KB Output is correct
16 Correct 6 ms 5068 KB Output is correct
17 Correct 6 ms 5068 KB Output is correct
18 Correct 5 ms 5032 KB Output is correct
19 Correct 4 ms 5036 KB Output is correct
20 Correct 4 ms 5040 KB Output is correct
21 Correct 4 ms 5068 KB Output is correct
22 Correct 4 ms 5068 KB Output is correct
23 Correct 4 ms 5068 KB Output is correct
24 Correct 4 ms 5032 KB Output is correct
25 Correct 4 ms 5068 KB Output is correct
26 Correct 4 ms 5164 KB Output is correct
27 Correct 4 ms 5028 KB Output is correct
28 Correct 4 ms 5068 KB Output is correct
29 Correct 4 ms 5028 KB Output is correct
30 Correct 5 ms 5068 KB Output is correct
31 Correct 5 ms 5068 KB Output is correct
32 Correct 4 ms 5068 KB Output is correct
33 Correct 4 ms 5068 KB Output is correct
34 Correct 4 ms 5068 KB Output is correct
35 Correct 4 ms 5068 KB Output is correct
36 Correct 5 ms 5068 KB Output is correct
37 Correct 4 ms 5068 KB Output is correct
38 Correct 4 ms 5028 KB Output is correct
39 Correct 6 ms 5028 KB Output is correct
40 Correct 5 ms 5028 KB Output is correct
41 Correct 5 ms 5068 KB Output is correct
42 Correct 4 ms 5028 KB Output is correct
43 Correct 4 ms 5068 KB Output is correct
44 Correct 4 ms 5068 KB Output is correct
45 Correct 6 ms 5196 KB Output is correct
46 Correct 18 ms 5652 KB Output is correct
47 Correct 18 ms 5540 KB Output is correct
48 Correct 20 ms 5568 KB Output is correct
49 Correct 12 ms 6056 KB Output is correct
50 Correct 11 ms 5964 KB Output is correct
51 Correct 12 ms 6056 KB Output is correct
52 Correct 10 ms 5804 KB Output is correct
53 Correct 12 ms 5836 KB Output is correct
54 Correct 12 ms 5836 KB Output is correct
55 Correct 12 ms 5836 KB Output is correct
56 Correct 11 ms 5836 KB Output is correct
57 Correct 24 ms 5544 KB Output is correct
58 Correct 31 ms 5640 KB Output is correct
59 Correct 28 ms 5644 KB Output is correct
60 Correct 29 ms 5636 KB Output is correct
61 Correct 12 ms 5824 KB Output is correct
62 Correct 11 ms 5836 KB Output is correct
63 Correct 11 ms 5836 KB Output is correct
64 Correct 12 ms 5324 KB Output is correct
65 Correct 12 ms 5324 KB Output is correct
66 Correct 15 ms 5452 KB Output is correct
67 Correct 17 ms 5452 KB Output is correct
68 Correct 9 ms 5836 KB Output is correct
69 Correct 11 ms 5708 KB Output is correct
70 Correct 9 ms 5552 KB Output is correct
71 Correct 9 ms 5552 KB Output is correct
72 Correct 24 ms 5616 KB Output is correct
73 Correct 20 ms 5428 KB Output is correct
74 Correct 9 ms 5580 KB Output is correct
75 Correct 12 ms 5708 KB Output is correct
76 Correct 12 ms 5684 KB Output is correct
77 Correct 12 ms 5580 KB Output is correct
78 Correct 10 ms 5456 KB Output is correct
79 Correct 9 ms 5472 KB Output is correct
80 Correct 10 ms 5396 KB Output is correct
81 Correct 13 ms 5736 KB Output is correct
82 Correct 13 ms 5688 KB Output is correct
83 Correct 13 ms 5672 KB Output is correct
84 Correct 10 ms 5520 KB Output is correct
85 Correct 10 ms 5420 KB Output is correct
86 Correct 10 ms 5452 KB Output is correct

Subtask #3
84.0 / 84.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4992 KB Output is correct
3 Correct 3 ms 5068 KB Output is correct
4 Correct 4 ms 5068 KB Output is correct
5 Correct 5 ms 5032 KB Output is correct
6 Correct 5 ms 5068 KB Output is correct
7 Correct 5 ms 5068 KB Output is correct
8 Correct 4 ms 5068 KB Output is correct
9 Correct 5 ms 5164 KB Output is correct
10 Correct 5 ms 5168 KB Output is correct
11 Correct 4 ms 5068 KB Output is correct
12 Correct 4 ms 5036 KB Output is correct
13 Correct 4 ms 5036 KB Output is correct
14 Correct 4 ms 5068 KB Output is correct
15 Correct 5 ms 5028 KB Output is correct
16 Correct 6 ms 5068 KB Output is correct
17 Correct 6 ms 5068 KB Output is correct
18 Correct 5 ms 5032 KB Output is correct
19 Correct 4 ms 5036 KB Output is correct
20 Correct 4 ms 5040 KB Output is correct
21 Correct 4 ms 5068 KB Output is correct
22 Correct 4 ms 5068 KB Output is correct
23 Correct 4 ms 5068 KB Output is correct
24 Correct 4 ms 5032 KB Output is correct
25 Correct 4 ms 5068 KB Output is correct
26 Correct 4 ms 5164 KB Output is correct
27 Correct 4 ms 5028 KB Output is correct
28 Correct 4 ms 5068 KB Output is correct
29 Correct 4 ms 5028 KB Output is correct
30 Correct 5 ms 5068 KB Output is correct
31 Correct 5 ms 5068 KB Output is correct
32 Correct 4 ms 5068 KB Output is correct
33 Correct 4 ms 5068 KB Output is correct
34 Correct 4 ms 5068 KB Output is correct
35 Correct 4 ms 5068 KB Output is correct
36 Correct 5 ms 5068 KB Output is correct
37 Correct 4 ms 5068 KB Output is correct
38 Correct 4 ms 5028 KB Output is correct
39 Correct 6 ms 5028 KB Output is correct
40 Correct 5 ms 5028 KB Output is correct
41 Correct 5 ms 5068 KB Output is correct
42 Correct 4 ms 5028 KB Output is correct
43 Correct 4 ms 5068 KB Output is correct
44 Correct 4 ms 5068 KB Output is correct
45 Correct 6 ms 5196 KB Output is correct
46 Correct 18 ms 5652 KB Output is correct
47 Correct 18 ms 5540 KB Output is correct
48 Correct 20 ms 5568 KB Output is correct
49 Correct 12 ms 6056 KB Output is correct
50 Correct 11 ms 5964 KB Output is correct
51 Correct 12 ms 6056 KB Output is correct
52 Correct 10 ms 5804 KB Output is correct
53 Correct 12 ms 5836 KB Output is correct
54 Correct 12 ms 5836 KB Output is correct
55 Correct 12 ms 5836 KB Output is correct
56 Correct 11 ms 5836 KB Output is correct
57 Correct 24 ms 5544 KB Output is correct
58 Correct 31 ms 5640 KB Output is correct
59 Correct 28 ms 5644 KB Output is correct
60 Correct 29 ms 5636 KB Output is correct
61 Correct 12 ms 5824 KB Output is correct
62 Correct 11 ms 5836 KB Output is correct
63 Correct 11 ms 5836 KB Output is correct
64 Correct 12 ms 5324 KB Output is correct
65 Correct 12 ms 5324 KB Output is correct
66 Correct 15 ms 5452 KB Output is correct
67 Correct 17 ms 5452 KB Output is correct
68 Correct 9 ms 5836 KB Output is correct
69 Correct 11 ms 5708 KB Output is correct
70 Correct 9 ms 5552 KB Output is correct
71 Correct 9 ms 5552 KB Output is correct
72 Correct 24 ms 5616 KB Output is correct
73 Correct 20 ms 5428 KB Output is correct
74 Correct 9 ms 5580 KB Output is correct
75 Correct 12 ms 5708 KB Output is correct
76 Correct 12 ms 5684 KB Output is correct
77 Correct 12 ms 5580 KB Output is correct
78 Correct 10 ms 5456 KB Output is correct
79 Correct 9 ms 5472 KB Output is correct
80 Correct 10 ms 5396 KB Output is correct
81 Correct 13 ms 5736 KB Output is correct
82 Correct 13 ms 5688 KB Output is correct
83 Correct 13 ms 5672 KB Output is correct
84 Correct 10 ms 5520 KB Output is correct
85 Correct 10 ms 5420 KB Output is correct
86 Correct 10 ms 5452 KB Output is correct
87 Correct 47 ms 6604 KB Output is correct
88 Correct 161 ms 9520 KB Output is correct
89 Correct 728 ms 20676 KB Output is correct
90 Correct 728 ms 20736 KB Output is correct
91 Correct 705 ms 20756 KB Output is correct
92 Correct 313 ms 30136 KB Output is correct
93 Correct 286 ms 30180 KB Output is correct
94 Correct 296 ms 30272 KB Output is correct
95 Correct 257 ms 25416 KB Output is correct
96 Correct 293 ms 25688 KB Output is correct
97 Correct 297 ms 25760 KB Output is correct
98 Correct 281 ms 25660 KB Output is correct
99 Correct 271 ms 25696 KB Output is correct
100 Correct 975 ms 20292 KB Output is correct
101 Correct 1296 ms 20692 KB Output is correct
102 Correct 1298 ms 20676 KB Output is correct
103 Correct 1369 ms 20820 KB Output is correct
104 Correct 314 ms 25248 KB Output is correct
105 Correct 323 ms 25360 KB Output is correct
106 Correct 290 ms 25404 KB Output is correct
107 Correct 402 ms 15216 KB Output is correct
108 Correct 475 ms 15184 KB Output is correct
109 Correct 619 ms 16908 KB Output is correct
110 Correct 189 ms 24916 KB Output is correct
111 Correct 235 ms 25404 KB Output is correct
112 Correct 179 ms 20288 KB Output is correct
113 Correct 185 ms 20152 KB Output is correct
114 Correct 943 ms 20316 KB Output is correct
115 Correct 935 ms 15500 KB Output is correct
116 Correct 189 ms 20156 KB Output is correct
117 Correct 293 ms 22460 KB Output is correct
118 Correct 317 ms 21896 KB Output is correct
119 Correct 308 ms 21192 KB Output is correct
120 Correct 205 ms 17612 KB Output is correct
121 Correct 209 ms 17048 KB Output is correct
122 Correct 220 ms 16580 KB Output is correct
123 Correct 323 ms 22492 KB Output is correct
124 Correct 330 ms 21872 KB Output is correct
125 Correct 338 ms 21400 KB Output is correct
126 Correct 221 ms 17724 KB Output is correct
127 Correct 230 ms 17060 KB Output is correct
128 Correct 234 ms 16500 KB Output is correct