QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#155718#7118. Closing Timebulijiojiodibuliduo#0 1ms4132kbC++172.6kb2023-09-02 02:25:112024-04-28 06:46:40

Judging History

你现在查看的是最新测评结果

  • [2024-04-28 06:46:40]
  • 管理员手动重测本题所有提交记录
  • 测评结果:0
  • 用时:1ms
  • 内存:4132kb
  • [2023-09-02 02:25:11]
  • 评测
  • 测评结果:0
  • 用时:1ms
  • 内存:3792kb
  • [2023-09-02 02:25:11]
  • 提交

answer

#include "closing.h"
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef basic_string<int> BI;
typedef long long ll;
typedef pair<int,int> PII;
typedef double db;
mt19937 mrand(random_device{}()); 
const ll mod=1000000007;
int rnd(int x) { return mrand() % x;}
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
// head

int max_score(int n, int X, int Y, long long K,
              std::vector<int> U, std::vector<int> V, std::vector<int> W)
{
    vector<vector<pair<int,int>>> e(n);
    rep(i,0,n-1) {
        int u=U[i],v=V[i],w=W[i];
        e[u].pb(mp(v,w));
        e[v].pb(mp(u,w));
    }
    vector<ll> dis1(n),dis2(n);
    function<void(int,int,ll,vector<ll>&)> dfs=[&](int u,int f,ll dep,vector<ll>& dis) {
        dis[u]=dep;
        //printf("??? %d\n",u);
        for (auto [v,w]:e[u]) if (v!=f) {
            dfs(v,u,dep+w,dis);
        }
    };
    dfs(X,0,0ll,dis1);
    dfs(Y,0,0ll,dis2);
    map<ll,vector<ll>> grp;
    vector<ll> w;
    for (int i=0;i<n;i++) {
        w.pb(min(dis1[i],dis2[i]));
        //grp[abs(dis1[i]-dis2[i])].pb(min(dis1[i],dis2[i]));
        //printf("!!! %d %lld %lld\n",i,dis1[i],dis2[i]);
    }
    sort(all(w));
    int ans1=0;
    ll s=0;
    for (auto x:w) {
        s+=x;
        if (s<=K) ans1++;
    }
    for (int i=0;i<n;i++) if (dis1[i]+dis2[i]==dis1[Y]) {
        K-=min(dis1[i],dis2[i]);
        grp[abs(dis1[i]-dis2[i])].pb(0);
    } else {
        grp[abs(dis1[i]-dis2[i])].pb(min(dis1[i],dis2[i]));        
    }
    vector<ll> ret{0ll};
    for (auto [d,vc]:grp) {
        sort(all(vc));
        vector<ll> q1,q2,dp;
        for (auto x:vc) if (x<=d) q1.pb(x); else q2.pb(x);
        ll s=0; dp.pb(0);
        for (auto x:q1) { s+=x; dp.pb(s); }
        rep(i,0,SZ(q1)) { s+=d; dp.pb(s); }
        for (auto x:q2) {
            s+=x; dp.pb(s);
            s+=d; dp.pb(s);
        }
        //printf("dp: ");
        //for (auto x:dp) printf("%lld ",x); puts("");
        vector<ll> tmp(SZ(ret)+SZ(dp)-1,1ll<<60);
        rep(p1,0,SZ(ret)) rep(p2,0,SZ(dp)) tmp[p1+p2]=min(tmp[p1+p2],ret[p1]+dp[p2]);
        ret=tmp;
    }
    //for (auto x:ret) printf("%lld ",x); puts("");
    int ans2=0;
    rep(i,1,SZ(ret)) if (ret[i]<=K) ans2++;
    return max(ans1,ans2);
}

详细

Subtask #1:

score: 0
Time Limit Exceeded

Test #1:

score: 0
Time Limit Exceeded

input:

cc61ad56a4797fb3f5c9529f73ce6fcedd85669b
1
200000 31011 61157 8517583098
31011 129396 964383
1655 129396 331139
1655 191487 566483
110385 191487 865248
43212 110385 542661
43212 81682 13766
81682 91774 546589
91774 124706 780638
124706 175650 118706
10421 175650 615314
10421 151953 436270
140430 151...

output:


result:


Subtask #2:

score: 0
Wrong Answer

Test #4:

score: 9
Accepted
time: 1ms
memory: 3824kb

input:

cc61ad56a4797fb3f5c9529f73ce6fcedd85669b
1
50 23 25 382806473
0 1 375710
1 2 898637
2 3 10402
3 4 536577
4 5 385023
5 6 71075
6 7 543368
7 8 301497
8 9 174394
9 10 711312
10 11 923006
11 12 675532
12 13 838667
13 14 565729
14 15 979816
15 16 862618
16 17 576015
17 18 177751
18 19 306989
19 20 881492...

output:

081ce3c351cbf526b37954b9ad30f2b531a7585c
OK
96

result:

ok 

Test #5:

score: 9
Accepted
time: 0ms
memory: 3820kb

input:

cc61ad56a4797fb3f5c9529f73ce6fcedd85669b
1
47 20 22 25669694
0 1 291237
1 2 851987
2 3 421247
3 4 962919
4 5 643085
5 6 224951
6 7 756890
7 8 147295
8 9 625823
9 10 736374
10 11 290526
11 12 335466
12 13 539086
13 14 957449
14 15 423408
15 16 932444
16 17 356032
17 18 307118
18 19 94279
19 20 989546...

output:

081ce3c351cbf526b37954b9ad30f2b531a7585c
OK
26

result:

ok 

Test #6:

score: 9
Accepted
time: 1ms
memory: 3848kb

input:

cc61ad56a4797fb3f5c9529f73ce6fcedd85669b
1
46 6 34 355277954
0 1 574359
1 2 58362
2 3 778155
3 4 538832
4 5 128903
5 6 79774
6 7 715282
7 8 259924
8 9 640303
9 10 361135
10 11 506866
11 12 527045
12 13 946672
13 14 620381
14 15 701743
15 16 766266
16 17 524732
17 18 340089
18 19 630172
19 20 357712
...

output:

081ce3c351cbf526b37954b9ad30f2b531a7585c
OK
74

result:

ok 

Test #7:

score: 9
Accepted
time: 1ms
memory: 4132kb

input:

cc61ad56a4797fb3f5c9529f73ce6fcedd85669b
1
45 14 44 70669
0 1 266130
1 2 372315
2 3 965349
3 4 119493
4 5 190522
5 6 506822
6 7 45330
7 8 423189
8 9 748532
9 10 653554
10 11 102552
11 12 90431
12 13 843259
13 14 422626
14 15 35334
15 16 1
16 17 1
17 18 1
18 19 1
19 20 1
20 21 1
21 22 1
22 23 1
23 24...

output:

081ce3c351cbf526b37954b9ad30f2b531a7585c
OK
4

result:

ok 

Test #8:

score: 9
Accepted
time: 1ms
memory: 3892kb

input:

cc61ad56a4797fb3f5c9529f73ce6fcedd85669b
1
50 0 49 332340134
0 1 987193
1 2 950856
2 3 893737
3 4 870689
4 5 810192
5 6 790242
6 7 744052
7 8 714922
8 9 677074
9 10 630082
10 11 599644
11 12 528415
12 13 491648
13 14 479486
14 15 439182
15 16 371085
16 17 357776
17 18 308161
18 19 254481
19 20 20430...

output:

081ce3c351cbf526b37954b9ad30f2b531a7585c
OK
44

result:

ok 

Test #9:

score: 9
Accepted
time: 0ms
memory: 3896kb

input:

cc61ad56a4797fb3f5c9529f73ce6fcedd85669b
1
50 0 49 329827838
0 1 972981
1 2 953594
2 3 908629
3 4 849675
4 5 808354
5 6 782643
6 7 759387
7 8 698618
8 9 650896
9 10 639153
10 11 591828
11 12 532588
12 13 503214
13 14 447660
14 15 403224
15 16 380834
16 17 327127
17 18 300115
18 19 244025
19 20 23362...

output:

081ce3c351cbf526b37954b9ad30f2b531a7585c
OK
44

result:

ok 

Test #10:

score: 0
Wrong Answer
time: 0ms
memory: 3824kb

input:

cc61ad56a4797fb3f5c9529f73ce6fcedd85669b
1
3 0 1 1
0 1 1
1 2 1

output:

081ce3c351cbf526b37954b9ad30f2b531a7585c
OK
4

result:

wrong answer 1st lines differ - on the 1st token, expected: '3', found: '4'

Subtask #3:

score: 0
Skipped

Dependency #2:

0%

Subtask #4:

score: 0
Skipped

Dependency #3:

0%

Subtask #5:

score: 0
Wrong Answer

Test #36:

score: 9
Accepted
time: 1ms
memory: 3812kb

input:

cc61ad56a4797fb3f5c9529f73ce6fcedd85669b
1
4 0 1 9
0 2 2
1 2 3
2 3 3

output:

081ce3c351cbf526b37954b9ad30f2b531a7585c
OK
6

result:

ok 

Test #37:

score: 9
Accepted
time: 0ms
memory: 4112kb

input:

cc61ad56a4797fb3f5c9529f73ce6fcedd85669b
1
4 0 1 8
0 2 2
1 2 3
2 3 100

output:

081ce3c351cbf526b37954b9ad30f2b531a7585c
OK
5

result:

ok 

Test #38:

score: 9
Accepted
time: 0ms
memory: 3816kb

input:

cc61ad56a4797fb3f5c9529f73ce6fcedd85669b
1
8 0 4 84
0 1 1
1 2 29
2 3 29
3 4 1
4 5 20
2 6 20
3 7 1

output:

081ce3c351cbf526b37954b9ad30f2b531a7585c
OK
9

result:

ok 

Test #39:

score: 9
Accepted
time: 0ms
memory: 3880kb

input:

cc61ad56a4797fb3f5c9529f73ce6fcedd85669b
1
18 14 15 221112
8 10 15984
3 8 2664
6 10 5328
9 10 13320
5 10 23976
1 10 13320
3 4 5328
3 7 26640
3 11 23976
4 15 23976
6 17 18648
12 17 5328
11 13 13320
0 11 7992
15 16 5328
2 16 5328
13 14 2664

output:

081ce3c351cbf526b37954b9ad30f2b531a7585c
OK
14

result:

ok 

Test #40:

score: 0
Wrong Answer
time: 1ms
memory: 3828kb

input:

cc61ad56a4797fb3f5c9529f73ce6fcedd85669b
1
19 3 9 11232111
13 14 174955
0 13 69982
10 14 209946
14 15 209946
12 14 104973
0 11 314919
0 3 314919
0 7 139964
5 10 209946
10 16 69982
4 10 104973
9 11 279928
9 17 349910
1 4 104973
3 18 209946
6 18 174955
7 8 314919
2 7 104973

output:

081ce3c351cbf526b37954b9ad30f2b531a7585c
OK
33

result:

wrong answer 1st lines differ - on the 1st token, expected: '28', found: '33'

Subtask #6:

score: 0
Skipped

Dependency #2:

0%

Subtask #7:

score: 0
Skipped

Dependency #3:

0%

Subtask #8:

score: 0
Skipped

Dependency #4:

0%

Subtask #9:

score: 0
Skipped

Dependency #1:

0%