Submission #899139

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
899139	2024-01-05 14:02:31	The_Samurai	Two Currencies (JOI23_currencies)	C++17	0 / 100	2 ms	860 KiB

currencies

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
void solve() {
    int n, m, q;
    cin >> n >> m >> q;
    vector<vector<pair<int, ll>>> g(n + 1);
    vector<pair<int, int>> adj(n - 1);
    vector<ll> val(n - 1);
    for (auto &[x, y]: adj) cin >> x >> y;
    bool sub2 = true;
    ll last = 0;
    for (int i = 0; i < m; i++) {
        int p, c;
        cin >> p >> c;
        val[p - 1] += c;
        if (i > 0) sub2 &= last == c;
        last = c;
    }
    for (int i = 0; i < n - 1; i++) {
        g[adj[i].first].emplace_back(adj[i].second, val[i]);
        g[adj[i].second].emplace_back(adj[i].first, val[i]);
    }
    if (sub2) {
        const int lg = 17;
        vector jump(lg, vector(n + 1, 0));
        vector<int> tin(n + 1), tout(n + 1), height(n + 1);
        vector<ll> need(n + 1);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 0 / 10
• Subtask 2: 0 / 28
• Subtask 3: 0 / 30
• Subtask 4: 0 / 32