oj.uz

답안 #1030950

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1030950 2024-07-22T12:48:12 Z Antekb JOI tour (JOI24_joitour) C++17
20 / 100
 3000 ms 418528 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 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;
        ll 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]=0;
        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();
    }
};

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) {
    typ[X]=Y;
    while(X!=-1){
        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:104:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  104 |         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 3 ms 2392 KB Output is correct
5 Correct 2 ms 1880 KB Output is correct
6 Correct 1 ms 1880 KB Output is correct
7 Correct 2 ms 1832 KB Output is correct
8 Correct 1 ms 1880 KB Output is correct
9 Correct 3 ms 2392 KB Output is correct
10 Correct 2 ms 2136 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 2 ms 1880 KB Output is correct
15 Correct 2 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 3 ms 2392 KB Output is correct
20 Correct 1 ms 1880 KB Output is correct
21 Correct 1 ms 1880 KB Output is correct
22 Correct 1 ms 1880 KB Output is correct
23 Correct 1 ms 1880 KB Output is correct
24 Correct 3 ms 2256 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 3 ms 2392 KB Output is correct
5 Correct 2 ms 1880 KB Output is correct
6 Correct 1 ms 1880 KB Output is correct
7 Correct 2 ms 1832 KB Output is correct
8 Correct 1 ms 1880 KB Output is correct
9 Correct 3 ms 2392 KB Output is correct
10 Correct 2 ms 2136 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 2 ms 1880 KB Output is correct
15 Correct 2 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 3 ms 2392 KB Output is correct
20 Correct 1 ms 1880 KB Output is correct
21 Correct 1 ms 1880 KB Output is correct
22 Correct 1 ms 1880 KB Output is correct
23 Correct 1 ms 1880 KB Output is correct
24 Correct 3 ms 2256 KB Output is correct
25 Correct 197 ms 8024 KB Output is correct
26 Correct 169 ms 7256 KB Output is correct
27 Correct 36 ms 4952 KB Output is correct
28 Correct 124 ms 8280 KB Output is correct
29 Correct 98 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 1061 ms 400472 KB Output is correct
3 Correct 1099 ms 400292 KB Output is correct
4 Correct 1058 ms 400292 KB Output is correct
5 Correct 1058 ms 400804 KB Output is correct
6 Correct 713 ms 384496 KB Output is correct
7 Correct 716 ms 384340 KB Output is correct
8 Correct 1077 ms 388328 KB Output is correct
9 Correct 1065 ms 384600 KB Output is correct
10 Correct 974 ms 368608 KB Output is correct
11 Correct 963 ms 358504 KB Output is correct
12 Correct 1042 ms 394188 KB Output is correct
13 Correct 1014 ms 394404 KB Output is correct
14 Correct 1048 ms 394248 KB Output is correct
15 Correct 1032 ms 394332 KB Output is correct
16 Correct 1068 ms 416944 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 869 ms 335008 KB Output is correct
22 Correct 907 ms 332884 KB Output is correct
23 Correct 1014 ms 337244 KB Output is correct
24 Correct 981 ms 337748 KB Output is correct
25 Correct 235 ms 153684 KB Output is correct
26 Correct 211 ms 153680 KB Output is correct
27 Correct 211 ms 153764 KB Output is correct
28 Correct 196 ms 153764 KB Output is correct
29 Correct 737 ms 418468 KB Output is correct
30 Correct 682 ms 418340 KB Output is correct
31 Correct 691 ms 418312 KB Output is correct
32 Correct 697 ms 418528 KB Output is correct
33 Correct 723 ms 387640 KB Output is correct
34 Correct 717 ms 387828 KB Output is correct
35 Correct 735 ms 387764 KB Output is correct
36 Correct 721 ms 387792 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 3 ms 2392 KB Output is correct
8 Correct 132 ms 8096 KB Output is correct
9 Correct 752 ms 418400 KB Output is correct
10 Correct 725 ms 418508 KB Output is correct
11 Correct 776 ms 418468 KB Output is correct
12 Correct 748 ms 418388 KB Output is correct
13 Execution timed out 3045 ms 201832 KB Time limit exceeded
14 Halted 0 ms 0 KB -

Subtask #5
0.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 3 ms 1880 KB Output is correct
4 Correct 1 ms 1908 KB Output is correct
5 Correct 1 ms 1880 KB Output is correct
6 Correct 3 ms 2392 KB Output is correct
7 Correct 106 ms 7768 KB Output is correct
8 Correct 723 ms 387868 KB Output is correct
9 Correct 699 ms 387748 KB Output is correct
10 Correct 722 ms 387900 KB Output is correct
11 Correct 694 ms 387792 KB Output is correct
12 Execution timed out 3024 ms 186564 KB Time limit exceeded
13 Halted 0 ms 0 KB -

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 3 ms 2392 KB Output is correct
5 Correct 2 ms 1880 KB Output is correct
6 Correct 1 ms 1880 KB Output is correct
7 Correct 2 ms 1832 KB Output is correct
8 Correct 1 ms 1880 KB Output is correct
9 Correct 3 ms 2392 KB Output is correct
10 Correct 2 ms 2136 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 2 ms 1880 KB Output is correct
15 Correct 2 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 3 ms 2392 KB Output is correct
20 Correct 1 ms 1880 KB Output is correct
21 Correct 1 ms 1880 KB Output is correct
22 Correct 1 ms 1880 KB Output is correct
23 Correct 1 ms 1880 KB Output is correct
24 Correct 3 ms 2256 KB Output is correct
25 Correct 197 ms 8024 KB Output is correct
26 Correct 169 ms 7256 KB Output is correct
27 Correct 36 ms 4952 KB Output is correct
28 Correct 124 ms 8280 KB Output is correct
29 Correct 98 ms 7768 KB Output is correct
30 Execution timed out 3100 ms 192832 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 3 ms 2392 KB Output is correct
5 Correct 2 ms 1880 KB Output is correct
6 Correct 1 ms 1880 KB Output is correct
7 Correct 2 ms 1832 KB Output is correct
8 Correct 1 ms 1880 KB Output is correct
9 Correct 3 ms 2392 KB Output is correct
10 Correct 2 ms 2136 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 2 ms 1880 KB Output is correct
15 Correct 2 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 3 ms 2392 KB Output is correct
20 Correct 1 ms 1880 KB Output is correct
21 Correct 1 ms 1880 KB Output is correct
22 Correct 1 ms 1880 KB Output is correct
23 Correct 1 ms 1880 KB Output is correct
24 Correct 3 ms 2256 KB Output is correct
25 Correct 197 ms 8024 KB Output is correct
26 Correct 169 ms 7256 KB Output is correct
27 Correct 36 ms 4952 KB Output is correct
28 Correct 124 ms 8280 KB Output is correct
29 Correct 98 ms 7768 KB Output is correct
30 Correct 1 ms 1880 KB Output is correct
31 Correct 1061 ms 400472 KB Output is correct
32 Correct 1099 ms 400292 KB Output is correct
33 Correct 1058 ms 400292 KB Output is correct
34 Correct 1058 ms 400804 KB Output is correct
35 Correct 713 ms 384496 KB Output is correct
36 Correct 716 ms 384340 KB Output is correct
37 Correct 1077 ms 388328 KB Output is correct
38 Correct 1065 ms 384600 KB Output is correct
39 Correct 974 ms 368608 KB Output is correct
40 Correct 963 ms 358504 KB Output is correct
41 Correct 1042 ms 394188 KB Output is correct
42 Correct 1014 ms 394404 KB Output is correct
43 Correct 1048 ms 394248 KB Output is correct
44 Correct 1032 ms 394332 KB Output is correct
45 Correct 1068 ms 416944 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 869 ms 335008 KB Output is correct
51 Correct 907 ms 332884 KB Output is correct
52 Correct 1014 ms 337244 KB Output is correct
53 Correct 981 ms 337748 KB Output is correct
54 Correct 235 ms 153684 KB Output is correct
55 Correct 211 ms 153680 KB Output is correct
56 Correct 211 ms 153764 KB Output is correct
57 Correct 196 ms 153764 KB Output is correct
58 Correct 737 ms 418468 KB Output is correct
59 Correct 682 ms 418340 KB Output is correct
60 Correct 691 ms 418312 KB Output is correct
61 Correct 697 ms 418528 KB Output is correct
62 Correct 723 ms 387640 KB Output is correct
63 Correct 717 ms 387828 KB Output is correct
64 Correct 735 ms 387764 KB Output is correct
65 Correct 721 ms 387792 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 3 ms 2392 KB Output is correct
73 Correct 132 ms 8096 KB Output is correct
74 Correct 752 ms 418400 KB Output is correct
75 Correct 725 ms 418508 KB Output is correct
76 Correct 776 ms 418468 KB Output is correct
77 Correct 748 ms 418388 KB Output is correct
78 Execution timed out 3045 ms 201832 KB Time limit exceeded
79 Halted 0 ms 0 KB -