求助C++7AC3WA
查看原帖
求助C++7AC3WA
738761
HappyDavid楼主2023/4/2 23:14

最前帖子更新：https://www.luogu.com.cn/paste/dntl1fpu

求助，C++70分，3个WA！

/*
# [COCI 2011/2012 #5] EKO / 砍树

## 题目描述

伐木工人 Mirko 需要砍 $M$ 米长的木材。对 Mirko 来说这是很简单的工作，因为他有一个漂亮的新伐木机，可以如野火一般砍伐森林。不过，Mirko 只被允许砍伐一排树。

Mirko 的伐木机工作流程如下：Mirko 设置一个高度参数 $H$（米），伐木机升起一个巨大的锯片到高度 $H$，并锯掉所有树比 $H$ 高的部分（当然，树木不高于 $H$ 米的部分保持不变）。Mirko 就得到树木被锯下的部分。例如，如果一排树的高度分别为 $20,15,10$ 和 $17$，Mirko 把锯片升到 $15$ 米的高度，切割后树木剩下的高度将是 $15,15,10$ 和 $15$，而 Mirko 将从第 $1$ 棵树得到 $5$ 米，从第 $4$ 棵树得到 $2$ 米，共得到 $7$ 米木材。

Mirko 非常关注生态保护，所以他不会砍掉过多的木材。这也是他尽可能高地设定伐木机锯片的原因。请帮助 Mirko 找到伐木机锯片的最大的整数高度 $H$，使得他能得到的木材至少为 $M$ 米。换句话说，如果再升高 $1$ 米，他将得不到 $M$ 米木材。

## 输入格式

第 $1$ 行 $2$ 个整数 $N$ 和 $M$，$N$ 表示树木的数量，$M$ 表示需要的木材总长度。

第 $2$ 行 $N$ 个整数表示每棵树的高度。

## 输出格式

$1$ 个整数，表示锯片的最高高度。

## 样例 #1

### 样例输入 #1

` `  `
4 7
20 15 10 17
`   `    `

### 样例输出 #1

`     `      `
15
`       `        `

## 样例 #2

### 样例输入 #2

`        `          `
5 20
4 42 40 26 46
`           `            `

### 样例输出 #2

`             `              `
36
`               `                `

## 提示

对于 $100\%$ 的测试数据，$1\le N\le10^6$，$1\le M\le2\times10^9$，树的高度 $<10^9$，所有树的高度总和 $>M$。
*/
#include <iostream>
#include <cmath>
using namespace std;
const bool integer_is_not_enough = true;
#if integer_is_not_enough
    #define int long long
#endif
#define forIinN for(int i = 1; i <= n; i++)
#define BC Binary_Search
#define bc BC
#define MAX_INT 2147483647
#define mid M
#define ans answer
int n, m, th[1000010]; // n=4 m=7 th={0,20,15,10,17}
bool check(int h)
{
    int have = 0;
    forIinN
    {
        if(th[i] > h)
        {
            have += th[i] - h;
        }
    }
    return (have >= m);
}
int Binary_Search(int R) // R=20
{
    int L = 1, answer = MAX_INT; // L=11 answer=10
    while (L <= R)
    {
        int M = (L + R) / 2; // M=10
        if (check(M))
        {
            L = mid + 1;
            ans = mid;
        }
        else
        {
            R = mid - 1;
        }
    }
    return ans;
}
int main()
{
    cin >> n >> m;
    int temp = -MAX_INT; // temp=20
    forIinN
    {
        cin >> th[i];
        temp = max(temp, th[i]); // r = r > a[i] ? r : a[i]
    }
    cout << bc(temp) << endl;
    return 0;
}
/*
// Record -> 106815766; Date->2023-04-02; Time->22:59:06; Score->70; Status->Unaccepted; Language->C++14(GCC9); Code->6.57KB; Time->582ms; Memory->4.12MB
// CheckPoint->#1; Time->3ms; Memory->688.00KB; Result ---> Accepted, 得分 10.ok accepted
// CheckPoint->#2; Time->175ms; Memory->3.26MB; Result ---> Accepted, 得分 10.ok accepted
// CheckPoint->#3; Time->182ms; Memory->4.12MB; Result ---> Wrong Answer.wrong answer On line 1 column 1, read 2, expected 7.
// CheckPoint->#4; Time->3ms; Memory->684.00KB; Result ---> Accepted, 得分 10.ok accepted
// CheckPoint->#5; Time->3ms; Memory->684.00KB; Result ---> Accepted, 得分 10.ok accepted
// CheckPoint->#6; Time->5ms; Memory->684.00KB; Result ---> Accepted, 得分 10.ok accepted
// CheckPoint->#7; Time->11ms; Memory->688.00KB; Result ---> Accepted, 得分 10.ok accepted
// CheckPoint->#8; Time->29ms; Memory->692.00KB; Result ---> Accepted, 得分 10.ok accepted
// CheckPoint->#9; Time->62ms; Memory->1.54MB; Result ---> Wrong Answer.wrong answer On line 1 column 1, read 2, expected 4.
// CheckPoint->#10; Time->109ms; Memory->2.52MB; Result ---> Wrong Answer.wrong answer On line 1 column 1, read 2, expected 1.
#include <iostream>
#include <cmath>
using namespace std;
const bool integer_is_not_enough = true;
#if integer_is_not_enough
    #define int long long
#endif
#define forIinN for(int i = 1; i <= n; i++)
#define BC Binary_Search
#define bc BC
#define MAX_INT 2147483647
#define mid M
#define ans answer
int n, m, th[1000010]; // n=4 m=7 th={0,20,15,10,17}
bool check(int h)
{
    int have = 0;
    forIinN
    {
        if(th[i] > h)
        {
            have += th[i] - h;
        }
    }
    return (have >= m);
}
int Binary_Search(int R) // R=20
{
    int L = 1, answer = MAX_INT; // L=11 answer=10
    while (L <= R)
    {
        int M = (L + R) / 2; // M=10
        if (check(M))
        {
            L = mid + 1;
            ans = mid;
        }
        else
        {
            R = mid - 1;
        }
    }
    return ans;
}
int main()
{
    cin >> n >> m;
    int temp = -MAX_INT; // temp=20
    forIinN
    {
        cin >> th[i];
        temp = max(temp, th[i]); // r = r > a[i] ? r : a[i]
    }
    cout << bc(temp) << endl;
    return 0;
}
*/
/*
// Record -> 106812931; Date->2023-04-02; Time->22:21:04; Score->70; Status->Unaccepted; Language->C++14(GCC9); Code->4.34KB; Time->585ms; Memory->4.12MB
// CheckPoint->#1; Time->3ms; Memory->684.00KB; Result ---> Accepted, 得分 10.ok accepted
// CheckPoint->#2; Time->176ms; Memory->3.18MB; Result ---> Accepted, 得分 10.ok accepted
// CheckPoint->#3; Time->182ms; Memory->4.12MB; Result ---> Wrong Answer.wrong answer On line 1 column 1, read 2, expected 7.
// CheckPoint->#4; Time->3ms; Memory->684.00KB; Result ---> Accepted, 得分 10.ok accepted
// CheckPoint->#5; Time->4ms; Memory->684.00KB; Result ---> Accepted, 得分 10.ok accepted
// CheckPoint->#6; Time->5ms; Memory->808.00KB; Result ---> Accepted, 得分 10.ok accepted
// CheckPoint->#7; Time->12ms; Memory->808.00KB; Result ---> Accepted, 得分 10.ok accepted
// CheckPoint->#8; Time->29ms; Memory->852.00KB; Result ---> Accepted, 得分 10.ok accepted
// CheckPoint->#9; Time->62ms; Memory->1.47MB; Result ---> Wrong Answer.wrong answer On line 1 column 1, read 2, expected 4.
// CheckPoint->#10; Time->109ms; Memory->2.46MB; Result ---> Wrong Answer.wrong answer On line 1 column 1, read 2, expected 1.
#include <iostream>
#include <cmath>
using namespace std;
bool integer_is_not_enough = false;
#if integer_is_not_enough
    #define int long long
#endif
#define forIinN for(int i = 1; i <= n; i++)
#define BC Binary_Search
#define bc BC
#define MAX_INT 2147483647
#define mid M
#define ans answer
int n, m, th[1000001]; // n=4 m=7 th={0,20,15,10,17}
bool check(int h)
{
    int have = 0;
    forIinN
    {
        if(th[i] > h)
        {
            have += th[i] - h;
        }
    }
    return (have >= m);
}
int Binary_Search(int R) // R=20
{
    int L = 1, answer = MAX_INT; // L=11 answer=10
    while (L <= R)
    {
        int M = (L + R) / 2; // M=10
        if (check(M))
        {
            L = mid + 1;
            ans = mid;
        }
        else
        {
            R = mid - 1;
        }
    }
    return ans;
}
int main()
{
    cin >> n >> m;
    int temp = -MAX_INT; // temp=20
    forIinN
    {
        cin >> th[i];
        temp = max(temp, th[i]);
    }
    cout << bc(temp) << endl;
    return 0;
}
*/
/*
// Record -> 106806025; Date->2023-04-02; Time->21:18:43; Score->70; Status->Unaccepted; Language->C++14(GCC9); Code->2.15KB; Time->585ms; Memory->4.21MB
// CheckPoint->#1; Time->3ms; Memory->684.00KB; Result ---> Accepted, 得分 10.ok accepted
// CheckPoint->#2; Time->175ms; Memory->3.17MB; Result ---> Accepted, 得分 10.ok accepted
// CheckPoint->#3; Time->184ms; Memory->4.21MB; Result ---> Wrong Answer.wrong answer On line 1 column 1, read 2, expected 7.
// CheckPoint->#4; Time->3ms; Memory->808.00KB; Result ---> Accepted, 得分 10.ok accepted
// CheckPoint->#5; Time->4ms; Memory->808.00KB; Result ---> Accepted, 得分 10.ok accepted
// CheckPoint->#6; Time->5ms; Memory->808.00KB; Result ---> Accepted, 得分 10.ok accepted
// CheckPoint->#7; Time->11ms; Memory->736.00KB; Result ---> Accepted, 得分 10.ok accepted
// CheckPoint->#8; Time->29ms; Memory->728.00KB; Result ---> Accepted, 得分 10.ok accepted
// CheckPoint->#9; Time->62ms; Memory->1.51MB; Result ---> Wrong Answer.wrong answer On line 1 column 1, read 2, expected 4.
// CheckPoint->#10; Time->109ms; Memory->2.46MB; Result ---> Wrong Answer.wrong answer On line 1 column 1, read 2, expected 1.
#include <iostream>
#include <cmath>
using namespace std;
bool integer_is_not_enough = false;
#if integer_is_not_enough
    #define int long long
#endif
#define forIinN for(int i = 1; i <= n; i++)
#define BC Binary_Search
#define bc BC
#define MAX_INT 2147483647
#define mid M
#define ans answer
int n, m, th[1000001]; // n=4 m=7 th={0,20,15,10,17}
bool check(int h)
{
    int have = 0;
    // cout << "73 - h = " << h << endl;
    forIinN
    {
        if(th[i] >= h)
        {
            have += th[i] - h;
        }
        // cout << "77 - have = " << have << endl;
//         if (have < 0)
//         {
//             return false;
//         }
    }
    return (have >= m);
}
int Binary_Search(int R) // R=20
{
    int L = 1, answer = MAX_INT; // L=11 answer=10
    while (L <= R)
    {
        int M = (L + R) / 2; // M=10
        if (check(M))
        {
            L = mid + 1;
            ans = mid;
        }
        else
        {
            R = mid - 1;
        }
    }
    return ans;
}
int main()
{
    cin >> n >> m;
    int temp = -MAX_INT; // temp=20
    forIinN
    {
        cin >> th[i];
        temp = max(temp, th[i]);
    }
    cout << bc(temp) << endl;
    return 0;
}
*/
2023/4/2 23:14