oj.uz

답안 #751930

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
751930 2023-06-01T20:29:58 Z Spade1 Two Currencies (JOI23_currencies) C++14
100 / 100
 857 ms 118116 KB 
#include<bits/stdc++.h>
//#include <grader.h>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define ll long long
#define ld long double
#define st first
#define nd second
#define pb push_back
#define INF INT_MAX
using namespace std;

const int N = 1e5 + 10;
const int L = log2(N)+1;

struct node{
    ll val, cnt;
    ll lc, rc;
}seg[20*N];

vector<pll> adj[N];
vector<ll> cost[N];
map<ll, ll> mp, rv;
ll up[N][L], lvl[N], cnt, root[N];

void update(ll &cur, ll l, ll r, ll x, ll val) {
    cnt++;
    seg[cnt] = seg[cur];
    cur = cnt;

    if (l==r) {
        seg[cur].val = val;
        seg[cur].cnt = 1;
        return;
    }
    int mid = (l+r)/2;
    if (x <= mid) update(seg[cur].lc, l, mid, x, val);
    else update(seg[cur].rc, mid+1, r, x, val);
    seg[cur].val = seg[seg[cur].rc].val + seg[seg[cur].lc].val;
    seg[cur].cnt = seg[seg[cur].rc].cnt + seg[seg[cur].lc].cnt;
}

ll query(ll curu, ll curv, ll curc, ll l, ll r, ll x, ll ans) {
    if (l==r) {
        if (x >= seg[curu].val + seg[curv].val - 2*seg[curc].val)
            return ans + seg[curu].cnt + seg[curv].cnt - 2*seg[curc].cnt;
        else
            return ans;
    }
    ll mid = (l+r)/2;
    ll nxt = seg[seg[curu].lc].val + seg[seg[curv].lc].val - 2*seg[seg[curc].lc].val;
    ll lft = seg[seg[curu].lc].cnt + seg[seg[curv].lc].cnt - 2*seg[seg[curc].lc].cnt;
    if (nxt > x) return query(seg[curu].lc, seg[curv].lc, seg[curc].lc, l, mid, x, ans);
    else return query(seg[curu].rc, seg[curv].rc, seg[curc].rc, mid+1, r, x-nxt, ans+lft);
}

void dfs(ll a, ll prt) {
    up[a][0] = prt; lvl[a] = lvl[prt]+1;
    for (int i = 1; i < L; ++i) up[a][i] = up[up[a][i-1]][i-1];
    for (auto [b, idx] : adj[a]) if (b != prt) dfs(b, a);
}

ll lca(ll a, ll b) {
    if (lvl[a] < lvl[b]) swap(a, b);
    ll j = lvl[a]-lvl[b];
    for (int i = 0; i < L; ++i) if (j&(1<<i)) a = up[a][i];
    if (a==b) return a;
    for (int i = L-1; i >= 0; --i) if (up[a][i] != up[b][i]) a = up[a][i], b = up[b][i];
    return up[a][0];
}

void build(int a, int prt) {
    for (auto [b, i] : adj[a]) {
        if (b == prt) continue;
        root[b] = root[a];
        for (auto c : cost[i]) update(root[b], 1, 100000, mp[c], rv[c]);
        build(b, a);
    }
}

void solve() {
    int n, m, q; cin >> n >> m >> q;
    for (int i = 1; i < n; ++i) {
        ll a, b; cin >> a >> b;
        adj[a].pb({b, i});
        adj[b].pb({a, i});
    }
    vector<pll> v; ll tmp = 0;
    for (int i = 1; i <= m; ++i) {
        ll p, c; cin >> p >> c;
        cost[p].pb(i); v.pb({c, i});
    }
    sort(v.begin(), v.end());
    for (auto i : v) mp[i.nd] = ++tmp, rv[i.nd] = i.st;
    dfs(1, 0);
    build(1, 0);
    while (q--) {
        ll s, t, x, y; cin >> s >> t >> x >> y;
        ll c = lca(s, t);
        ll rmn = query(root[s], root[t], root[c], 1, 100000, 1e18, 0) - query(root[s], root[t], root[c], 1, 100000, y, 0);
        if (rmn > x) cout << -1 << '\n';
        else cout << x-rmn << '\n';
    }
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(NULL);
    int t = 1;
//    cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}

Compilation message

currencies.cpp: In function 'void dfs(long long int, long long int)':
currencies.cpp:60:15: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   60 |     for (auto [b, idx] : adj[a]) if (b != prt) dfs(b, a);
      |               ^
currencies.cpp: In function 'void build(int, int)':
currencies.cpp:73:15: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   73 |     for (auto [b, i] : adj[a]) {
      |               ^

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 8 ms 6848 KB Output is correct
6 Correct 7 ms 6740 KB Output is correct
7 Correct 6 ms 6476 KB Output is correct
8 Correct 7 ms 6868 KB Output is correct
9 Correct 8 ms 6940 KB Output is correct
10 Correct 9 ms 6868 KB Output is correct
11 Correct 10 ms 6888 KB Output is correct
12 Correct 8 ms 6868 KB Output is correct
13 Correct 8 ms 7124 KB Output is correct
14 Correct 9 ms 7124 KB Output is correct
15 Correct 9 ms 6964 KB Output is correct
16 Correct 12 ms 6964 KB Output is correct
17 Correct 8 ms 7048 KB Output is correct
18 Correct 8 ms 7060 KB Output is correct
19 Correct 10 ms 6868 KB Output is correct
20 Correct 8 ms 6836 KB Output is correct
21 Correct 9 ms 6860 KB Output is correct
22 Correct 8 ms 6840 KB Output is correct
23 Correct 8 ms 6880 KB Output is correct
24 Correct 10 ms 6968 KB Output is correct
25 Correct 8 ms 6868 KB Output is correct
26 Correct 8 ms 6972 KB Output is correct
27 Correct 8 ms 6964 KB Output is correct
28 Correct 8 ms 6956 KB Output is correct
29 Correct 10 ms 6868 KB Output is correct
30 Correct 7 ms 6872 KB Output is correct
31 Correct 7 ms 6868 KB Output is correct
32 Correct 10 ms 6868 KB Output is correct
33 Correct 8 ms 7272 KB Output is correct
34 Correct 8 ms 7228 KB Output is correct
35 Correct 8 ms 7252 KB Output is correct

Subtask #2
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 9 ms 6868 KB Output is correct
3 Correct 8 ms 6860 KB Output is correct
4 Correct 8 ms 6868 KB Output is correct
5 Correct 480 ms 93896 KB Output is correct
6 Correct 476 ms 82316 KB Output is correct
7 Correct 389 ms 73528 KB Output is correct
8 Correct 346 ms 71432 KB Output is correct
9 Correct 358 ms 75004 KB Output is correct
10 Correct 578 ms 101948 KB Output is correct
11 Correct 540 ms 102020 KB Output is correct
12 Correct 518 ms 102024 KB Output is correct
13 Correct 484 ms 101984 KB Output is correct
14 Correct 585 ms 102048 KB Output is correct
15 Correct 781 ms 116996 KB Output is correct
16 Correct 825 ms 117940 KB Output is correct
17 Correct 857 ms 116240 KB Output is correct
18 Correct 703 ms 102592 KB Output is correct
19 Correct 709 ms 102540 KB Output is correct
20 Correct 634 ms 102692 KB Output is correct
21 Correct 406 ms 100964 KB Output is correct
22 Correct 424 ms 101036 KB Output is correct
23 Correct 412 ms 101028 KB Output is correct
24 Correct 420 ms 101152 KB Output is correct
25 Correct 469 ms 101916 KB Output is correct
26 Correct 461 ms 101924 KB Output is correct
27 Correct 479 ms 101940 KB Output is correct
28 Correct 441 ms 101852 KB Output is correct
29 Correct 486 ms 101932 KB Output is correct
30 Correct 499 ms 102040 KB Output is correct
31 Correct 449 ms 102060 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 11 ms 7216 KB Output is correct
3 Correct 8 ms 7252 KB Output is correct
4 Correct 8 ms 7252 KB Output is correct
5 Correct 365 ms 89904 KB Output is correct
6 Correct 358 ms 79128 KB Output is correct
7 Correct 554 ms 95708 KB Output is correct
8 Correct 714 ms 118072 KB Output is correct
9 Correct 683 ms 118060 KB Output is correct
10 Correct 725 ms 117992 KB Output is correct
11 Correct 622 ms 117628 KB Output is correct
12 Correct 742 ms 117616 KB Output is correct
13 Correct 613 ms 117592 KB Output is correct
14 Correct 527 ms 117880 KB Output is correct
15 Correct 533 ms 117864 KB Output is correct
16 Correct 455 ms 118116 KB Output is correct
17 Correct 471 ms 118004 KB Output is correct

Subtask #4
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 8 ms 6848 KB Output is correct
6 Correct 7 ms 6740 KB Output is correct
7 Correct 6 ms 6476 KB Output is correct
8 Correct 7 ms 6868 KB Output is correct
9 Correct 8 ms 6940 KB Output is correct
10 Correct 9 ms 6868 KB Output is correct
11 Correct 10 ms 6888 KB Output is correct
12 Correct 8 ms 6868 KB Output is correct
13 Correct 8 ms 7124 KB Output is correct
14 Correct 9 ms 7124 KB Output is correct
15 Correct 9 ms 6964 KB Output is correct
16 Correct 12 ms 6964 KB Output is correct
17 Correct 8 ms 7048 KB Output is correct
18 Correct 8 ms 7060 KB Output is correct
19 Correct 10 ms 6868 KB Output is correct
20 Correct 8 ms 6836 KB Output is correct
21 Correct 9 ms 6860 KB Output is correct
22 Correct 8 ms 6840 KB Output is correct
23 Correct 8 ms 6880 KB Output is correct
24 Correct 10 ms 6968 KB Output is correct
25 Correct 8 ms 6868 KB Output is correct
26 Correct 8 ms 6972 KB Output is correct
27 Correct 8 ms 6964 KB Output is correct
28 Correct 8 ms 6956 KB Output is correct
29 Correct 10 ms 6868 KB Output is correct
30 Correct 7 ms 6872 KB Output is correct
31 Correct 7 ms 6868 KB Output is correct
32 Correct 10 ms 6868 KB Output is correct
33 Correct 8 ms 7272 KB Output is correct
34 Correct 8 ms 7228 KB Output is correct
35 Correct 8 ms 7252 KB Output is correct
36 Correct 3 ms 4948 KB Output is correct
37 Correct 9 ms 6868 KB Output is correct
38 Correct 8 ms 6860 KB Output is correct
39 Correct 8 ms 6868 KB Output is correct
40 Correct 480 ms 93896 KB Output is correct
41 Correct 476 ms 82316 KB Output is correct
42 Correct 389 ms 73528 KB Output is correct
43 Correct 346 ms 71432 KB Output is correct
44 Correct 358 ms 75004 KB Output is correct
45 Correct 578 ms 101948 KB Output is correct
46 Correct 540 ms 102020 KB Output is correct
47 Correct 518 ms 102024 KB Output is correct
48 Correct 484 ms 101984 KB Output is correct
49 Correct 585 ms 102048 KB Output is correct
50 Correct 781 ms 116996 KB Output is correct
51 Correct 825 ms 117940 KB Output is correct
52 Correct 857 ms 116240 KB Output is correct
53 Correct 703 ms 102592 KB Output is correct
54 Correct 709 ms 102540 KB Output is correct
55 Correct 634 ms 102692 KB Output is correct
56 Correct 406 ms 100964 KB Output is correct
57 Correct 424 ms 101036 KB Output is correct
58 Correct 412 ms 101028 KB Output is correct
59 Correct 420 ms 101152 KB Output is correct
60 Correct 469 ms 101916 KB Output is correct
61 Correct 461 ms 101924 KB Output is correct
62 Correct 479 ms 101940 KB Output is correct
63 Correct 441 ms 101852 KB Output is correct
64 Correct 486 ms 101932 KB Output is correct
65 Correct 499 ms 102040 KB Output is correct
66 Correct 449 ms 102060 KB Output is correct
67 Correct 3 ms 4948 KB Output is correct
68 Correct 11 ms 7216 KB Output is correct
69 Correct 8 ms 7252 KB Output is correct
70 Correct 8 ms 7252 KB Output is correct
71 Correct 365 ms 89904 KB Output is correct
72 Correct 358 ms 79128 KB Output is correct
73 Correct 554 ms 95708 KB Output is correct
74 Correct 714 ms 118072 KB Output is correct
75 Correct 683 ms 118060 KB Output is correct
76 Correct 725 ms 117992 KB Output is correct
77 Correct 622 ms 117628 KB Output is correct
78 Correct 742 ms 117616 KB Output is correct
79 Correct 613 ms 117592 KB Output is correct
80 Correct 527 ms 117880 KB Output is correct
81 Correct 533 ms 117864 KB Output is correct
82 Correct 455 ms 118116 KB Output is correct
83 Correct 471 ms 118004 KB Output is correct
84 Correct 436 ms 92944 KB Output is correct
85 Correct 416 ms 80680 KB Output is correct
86 Correct 285 ms 61556 KB Output is correct
87 Correct 548 ms 101988 KB Output is correct
88 Correct 536 ms 102028 KB Output is correct
89 Correct 546 ms 101928 KB Output is correct
90 Correct 538 ms 102008 KB Output is correct
91 Correct 540 ms 101980 KB Output is correct
92 Correct 801 ms 112348 KB Output is correct
93 Correct 760 ms 115864 KB Output is correct
94 Correct 724 ms 102684 KB Output is correct
95 Correct 674 ms 102664 KB Output is correct
96 Correct 621 ms 102592 KB Output is correct
97 Correct 636 ms 102512 KB Output is correct
98 Correct 407 ms 101180 KB Output is correct
99 Correct 449 ms 100920 KB Output is correct
100 Correct 408 ms 101200 KB Output is correct
101 Correct 401 ms 101012 KB Output is correct
102 Correct 459 ms 101944 KB Output is correct
103 Correct 457 ms 101976 KB Output is correct
104 Correct 479 ms 101952 KB Output is correct
105 Correct 403 ms 102036 KB Output is correct
106 Correct 407 ms 101944 KB Output is correct
107 Correct 446 ms 101944 KB Output is correct
108 Correct 483 ms 101964 KB Output is correct