2015 ACM-ICPC China Shanghai Metropolitan Programming Contest-优快云博客

本文链接：https://blog.youkuaiyun.com/khyuhong/article/details/89791640

该博客记录了HDU 5236 - 5245系列题目的解题情况。其中，A、B、E题由Panelatta解决，F题由reflect解决，J题由reflect和hmfzy解决，C、D、G、H、I题未解决。还提及E题数据较弱，赛中代码有误。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Rank	Solved	A	B	C	D	E	F	G	H	I	J
77/526	5/10	O	O	.	.	O	O	.	.	.	O

O : Solved in contest

Ø : Solved after contest

. : Has not been solved yet

A. Article(HDU 5236)

Solved by Panelatta

B. Base64 (HDU 5237)

Solved by Panelatta

傻逼模拟，乱搞一发即可

C.Calculator (HDU 5238)

Unsolved

D. Doom (HDU 5239)

Unsolved

E. Exam (HDU 5240)

Solved by Panelatta

按考试时间排序，判断能否在第i门课考试前复习完该门课即可
注意本题数据较弱，赛后发现赛中写的代码是fake的 = =
正确代码

#include <bits/stdc++.h>
using namespace std;

const int MAXN = 1e5 + 10;

struct exam {
    int r, e, l;

    bool operator<(const exam& a) const {
        return e < a.e;
    }
};

exam b[MAXN];

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    int t = 0;
    cin >> t;
    for (int kase = 1; kase <= t; kase++) {
        int n = 0;
        cin >> n;

        for (int i = 1; i <= n; i++)
            cin >> b[i].r >> b[i].e >> b[i].l;
        sort(b + 1, b + n + 1);

        int  now  = 0;
        bool flag = true;
        for (int i = 1; i <= n; i++) {
            now += b[i].r;
            if (now > b[i].e) {
                flag = false;
                break;
            } else {
                if (i < n)
                    b[i + 1].r -= (b[i].e - now);
            }
            now = b[i].e + b[i].l;
        }

        cout << "Case #" << kase << ": " << (flag ? "YES" : "NO") << endl;
    }

    return 0;
}