oj.uz

답안 #1031026

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1031026 2024-07-22T13:36:11 Z Antekb JOI tour (JOI24_joitour) C++17
36 / 100
 3000 ms 421800 KB 
#include "bits/stdc++.h"	/** keep-include */
using namespace std;

#define rep(i, b, e) for(int i = (b); i <= (e); i++)
#define per(i, b, e) for(int i = (e); i >= (b); i--)
#define FOR(i, b, e) rep(i, b, (e) - 1)
#define SZ(x) int(x.size())
#define all(x) x.begin(), x.end()
#define pb push_back
#define mp make_pair
#define st first
#define nd second
using ll = long long;
using vi = vector<int>;
using pii = pair<int, int>;

auto &operator<<(auto &o, pair<auto, auto> p) {
	return o << "(" << p.st << ", " << p.nd << ")"; }
auto operator<<(auto &o, auto x)->decltype(end(x), o) {
	o << "{"; int i=0; for(auto e: x) o << ", " + 2*!i++ << e;
	return o << "}"; }
#ifdef LOCAL
#define deb(x...) cerr << "[" #x "]: ", [](auto...$) { \
	((cerr << $ << "; "),...) << endl; }(x)
#else
#define deb(...)
#endif

#include "joitour.h"

const int N=2e5+5;

ll result;
int typ[N];


struct drzewo{
    vi real_name;
    vi siz, par, pre, post, subtree, order;
    vector<vi> E;
    int root=-1, real_root;
    int n;
    vi ile[2];
    vector<ll> sum[2];
    ll iles[2]={}, sums[2]={};
    ll zle=0;
    ll res=0;
    int new_name(int v){
        return lower_bound(all(real_name), v)-real_name.begin();
    }
    void dfs_cent(int v){
        siz[v]=1;
        bool ok=1;
        for(int u:E[v]){
            if(u!=par[v]){
                par[u]=v;
                dfs_cent(u);
                siz[v]+=siz[u];
                if(siz[u]*2>n)ok=0;
            }
        }
        if(ok && 2*(n-siz[v])<=n){
            root=v;
        }
    }
    void dfs_init(int v, int sub=-1){
        deb(v, sub, order, root, E[v]);
        pre[v]=order.size();
        order.pb(v);
        int cnt=0;
        if(v!=root){
            subtree[v]=sub;
            for(int &u:E[v])if(u==par[v])swap(u, E[v].back());
            E[v].pop_back();
        }
        for(int u:E[v]){
            par[u]=v;
            if(v==root)dfs_init(u, cnt);
            else dfs_init(u, sub);
            cnt++;
        }
        post[v]=order.size();
    }
    pair<int, ll> licz(int v, int lbl, int num){//num - liczba 1
        pair<int, ll> a;
        for(int u:E[v]){
            auto b=licz(u, lbl, num+(typ[real_name[v]]==1));
            a.st+=b.st;
            a.nd+=b.nd;
        }
        if(typ[real_name[v]]==lbl*2){
            a.st++;
            a.nd+=num;
        }
        return a;
    }
    void calc(){
        result-=res;
        res=0;
        iles[0]=0;
        iles[1]=0;
        sums[0]=0;
        sums[1]=0;
        zle=0;
        for(int i=0; i<E[root].size(); i++){
            auto a=licz(E[root][i], 0, 0);
            auto b=licz(E[root][i], 1, 0);
            ile[0][i]={a.st};
            ile[1][i]={b.st};
            sum[0][i]={a.nd};
            sum[1][i]={b.nd};
            iles[0]+=a.st;
            iles[1]+=b.st;
            sums[0]+=a.nd;
            sums[1]+=b.nd;
            res-=a.st*b.nd;
            res-=a.nd*b.st;
            zle+=a.st*1ll*b.st;
        }
        res+=sums[0]*iles[1];
        res+=sums[1]*iles[0];
        if(typ[real_name[root]]==1)res+=iles[0]*1ll*iles[1]-zle;
        else res+=sums[1-typ[real_name[root]]/2];
        result+=res;
    }
    drzewo(vi V, vector<pii> edges){
        deb(V, edges);
        real_name=V;
        sort(all(real_name));
        n=real_name.size();
        E.resize(n);
        siz.resize(n);
        par.resize(n);
        subtree.resize(n);
        pre.resize(n);
        post.resize(n);
        par[0]=-1;
        for(auto &[u, v] : edges){
            deb(u, v, real_name);
            u=new_name(u);
            v=new_name(v);
            E[u].pb(v);
            E[v].pb(u);
        }
        dfs_cent(0);
        assert(root!=-1);
        deb(root, real_name);
        real_root=real_name[root];
        par[root]=-1;
        ile[0].resize(E[root].size());
        ile[1].resize(E[root].size());
        sum[0].resize(E[root].size());
        sum[1].resize(E[root].size());
        dfs_init(root);
        calc();
    }
    pair<vi, vector<pii> > prep(int v){
        vi vert;
        vector<pii> edg;
        for(int i=pre[v]; i<post[v]; i++){
            int u=order[i];
            vert.pb(real_name[u]);
            for(int w:E[u]){
                edg.pb(mp(real_name[u], real_name[w]));
            }
        }
        return {vert, edg};
    }
    void update_slow(){
        calc();
        deb(res);
    }
    int licz_gora(int v){
        deb(v, typ[real_name[v]]);
        if(v==root)return 0;
        return licz_gora(par[v])+(typ[real_name[v]]==1);
    }
    int licz_dol(int v, int lbl){
        int cnt=0;
        for(int i=pre[v]; i<post[v]; i++){
            if(typ[real_name[order[i]]]==lbl)cnt++;
        }
        return cnt;
    }
    void update_fast(int v, int stary, int nowy){
        v=new_name(v);
        deb(root, v, stary, nowy);
        deb(ile[0], ile[1], sum[0], sum[1]);
        result-=res;
        typ[real_name[v]]=stary;
        
        if(typ[real_name[root]]==1)res-=iles[0]*1ll*iles[1]-zle;
        else res-=sums[1-typ[real_name[root]]/2];
        
        if(v!=root){
            res-=sums[0]*iles[1];
            res-=sums[1]*iles[0];
            int sub=subtree[v];

            iles[0]-=ile[0][sub];
            iles[1]-=ile[1][sub];
            sums[0]-=sum[0][sub];
            sums[1]-=sum[1][sub];
            res+=ile[0][sub]*sum[1][sub];
            res+=ile[1][sub]*sum[0][sub];
            zle-=ile[1][sub]*1ll*ile[0][sub];

            if(stary==1){
                int cnt0=licz_dol(v, 0);
                int cnt2=licz_dol(v, 2);
                sum[0][sub]-=cnt0;
                sum[1][sub]-=cnt2;
            }
            else{
                int cnt=licz_gora(v);
                deb(cnt);
                sum[stary/2][sub]-=cnt;
                ile[stary/2][sub]--;
            }
            deb(ile[0], ile[1], sum[0], sum[1]);
            deb(res);
            typ[real_name[v]]=nowy;
            
            if(nowy==1){
                int cnt0=licz_dol(v, 0);
                int cnt2=licz_dol(v, 2);
                sum[0][sub]+=cnt0;
                sum[1][sub]+=cnt2;
            }
            else{
                int cnt=licz_gora(v);
                sum[nowy/2][sub]+=cnt;
                ile[nowy/2][sub]++;
            }

            iles[0]+=ile[0][sub];
            iles[1]+=ile[1][sub];
            sums[0]+=sum[0][sub];
            sums[1]+=sum[1][sub];
            res-=ile[0][sub]*sum[1][sub];
            res-=ile[1][sub]*sum[0][sub];
            zle+=ile[1][sub]*1ll*ile[0][sub];
            
            res+=sums[0]*iles[1];
            res+=sums[1]*iles[0];
        }
        typ[real_name[v]]=nowy;
        if(typ[real_name[root]]==1)res+=iles[0]*1ll*iles[1]-zle;
        else res+=sums[1-typ[real_name[root]]/2];
        result+=res;
        deb(root, v, stary, nowy);
        deb(ile[0], ile[1], sum[0], sum[1]);
        deb(res);
    }
};

vector<drzewo*> drzewa(N);
int rodzic[N];

void stworz(vector<int> vert, vector<pii> edg, int par){
    drzewo* T=new drzewo(vert, edg);
    drzewa[T->real_root]=T;
    deb(T->real_root);
    rodzic[T->real_root]=par;
    for(int u:T->E[T->root]){
        auto a = T->prep(u);
        deb(T->real_root, a.st, a.nd);
        stworz(a.st, a.nd, T->real_root);
    }
}

int n;

void init(int _n, std::vector<int> F, std::vector<int> U, std::vector<int> V,
          int Q) {
    n=_n;
    vector<pii> edges;
    for(int i=0; i<n-1; i++){
        edges.pb(mp(U[i], V[i]));   
    }
    for(int i=0; i<n; i++){
        typ[i]=F[i];
    }
    vi v(n);
    iota(all(v), 0);
    stworz(v, edges, -1);
}

void change(int X, int Y) {
    int stary=typ[X];
    int v=X;
    typ[X]=Y;
    while(X!=-1){
        drzewa[X]->update_fast(v, stary, Y);
        //drzewa[X]->update_slow();
        X=rodzic[X];
    }
}

long long num_tours() {
  return result;
}

Compilation message

joitour.cpp:17:18: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   17 | auto &operator<<(auto &o, pair<auto, auto> p) {
      |                  ^~~~
joitour.cpp:17:32: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   17 | auto &operator<<(auto &o, pair<auto, auto> p) {
      |                                ^~~~
joitour.cpp:17:38: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   17 | auto &operator<<(auto &o, pair<auto, auto> p) {
      |                                      ^~~~
joitour.cpp:19:17: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   19 | auto operator<<(auto &o, auto x)->decltype(end(x), o) {
      |                 ^~~~
joitour.cpp:19:26: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   19 | auto operator<<(auto &o, auto x)->decltype(end(x), o) {
      |                          ^~~~
joitour.cpp: In member function 'void drzewo::calc()':
joitour.cpp:105:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  105 |         for(int i=0; i<E[root].size(); i++){
      |                      ~^~~~~~~~~~~~~~~

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1880 KB Output is correct
2 Correct 1 ms 1880 KB Output is correct
3 Correct 1 ms 1880 KB Output is correct
4 Correct 2 ms 2392 KB Output is correct
5 Correct 1 ms 1880 KB Output is correct
6 Correct 2 ms 1880 KB Output is correct
7 Correct 1 ms 1880 KB Output is correct
8 Correct 1 ms 1880 KB Output is correct
9 Correct 2 ms 2392 KB Output is correct
10 Correct 2 ms 2340 KB Output is correct
11 Correct 1 ms 1880 KB Output is correct
12 Correct 1 ms 1880 KB Output is correct
13 Correct 1 ms 1880 KB Output is correct
14 Correct 1 ms 1880 KB Output is correct
15 Correct 1 ms 1880 KB Output is correct
16 Correct 1 ms 1880 KB Output is correct
17 Correct 1 ms 1880 KB Output is correct
18 Correct 1 ms 1880 KB Output is correct
19 Correct 2 ms 2392 KB Output is correct
20 Correct 1 ms 1880 KB Output is correct
21 Correct 2 ms 1880 KB Output is correct
22 Correct 2 ms 1880 KB Output is correct
23 Correct 1 ms 1880 KB Output is correct
24 Correct 3 ms 2432 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1880 KB Output is correct
2 Correct 1 ms 1880 KB Output is correct
3 Correct 1 ms 1880 KB Output is correct
4 Correct 2 ms 2392 KB Output is correct
5 Correct 1 ms 1880 KB Output is correct
6 Correct 2 ms 1880 KB Output is correct
7 Correct 1 ms 1880 KB Output is correct
8 Correct 1 ms 1880 KB Output is correct
9 Correct 2 ms 2392 KB Output is correct
10 Correct 2 ms 2340 KB Output is correct
11 Correct 1 ms 1880 KB Output is correct
12 Correct 1 ms 1880 KB Output is correct
13 Correct 1 ms 1880 KB Output is correct
14 Correct 1 ms 1880 KB Output is correct
15 Correct 1 ms 1880 KB Output is correct
16 Correct 1 ms 1880 KB Output is correct
17 Correct 1 ms 1880 KB Output is correct
18 Correct 1 ms 1880 KB Output is correct
19 Correct 2 ms 2392 KB Output is correct
20 Correct 1 ms 1880 KB Output is correct
21 Correct 2 ms 1880 KB Output is correct
22 Correct 2 ms 1880 KB Output is correct
23 Correct 1 ms 1880 KB Output is correct
24 Correct 3 ms 2432 KB Output is correct
25 Correct 28 ms 8024 KB Output is correct
26 Correct 21 ms 7476 KB Output is correct
27 Correct 9 ms 4888 KB Output is correct
28 Correct 28 ms 8324 KB Output is correct
29 Correct 17 ms 7768 KB Output is correct

Subtask #3
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1880 KB Output is correct
2 Correct 1107 ms 403720 KB Output is correct
3 Correct 1164 ms 403504 KB Output is correct
4 Correct 1105 ms 403364 KB Output is correct
5 Correct 1168 ms 403888 KB Output is correct
6 Correct 768 ms 387572 KB Output is correct
7 Correct 760 ms 387556 KB Output is correct
8 Correct 1087 ms 391524 KB Output is correct
9 Correct 1113 ms 387492 KB Output is correct
10 Correct 1061 ms 371412 KB Output is correct
11 Correct 1026 ms 361552 KB Output is correct
12 Correct 1154 ms 397416 KB Output is correct
13 Correct 1165 ms 397520 KB Output is correct
14 Correct 1200 ms 397268 KB Output is correct
15 Correct 1176 ms 397312 KB Output is correct
16 Correct 1160 ms 420268 KB Output is correct
17 Correct 1 ms 1880 KB Output is correct
18 Correct 1 ms 1880 KB Output is correct
19 Correct 1 ms 1880 KB Output is correct
20 Correct 1 ms 1880 KB Output is correct
21 Correct 935 ms 338144 KB Output is correct
22 Correct 929 ms 335872 KB Output is correct
23 Correct 989 ms 340240 KB Output is correct
24 Correct 1006 ms 341096 KB Output is correct
25 Correct 217 ms 156888 KB Output is correct
26 Correct 231 ms 156896 KB Output is correct
27 Correct 220 ms 156840 KB Output is correct
28 Correct 226 ms 157008 KB Output is correct
29 Correct 735 ms 421460 KB Output is correct
30 Correct 740 ms 421556 KB Output is correct
31 Correct 776 ms 421680 KB Output is correct
32 Correct 777 ms 421672 KB Output is correct
33 Correct 752 ms 390828 KB Output is correct
34 Correct 776 ms 390888 KB Output is correct
35 Correct 764 ms 390872 KB Output is correct
36 Correct 741 ms 390996 KB Output is correct

Subtask #4
0.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1880 KB Output is correct
2 Correct 1 ms 1880 KB Output is correct
3 Correct 1 ms 1880 KB Output is correct
4 Correct 1 ms 1880 KB Output is correct
5 Correct 1 ms 1880 KB Output is correct
6 Correct 1 ms 1880 KB Output is correct
7 Correct 2 ms 2392 KB Output is correct
8 Correct 27 ms 8280 KB Output is correct
9 Correct 793 ms 421472 KB Output is correct
10 Correct 759 ms 421800 KB Output is correct
11 Correct 751 ms 421700 KB Output is correct
12 Correct 799 ms 421568 KB Output is correct
13 Correct 2513 ms 203444 KB Output is correct
14 Execution timed out 3083 ms 203460 KB Time limit exceeded
15 Halted 0 ms 0 KB -

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1880 KB Output is correct
2 Correct 2 ms 1880 KB Output is correct
3 Correct 1 ms 1880 KB Output is correct
4 Correct 2 ms 1880 KB Output is correct
5 Correct 1 ms 1880 KB Output is correct
6 Correct 2 ms 2392 KB Output is correct
7 Correct 14 ms 7796 KB Output is correct
8 Correct 657 ms 390876 KB Output is correct
9 Correct 706 ms 390820 KB Output is correct
10 Correct 736 ms 390996 KB Output is correct
11 Correct 778 ms 390820 KB Output is correct
12 Correct 571 ms 188084 KB Output is correct
13 Correct 701 ms 188096 KB Output is correct
14 Correct 758 ms 188356 KB Output is correct
15 Correct 696 ms 188260 KB Output is correct
16 Correct 699 ms 188096 KB Output is correct
17 Correct 701 ms 188376 KB Output is correct
18 Correct 1174 ms 390996 KB Output is correct
19 Correct 1530 ms 390820 KB Output is correct
20 Correct 1568 ms 390820 KB Output is correct
21 Correct 1694 ms 390936 KB Output is correct
22 Correct 1460 ms 390756 KB Output is correct
23 Correct 1529 ms 390820 KB Output is correct

Subtask #6
0.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1880 KB Output is correct
2 Correct 1 ms 1880 KB Output is correct
3 Correct 1 ms 1880 KB Output is correct
4 Correct 2 ms 2392 KB Output is correct
5 Correct 1 ms 1880 KB Output is correct
6 Correct 2 ms 1880 KB Output is correct
7 Correct 1 ms 1880 KB Output is correct
8 Correct 1 ms 1880 KB Output is correct
9 Correct 2 ms 2392 KB Output is correct
10 Correct 2 ms 2340 KB Output is correct
11 Correct 1 ms 1880 KB Output is correct
12 Correct 1 ms 1880 KB Output is correct
13 Correct 1 ms 1880 KB Output is correct
14 Correct 1 ms 1880 KB Output is correct
15 Correct 1 ms 1880 KB Output is correct
16 Correct 1 ms 1880 KB Output is correct
17 Correct 1 ms 1880 KB Output is correct
18 Correct 1 ms 1880 KB Output is correct
19 Correct 2 ms 2392 KB Output is correct
20 Correct 1 ms 1880 KB Output is correct
21 Correct 2 ms 1880 KB Output is correct
22 Correct 2 ms 1880 KB Output is correct
23 Correct 1 ms 1880 KB Output is correct
24 Correct 3 ms 2432 KB Output is correct
25 Correct 28 ms 8024 KB Output is correct
26 Correct 21 ms 7476 KB Output is correct
27 Correct 9 ms 4888 KB Output is correct
28 Correct 28 ms 8324 KB Output is correct
29 Correct 17 ms 7768 KB Output is correct
30 Execution timed out 3090 ms 194484 KB Time limit exceeded
31 Halted 0 ms 0 KB -

Subtask #7
0.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1880 KB Output is correct
2 Correct 1 ms 1880 KB Output is correct
3 Correct 1 ms 1880 KB Output is correct
4 Correct 2 ms 2392 KB Output is correct
5 Correct 1 ms 1880 KB Output is correct
6 Correct 2 ms 1880 KB Output is correct
7 Correct 1 ms 1880 KB Output is correct
8 Correct 1 ms 1880 KB Output is correct
9 Correct 2 ms 2392 KB Output is correct
10 Correct 2 ms 2340 KB Output is correct
11 Correct 1 ms 1880 KB Output is correct
12 Correct 1 ms 1880 KB Output is correct
13 Correct 1 ms 1880 KB Output is correct
14 Correct 1 ms 1880 KB Output is correct
15 Correct 1 ms 1880 KB Output is correct
16 Correct 1 ms 1880 KB Output is correct
17 Correct 1 ms 1880 KB Output is correct
18 Correct 1 ms 1880 KB Output is correct
19 Correct 2 ms 2392 KB Output is correct
20 Correct 1 ms 1880 KB Output is correct
21 Correct 2 ms 1880 KB Output is correct
22 Correct 2 ms 1880 KB Output is correct
23 Correct 1 ms 1880 KB Output is correct
24 Correct 3 ms 2432 KB Output is correct
25 Correct 28 ms 8024 KB Output is correct
26 Correct 21 ms 7476 KB Output is correct
27 Correct 9 ms 4888 KB Output is correct
28 Correct 28 ms 8324 KB Output is correct
29 Correct 17 ms 7768 KB Output is correct
30 Correct 1 ms 1880 KB Output is correct
31 Correct 1107 ms 403720 KB Output is correct
32 Correct 1164 ms 403504 KB Output is correct
33 Correct 1105 ms 403364 KB Output is correct
34 Correct 1168 ms 403888 KB Output is correct
35 Correct 768 ms 387572 KB Output is correct
36 Correct 760 ms 387556 KB Output is correct
37 Correct 1087 ms 391524 KB Output is correct
38 Correct 1113 ms 387492 KB Output is correct
39 Correct 1061 ms 371412 KB Output is correct
40 Correct 1026 ms 361552 KB Output is correct
41 Correct 1154 ms 397416 KB Output is correct
42 Correct 1165 ms 397520 KB Output is correct
43 Correct 1200 ms 397268 KB Output is correct
44 Correct 1176 ms 397312 KB Output is correct
45 Correct 1160 ms 420268 KB Output is correct
46 Correct 1 ms 1880 KB Output is correct
47 Correct 1 ms 1880 KB Output is correct
48 Correct 1 ms 1880 KB Output is correct
49 Correct 1 ms 1880 KB Output is correct
50 Correct 935 ms 338144 KB Output is correct
51 Correct 929 ms 335872 KB Output is correct
52 Correct 989 ms 340240 KB Output is correct
53 Correct 1006 ms 341096 KB Output is correct
54 Correct 217 ms 156888 KB Output is correct
55 Correct 231 ms 156896 KB Output is correct
56 Correct 220 ms 156840 KB Output is correct
57 Correct 226 ms 157008 KB Output is correct
58 Correct 735 ms 421460 KB Output is correct
59 Correct 740 ms 421556 KB Output is correct
60 Correct 776 ms 421680 KB Output is correct
61 Correct 777 ms 421672 KB Output is correct
62 Correct 752 ms 390828 KB Output is correct
63 Correct 776 ms 390888 KB Output is correct
64 Correct 764 ms 390872 KB Output is correct
65 Correct 741 ms 390996 KB Output is correct
66 Correct 1 ms 1880 KB Output is correct
67 Correct 1 ms 1880 KB Output is correct
68 Correct 1 ms 1880 KB Output is correct
69 Correct 1 ms 1880 KB Output is correct
70 Correct 1 ms 1880 KB Output is correct
71 Correct 1 ms 1880 KB Output is correct
72 Correct 2 ms 2392 KB Output is correct
73 Correct 27 ms 8280 KB Output is correct
74 Correct 793 ms 421472 KB Output is correct
75 Correct 759 ms 421800 KB Output is correct
76 Correct 751 ms 421700 KB Output is correct
77 Correct 799 ms 421568 KB Output is correct
78 Correct 2513 ms 203444 KB Output is correct
79 Execution timed out 3083 ms 203460 KB Time limit exceeded
80 Halted 0 ms 0 KB -