oj.uz

Submission #964478

# Submission time Handle Problem Language Result Execution time Memory
964478 2024-04-17T01:21:50 Z YassirSalama Two Currencies (JOI23_currencies) C++17
100 / 100
 3990 ms 108608 KB 
#include <bits/stdc++.h>
using namespace std;
const int dx[4] = {1,0,-1,0}, dy[4] = {0,1,0,-1};
#define endl "\n"
#define int ll
using ull=unsigned long long;
using ll=long long;
using pii=pair<int,int>;
const int mod=1e9+7;
#define OVL(x,s) for(auto y:x) cout<<y<<s; cout<<"\n";
template <typename T> istream& operator>>(istream& is, vector<T> &a) {
    copy_n(istream_iterator<T>(is), a.size(), a.begin()); return is;}
#ifdef IOI
void dbg_out() { cout << endl; } template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cout << ' ' << H; dbg_out(T...); }
#define dbg(...) cout << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__);
#else
#define dbg(...) 1337;
#endif
#define pb push_back
#define F first
#define S second
#define all(v) v.begin(),v.end()
const int mxn=1e5+100;
const int LOGN=20;
vector<pair<int,int>> ed;
vector<vector<int>> f;
vector<int> v[mxn];
int depth[mxn];
int pos[mxn];
int top[mxn];
int sz[mxn];
int up[mxn][LOGN+1];
map<pii,int> mp;
map<int,pii> mp2;
vector<vector<int>> queries;
void dfs(int node,int par){
    depth[node]=depth[par]+1;
    up[node][0]=par;
    for(int i=1;i<=LOGN;i++){
        up[node][i]=up[up[node][i-1]][i-1];
    }
    sz[node]=1;
    for(auto x:v[node]){
        if(x==par){continue;}
        dfs(x,node);
        sz[node]+=sz[x];
    }
}
int LCA(int a,int b){
    if(depth[a]<depth[b]) swap(a,b);
    int d=depth[a]-depth[b];
    for(int i=LOGN;i>=0;i--){
        if(d&(1<<i)) a=up[a][i];
    }
    if(a==b) return a;
    for(int i=LOGN;i>=0;i--){
        if(up[a][i]!=up[b][i]){
            a=up[a][i];
            b=up[b][i];
        }
    }
    return up[a][0];
}
int c=1;
int cID=1;
void HLD(int node,int par,int cID){
    top[node]=cID;
    pos[node]=c;
    c++;
    int bst=0;
    int b=-1;
    for(auto x:v[node]){
        if(x==par) continue;
        if(b<sz[x]){
            b=sz[x];
            bst=x;
        }
    }
    if(b!=-1){
        HLD(bst,node,cID);
    }
    for(auto x:v[node]){
        if(x==par||x==bst) continue;
        HLD(x,node,x);
    }
}
const int MAXN=2e5+100;
int BIT[MAXN];
int BIT2[MAXN];
void add(int i,int x){
    i++;
    while(i<MAXN){
        BIT[i]+=x;
        BIT2[i]+=(x>0?1:-1);
        i+=(i&(-i));
    }
}
int qqqq(int i){
    i++;
    int ans=0;
    while(i){
        ans+=BIT[i];
        i-=(i&-i);
    }
    return ans;
}
int qqqq1(int i){
    i++;
    int ans=0;
    while(i){
        ans+=BIT2[i];
        i-=(i&-i);
    }
    return ans;
}
int query(int l,int r){
    if(l>r) return 0;
    return qqqq(r)-qqqq(l-1);
}
int query1(int l,int r){
    if(l>r) return 0;
    return qqqq1(r)-qqqq1(l-1);
}
map<pii,int> updated,upp;
pair<int,int> qq(int u,int v){
    pair<int,int> ans(0,0);
    while(top[u]!=top[v]){
        int l=top[v];
        l=pos[l];
        l++;
        int r=pos[v];
        // dbg(pos[top[v]],r,u,v)
        ans.F+=query(l,r);
        ans.S+=query1(l,r);
        v=top[v];
        int t=up[v][0];
        if(updated.count({t,v})){
            ans.F+=updated[{t,v}];
            ans.S+=upp[{t,v}];
        }
        v=up[v][0];
    }
    int l=pos[u];
    l++;
    int r=pos[v];
    ans.F+=query(l,r);
    ans.S+=query1(l,r);
    return ans;
}
pair<int,int> qv(int u,int v){
    int l=LCA(u,v);
    pair<int,int> ans(0,0);
    pair<int,int> a=qq(l,u);
    pair<int,int> b=qq(l,v);
    ans.F=a.F+b.F;
    ans.S=a.S+b.S;
    return ans;
}
int sum[mxn];
int nm[mxn];
int ans[mxn];
void bs(int l,int r,vector<vector<int>> &queries){
    if(l>r) return;
    if(queries.empty()) return;
    vector<vector<int>> ok,nok;
    int mid=(l+r)/2;
    for(int i=l;i<=mid;i++){
         int a=f[i][0];
         int b=f[i][1];
         int c=f[i][2];
         if(up[a][0]==b) swap(a,b);
         // update(1,1,mxn,pos[b],c);
         add(pos[b],c);
         updated[{a,b}]+=c;
         upp[{a,b}]++;
    }
    for(auto x:queries){
        int s=x[0];
        int t=x[1];
        pair<int,int> as=qv(s,t);
        if(sum[x[4]]>=as.F){
            sum[x[4]]-=as.F;
            nm[x[4]]-=as.S;
            ans[x[4]]=mid;
            ok.pb(x);
        }else{
            nok.pb(x);
        }
    }
    for(int i=l;i<=mid;i++){
        int a=f[i][0];
        int b=f[i][1];
        int c=f[i][2];
        if(up[a][0]==b) swap(a,b);
        add(pos[b],-c);
        updated.erase(make_pair(a,b));
        upp.erase(make_pair(a,b));
    }
    if(l==r){
        for(auto x:queries){
            if(nm[x[4]]>x[2]) ans[x[4]]=-1;
            else ans[x[4]]=x[2]-nm[x[4]];
        }
        return;
    }
    bs(l,mid,nok);vector<vector<int>>().swap(nok);
    bs(mid+1,r,ok);vector<vector<int>>().swap(ok);
}
signed main(){
ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
int n,m,q;
cin>>n>>m>>q;
for(int i=0;i+1<n;i++){
    int a,b;
    cin>>a>>b;
    v[a].pb(b);
    v[b].pb(a);
    ed.pb({a,b});
    mp[{a,b}]=mp[{b,a}]=i;
    mp2[i]={a,b};
}
for(int i=0;i<m;i++){
    int p,c;
    cin>>p>>c;
    p--;
    auto [a,b]=mp2[p];
    f.pb({a,b,c});
}
sort(all(f),[&](const auto &a,const auto &b ){
   return a[2]<b[2];
});
for(int i=0;i<q;i++){
    int s,t,x,y;
    cin>>s>>t>>x>>y;
    queries.pb({s,t,x,y,i});
    sum[i]=y;
}
dfs(1,1);
HLD(1,1,1);
for(auto x:f){
    int a=x[0];
    int b=x[1];
    int c=x[2];
    if(up[a][0]==b) swap(a,b);
    updated[{a,b}]+=c;
    upp[{a,b}]++;
    add(pos[b],c);
    // update(1,1,mxn,pos[b],c);
}
for(auto x:queries){
    int s=x[0];
    int t=x[1];
    nm[x[4]]=qv(s,t).S;
}
for(auto x:f){
    int a=x[0];
    int b=x[1];
    int c=x[2];
    if(up[a][0]==b) swap(a,b);
    updated.erase(make_pair(a,b));
    upp.erase(make_pair(a,b));
    // update(1,1,mxn,pos[b],-c);
    add(pos[b],-c);
}
bs(0,m-1,queries);
for(auto x:queries){
    cout<<ans[x[4]]<<endl;
}
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 11096 KB Output is correct
2 Correct 3 ms 11100 KB Output is correct
3 Correct 2 ms 11096 KB Output is correct
4 Correct 2 ms 11100 KB Output is correct
5 Correct 17 ms 12380 KB Output is correct
6 Correct 23 ms 12660 KB Output is correct
7 Correct 21 ms 12636 KB Output is correct
8 Correct 23 ms 12332 KB Output is correct
9 Correct 24 ms 12536 KB Output is correct
10 Correct 24 ms 12524 KB Output is correct
11 Correct 23 ms 12380 KB Output is correct
12 Correct 23 ms 12380 KB Output is correct
13 Correct 16 ms 12608 KB Output is correct
14 Correct 16 ms 12376 KB Output is correct
15 Correct 19 ms 12416 KB Output is correct
16 Correct 19 ms 12380 KB Output is correct
17 Correct 19 ms 12380 KB Output is correct
18 Correct 19 ms 12380 KB Output is correct
19 Correct 18 ms 12640 KB Output is correct
20 Correct 18 ms 12640 KB Output is correct
21 Correct 19 ms 12744 KB Output is correct
22 Correct 19 ms 12640 KB Output is correct
23 Correct 18 ms 12376 KB Output is correct
24 Correct 19 ms 12688 KB Output is correct
25 Correct 21 ms 12380 KB Output is correct
26 Correct 14 ms 12632 KB Output is correct
27 Correct 21 ms 12636 KB Output is correct
28 Correct 20 ms 12632 KB Output is correct
29 Correct 15 ms 13660 KB Output is correct
30 Correct 28 ms 12524 KB Output is correct
31 Correct 23 ms 12380 KB Output is correct
32 Correct 24 ms 12380 KB Output is correct
33 Correct 14 ms 12636 KB Output is correct
34 Correct 14 ms 12380 KB Output is correct
35 Correct 14 ms 12620 KB Output is correct

Subtask #2
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 11300 KB Output is correct
2 Correct 26 ms 12540 KB Output is correct
3 Correct 23 ms 12376 KB Output is correct
4 Correct 24 ms 12544 KB Output is correct
5 Correct 2386 ms 92804 KB Output is correct
6 Correct 3154 ms 99512 KB Output is correct
7 Correct 2907 ms 105028 KB Output is correct
8 Correct 2230 ms 90848 KB Output is correct
9 Correct 2071 ms 89220 KB Output is correct
10 Correct 3523 ms 85364 KB Output is correct
11 Correct 3650 ms 85032 KB Output is correct
12 Correct 3702 ms 86080 KB Output is correct
13 Correct 3756 ms 85940 KB Output is correct
14 Correct 3759 ms 85028 KB Output is correct
15 Correct 2124 ms 90684 KB Output is correct
16 Correct 2188 ms 91164 KB Output is correct
17 Correct 2247 ms 89728 KB Output is correct
18 Correct 3284 ms 84500 KB Output is correct
19 Correct 3294 ms 84008 KB Output is correct
20 Correct 3587 ms 84312 KB Output is correct
21 Correct 2001 ms 108152 KB Output is correct
22 Correct 1958 ms 108428 KB Output is correct
23 Correct 2068 ms 108040 KB Output is correct
24 Correct 2069 ms 108420 KB Output is correct
25 Correct 2259 ms 92240 KB Output is correct
26 Correct 2399 ms 87632 KB Output is correct
27 Correct 2385 ms 90408 KB Output is correct
28 Correct 1517 ms 92628 KB Output is correct
29 Correct 1257 ms 108608 KB Output is correct
30 Correct 2016 ms 89744 KB Output is correct
31 Correct 1882 ms 90660 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 11100 KB Output is correct
2 Correct 14 ms 12640 KB Output is correct
3 Correct 14 ms 12380 KB Output is correct
4 Correct 15 ms 12612 KB Output is correct
5 Correct 1227 ms 94244 KB Output is correct
6 Correct 1098 ms 94716 KB Output is correct
7 Correct 1389 ms 92556 KB Output is correct
8 Correct 2024 ms 88236 KB Output is correct
9 Correct 1984 ms 87840 KB Output is correct
10 Correct 1984 ms 87996 KB Output is correct
11 Correct 1244 ms 88632 KB Output is correct
12 Correct 1213 ms 87992 KB Output is correct
13 Correct 1306 ms 87960 KB Output is correct
14 Correct 1120 ms 88396 KB Output is correct
15 Correct 1068 ms 89140 KB Output is correct
16 Correct 1224 ms 88164 KB Output is correct
17 Correct 1184 ms 88076 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 11096 KB Output is correct
2 Correct 3 ms 11100 KB Output is correct
3 Correct 2 ms 11096 KB Output is correct
4 Correct 2 ms 11100 KB Output is correct
5 Correct 17 ms 12380 KB Output is correct
6 Correct 23 ms 12660 KB Output is correct
7 Correct 21 ms 12636 KB Output is correct
8 Correct 23 ms 12332 KB Output is correct
9 Correct 24 ms 12536 KB Output is correct
10 Correct 24 ms 12524 KB Output is correct
11 Correct 23 ms 12380 KB Output is correct
12 Correct 23 ms 12380 KB Output is correct
13 Correct 16 ms 12608 KB Output is correct
14 Correct 16 ms 12376 KB Output is correct
15 Correct 19 ms 12416 KB Output is correct
16 Correct 19 ms 12380 KB Output is correct
17 Correct 19 ms 12380 KB Output is correct
18 Correct 19 ms 12380 KB Output is correct
19 Correct 18 ms 12640 KB Output is correct
20 Correct 18 ms 12640 KB Output is correct
21 Correct 19 ms 12744 KB Output is correct
22 Correct 19 ms 12640 KB Output is correct
23 Correct 18 ms 12376 KB Output is correct
24 Correct 19 ms 12688 KB Output is correct
25 Correct 21 ms 12380 KB Output is correct
26 Correct 14 ms 12632 KB Output is correct
27 Correct 21 ms 12636 KB Output is correct
28 Correct 20 ms 12632 KB Output is correct
29 Correct 15 ms 13660 KB Output is correct
30 Correct 28 ms 12524 KB Output is correct
31 Correct 23 ms 12380 KB Output is correct
32 Correct 24 ms 12380 KB Output is correct
33 Correct 14 ms 12636 KB Output is correct
34 Correct 14 ms 12380 KB Output is correct
35 Correct 14 ms 12620 KB Output is correct
36 Correct 2 ms 11300 KB Output is correct
37 Correct 26 ms 12540 KB Output is correct
38 Correct 23 ms 12376 KB Output is correct
39 Correct 24 ms 12544 KB Output is correct
40 Correct 2386 ms 92804 KB Output is correct
41 Correct 3154 ms 99512 KB Output is correct
42 Correct 2907 ms 105028 KB Output is correct
43 Correct 2230 ms 90848 KB Output is correct
44 Correct 2071 ms 89220 KB Output is correct
45 Correct 3523 ms 85364 KB Output is correct
46 Correct 3650 ms 85032 KB Output is correct
47 Correct 3702 ms 86080 KB Output is correct
48 Correct 3756 ms 85940 KB Output is correct
49 Correct 3759 ms 85028 KB Output is correct
50 Correct 2124 ms 90684 KB Output is correct
51 Correct 2188 ms 91164 KB Output is correct
52 Correct 2247 ms 89728 KB Output is correct
53 Correct 3284 ms 84500 KB Output is correct
54 Correct 3294 ms 84008 KB Output is correct
55 Correct 3587 ms 84312 KB Output is correct
56 Correct 2001 ms 108152 KB Output is correct
57 Correct 1958 ms 108428 KB Output is correct
58 Correct 2068 ms 108040 KB Output is correct
59 Correct 2069 ms 108420 KB Output is correct
60 Correct 2259 ms 92240 KB Output is correct
61 Correct 2399 ms 87632 KB Output is correct
62 Correct 2385 ms 90408 KB Output is correct
63 Correct 1517 ms 92628 KB Output is correct
64 Correct 1257 ms 108608 KB Output is correct
65 Correct 2016 ms 89744 KB Output is correct
66 Correct 1882 ms 90660 KB Output is correct
67 Correct 3 ms 11100 KB Output is correct
68 Correct 14 ms 12640 KB Output is correct
69 Correct 14 ms 12380 KB Output is correct
70 Correct 15 ms 12612 KB Output is correct
71 Correct 1227 ms 94244 KB Output is correct
72 Correct 1098 ms 94716 KB Output is correct
73 Correct 1389 ms 92556 KB Output is correct
74 Correct 2024 ms 88236 KB Output is correct
75 Correct 1984 ms 87840 KB Output is correct
76 Correct 1984 ms 87996 KB Output is correct
77 Correct 1244 ms 88632 KB Output is correct
78 Correct 1213 ms 87992 KB Output is correct
79 Correct 1306 ms 87960 KB Output is correct
80 Correct 1120 ms 88396 KB Output is correct
81 Correct 1068 ms 89140 KB Output is correct
82 Correct 1224 ms 88164 KB Output is correct
83 Correct 1184 ms 88076 KB Output is correct
84 Correct 2559 ms 93092 KB Output is correct
85 Correct 2538 ms 84684 KB Output is correct
86 Correct 2391 ms 82668 KB Output is correct
87 Correct 3990 ms 87656 KB Output is correct
88 Correct 3812 ms 85848 KB Output is correct
89 Correct 3900 ms 86496 KB Output is correct
90 Correct 3832 ms 84944 KB Output is correct
91 Correct 3824 ms 86228 KB Output is correct
92 Correct 2431 ms 88284 KB Output is correct
93 Correct 2373 ms 89704 KB Output is correct
94 Correct 3265 ms 84180 KB Output is correct
95 Correct 3369 ms 84452 KB Output is correct
96 Correct 3756 ms 84644 KB Output is correct
97 Correct 3694 ms 84644 KB Output is correct
98 Correct 2033 ms 108160 KB Output is correct
99 Correct 2096 ms 108208 KB Output is correct
100 Correct 2085 ms 107784 KB Output is correct
101 Correct 1998 ms 108568 KB Output is correct
102 Correct 2524 ms 87188 KB Output is correct
103 Correct 2493 ms 92428 KB Output is correct
104 Correct 2474 ms 89800 KB Output is correct
105 Correct 1439 ms 92332 KB Output is correct
106 Correct 1630 ms 93944 KB Output is correct
107 Correct 1955 ms 95048 KB Output is correct
108 Correct 1906 ms 96136 KB Output is correct