QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#166393 | #7118. Closing Time | youngsystem# | 8 | 80ms | 44132kb | C++14 | 2.9kb | 2023-09-06 10:50:46 | 2023-09-06 10:50:47 |
Judging History
answer
#include "closing.h"
#include <bits/stdc++.h>
using namespace std;
long long disx[200005],disy[200005];
vector<pair<int,int> >v[200005];
int fa[200005];
bool lj[200005];
void dfsx(int x,int f)
{
fa[x]=f;
for(int i=0;i<v[x].size();i++)
{
int sth=v[x][i].first,bq=v[x][i].second;
if(sth==f)continue;
disx[sth]=disx[x]+bq;
dfsx(sth,x);
}
}
void dfsy(int x,int f)
{
for(int i=0;i<v[x].size();i++)
{
int sth=v[x][i].first,bq=v[x][i].second;
if(sth==f)continue;
disy[sth]=disy[x]+bq;
dfsy(sth,x);
}
}
long long dis1[200005],dis2[200005];
long long dp[3005][6005];
long long qz[400005];
int sy[200005];
priority_queue<pair<long long,int>,vector<pair<long long,int> >,greater<pair<long long,int> > >pq,pq2;
int max_score(int N, int X, int Y, long long K,
std::vector<int> U, std::vector<int> V, std::vector<int> W)
{
for(int i=1;i<=N;i++)v[i].clear(),sy[i]=0;
while(!pq.empty())pq.pop();
while(!pq2.empty())pq2.pop();
for(int i=0;i<N-1;i++)
{
U[i]++;
V[i]++;
v[U[i]].push_back(make_pair(V[i],W[i]));
v[V[i]].push_back(make_pair(U[i],W[i]));
}
X++;
Y++;
disx[X]=disy[Y]=0;
dfsx(X,0);
dfsy(Y,0);
int sth=Y;
while(sth!=0)
{
lj[sth]=true;
sth=fa[sth];
}
int ans1=N;
for(int i=1;i<=N;i++)
{
dis1[i]=min(disx[i],disy[i]);
dis2[i]=max(disx[i],disy[i]);
qz[i]=dis1[i];
//printf("%lld %lld\n",dis1[i],dis2[i]);
}
sort(qz+1,qz+N+1);
long long now=0;
for(int i=1;i<=N;i++)
{
now+=qz[i];
if(now>K)
{
ans1=i-1;
break;
}
}
int ans2=0;
int nsl=0;
long long het=0;
for(int i=1;i<=N;i++)
{
if(lj[i])
{
nsl++;
het+=dis1[i];
sy[i]=1;
pq.push(make_pair(dis2[i]-dis1[i],i));
}
else
{
if(dis1[i]<dis2[i]-dis1[i])
{
pq.push(make_pair(dis1[i],i));
pq.push(make_pair(dis2[i]-dis1[i],i));
}
else
{
pq2.push(make_pair(dis2[i],i));
}
}
}
if(het>K)return ans1;
while(!pq2.empty())
{
pair<long long,int> sth=pq2.top();
//printf("!!!%lld %d\n",sth.first,sth.second);
if(het+sth.first>K)
{
break;
}
if(pq.size()<=1)
{
het+=sth.first;
sy[sth.second]+=2;
nsl+=2;
pq2.pop();
}
pair<long long,int> x=pq.top();
pq.pop();
pair<long long,int> y=pq.top();
if(x.first+y.first<sth.first)
{
//printf("pq:%lld %d\n",x.first,x.second);
het+=x.first;
sy[x.second]+=1;
nsl++;
}
else
{
het+=sth.first;
nsl+=2;
sy[sth.second]+=2;
pq.push(x);
pq2.pop();
}
}
//printf("!!!%lld %d\n",het,nsl);
int tmp=0;
for(int i=1;i<=N;i++)
{
if(sy[i]==0)
{
qz[++tmp]=dis1[i];
}
if(sy[i]<2)
{
qz[++tmp]=dis2[i]-dis1[i];
}
}
sort(qz+1,qz+tmp+1);
for(int i=1;i<=tmp;i++)
{
if(het+qz[i]<=K)
{
het+=qz[i];
nsl++;
}
}
//printf("!!!%lld %d\n",het,nsl);
ans2=nsl;
return max(ans1,ans2);
}
詳細信息
Subtask #1:
score: 8
Accepted
Test #1:
score: 8
Accepted
time: 80ms
memory: 43140kb
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: 76ms
memory: 44132kb
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: 59ms
memory: 16632kb
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: 0
Wrong Answer
time: 3ms
memory: 18176kb
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 236
result:
wrong answer 1st lines differ - on the 1st token, expected: '96', found: '236'
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: 3ms
memory: 16084kb
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: 13984kb
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: 14340kb
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: 0
Accepted
time: 1ms
memory: 14048kb
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
Accepted
time: 1ms
memory: 16136kb
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 28
result:
ok
Test #41:
score: 0
Accepted
time: 1ms
memory: 14048kb
input:
cc61ad56a4797fb3f5c9529f73ce6fcedd85669b 1 15 5 7 155966 1 4 964448 5 11 996819 9 10 330180 5 6 987448 11 12 704605 0 5 155967 8 14 596631 10 11 923917 0 14 560902 4 13 49411 1 7 856694 1 12 755799 2 14 488208 3 13 990480
output:
081ce3c351cbf526b37954b9ad30f2b531a7585c OK 2
result:
ok
Test #42:
score: -9
Wrong Answer
time: 3ms
memory: 18220kb
input:
cc61ad56a4797fb3f5c9529f73ce6fcedd85669b 1 20 4 7 40726445 15 18 841797 9 16 909512 0 7 39919 8 19 78725 6 17 661904 7 14 426400 17 18 664669 7 13 917960 4 14 821652 4 11 274656 1 12 937782 10 19 129031 12 13 504353 5 11 502915 3 8 264525 2 19 358409 12 18 578659 16 19 696491 3 17 175157
output:
081ce3c351cbf526b37954b9ad30f2b531a7585c OK 37
result:
wrong answer 1st lines differ - on the 1st token, expected: '30', found: '37'
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%