QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#154142 | #7118. Closing Time | paul2008# | 8 | 135ms | 74568kb | C++14 | 3.9kb | 2023-08-31 14:07:42 | 2023-08-31 14:07:43 |
Judging History
answer
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <vector>
#include <queue>
using namespace std;
const int N=4e5+5;
vector <int> g[N],w[N];
int fat[N],fa[N],son[N],a[N],n;
long long distx[N],disty[N];
bool inpath[N];
void dfsx(int x,int fa)
{
for(int i=0;i<g[x].size();i++)
{
int to=g[x][i];
if(to==fa)
continue;
fat[to]=x;
distx[to]=distx[x]+w[x][i];
dfsx(to,x);
}
}
void dfsy(int x,int fa)
{
for(int i=0;i<g[x].size();i++)
{
int to=g[x][i];
if(to==fa)
continue;
disty[to]=disty[x]+w[x][i];
dfsy(to,x);
}
}
long long calc(long long k)
{
priority_queue <long long,vector <long long>,greater<long long> > q;
for(int i=1;i<=n;i++)
q.push(distx[i]);
for(int i=1;i<=n;i++)
q.push(disty[i]);
int ans=0;
while(!q.empty())
{
long long x=q.top();
q.pop();
k -= x, ans++;
if(k<0)
return ans-1;
}
return ans;
}
void add(int x,int y,int z)
{
g[x].push_back(y);
w[x].push_back(z);
}
struct node
{
long long sz,sum;
int id;
bool operator <(const node& oth) const
{
return sum*oth.sz>oth.sum*sz;
}
}val[N];
bool del[N],in[N];
pair <int,int> edge[N];
long long sumfirst[N];
int cnt;
priority_queue <pair<int,int>,vector <pair<int,int> >,greater<pair<int,int> > > q;
int gettop()
{
while(del[q.top().second])
q.pop();
in[q.top().second]=true;
int ans=q.top().first;
q.pop();
return ans;
}
bool check(int m,long long k) //判断是否可以取m个,上界为k
{
for(int i=1;i<=cnt;i++)
del[i]=in[i]=false;
sort(edge+1,edge+cnt+1);
for(int i=1;i<=cnt;i++) //处理第一行的前缀和
sumfirst[i]=sumfirst[i-1]+edge[i].second;
for(int i=1;i<=cnt;i++)
q.push(make_pair(edge[i].first-edge[i].second,i+cnt)); //第一行的标号为i,第二行的标号为i+cnt
long long nowsum=0;
for(int i=cnt;i>=0;i--)
{
if(i>m)
continue;
if(nowsum+sumfirst[i]<=k) //当前这个i是合法的
return true;
if(i+cnt<=m)
return false;
//更新nowsum
q.push(make_pair(edge[i].second,i));
nowsum += gettop();
del[i+cnt]=true;
if(in[i+cnt])
{
in[i+cnt]=false;
nowsum -= edge[i].first-edge[i].second;
nowsum += gettop();
}
}
return false;
}
void add(int x,int y)
{
edge[++cnt]=make_pair(x+y,x);
}
int max_score(int N, int x, int y, long long k, vector<int> U, vector<int> V, vector<int> W)
{
n=N, x++, y++, cnt=0;
for(int i=1;i<=n;i++)
g[i].clear(), w[i].clear(), inpath[i]=false, distx[i]=disty[i]=fat[i]=0;
for(int i=0;i<n-1;i++)
{
add(U[i]+1,V[i]+1,W[i]);
add(V[i]+1,U[i]+1,W[i]);
}
dfsx(x,-1), dfsy(y,-1);
for(int i=1;i<=n;i++)
g[i].clear();
for(int i=0;i<=n*2;i++)
fa[i]=son[i]=del[i]=0;
int sum=0,cnt=0,ans=calc(k);
for(int i=y;i;i=fat[i])
{
inpath[i]=true;
if(distx[i]>disty[i]) swap(distx[i],disty[i]);
add(0,disty[i]-distx[i]);
k -= distx[i], sum++;
val[cnt+1].sum=disty[i]-distx[i];
cnt++;
}
if(k<0)
return ans;
for(int i=1;i<=n;i++)
{
if(!inpath[i])
{
if(distx[i]>disty[i]) swap(distx[i],disty[i]);
add(distx[i],disty[i]-distx[i]);
val[cnt+2].sum=disty[i]-distx[i], val[cnt+1].sum=distx[i];
fa[cnt+2]=cnt+1, son[cnt+1]=cnt+2;
cnt += 2;
}
}
priority_queue <node> q;
for(int i=1;i<=cnt;i++)
{
val[i].sz=1, val[i].id=i;
q.push(val[i]), a[i]=val[i].sum;
}
int maxone=0;
while(!q.empty())
{
node x=q.top();
q.pop();
if(del[x.id])
continue;
if(!fa[x.id] || del[fa[x.id]])
{
if(k>=x.sum)
{
k -= x.sum;
sum += x.sz;
if(x.sz==1)
del[x.id]=true;
else
del[x.id]=del[son[x.id]]=true;
continue;
}
else
break;
}
else
{
val[fa[x.id]].sz += val[x.id].sz, val[fa[x.id]].sum += x.sum;
q.push(val[fa[x.id]]);
}
}
return max(sum+check(sum+1,k),ans);
}
详细
Subtask #1:
score: 8
Accepted
Test #1:
score: 8
Accepted
time: 115ms
memory: 67248kb
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:
081ce3c351cbf526b37954b9ad30f2b531a7585c OK 451
result:
ok
Test #2:
score: 0
Accepted
time: 135ms
memory: 74568kb
input:
cc61ad56a4797fb3f5c9529f73ce6fcedd85669b 1 200000 97133 170892 35489415917 114511 170892 730058 34783 114511 435023 34783 47301 562314 47301 162600 457629 44856 162600 365133 44856 133801 83016 117539 133801 124222 117539 128719 199821 77871 128719 703141 77871 133155 624331 7211 133155 138691 7211 ...
output:
081ce3c351cbf526b37954b9ad30f2b531a7585c OK 650
result:
ok
Test #3:
score: 0
Accepted
time: 35ms
memory: 41144kb
input:
cc61ad56a4797fb3f5c9529f73ce6fcedd85669b 200 1000 611 992 5736784 504 611 954658 504 936 219278 502 936 632439 393 502 177662 267 393 570266 267 291 941365 291 310 168052 310 765 253098 635 765 724932 274 635 842125 274 799 848645 39 799 433118 39 940 705598 553 940 564063 553 960 69665 917 960 6904...
output:
081ce3c351cbf526b37954b9ad30f2b531a7585c OK 126 38 69 34 52 33 42 32 39 41 38 36 45 84 40 44 50 42 47 34 38 47 38 37 39 37 44 39 32 33 38 54 25 36 46 33 37 35 28 36 45 43 44 49 37 33 43 44 53 42 33 30 50 41 37 40 37 44 207 31 37 45 36 43 35 40 41 39 135 53 40 32 31 37 34 38 51 48 36 40 48 42 43 43 3...
result:
ok
Subtask #2:
score: 0
Wrong Answer
Test #4:
score: 9
Accepted
time: 3ms
memory: 38112kb
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: 0
Accepted
time: 1ms
memory: 39120kb
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: 0
Accepted
time: 3ms
memory: 40780kb
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: 0
Accepted
time: 5ms
memory: 39388kb
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: 0
Accepted
time: 5ms
memory: 38196kb
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: 0
Accepted
time: 3ms
memory: 37044kb
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
Accepted
time: 2ms
memory: 38420kb
input:
cc61ad56a4797fb3f5c9529f73ce6fcedd85669b 1 3 0 1 1 0 1 1 1 2 1
output:
081ce3c351cbf526b37954b9ad30f2b531a7585c OK 3
result:
ok
Test #11:
score: 0
Accepted
time: 1ms
memory: 40800kb
input:
cc61ad56a4797fb3f5c9529f73ce6fcedd85669b 1 20 8 9 31897732 0 1 428932 1 2 103619 2 3 805647 3 4 691922 4 5 320369 5 6 755877 6 7 701672 7 8 426711 8 9 507102 9 10 492732 10 11 68466 11 12 317311 12 13 37666 13 14 499673 14 15 502226 15 16 753200 16 17 523387 17 18 904778 18 19 695859
output:
081ce3c351cbf526b37954b9ad30f2b531a7585c OK 30
result:
ok
Test #12:
score: 0
Accepted
time: 5ms
memory: 40792kb
input:
cc61ad56a4797fb3f5c9529f73ce6fcedd85669b 1 20 15 16 25160185 0 1 193268 1 2 139314 2 3 193167 3 4 446469 4 5 793626 5 6 502774 6 7 598587 7 8 69975 8 9 499282 9 10 943594 10 11 804459 11 12 536095 12 13 578060 13 14 142523 14 15 364845 15 16 181397 16 17 64327 17 18 224827 18 19 439557
output:
081ce3c351cbf526b37954b9ad30f2b531a7585c OK 26
result:
ok
Test #13:
score: -9
Wrong Answer
time: 5ms
memory: 40888kb
input:
cc61ad56a4797fb3f5c9529f73ce6fcedd85669b 1 20 0 19 77846543 0 1 603320 1 2 433257 2 3 572719 3 4 340716 4 5 549198 5 6 383420 6 7 50703 7 8 720210 8 9 304217 9 10 162280 10 11 68594 11 12 401595 12 13 446738 13 14 920882 14 15 494739 15 16 616729 16 17 874820 17 18 269830 18 19 53532
output:
081ce3c351cbf526b37954b9ad30f2b531a7585c OK 35
result:
wrong answer 1st lines differ - on the 1st token, expected: '34', found: '35'
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: 2ms
memory: 38552kb
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: 0
Accepted
time: 2ms
memory: 41432kb
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: 0
Accepted
time: 0ms
memory: 38568kb
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
Wrong Answer
time: 1ms
memory: 40928kb
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 13
result:
wrong answer 1st lines differ - on the 1st token, expected: '14', found: '13'
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:
100%
Accepted
Dependency #2:
0%