QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#149092#5249. BanditsForever_YoungWA 537ms30488kbC++144.0kb2023-08-24 00:21:132023-08-24 00:21:15

Judging History

你现在查看的是最新测评结果

  • [2023-08-24 00:21:15]
  • 评测
  • 测评结果:WA
  • 用时:537ms
  • 内存:30488kb
  • [2023-08-24 00:21:13]
  • 提交

answer

#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/detail/standard_policies.hpp>
using namespace __gnu_pbds;
using namespace std;
#define pb push_back
const int N = 100011;
int vst[N];
int tim = 0;
const int inf = 1e9 + 7;
struct E {
    int y, z, n;
} e[N * 2];
vector<int> vec[N];
int q[N][3];
int dep[N];
int blg[N], idx[N], son[N], siz[N], ans[N], x[N], y[N];
int l = 1;
typedef tree<pair<int, int> , null_type, less<pair<int, int> >, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
ordered_set mp, mps[N];

void get_size(int v, int fa = 0) {
    siz[v] = 1;
    son[v] = 0;
    int mx = -1;
    for(int p = idx[v]; p; p = e[p].n) {
        int y = e[p].y;
        if(y == fa) continue;
        get_size(y, v);
        siz[v] += siz[y];
        if(siz[y] > mx) {
            mx = siz[y];
            son[v] = y;
        }
    }
}
int get_root(int st) {
    get_size(st);
    int tot = siz[st];
    while(siz[son[st]] > tot / 2) {
        st = son[st];
    }
    return st;
}
void dfs(int v, int fa = 0) {
    for(int p = idx[v]; p; p = e[p].n) {
        int y = e[p].y;
        if(y == fa) continue;
        int z = e[p].z;
        dep[y] = min(inf, dep[v] + z);
        blg[y] = fa == 0 ? y : blg[v];
        dfs(y, v);
    }
}
void build(int x, int y, int z) {
    e[++l].y = y;
    e[l].z = z;
    e[l].n = idx[x];
    idx[x] = l;
}
void dvcq(int st, vector<int> qids) {
    int rt = get_root(st);
    //printf("st = %d, rt = %d, queries = %d, siz = %d\n", st, rt, qids.size(), siz[st]);
    dep[rt] = 0;
    dfs(rt);
    int cnt = 0;
    for(int id : qids) {
        if(q[id][0] == '+') {
            int v = q[id][1];
            int len = q[id][2];
            if(dep[v] <= len) {
                
                if(siz[st] == 2) {
                    cnt++;
                }else {
                    mp.insert({len - dep[v], id});
                    if(v == rt) {

                    }else {
                        mps[blg[v]].insert({len - dep[v], id});
                        vec[blg[v]].pb(id);
                    }
                }
            }else {
                if(siz[st] == 2) {
                    
                }else {
                    vec[blg[v]].pb(id);
                }
            }
        }else {
            if(siz[st] == 2) {
                ans[id] += cnt;
            }else {
                int eid = q[id][1];
                int x = ::x[eid];
                int y = ::y[eid];
                if(dep[x] < dep[y]) {
                    x = y;
                }
                ans[id] += mp.size() - mp.order_of_key({dep[x], -1});
                ans[id] -= mps[blg[x]].size() - mps[blg[x]].order_of_key({dep[x], -1});
                vec[x == rt ? blg[y] : blg[x]].pb(id);
            }
        }
    }
    if(siz[st] == 2) return;
    mp.clear();
    for(int p = idx[rt]; p; p = e[p].n) {
        int y = e[p].y;
        mps[y].clear();
    }
    for(int p = idx[rt]; p; p = e[p].n) {
        int y = e[p].y;
        int bak = idx[rt];
        int nxt = e[p].n;
        idx[rt] = p;
        e[p].n = 0;

        dvcq(y, move(vec[y]));
        idx[rt] = bak;
        e[p].n = nxt;
    }
}
int main() {
    int n, Q;
    scanf("%d", &n);
    for(int i = 0; i < n - 1; i++) {
        int x, y, z;
        scanf("%d%d%d", &x, &y, &z);
        build(x, y, z);
        build(y, x, z);
        ::x[i] = x;
        ::y[i] = y;
    }
    scanf("%d", &Q);
    vector<int> queries;
    for(int i = 0; i < Q; i++) {
        queries.pb(i);
        static char st[111];
        scanf("%s", st);
        q[i][0] = st[0];
        if(q[i][0] == '+') {
            scanf("%d%d", &q[i][1], &q[i][2]);
        }else {
            scanf("%d", &q[i][1]);
            q[i][1] -= 1;
        }
    }
    dvcq(1, queries);
    for(int i = 0; i < Q; i++) {
        if(q[i][0] == '?') {
            printf("%d\n", ans[i]);
        }
    }
}

详细

Test #1:

score: 0
Wrong Answer
time: 537ms
memory: 30488kb

input:

100000
2670 75097 4080
87477 75802 1712
51835 36626 2883
19412 25923 5852
23976 19312 2520
82536 19514 2492
27160 66601 4483
99087 15088 3504
47050 58820 2964
37063 5696 9901
7717 1496 4891
79136 5448 4340
22575 81285 9289
96280 3803 9877
41980 32139 2855
44236 64938 3298
5983 99947 9666
95856 62545...

output:

0
0
0
2
2
5
2
2
3
4
4
7
8
9
11
10
14
12
12
10
11
10
10
9
10
11
11
9
15
11
14
13
14
16
11
17
15
13
15
14
14
20
15
20
22
22
20
17
23
23
24
29
24
26
30
31
36
28
37
39
35
34
45
39
46
45
43
46
42
49
44
50
43
47
52
50
49
57
51
56
61
58
68
66
69
69
61
63
67
63
72
74
78
72
73
78
77
73
85
76
86
82
85
76
82
8...

result:

wrong answer 11513th lines differ - expected: '9999', found: '10001'