QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#74014#5252. Deforestationricky0129WA 53ms8132kbC++171.1kb2023-01-30 09:57:112023-01-30 09:57:14

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:57:14]
  • 评测
  • 测评结果:WA
  • 用时:53ms
  • 内存:8132kb
  • [2023-01-30 09:57:11]
  • 提交

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;
    multiset<ll> br;
    FOR(i,branches){
        ll x = create();
        if(x)
        br.insert(x);
        remain+=x;
    }
    while(sz(br) && remain>w){
        ll rr = w;
        while(true){
           auto it = br.upper_bound(rr);
           if(it==br.begin()) break;
           it--;
           br.erase(it);
           rr-=w;
        }
        remain-=w-rr;
        ans++;
    }
    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;
}

詳細信息

Test #1:

score: 100
Accepted
time: 30ms
memory: 3292kb

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: 53ms
memory: 8132kb

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'