oj.uz

답안 #971650

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
971650 2024-04-29T06:36:05 Z vjudge1 Two Currencies (JOI23_currencies) C++
10 / 100
 5000 ms 58528 KB 
#include <time.h>
#include <cstdlib>
#include <stack>
#include <numeric>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <map>
#include <set>
#include <iterator>
#include <deque>
#include <queue>
#include <sstream>
#include <array>
#include <string>
#include <tuple>
#include <chrono>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <list>
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <bitset>
#define ll long long
using namespace std;

int tt = 1, n, m, q;
vector<int> g[200005];
ll p[100005], c[100005], s[100005], t[100005], x[100005], y[100005], h[100005], pp[100005];
pair<ll, ll> mn[1000005];
vector<ll> v;
map<pair<int, int>, int> mp;
void dfs(int k, int pr){
    v.push_back(k);
    pp[k] = pr;
    for(int to : g[k]){
        if(to == pr) continue;
        h[to] = h[k] + 1;
        dfs(to, k);
        v.push_back(k);
    }
}
void up(int l, int r, int pos, int num, int ind, int vv){
    if(l > pos || r < pos) return;
    if(l == r){
        mn[vv] = {num, ind};
        return; 
    }
    int mid = (l + r) / 2;
    up(l, mid, pos, num, ind, vv * 2);
    up(mid + 1, r, pos, num, ind, vv * 2 + 1);
    mn[vv] = min(mn[vv * 2], mn[vv * 2 + 1]);
}
pair<int, int> sbor(int l, int r, int l1, int r1, int vv){
    if(l > r1 || l1 > r) return {1e9, 1e9};
    if(l >= l1 && r1 >= r) return mn[vv];
    int mid = (l + r) / 2;
    return min(sbor(l, mid, l1, r1, vv * 2), sbor(mid + 1, r, l1, r1, vv * 2 + 1));
}
vector<ll> ss[100005];
int lf[1000005];
int main(){
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    cin >> n >> m >> q;
    for(int i = 1; i < n; i++){
        int a, b;
        cin >> a >> b;
        g[a].push_back(b);
        g[b].push_back(a);
        mp[{a, b}] = i;
        mp[{b, a}] = i;
    }
    for(int i = 1; i <= m; i++){
        cin >> p[i] >> c[i];
        ss[p[i]].push_back(c[i]);
    }
    for(int i = 1; i <= q; i++)
        cin >> s[i] >> t[i] >> x[i] >> y[i];
    v.push_back(1);
    dfs(1, 0);
    for(int i = 1; i < int(v.size()); i++){
        up(1, int(v.size()) - 1, i, h[v[i]], v[i], 1);
        if(lf[v[i]] == 0) lf[v[i]] = i;
    }
    int d = v.size();
    for(int i = 1; i <= q; i++){
        int l = min(lf[s[i]], lf[t[i]]);
        int r = max(lf[s[i]], lf[t[i]]);
        auto it = sbor(1, d - 1, l, r, 1);
        int lca = it.second;
        vector<int> vv;
        l = s[i], r = t[i];
        while(l != lca){
            for(ll to : ss[mp[{l, pp[l]}]])
                vv.push_back(to);
            l = pp[l];
        }
        while(r != lca){
            for(ll to : ss[mp[{r, pp[r]}]])
                vv.push_back(to);
            r = pp[r];
        }
        sort(vv.rbegin(), vv.rend());
        while(!vv.empty()){
            if(y[i] >= vv.back()){
                y[i] -= vv.back();
                vv.pop_back();
            }
            else break;
        }
        x[i] -= int(vv.size());
        if(x[i] < 0) cout << -1 << "\n";
        else cout << x[i] << "\n";
    }
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 16732 KB Output is correct
2 Correct 4 ms 16732 KB Output is correct
3 Correct 3 ms 16732 KB Output is correct
4 Correct 3 ms 16732 KB Output is correct
5 Correct 9 ms 19204 KB Output is correct
6 Correct 10 ms 19312 KB Output is correct
7 Correct 8 ms 19288 KB Output is correct
8 Correct 10 ms 19292 KB Output is correct
9 Correct 10 ms 19292 KB Output is correct
10 Correct 10 ms 19320 KB Output is correct
11 Correct 10 ms 19320 KB Output is correct
12 Correct 11 ms 19328 KB Output is correct
13 Correct 182 ms 19444 KB Output is correct
14 Correct 171 ms 19292 KB Output is correct
15 Correct 78 ms 19288 KB Output is correct
16 Correct 59 ms 19368 KB Output is correct
17 Correct 49 ms 19292 KB Output is correct
18 Correct 82 ms 19536 KB Output is correct
19 Correct 7 ms 19132 KB Output is correct
20 Correct 9 ms 19292 KB Output is correct
21 Correct 8 ms 19292 KB Output is correct
22 Correct 9 ms 19288 KB Output is correct
23 Correct 51 ms 19320 KB Output is correct
24 Correct 47 ms 19292 KB Output is correct
25 Correct 46 ms 19292 KB Output is correct
26 Correct 8 ms 19292 KB Output is correct
27 Correct 8 ms 19292 KB Output is correct
28 Correct 8 ms 19324 KB Output is correct
29 Correct 7 ms 19292 KB Output is correct
30 Correct 10 ms 19492 KB Output is correct
31 Correct 9 ms 19292 KB Output is correct
32 Correct 10 ms 19292 KB Output is correct
33 Correct 130 ms 19460 KB Output is correct
34 Correct 133 ms 19460 KB Output is correct
35 Correct 132 ms 19288 KB Output is correct

Subtask #2
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 16728 KB Output is correct
2 Correct 11 ms 19036 KB Output is correct
3 Correct 10 ms 19320 KB Output is correct
4 Correct 9 ms 19288 KB Output is correct
5 Correct 733 ms 49384 KB Output is correct
6 Correct 782 ms 43808 KB Output is correct
7 Correct 811 ms 46148 KB Output is correct
8 Correct 701 ms 46236 KB Output is correct
9 Correct 653 ms 46044 KB Output is correct
10 Correct 943 ms 50628 KB Output is correct
11 Correct 982 ms 50460 KB Output is correct
12 Correct 939 ms 50364 KB Output is correct
13 Correct 993 ms 50408 KB Output is correct
14 Correct 1020 ms 50112 KB Output is correct
15 Execution timed out 5048 ms 58528 KB Time limit exceeded
16 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 16732 KB Output is correct
2 Correct 133 ms 19548 KB Output is correct
3 Correct 134 ms 19460 KB Output is correct
4 Correct 138 ms 19460 KB Output is correct
5 Execution timed out 5081 ms 55540 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 16732 KB Output is correct
2 Correct 4 ms 16732 KB Output is correct
3 Correct 3 ms 16732 KB Output is correct
4 Correct 3 ms 16732 KB Output is correct
5 Correct 9 ms 19204 KB Output is correct
6 Correct 10 ms 19312 KB Output is correct
7 Correct 8 ms 19288 KB Output is correct
8 Correct 10 ms 19292 KB Output is correct
9 Correct 10 ms 19292 KB Output is correct
10 Correct 10 ms 19320 KB Output is correct
11 Correct 10 ms 19320 KB Output is correct
12 Correct 11 ms 19328 KB Output is correct
13 Correct 182 ms 19444 KB Output is correct
14 Correct 171 ms 19292 KB Output is correct
15 Correct 78 ms 19288 KB Output is correct
16 Correct 59 ms 19368 KB Output is correct
17 Correct 49 ms 19292 KB Output is correct
18 Correct 82 ms 19536 KB Output is correct
19 Correct 7 ms 19132 KB Output is correct
20 Correct 9 ms 19292 KB Output is correct
21 Correct 8 ms 19292 KB Output is correct
22 Correct 9 ms 19288 KB Output is correct
23 Correct 51 ms 19320 KB Output is correct
24 Correct 47 ms 19292 KB Output is correct
25 Correct 46 ms 19292 KB Output is correct
26 Correct 8 ms 19292 KB Output is correct
27 Correct 8 ms 19292 KB Output is correct
28 Correct 8 ms 19324 KB Output is correct
29 Correct 7 ms 19292 KB Output is correct
30 Correct 10 ms 19492 KB Output is correct
31 Correct 9 ms 19292 KB Output is correct
32 Correct 10 ms 19292 KB Output is correct
33 Correct 130 ms 19460 KB Output is correct
34 Correct 133 ms 19460 KB Output is correct
35 Correct 132 ms 19288 KB Output is correct
36 Correct 3 ms 16728 KB Output is correct
37 Correct 11 ms 19036 KB Output is correct
38 Correct 10 ms 19320 KB Output is correct
39 Correct 9 ms 19288 KB Output is correct
40 Correct 733 ms 49384 KB Output is correct
41 Correct 782 ms 43808 KB Output is correct
42 Correct 811 ms 46148 KB Output is correct
43 Correct 701 ms 46236 KB Output is correct
44 Correct 653 ms 46044 KB Output is correct
45 Correct 943 ms 50628 KB Output is correct
46 Correct 982 ms 50460 KB Output is correct
47 Correct 939 ms 50364 KB Output is correct
48 Correct 993 ms 50408 KB Output is correct
49 Correct 1020 ms 50112 KB Output is correct
50 Execution timed out 5048 ms 58528 KB Time limit exceeded
51 Halted 0 ms 0 KB -