QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#412991 | #5252. Deforestation | Liberty12619# | WA | 10ms | 4020kb | C++20 | 887b | 2024-05-16 23:17:22 | 2024-05-16 23:17:22 |
Judging History
answer
#include <bits/stdc++.h>
#define x first
#define y second
#define int long long
using namespace std;
typedef pair<int,int> PII;
const int N = 1e6+10,mod = 998244353,INF=1e12,cap = 20210926;
int W,ans;
int dfs()
{
int x,y;
cin>>x>>y;
vector<int>nums(y+1,0);
for(int i=1;i<=y;i++) nums[i]=dfs();
int res=0;
for(int i=1;i<=y;i++)
{
if(res+nums[i]>W)
{
ans++;
res=0;
}
res+=nums[i];
}
res+=x;
ans+=res/W;
return res%W;
}
void solve()
{
cin>>W;
int res = dfs();
if(res) ans++;
cout<<ans<<"\n";
}
signed main()
{
int T=1;
cin.tie(0)->sync_with_stdio(false);
//cin>>T;
//init();
while(T--)
{
solve();
}
return 0;
}
/*
5
2 3
2 2
1 0
1 0
6 0
4 2
3 0
2 0
7
5 2
7 0
2 0
*/
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 10ms
memory: 3596kb
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: -100
Wrong Answer
time: 3ms
memory: 4020kb
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:
50000
result:
wrong answer 1st lines differ - expected: '99999', found: '50000'