QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#74008#5252. Deforestationricky0129WA 41ms19004kbC++171023b2023-01-30 09:26:432023-01-30 09:26:46

Judging History

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

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2023-01-30 09:26:46]
  • 评测
  • 测评结果:WA
  • 用时:41ms
  • 内存:19004kb
  • [2023-01-30 09:26:43]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector<int>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define vll vector<ll>
#define FOR(i,n) for(int i=0;i<n;i++)
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define pb push_back
#define f first
#define s second

const int MOD = (int)1e9+7;
ll w;
ll ans = 0;
ll create(){
    ll height,branches; 
    cin>>height>>branches;
    ll remain = 0;
    vll br;
    FOR(i,branches){
        ll x = create();
        if(x)
        br.pb(x);
        remain+=x;
    }
    sort(br.begin(),br.end());
    reverse(br.begin(),br.end());
    while(sz(br) && remain>w){
        ans++; 
        remain-=br.back();
        br.pop_back();
    }
    remain+=height;
    ll k = remain/w;
    ans+=k;
    remain-=k*w;
    return remain;
}

int main()
{
    cin>>w;
    ll x = create();
    if(x)ans++;
    cout<<ans<<endl;
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 36ms
memory: 3372kb

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: 20ms
memory: 4028kb

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: 34ms
memory: 12676kb

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: 41ms
memory: 19004kb

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: -100
Wrong Answer
time: 28ms
memory: 3292kb

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:

111392

result:

wrong answer 1st lines differ - expected: '105756', found: '111392'