oj.uz

답안 #966816

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
966816 2024-04-20T12:13:05 Z mychecksedad Two Currencies (JOI23_currencies) C++17
100 / 100
 698 ms 192196 KB 
/* Author : Mychecksdead  */
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define MOD (1000000000+7)
#define MOD1 (998244353)
#define pb push_back
#define all(x) x.begin(), x.end()
#define en cout << '\n'
const int N = 1e6+100, M = 1e5+10, K = 20, MX = 30;


struct Node{
  Node *L, *R;
  ll sum;
  int num;
  Node(){
    L = R = nullptr;
    sum = num = 0;
  }
  Node(ll x){
    L = R = nullptr;
    sum = x;
    num = 1;
  }
  Node(Node *l, Node *r){
    L = l, R = r;
    sum = L->sum + R->sum;
    num = L->num + R->num;
  }
  void extend(){
    if(L == nullptr) L = new Node();
    if(R == nullptr) R = new Node();
  }
};

int n, mi, q, s[N], tin[N], tout[N], up[N][K], heavy[N], dep[N], par[N], ESZ[N], ttin[N], toutt[N], timerr = 0;
vector<pair<int, int>> g[N], euler;
vector<int> E[N];
vector<Node*> roots;

Node* build(int l, int r){
  if(l == r){
    return new Node();
  }
  int m = l+r>>1;
  return new Node(build(l, m), build(m+1, r));
}

Node *update(Node *v, int l, int r, int p, ll val){
  if(l == r){
    return new Node(val);
  }
  int m = l+r>>1;
  if(p <= m){
    return new Node(update(v->L, l, m, p, val), v->R);
  }
  return new Node(v->L, update(v->R, m+1, r, p, val));
}

int f(int l, int r, vector<pair<Node*, Node*>> &TV, ll rsilver){
  if(l == r){
    ll val = 0;
    int nm = 0;
    for(auto &pt: TV){
      val += pt.second->sum - pt.first->sum;
      nm += pt.second->num - pt.first->num;
    }
    if(val <= rsilver) return nm;
    return 0;
  }
  int m = l+r>>1;
  ll val = 0;
  int nm = 0;
  for(auto &pt: TV){
    val += pt.second->L->sum - pt.first->L->sum;
    nm += pt.second->L->num - pt.first->L->num;
  }
  if(val <= rsilver){
    for(auto &pt: TV) pt.first = pt.first->R, pt.second = pt.second->R;
    return nm + f(m+1, r, TV, rsilver - val);
  }
  for(auto &pt: TV) pt.first = pt.first->L, pt.second = pt.second->L;
  return f(l, m, TV, rsilver);
}



void dfs(int v, int p){
  s[v] = 1;
  par[v] = p;
  dep[v] = dep[p] + 1;
  for(auto &U: g[v]){
    int u = U.first;
    if(u != p){
      dfs(u, v);
      up[u][0] = v;
      s[v] += s[u];
      if(s[u] > s[g[v][0].first] || g[v][0].first == p) swap(U, g[v][0]);
    }
  }
}

void dfs2(int v, int p, int &timer){
  tin[v] = timer - 1;
  ttin[v] = timerr++;
  for(auto &U: g[v]){
    int u = U.first;
    if(u != p){
      if(u == g[v][0].first) heavy[u] = heavy[v];
      else heavy[u] = u;
      timer += E[U.second].size();
      ESZ[u] = E[U.second].size();
      for(auto x: E[U.second]) euler.pb({x, euler.size() + 1});
      dfs2(u, v, timer);
    }
  }
  tout[v] = timer - 1;
  toutt[v] = timerr++;
}

bool is_parent(int u, int v){
  return ttin[u] <= ttin[v] && toutt[v] <= toutt[u];
}

int _lca(int u, int v){
  if(is_parent(u, v)) return u;
  if(is_parent(v, u)) return v;
  for(int j = K-1; j >= 0 ; --j){
    if(!is_parent(up[u][j], v)) u = up[u][j];
  }
  return up[u][0];
}

void solve(){
  cin >> n >> mi >> q;
  for(int i = 0; i < n - 1; ++i){
    int u, v; cin >> u >> v;
    g[u].pb({v, i+1});
    g[v].pb({u, i+1});
  }
  for(int i = 0; i < mi; ++i){
    int p, c; cin >> p >> c;
    E[p].pb(c);
  }
  dep[1] = 1;
  dfs(1, 1);
  int tm = 1;
  heavy[1] = 1;
  dfs2(1, 1, tm);
  
  up[1][0] = 1;
  for(int j = 1; j < K; ++j) for(int i = 1; i <= n; ++i) up[i][j] = up[up[i][j - 1]][j - 1];

  vector<pair<int, int>> X = euler;
  vector<int> pos(mi+1);
  sort(all(X));
  for(int i = 0; i < mi; ++i) pos[X[i].second] = i + 1;

  roots.pb(build(1, mi));
  for(int i = 1; i <= mi; ++i){
    roots.pb(update(roots.back(), 1, mi, pos[i], euler[i - 1].first));
  }



  // for(auto x: X){
  //   cout << x.first << ' ' << x.second << '\n';
  // }
  // for(int i = 1; i <= n; ++i) cout << tin[i] << ' ' << tout[i] << '\n';

  for(int i = 0; i < q; ++i){
    int s, t; ll x, y; cin >> s >> t >> x >> y;
    int lca = _lca(s, t);
    vector<pair<int, int>> T;
    if(lca != s){
      int v = s;
      while(v != lca){
        int next;
        if(dep[heavy[v]] <= dep[lca]){
          next = lca;
          if(tin[next] + 1 <= tin[v])
            T.pb({tin[next] + 1, tin[v]});
          break;
        }
        else{ 
          next = heavy[v];
          int L = tin[heavy[v]] - ESZ[heavy[v]] + 1;
          if(L <= tin[v])
            T.pb({L, tin[v]});
        }
        v = par[next];
      }
    }
    if(lca != t){
      int v = t;
      while(v != lca){
        int next;
        if(dep[heavy[v]] <= dep[lca]){
          next = lca;
          if(tin[next] + 1 <= tin[v])
            T.pb({tin[next] + 1, tin[v]});
          break;
        }
        else{ 
          next = heavy[v];
          int L = tin[heavy[v]] - ESZ[heavy[v]] + 1;
          if(L <= tin[v])
            T.pb({L, tin[v]});
        }
        v = par[next];
      }
    }
    // cout << "q:";

    // cout << s << ' ' << t << ' ' << lca << '\n';
    // for(auto x:T) cout << x.first << ' ' << x.second << '\n';

    // en;en;
    int tot_gold = 0;
    vector<pair<Node*, Node*>> TV;
    for(auto x: T){
      TV.pb({roots[x.first - 1], roots[x.second]});
      tot_gold += x.second - x.first + 1; 
    }
    int rgold = x - (tot_gold - f(1, mi, TV, y));
    if(rgold < 0) cout << -1 << '\n';
    else cout << rgold << '\n';
  }
}



int main(){
  cin.tie(0); ios::sync_with_stdio(0);
  int tt = 1, aa;
  // freopen("in.txt", "r", stdin);
  // freopen("out.txt", "w", stdout);
  while(tt--){
    solve();
    en;
  }
  cerr<<"time taken : "<<(float)clock()/CLOCKS_PER_SEC<<" seconds\n";
  return 0;
}

Compilation message

currencies.cpp: In function 'Node* build(int, int)':
currencies.cpp:46:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   46 |   int m = l+r>>1;
      |           ~^~
currencies.cpp: In function 'Node* update(Node*, int, int, int, long long int)':
currencies.cpp:54:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   54 |   int m = l+r>>1;
      |           ~^~
currencies.cpp: In function 'int f(int, int, std::vector<std::pair<Node*, Node*> >&, long long int)':
currencies.cpp:72:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   72 |   int m = l+r>>1;
      |           ~^~
currencies.cpp: In function 'int main()':
currencies.cpp:236:15: warning: unused variable 'aa' [-Wunused-variable]
  236 |   int tt = 1, aa;
      |               ^~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 66136 KB Output is correct
2 Correct 14 ms 66212 KB Output is correct
3 Correct 14 ms 66140 KB Output is correct
4 Correct 14 ms 66140 KB Output is correct
5 Correct 17 ms 67744 KB Output is correct
6 Correct 20 ms 67676 KB Output is correct
7 Correct 16 ms 67252 KB Output is correct
8 Correct 19 ms 67672 KB Output is correct
9 Correct 17 ms 67676 KB Output is correct
10 Correct 17 ms 67676 KB Output is correct
11 Correct 18 ms 67876 KB Output is correct
12 Correct 20 ms 68132 KB Output is correct
13 Correct 17 ms 67928 KB Output is correct
14 Correct 18 ms 67928 KB Output is correct
15 Correct 19 ms 67796 KB Output is correct
16 Correct 20 ms 67928 KB Output is correct
17 Correct 18 ms 67676 KB Output is correct
18 Correct 17 ms 67860 KB Output is correct
19 Correct 17 ms 67676 KB Output is correct
20 Correct 17 ms 67676 KB Output is correct
21 Correct 17 ms 67676 KB Output is correct
22 Correct 17 ms 67776 KB Output is correct
23 Correct 19 ms 67672 KB Output is correct
24 Correct 17 ms 67680 KB Output is correct
25 Correct 18 ms 67676 KB Output is correct
26 Correct 17 ms 67696 KB Output is correct
27 Correct 17 ms 67676 KB Output is correct
28 Correct 17 ms 67672 KB Output is correct
29 Correct 17 ms 67676 KB Output is correct
30 Correct 20 ms 67804 KB Output is correct
31 Correct 20 ms 67672 KB Output is correct
32 Correct 19 ms 67676 KB Output is correct
33 Correct 17 ms 67932 KB Output is correct
34 Correct 17 ms 67932 KB Output is correct
35 Correct 17 ms 67932 KB Output is correct

Subtask #2
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 66136 KB Output is correct
2 Correct 17 ms 67812 KB Output is correct
3 Correct 17 ms 67676 KB Output is correct
4 Correct 18 ms 67676 KB Output is correct
5 Correct 301 ms 169452 KB Output is correct
6 Correct 353 ms 156880 KB Output is correct
7 Correct 388 ms 142876 KB Output is correct
8 Correct 286 ms 138632 KB Output is correct
9 Correct 289 ms 143872 KB Output is correct
10 Correct 475 ms 179196 KB Output is correct
11 Correct 495 ms 180668 KB Output is correct
12 Correct 473 ms 180852 KB Output is correct
13 Correct 434 ms 180888 KB Output is correct
14 Correct 455 ms 180756 KB Output is correct
15 Correct 419 ms 190976 KB Output is correct
16 Correct 382 ms 191736 KB Output is correct
17 Correct 396 ms 190868 KB Output is correct
18 Correct 447 ms 180832 KB Output is correct
19 Correct 453 ms 180752 KB Output is correct
20 Correct 431 ms 181080 KB Output is correct
21 Correct 335 ms 180340 KB Output is correct
22 Correct 333 ms 180364 KB Output is correct
23 Correct 361 ms 180372 KB Output is correct
24 Correct 324 ms 180536 KB Output is correct
25 Correct 358 ms 180632 KB Output is correct
26 Correct 376 ms 180716 KB Output is correct
27 Correct 394 ms 180480 KB Output is correct
28 Correct 256 ms 180712 KB Output is correct
29 Correct 242 ms 180676 KB Output is correct
30 Correct 305 ms 180900 KB Output is correct
31 Correct 281 ms 180776 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 66140 KB Output is correct
2 Correct 17 ms 68064 KB Output is correct
3 Correct 17 ms 67932 KB Output is correct
4 Correct 17 ms 67932 KB Output is correct
5 Correct 292 ms 151468 KB Output is correct
6 Correct 251 ms 137840 KB Output is correct
7 Correct 402 ms 172800 KB Output is correct
8 Correct 482 ms 192080 KB Output is correct
9 Correct 495 ms 192196 KB Output is correct
10 Correct 491 ms 191976 KB Output is correct
11 Correct 455 ms 191612 KB Output is correct
12 Correct 417 ms 191468 KB Output is correct
13 Correct 453 ms 191332 KB Output is correct
14 Correct 289 ms 191824 KB Output is correct
15 Correct 280 ms 191800 KB Output is correct
16 Correct 385 ms 192048 KB Output is correct
17 Correct 322 ms 192180 KB Output is correct

Subtask #4
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 66136 KB Output is correct
2 Correct 14 ms 66212 KB Output is correct
3 Correct 14 ms 66140 KB Output is correct
4 Correct 14 ms 66140 KB Output is correct
5 Correct 17 ms 67744 KB Output is correct
6 Correct 20 ms 67676 KB Output is correct
7 Correct 16 ms 67252 KB Output is correct
8 Correct 19 ms 67672 KB Output is correct
9 Correct 17 ms 67676 KB Output is correct
10 Correct 17 ms 67676 KB Output is correct
11 Correct 18 ms 67876 KB Output is correct
12 Correct 20 ms 68132 KB Output is correct
13 Correct 17 ms 67928 KB Output is correct
14 Correct 18 ms 67928 KB Output is correct
15 Correct 19 ms 67796 KB Output is correct
16 Correct 20 ms 67928 KB Output is correct
17 Correct 18 ms 67676 KB Output is correct
18 Correct 17 ms 67860 KB Output is correct
19 Correct 17 ms 67676 KB Output is correct
20 Correct 17 ms 67676 KB Output is correct
21 Correct 17 ms 67676 KB Output is correct
22 Correct 17 ms 67776 KB Output is correct
23 Correct 19 ms 67672 KB Output is correct
24 Correct 17 ms 67680 KB Output is correct
25 Correct 18 ms 67676 KB Output is correct
26 Correct 17 ms 67696 KB Output is correct
27 Correct 17 ms 67676 KB Output is correct
28 Correct 17 ms 67672 KB Output is correct
29 Correct 17 ms 67676 KB Output is correct
30 Correct 20 ms 67804 KB Output is correct
31 Correct 20 ms 67672 KB Output is correct
32 Correct 19 ms 67676 KB Output is correct
33 Correct 17 ms 67932 KB Output is correct
34 Correct 17 ms 67932 KB Output is correct
35 Correct 17 ms 67932 KB Output is correct
36 Correct 13 ms 66136 KB Output is correct
37 Correct 17 ms 67812 KB Output is correct
38 Correct 17 ms 67676 KB Output is correct
39 Correct 18 ms 67676 KB Output is correct
40 Correct 301 ms 169452 KB Output is correct
41 Correct 353 ms 156880 KB Output is correct
42 Correct 388 ms 142876 KB Output is correct
43 Correct 286 ms 138632 KB Output is correct
44 Correct 289 ms 143872 KB Output is correct
45 Correct 475 ms 179196 KB Output is correct
46 Correct 495 ms 180668 KB Output is correct
47 Correct 473 ms 180852 KB Output is correct
48 Correct 434 ms 180888 KB Output is correct
49 Correct 455 ms 180756 KB Output is correct
50 Correct 419 ms 190976 KB Output is correct
51 Correct 382 ms 191736 KB Output is correct
52 Correct 396 ms 190868 KB Output is correct
53 Correct 447 ms 180832 KB Output is correct
54 Correct 453 ms 180752 KB Output is correct
55 Correct 431 ms 181080 KB Output is correct
56 Correct 335 ms 180340 KB Output is correct
57 Correct 333 ms 180364 KB Output is correct
58 Correct 361 ms 180372 KB Output is correct
59 Correct 324 ms 180536 KB Output is correct
60 Correct 358 ms 180632 KB Output is correct
61 Correct 376 ms 180716 KB Output is correct
62 Correct 394 ms 180480 KB Output is correct
63 Correct 256 ms 180712 KB Output is correct
64 Correct 242 ms 180676 KB Output is correct
65 Correct 305 ms 180900 KB Output is correct
66 Correct 281 ms 180776 KB Output is correct
67 Correct 13 ms 66140 KB Output is correct
68 Correct 17 ms 68064 KB Output is correct
69 Correct 17 ms 67932 KB Output is correct
70 Correct 17 ms 67932 KB Output is correct
71 Correct 292 ms 151468 KB Output is correct
72 Correct 251 ms 137840 KB Output is correct
73 Correct 402 ms 172800 KB Output is correct
74 Correct 482 ms 192080 KB Output is correct
75 Correct 495 ms 192196 KB Output is correct
76 Correct 491 ms 191976 KB Output is correct
77 Correct 455 ms 191612 KB Output is correct
78 Correct 417 ms 191468 KB Output is correct
79 Correct 453 ms 191332 KB Output is correct
80 Correct 289 ms 191824 KB Output is correct
81 Correct 280 ms 191800 KB Output is correct
82 Correct 385 ms 192048 KB Output is correct
83 Correct 322 ms 192180 KB Output is correct
84 Correct 438 ms 170292 KB Output is correct
85 Correct 474 ms 158008 KB Output is correct
86 Correct 368 ms 131464 KB Output is correct
87 Correct 644 ms 180636 KB Output is correct
88 Correct 667 ms 180804 KB Output is correct
89 Correct 694 ms 180936 KB Output is correct
90 Correct 662 ms 180720 KB Output is correct
91 Correct 680 ms 180828 KB Output is correct
92 Correct 588 ms 187716 KB Output is correct
93 Correct 588 ms 190240 KB Output is correct
94 Correct 693 ms 180732 KB Output is correct
95 Correct 698 ms 180892 KB Output is correct
96 Correct 695 ms 180708 KB Output is correct
97 Correct 689 ms 180916 KB Output is correct
98 Correct 435 ms 180448 KB Output is correct
99 Correct 456 ms 180320 KB Output is correct
100 Correct 438 ms 180392 KB Output is correct
101 Correct 426 ms 180296 KB Output is correct
102 Correct 523 ms 180596 KB Output is correct
103 Correct 515 ms 180756 KB Output is correct
104 Correct 478 ms 180592 KB Output is correct
105 Correct 354 ms 180824 KB Output is correct
106 Correct 309 ms 180656 KB Output is correct
107 Correct 344 ms 180932 KB Output is correct
108 Correct 335 ms 180936 KB Output is correct