oj.uz

답안 #971656

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
971656 2024-04-29T06:47:42 Z vjudge1 Two Currencies (JOI23_currencies) C++17
38 / 100
 365 ms 58840 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;
int kol[100005], dp[100005];
void dfs(int k, int pr){
    v.push_back(k);
    pp[k] = pr;
    kol[k] += dp[mp[{k, pr}]];
    for(int to : g[k]){
        if(to == pr) continue;
        h[to] = h[k] + 1;
        kol[to] += kol[k];
        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];
set<int> st;
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]);
        dp[p[i]]++;
        st.insert(s[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;
        if(n <= 2000 && m <= 2000 && q <= 2000){
            vector<ll> 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";
            continue;
        }
        if(int(st.size()) == 1){
            ll dist = kol[s[i]] - kol[lca] + kol[t[i]] - kol[lca];
            ll ost = x[i] - max(0ll, dist - y[i] / c[1]);
            if(ost < 0) cout << -1 << "\n";
            else cout << ost << "\n";
            continue;
        }
    }
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 17496 KB Output is correct
2 Correct 3 ms 17500 KB Output is correct
3 Correct 3 ms 17496 KB Output is correct
4 Correct 3 ms 17496 KB Output is correct
5 Correct 9 ms 18012 KB Output is correct
6 Correct 10 ms 18012 KB Output is correct
7 Correct 8 ms 17756 KB Output is correct
8 Correct 10 ms 18012 KB Output is correct
9 Correct 10 ms 18264 KB Output is correct
10 Correct 9 ms 17992 KB Output is correct
11 Correct 10 ms 18012 KB Output is correct
12 Correct 10 ms 18028 KB Output is correct
13 Correct 186 ms 18196 KB Output is correct
14 Correct 202 ms 18144 KB Output is correct
15 Correct 77 ms 18008 KB Output is correct
16 Correct 60 ms 18008 KB Output is correct
17 Correct 50 ms 18012 KB Output is correct
18 Correct 78 ms 18008 KB Output is correct
19 Correct 8 ms 18008 KB Output is correct
20 Correct 7 ms 18008 KB Output is correct
21 Correct 7 ms 18012 KB Output is correct
22 Correct 7 ms 18012 KB Output is correct
23 Correct 56 ms 18028 KB Output is correct
24 Correct 48 ms 18008 KB Output is correct
25 Correct 47 ms 18028 KB Output is correct
26 Correct 8 ms 18012 KB Output is correct
27 Correct 7 ms 18012 KB Output is correct
28 Correct 8 ms 18012 KB Output is correct
29 Correct 7 ms 18012 KB Output is correct
30 Correct 10 ms 18028 KB Output is correct
31 Correct 10 ms 18012 KB Output is correct
32 Correct 9 ms 17848 KB Output is correct
33 Correct 132 ms 18224 KB Output is correct
34 Correct 136 ms 18228 KB Output is correct
35 Correct 135 ms 18012 KB Output is correct

Subtask #2
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 17496 KB Output is correct
2 Correct 9 ms 18008 KB Output is correct
3 Correct 9 ms 18032 KB Output is correct
4 Correct 9 ms 17972 KB Output is correct
5 Correct 324 ms 46952 KB Output is correct
6 Correct 220 ms 41664 KB Output is correct
7 Correct 275 ms 43996 KB Output is correct
8 Correct 258 ms 44172 KB Output is correct
9 Correct 251 ms 44040 KB Output is correct
10 Correct 338 ms 47824 KB Output is correct
11 Correct 322 ms 47812 KB Output is correct
12 Correct 322 ms 47992 KB Output is correct
13 Correct 365 ms 47972 KB Output is correct
14 Correct 327 ms 48016 KB Output is correct
15 Correct 308 ms 58048 KB Output is correct
16 Correct 351 ms 58840 KB Output is correct
17 Correct 321 ms 57500 KB Output is correct
18 Correct 340 ms 48060 KB Output is correct
19 Correct 318 ms 48020 KB Output is correct
20 Correct 307 ms 48120 KB Output is correct
21 Correct 299 ms 48040 KB Output is correct
22 Correct 277 ms 48104 KB Output is correct
23 Correct 281 ms 48072 KB Output is correct
24 Correct 289 ms 48196 KB Output is correct
25 Correct 313 ms 47700 KB Output is correct
26 Correct 304 ms 47540 KB Output is correct
27 Correct 321 ms 47828 KB Output is correct
28 Correct 315 ms 47812 KB Output is correct
29 Correct 278 ms 47976 KB Output is correct
30 Correct 291 ms 47812 KB Output is correct
31 Correct 317 ms 47956 KB Output is correct

Subtask #3
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 17500 KB Output is correct
2 Correct 133 ms 18012 KB Output is correct
3 Correct 133 ms 18012 KB Output is correct
4 Correct 138 ms 18008 KB Output is correct
5 Incorrect 184 ms 56248 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 17496 KB Output is correct
2 Correct 3 ms 17500 KB Output is correct
3 Correct 3 ms 17496 KB Output is correct
4 Correct 3 ms 17496 KB Output is correct
5 Correct 9 ms 18012 KB Output is correct
6 Correct 10 ms 18012 KB Output is correct
7 Correct 8 ms 17756 KB Output is correct
8 Correct 10 ms 18012 KB Output is correct
9 Correct 10 ms 18264 KB Output is correct
10 Correct 9 ms 17992 KB Output is correct
11 Correct 10 ms 18012 KB Output is correct
12 Correct 10 ms 18028 KB Output is correct
13 Correct 186 ms 18196 KB Output is correct
14 Correct 202 ms 18144 KB Output is correct
15 Correct 77 ms 18008 KB Output is correct
16 Correct 60 ms 18008 KB Output is correct
17 Correct 50 ms 18012 KB Output is correct
18 Correct 78 ms 18008 KB Output is correct
19 Correct 8 ms 18008 KB Output is correct
20 Correct 7 ms 18008 KB Output is correct
21 Correct 7 ms 18012 KB Output is correct
22 Correct 7 ms 18012 KB Output is correct
23 Correct 56 ms 18028 KB Output is correct
24 Correct 48 ms 18008 KB Output is correct
25 Correct 47 ms 18028 KB Output is correct
26 Correct 8 ms 18012 KB Output is correct
27 Correct 7 ms 18012 KB Output is correct
28 Correct 8 ms 18012 KB Output is correct
29 Correct 7 ms 18012 KB Output is correct
30 Correct 10 ms 18028 KB Output is correct
31 Correct 10 ms 18012 KB Output is correct
32 Correct 9 ms 17848 KB Output is correct
33 Correct 132 ms 18224 KB Output is correct
34 Correct 136 ms 18228 KB Output is correct
35 Correct 135 ms 18012 KB Output is correct
36 Correct 3 ms 17496 KB Output is correct
37 Correct 9 ms 18008 KB Output is correct
38 Correct 9 ms 18032 KB Output is correct
39 Correct 9 ms 17972 KB Output is correct
40 Correct 324 ms 46952 KB Output is correct
41 Correct 220 ms 41664 KB Output is correct
42 Correct 275 ms 43996 KB Output is correct
43 Correct 258 ms 44172 KB Output is correct
44 Correct 251 ms 44040 KB Output is correct
45 Correct 338 ms 47824 KB Output is correct
46 Correct 322 ms 47812 KB Output is correct
47 Correct 322 ms 47992 KB Output is correct
48 Correct 365 ms 47972 KB Output is correct
49 Correct 327 ms 48016 KB Output is correct
50 Correct 308 ms 58048 KB Output is correct
51 Correct 351 ms 58840 KB Output is correct
52 Correct 321 ms 57500 KB Output is correct
53 Correct 340 ms 48060 KB Output is correct
54 Correct 318 ms 48020 KB Output is correct
55 Correct 307 ms 48120 KB Output is correct
56 Correct 299 ms 48040 KB Output is correct
57 Correct 277 ms 48104 KB Output is correct
58 Correct 281 ms 48072 KB Output is correct
59 Correct 289 ms 48196 KB Output is correct
60 Correct 313 ms 47700 KB Output is correct
61 Correct 304 ms 47540 KB Output is correct
62 Correct 321 ms 47828 KB Output is correct
63 Correct 315 ms 47812 KB Output is correct
64 Correct 278 ms 47976 KB Output is correct
65 Correct 291 ms 47812 KB Output is correct
66 Correct 317 ms 47956 KB Output is correct
67 Correct 3 ms 17500 KB Output is correct
68 Correct 133 ms 18012 KB Output is correct
69 Correct 133 ms 18012 KB Output is correct
70 Correct 138 ms 18008 KB Output is correct
71 Incorrect 184 ms 56248 KB Output isn't correct
72 Halted 0 ms 0 KB -