oj.uz

답안 #792814

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
792814 2023-07-25T09:01:59 Z vjudge1 Two Currencies (JOI23_currencies) C++17
38 / 100
 239 ms 47620 KB 
#ifdef Home
#define _GLIBCXX_DEBUG
#endif // Home

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;

const int N = 100100;
const int LOGN = 17;

struct MyPQ{
    priority_queue < int > pq;
    ll sum = 0, y, c = 0;

    MyPQ(ll y):y(y) {};

    void add(ll x) {
        pq.push(x);
        sum += x;
        for(; sum > y;) {
            sum -= pq.top();
            pq.pop();
            ++ c;
        }
    }
};

vector < pair < int, int > > adj[N];
vector < int > C[N];

ll n, m, q, cnt[N][LOGN], depth[N], up[N][LOGN], P_C[N], pr_c = -1;

void dfs1(int v, int p) {
    depth[v] = depth[p] + 1;
    up[v][0] = p;
    for(int i = 1; i < LOGN; ++ i) {
        cnt[v][i] = cnt[v][i - 1] + cnt[ up[v][i - 1] ][i - 1];
        up[v][i] = up[ up[v][i - 1] ][i - 1];
    }
    for(auto &[u, w] : adj[v]) {
        if(u != p) {
            P_C[u] = w;
            cnt[u][0] = C[w].size();
            dfs1(u, v);
        }
    }
}

ll slow_LCA(ll a, ll b, ll &Y) {
    if(depth[a] < depth[b]) {
        swap(a, b);
    }
    MyPQ ans(Y);
    for(; depth[a] > depth[b];) {
        for(auto &i : C[P_C[a]]) {
            ans.add(i);
        }
        a = up[a][0];
    }
    for(; a != b;) {
        for(auto &i : C[P_C[a]]) {
            ans.add(i);
        }
        for(auto &i : C[P_C[b]]) {
            ans.add(i);
        }
        a = up[a][0];
        b = up[b][0];
    }
    return ans.c;
}

ll fast_LCA(ll a, ll b) {
    ll c = 0;
    if(depth[a] < depth[b]) {
        swap(a, b);
    }
    for(int t = LOGN; t --> 0;) {
        if(depth[up[a][t]] >= depth[b]) {
            c += cnt[a][t];
            a = up[a][t];
        }
    }
    if(a == b) {
        return c;
    }
    for(int t = LOGN; t --> 0;) {
        if(up[a][t] != up[b][t]) {
            c += cnt[a][t];
            c += cnt[b][t];
            a = up[a][t];
            b = up[b][t];
        }
    }
    c += cnt[a][0];
    c += cnt[b][0];
    return c;
}

void solve_subtask_1() {
    dfs1(1, 1);
    ll s, t, X, Y, Z;
    for(; q --> 0;) {
        cin >> s >> t >> X >> Y;
        Z = slow_LCA(s, t, Y);
        cout << (X < Z ? -1 : X - Z) << '\n';
    }   
}

void solve_subtask_2() {
    ll s, t, X, Y, Z;
    dfs1(1, 1);
    for(; q --> 0;) {
        cin >> s >> t >> X >> Y;
        Z = fast_LCA(s, t);
        Z -= Y / pr_c;
        cout << (X < Z ? -1 : X - max(0ll, Z)) << '\n';
    }
}

main() {
#ifdef Home
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif // Home
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    cin >> n >> m >> q;
    for(int u, v, i = 1; i < n; ++ i) {
        cin >> u >> v;
        adj[u].push_back({v, i});
        adj[v].push_back({u, i});
    }
    bool subtsk2 = true;
    for(int p, c; m --> 0;) {
        cin >> p >> c;
        if(pr_c != -1) {
            subtsk2 &= pr_c == c;
        }
        C[p].push_back(c);
        pr_c = c;
    }
    if(subtsk2) {
        solve_subtask_2();
        return 0;
    }
    if(n <= 2023 && q <= 2023) {
        solve_subtask_1();
        return 0;
    }
}

Compilation message

currencies.cpp:125:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  125 | main() {
      | ^~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 2 ms 5032 KB Output is correct
5 Correct 5 ms 5680 KB Output is correct
6 Correct 7 ms 5716 KB Output is correct
7 Correct 5 ms 5556 KB Output is correct
8 Correct 5 ms 5716 KB Output is correct
9 Correct 5 ms 5832 KB Output is correct
10 Correct 5 ms 5804 KB Output is correct
11 Correct 5 ms 5716 KB Output is correct
12 Correct 5 ms 5716 KB Output is correct
13 Correct 69 ms 5924 KB Output is correct
14 Correct 69 ms 5912 KB Output is correct
15 Correct 30 ms 5852 KB Output is correct
16 Correct 24 ms 5844 KB Output is correct
17 Correct 19 ms 5804 KB Output is correct
18 Correct 31 ms 5816 KB Output is correct
19 Correct 4 ms 5716 KB Output is correct
20 Correct 6 ms 5736 KB Output is correct
21 Correct 4 ms 5716 KB Output is correct
22 Correct 4 ms 5804 KB Output is correct
23 Correct 39 ms 5716 KB Output is correct
24 Correct 37 ms 5716 KB Output is correct
25 Correct 35 ms 5716 KB Output is correct
26 Correct 5 ms 5804 KB Output is correct
27 Correct 4 ms 5716 KB Output is correct
28 Correct 4 ms 5716 KB Output is correct
29 Correct 4 ms 5716 KB Output is correct
30 Correct 4 ms 5716 KB Output is correct
31 Correct 4 ms 5704 KB Output is correct
32 Correct 4 ms 5716 KB Output is correct
33 Correct 61 ms 5944 KB Output is correct
34 Correct 65 ms 6072 KB Output is correct
35 Correct 62 ms 5960 KB Output is correct

Subtask #2
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 4 ms 5716 KB Output is correct
3 Correct 4 ms 5796 KB Output is correct
4 Correct 5 ms 5828 KB Output is correct
5 Correct 139 ms 40276 KB Output is correct
6 Correct 136 ms 30864 KB Output is correct
7 Correct 147 ms 35660 KB Output is correct
8 Correct 123 ms 37004 KB Output is correct
9 Correct 118 ms 36940 KB Output is correct
10 Correct 180 ms 42128 KB Output is correct
11 Correct 163 ms 41956 KB Output is correct
12 Correct 161 ms 41932 KB Output is correct
13 Correct 189 ms 41900 KB Output is correct
14 Correct 157 ms 41960 KB Output is correct
15 Correct 239 ms 47240 KB Output is correct
16 Correct 230 ms 47620 KB Output is correct
17 Correct 235 ms 47036 KB Output is correct
18 Correct 206 ms 41732 KB Output is correct
19 Correct 195 ms 41600 KB Output is correct
20 Correct 193 ms 41584 KB Output is correct
21 Correct 156 ms 42100 KB Output is correct
22 Correct 134 ms 42152 KB Output is correct
23 Correct 133 ms 42084 KB Output is correct
24 Correct 138 ms 42172 KB Output is correct
25 Correct 147 ms 41520 KB Output is correct
26 Correct 151 ms 41568 KB Output is correct
27 Correct 141 ms 41548 KB Output is correct
28 Correct 130 ms 41948 KB Output is correct
29 Correct 124 ms 41916 KB Output is correct
30 Correct 131 ms 42008 KB Output is correct
31 Correct 135 ms 42152 KB Output is correct

Subtask #3
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 61 ms 5856 KB Output is correct
3 Correct 62 ms 5860 KB Output is correct
4 Correct 63 ms 5848 KB Output is correct
5 Incorrect 30 ms 9416 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 2 ms 5032 KB Output is correct
5 Correct 5 ms 5680 KB Output is correct
6 Correct 7 ms 5716 KB Output is correct
7 Correct 5 ms 5556 KB Output is correct
8 Correct 5 ms 5716 KB Output is correct
9 Correct 5 ms 5832 KB Output is correct
10 Correct 5 ms 5804 KB Output is correct
11 Correct 5 ms 5716 KB Output is correct
12 Correct 5 ms 5716 KB Output is correct
13 Correct 69 ms 5924 KB Output is correct
14 Correct 69 ms 5912 KB Output is correct
15 Correct 30 ms 5852 KB Output is correct
16 Correct 24 ms 5844 KB Output is correct
17 Correct 19 ms 5804 KB Output is correct
18 Correct 31 ms 5816 KB Output is correct
19 Correct 4 ms 5716 KB Output is correct
20 Correct 6 ms 5736 KB Output is correct
21 Correct 4 ms 5716 KB Output is correct
22 Correct 4 ms 5804 KB Output is correct
23 Correct 39 ms 5716 KB Output is correct
24 Correct 37 ms 5716 KB Output is correct
25 Correct 35 ms 5716 KB Output is correct
26 Correct 5 ms 5804 KB Output is correct
27 Correct 4 ms 5716 KB Output is correct
28 Correct 4 ms 5716 KB Output is correct
29 Correct 4 ms 5716 KB Output is correct
30 Correct 4 ms 5716 KB Output is correct
31 Correct 4 ms 5704 KB Output is correct
32 Correct 4 ms 5716 KB Output is correct
33 Correct 61 ms 5944 KB Output is correct
34 Correct 65 ms 6072 KB Output is correct
35 Correct 62 ms 5960 KB Output is correct
36 Correct 2 ms 4948 KB Output is correct
37 Correct 4 ms 5716 KB Output is correct
38 Correct 4 ms 5796 KB Output is correct
39 Correct 5 ms 5828 KB Output is correct
40 Correct 139 ms 40276 KB Output is correct
41 Correct 136 ms 30864 KB Output is correct
42 Correct 147 ms 35660 KB Output is correct
43 Correct 123 ms 37004 KB Output is correct
44 Correct 118 ms 36940 KB Output is correct
45 Correct 180 ms 42128 KB Output is correct
46 Correct 163 ms 41956 KB Output is correct
47 Correct 161 ms 41932 KB Output is correct
48 Correct 189 ms 41900 KB Output is correct
49 Correct 157 ms 41960 KB Output is correct
50 Correct 239 ms 47240 KB Output is correct
51 Correct 230 ms 47620 KB Output is correct
52 Correct 235 ms 47036 KB Output is correct
53 Correct 206 ms 41732 KB Output is correct
54 Correct 195 ms 41600 KB Output is correct
55 Correct 193 ms 41584 KB Output is correct
56 Correct 156 ms 42100 KB Output is correct
57 Correct 134 ms 42152 KB Output is correct
58 Correct 133 ms 42084 KB Output is correct
59 Correct 138 ms 42172 KB Output is correct
60 Correct 147 ms 41520 KB Output is correct
61 Correct 151 ms 41568 KB Output is correct
62 Correct 141 ms 41548 KB Output is correct
63 Correct 130 ms 41948 KB Output is correct
64 Correct 124 ms 41916 KB Output is correct
65 Correct 131 ms 42008 KB Output is correct
66 Correct 135 ms 42152 KB Output is correct
67 Correct 2 ms 4948 KB Output is correct
68 Correct 61 ms 5856 KB Output is correct
69 Correct 62 ms 5860 KB Output is correct
70 Correct 63 ms 5848 KB Output is correct
71 Incorrect 30 ms 9416 KB Output isn't correct
72 Halted 0 ms 0 KB -