QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#89522 | #5252. Deforestation | Fengfeng | WA | 19ms | 17440kb | C++14 | 518b | 2023-03-20 13:13:08 | 2023-03-20 13:13:10 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
long long w;
long long ans=0;
long long dfs()
{
int n;
long long no;
cin>>no>>n;
long long sum=0;
priority_queue<int>q;
for(int i=1;i<=n;i++)
{
long long t=dfs();
q.push(t);
sum+=t;
}
while(sum>w)
{
ans++;
sum-=q.top();
}
if(sum==w) sum=0,ans++;
no+=sum;
ans+=no/w;
no%=w;
return no;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
cin>>w;
if(dfs()) ans++;
cout<<ans;
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 19ms
memory: 3432kb
input:
999900000 7339 3 14947 2 12850 3 8986 10 11599 9 8889 10 10711 4 8015 1 11626 0 9492 1 7017 0 8863 0 8632 0 5321 5 9906 0 11687 0 9845 0 10469 0 11708 0 14950 5 11934 0 11922 0 13101 0 12000 0 9082 0 9273 5 12296 0 6119 0 9201 0 12652 0 12957 0 7454 5 12515 0 12976 0 10358 0 13997 0 8371 0 10181 5 8...
output:
1
result:
ok single line: '1'
Test #2:
score: 0
Accepted
time: 7ms
memory: 3756kb
input:
2 1 99999 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 ...
output:
99999
result:
ok single line: '99999'
Test #3:
score: 0
Accepted
time: 16ms
memory: 11952kb
input:
7 10000 2 10000 0 10000 2 10000 0 10000 2 10000 0 10000 2 10000 0 10000 2 10000 0 10000 2 10000 0 10000 2 10000 0 10000 2 10000 0 10000 2 10000 0 10000 2 10000 0 10000 2 10000 0 10000 2 10000 0 10000 2 10000 0 10000 2 10000 0 10000 2 10000 0 10000 2 10000 0 10000 2 10000 0 10000 2 10000 0 10000 2 10...
output:
142862500
result:
ok single line: '142862500'
Test #4:
score: 0
Accepted
time: 15ms
memory: 17440kb
input:
2 10000 1 10000 1 10000 1 10000 1 10000 1 10000 1 10000 1 10000 1 10000 1 10000 1 10000 1 10000 1 10000 1 10000 1 10000 1 10000 1 10000 1 10000 1 10000 1 10000 1 10000 1 10000 1 10000 1 10000 1 10000 1 10000 1 10000 1 10000 1 10000 1 10000 1 10000 1 10000 1 10000 1 10000 1 10000 1 10000 1 10000 1 10...
output:
500000000
result:
ok single line: '500000000'
Test #5:
score: 0
Accepted
time: 19ms
memory: 3356kb
input:
9717 14907 2 6953 2 10004 2 10949 2 11766 2 14015 2 5640 2 10370 2 6432 2 7602 2 10238 2 9755 2 5788 2 10885 2 11858 2 9182 2 14174 0 12614 0 12080 1 12497 0 7708 2 9108 1 14948 0 9107 1 13540 0 7400 2 6303 2 14462 1 8021 0 7659 1 7232 0 14314 2 9495 1 8459 0 13069 1 5777 0 12734 2 7061 2 12810 2 13...
output:
105756
result:
ok single line: '105756'
Test #6:
score: 0
Accepted
time: 16ms
memory: 3496kb
input:
39375 7550 2 13825 2 11034 2 7836 2 11683 2 9571 2 13888 2 11680 2 5713 2 13175 2 11057 2 7849 2 5598 2 9557 2 7974 2 13285 2 8251 0 13513 0 6254 1 11361 0 13651 2 6286 1 10397 0 5450 1 9590 0 12571 2 7519 2 5512 1 5430 0 9148 1 5281 0 6991 2 6310 1 12868 0 13487 1 6045 0 12298 2 10198 2 11601 2 127...
output:
29976
result:
ok single line: '29976'
Test #7:
score: -100
Wrong Answer
time: 12ms
memory: 3416kb
input:
874898 10304 7 7634 3 7362 9 7960 8 12298 2 5668 1 11762 4 14379 4 6126 1 8135 0 12246 1 13096 0 10376 1 14935 0 9311 0 6256 5 14752 1 12903 0 9645 1 5986 0 14329 0 8683 0 6501 0 6337 1 14416 5 11161 1 10643 0 8900 0 13527 0 9644 0 11961 0 13251 4 9559 1 5799 0 7021 1 13442 0 12589 0 8301 0 5765 7 1...
output:
2016
result:
wrong answer 1st lines differ - expected: '2116', found: '2016'