oj.uz

답안 #926020

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
926020 2024-02-12T13:13:27 Z andrei_boaca Two Currencies (JOI23_currencies) C++17
100 / 100
 1459 ms 54480 KB 
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
ll n,m,q,in[100005],out[100005],dp[21][100005],par[100005],timp,total[100005],init[100005],niv[100005];
vector<pii> g;
vector<int> muchii[100005];
struct date
{
    ll p,c;
} v[100005];
bool byc(date a, date b)
{
    return a.c<b.c;
}
struct qr
{
    ll a,b,gold,silver,best;
} query[100005];
bool isancestor(int a,int b)
{
    return in[a]<=in[b]&&out[a]>=out[b];
}
int LCA(int a,int b)
{
    if(niv[a]>niv[b])
        swap(a,b);
    if(isancestor(a,b))
        return a;
    for(int i=18;i>=0;i--)
        if(dp[i][a]!=0&&!isancestor(dp[i][a],b))
            a=dp[i][a];
    return par[a];
}
void dfs(int nod)
{
    timp++;
    in[nod]=timp;
    dp[0][nod]=par[nod];
    for(int i=1;i<=18;i++)
        dp[i][nod]=dp[i-1][dp[i-1][nod]];
    for(int i:muchii[nod])
        if(i!=par[nod])
        {
            par[i]=nod;
            niv[i]=niv[nod]+1;
            dfs(i);
        }
    out[nod]=timp;
}
int getnode(pii p)
{
    if(par[p.first]==p.second)
        return p.first;
    return p.second;
}
struct event
{
    ll st,dr,who;
};
bool bymij(event a, event b)
{
    ll mija=(a.st+a.dr)/2;
    ll mijb=(b.st+b.dr)/2;
    return mija<mijb;
}
ll aib[2][100005]; /// 0 -> nr checkpoints, 1 -> suma
int lsb(int x)
{
    return x&(-x);
}
void update(ll ind,ll poz,ll val)
{
    for(ll i=poz;i<=n;i+=lsb(i))
        aib[ind][i]+=val;
}
ll suma(ll ind,ll poz)
{
    ll rez=0;
    for(ll i=poz;i>=1;i-=lsb(i))
        rez+=aib[ind][i];
    return rez;
}
vector<event> ev;
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cin>>n>>m>>q;
    for(int i=1;i<n;i++)
    {
        ll a,b;
        cin>>a>>b;
        g.push_back({a,b});
        muchii[a].push_back(b);
        muchii[b].push_back(a);
    }
    dfs(1);
    for(int i=1;i<=m;i++)
    {
        ll p,c;
        cin>>p>>c;
        p=getnode(g[p-1]);
        v[i]={p,c};
        init[in[p]]++;
        init[out[p]+1]--;
    }
    sort(v+1,v+m+1,byc);
    for(int i=1;i<=n;i++)
        init[i]+=init[i-1];
    for(int i=1;i<=q;i++)
    {
        ll a,b,x,y;
        cin>>a>>b>>x>>y;
        ll lca=LCA(a,b);
        total[i]=init[in[a]]+init[in[b]]-2*init[in[lca]];
        query[i]={a,b,x,y,0};
        ev.push_back({1,m,i});
    }
    while(!ev.empty())
    {
        sort(ev.begin(),ev.end(),bymij);
        for(int i=1;i<=n;i++)
            aib[0][i]=aib[1][i]=0;
        vector<event> aux;
        int poz=1;
        for(auto p:ev)
        {
            ll st=p.st;
            ll dr=p.dr;
            ll mij=(st+dr)/2;
            ll who=p.who;
            ll a=query[who].a;
            ll b=query[who].b;
            ll silver=query[who].silver;
            while(poz<=mij)
            {
                ll nod=v[poz].p;
                ll val=v[poz].c;
                update(0,in[nod],1);
                update(0,out[nod]+1,-1);
                update(1,in[nod],val);
                update(1,out[nod]+1,-val);
                poz++;
            }
            ll lca=LCA(a,b);
            ll s=suma(1,in[a])+suma(1,in[b])-2*suma(1,in[lca]);
            if(s<=silver)
            {
                query[who].best=suma(0,in[a])+suma(0,in[b])-2*suma(0,in[lca]);
                st=mij+1;
            }
            else
                dr=mij-1;
            if(st<=dr)
                aux.push_back({st,dr,who});
        }
        ev=aux;
    }
    for(int i=1;i<=q;i++)
    {
        ll rem=total[i]-query[i].best;
        if(rem>query[i].gold)
            cout<<-1<<'\n';
        else
            cout<<query[i].gold-rem<<'\n';
    }
    return 0;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 22876 KB Output is correct
2 Correct 3 ms 22876 KB Output is correct
3 Correct 3 ms 22872 KB Output is correct
4 Correct 4 ms 23028 KB Output is correct
5 Correct 8 ms 23264 KB Output is correct
6 Correct 11 ms 23388 KB Output is correct
7 Correct 8 ms 23388 KB Output is correct
8 Correct 10 ms 23388 KB Output is correct
9 Correct 10 ms 23264 KB Output is correct
10 Correct 11 ms 23388 KB Output is correct
11 Correct 10 ms 23444 KB Output is correct
12 Correct 10 ms 23388 KB Output is correct
13 Correct 9 ms 23384 KB Output is correct
14 Correct 10 ms 23384 KB Output is correct
15 Correct 10 ms 23384 KB Output is correct
16 Correct 11 ms 23388 KB Output is correct
17 Correct 11 ms 23388 KB Output is correct
18 Correct 11 ms 23480 KB Output is correct
19 Correct 8 ms 23388 KB Output is correct
20 Correct 9 ms 23384 KB Output is correct
21 Correct 10 ms 23388 KB Output is correct
22 Correct 8 ms 23428 KB Output is correct
23 Correct 8 ms 23388 KB Output is correct
24 Correct 9 ms 23456 KB Output is correct
25 Correct 9 ms 23388 KB Output is correct
26 Correct 7 ms 23388 KB Output is correct
27 Correct 7 ms 23420 KB Output is correct
28 Correct 8 ms 23388 KB Output is correct
29 Correct 8 ms 23200 KB Output is correct
30 Correct 9 ms 23388 KB Output is correct
31 Correct 12 ms 23648 KB Output is correct
32 Correct 9 ms 23584 KB Output is correct
33 Correct 7 ms 23384 KB Output is correct
34 Correct 7 ms 23388 KB Output is correct
35 Correct 7 ms 23388 KB Output is correct

Subtask #2
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 22876 KB Output is correct
2 Correct 9 ms 23356 KB Output is correct
3 Correct 10 ms 23388 KB Output is correct
4 Correct 12 ms 23388 KB Output is correct
5 Correct 773 ms 43596 KB Output is correct
6 Correct 892 ms 45952 KB Output is correct
7 Correct 844 ms 46872 KB Output is correct
8 Correct 730 ms 45916 KB Output is correct
9 Correct 704 ms 42312 KB Output is correct
10 Correct 1174 ms 48348 KB Output is correct
11 Correct 1143 ms 48344 KB Output is correct
12 Correct 1132 ms 47908 KB Output is correct
13 Correct 1076 ms 48208 KB Output is correct
14 Correct 1193 ms 48056 KB Output is correct
15 Correct 811 ms 54480 KB Output is correct
16 Correct 655 ms 54316 KB Output is correct
17 Correct 796 ms 53080 KB Output is correct
18 Correct 1459 ms 48388 KB Output is correct
19 Correct 1395 ms 49276 KB Output is correct
20 Correct 1410 ms 49160 KB Output is correct
21 Correct 1043 ms 47544 KB Output is correct
22 Correct 1018 ms 47888 KB Output is correct
23 Correct 1033 ms 47776 KB Output is correct
24 Correct 1042 ms 48264 KB Output is correct
25 Correct 834 ms 48496 KB Output is correct
26 Correct 924 ms 48636 KB Output is correct
27 Correct 703 ms 48528 KB Output is correct
28 Correct 503 ms 47976 KB Output is correct
29 Correct 472 ms 47884 KB Output is correct
30 Correct 589 ms 48708 KB Output is correct
31 Correct 674 ms 48548 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 22876 KB Output is correct
2 Correct 7 ms 23388 KB Output is correct
3 Correct 9 ms 23384 KB Output is correct
4 Correct 7 ms 23388 KB Output is correct
5 Correct 321 ms 43352 KB Output is correct
6 Correct 333 ms 45952 KB Output is correct
7 Correct 457 ms 42300 KB Output is correct
8 Correct 586 ms 48664 KB Output is correct
9 Correct 537 ms 47548 KB Output is correct
10 Correct 555 ms 47940 KB Output is correct
11 Correct 508 ms 48888 KB Output is correct
12 Correct 514 ms 48492 KB Output is correct
13 Correct 461 ms 47560 KB Output is correct
14 Correct 406 ms 47784 KB Output is correct
15 Correct 369 ms 47904 KB Output is correct
16 Correct 498 ms 47720 KB Output is correct
17 Correct 415 ms 47896 KB Output is correct

Subtask #4
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 22876 KB Output is correct
2 Correct 3 ms 22876 KB Output is correct
3 Correct 3 ms 22872 KB Output is correct
4 Correct 4 ms 23028 KB Output is correct
5 Correct 8 ms 23264 KB Output is correct
6 Correct 11 ms 23388 KB Output is correct
7 Correct 8 ms 23388 KB Output is correct
8 Correct 10 ms 23388 KB Output is correct
9 Correct 10 ms 23264 KB Output is correct
10 Correct 11 ms 23388 KB Output is correct
11 Correct 10 ms 23444 KB Output is correct
12 Correct 10 ms 23388 KB Output is correct
13 Correct 9 ms 23384 KB Output is correct
14 Correct 10 ms 23384 KB Output is correct
15 Correct 10 ms 23384 KB Output is correct
16 Correct 11 ms 23388 KB Output is correct
17 Correct 11 ms 23388 KB Output is correct
18 Correct 11 ms 23480 KB Output is correct
19 Correct 8 ms 23388 KB Output is correct
20 Correct 9 ms 23384 KB Output is correct
21 Correct 10 ms 23388 KB Output is correct
22 Correct 8 ms 23428 KB Output is correct
23 Correct 8 ms 23388 KB Output is correct
24 Correct 9 ms 23456 KB Output is correct
25 Correct 9 ms 23388 KB Output is correct
26 Correct 7 ms 23388 KB Output is correct
27 Correct 7 ms 23420 KB Output is correct
28 Correct 8 ms 23388 KB Output is correct
29 Correct 8 ms 23200 KB Output is correct
30 Correct 9 ms 23388 KB Output is correct
31 Correct 12 ms 23648 KB Output is correct
32 Correct 9 ms 23584 KB Output is correct
33 Correct 7 ms 23384 KB Output is correct
34 Correct 7 ms 23388 KB Output is correct
35 Correct 7 ms 23388 KB Output is correct
36 Correct 3 ms 22876 KB Output is correct
37 Correct 9 ms 23356 KB Output is correct
38 Correct 10 ms 23388 KB Output is correct
39 Correct 12 ms 23388 KB Output is correct
40 Correct 773 ms 43596 KB Output is correct
41 Correct 892 ms 45952 KB Output is correct
42 Correct 844 ms 46872 KB Output is correct
43 Correct 730 ms 45916 KB Output is correct
44 Correct 704 ms 42312 KB Output is correct
45 Correct 1174 ms 48348 KB Output is correct
46 Correct 1143 ms 48344 KB Output is correct
47 Correct 1132 ms 47908 KB Output is correct
48 Correct 1076 ms 48208 KB Output is correct
49 Correct 1193 ms 48056 KB Output is correct
50 Correct 811 ms 54480 KB Output is correct
51 Correct 655 ms 54316 KB Output is correct
52 Correct 796 ms 53080 KB Output is correct
53 Correct 1459 ms 48388 KB Output is correct
54 Correct 1395 ms 49276 KB Output is correct
55 Correct 1410 ms 49160 KB Output is correct
56 Correct 1043 ms 47544 KB Output is correct
57 Correct 1018 ms 47888 KB Output is correct
58 Correct 1033 ms 47776 KB Output is correct
59 Correct 1042 ms 48264 KB Output is correct
60 Correct 834 ms 48496 KB Output is correct
61 Correct 924 ms 48636 KB Output is correct
62 Correct 703 ms 48528 KB Output is correct
63 Correct 503 ms 47976 KB Output is correct
64 Correct 472 ms 47884 KB Output is correct
65 Correct 589 ms 48708 KB Output is correct
66 Correct 674 ms 48548 KB Output is correct
67 Correct 3 ms 22876 KB Output is correct
68 Correct 7 ms 23388 KB Output is correct
69 Correct 9 ms 23384 KB Output is correct
70 Correct 7 ms 23388 KB Output is correct
71 Correct 321 ms 43352 KB Output is correct
72 Correct 333 ms 45952 KB Output is correct
73 Correct 457 ms 42300 KB Output is correct
74 Correct 586 ms 48664 KB Output is correct
75 Correct 537 ms 47548 KB Output is correct
76 Correct 555 ms 47940 KB Output is correct
77 Correct 508 ms 48888 KB Output is correct
78 Correct 514 ms 48492 KB Output is correct
79 Correct 461 ms 47560 KB Output is correct
80 Correct 406 ms 47784 KB Output is correct
81 Correct 369 ms 47904 KB Output is correct
82 Correct 498 ms 47720 KB Output is correct
83 Correct 415 ms 47896 KB Output is correct
84 Correct 668 ms 42316 KB Output is correct
85 Correct 630 ms 43344 KB Output is correct
86 Correct 639 ms 42300 KB Output is correct
87 Correct 1137 ms 48688 KB Output is correct
88 Correct 1132 ms 48528 KB Output is correct
89 Correct 1137 ms 48316 KB Output is correct
90 Correct 1146 ms 47836 KB Output is correct
91 Correct 1141 ms 47964 KB Output is correct
92 Correct 970 ms 51420 KB Output is correct
93 Correct 861 ms 52416 KB Output is correct
94 Correct 1327 ms 48488 KB Output is correct
95 Correct 1327 ms 48264 KB Output is correct
96 Correct 1389 ms 48804 KB Output is correct
97 Correct 1295 ms 48412 KB Output is correct
98 Correct 1088 ms 47856 KB Output is correct
99 Correct 1106 ms 48392 KB Output is correct
100 Correct 1107 ms 48348 KB Output is correct
101 Correct 1030 ms 48232 KB Output is correct
102 Correct 867 ms 48420 KB Output is correct
103 Correct 841 ms 49076 KB Output is correct
104 Correct 906 ms 48108 KB Output is correct
105 Correct 574 ms 48576 KB Output is correct
106 Correct 504 ms 48320 KB Output is correct
107 Correct 649 ms 48416 KB Output is correct
108 Correct 558 ms 48056 KB Output is correct