NOI批量评测 - 记录详情

foo.cc: In function 'bool solve1::solve()':
foo.cc:18:19: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   18 |             auto &[a, b, t] = s[p];
      |                   ^
foo.cc: In function 'bool solve2::solve()':
foo.cc:61:19: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   61 |             auto &[a, b, t] = s[p];
      |                   ^
Expand

#	状态分数	耗时	内存占用

#1	Accepted 4	1ms	404 KiB
#2	Accepted 4	1ms	404 KiB
#3	Wrong Answer 0 读取到 Yes，应为 No。	1ms	404 KiB
#4	Accepted 4	2ms	404 KiB
#5	Accepted 4	2ms	408 KiB
#6	Wrong Answer 0 Standard answer longer than user output.	2ms	408 KiB
#7	Wrong Answer 0 Standard answer longer than user output.	2ms	404 KiB
#8	Accepted 4	5ms	532 KiB
#9	Accepted 4	6ms	532 KiB
#10	Wrong Answer 0 Standard answer longer than user output.	15ms	532 KiB
#11	Wrong Answer 0 读取到 Yes，应为 No。	16ms	532 KiB
#12	Wrong Answer 0 Standard answer longer than user output.	96ms	4.2 MiB
#13	Wrong Answer 0 Standard answer longer than user output.	122ms	4.6 MiB
#14	Wrong Answer 0 读取到 No，应为 Yes。	107ms	4.6 MiB
#15	Wrong Answer 0 Standard answer longer than user output.	103ms	4.6 MiB
#16	Wrong Answer 0 Standard answer longer than user output.	100ms	3.4 MiB
#17	Wrong Answer 0 Standard answer longer than user output.	100ms	3.4 MiB
#18	Wrong Answer 0 读取到 No，应为 Yes。	102ms	4.7 MiB
#19	Wrong Answer 0 读取到 No，应为 Yes。	363ms	11.1 MiB
#20	Wrong Answer 0 读取到 No，应为 Yes。	356ms	11.1 MiB
#21	Wrong Answer 0 Standard answer longer than user output.	298ms	11.1 MiB
#22	Wrong Answer 0 Standard answer longer than user output.	307ms	11.1 MiB
#23	Wrong Answer 0 读取到 No，应为 Yes。	293ms	7.9 MiB
#24	Wrong Answer 0 Standard answer longer than user output.	302ms	11.1 MiB
#25	Wrong Answer 0 Standard answer longer than user output.	297ms	8.1 MiB

#include <bits/stdc++.h>
#define int long long
using namespace std;
namespace solve1
{
    constexpr int N = 2e5 + 5;
    int n, id[N];
    struct Node { int a, b, t; } s[N];
    bool cmp(int x, int y) { return s[x].t < s[y].t; }
    bool solve()
    {
        cin >> n;
        for (int i = 1; i <= n; i++) { cin >> s[i].a >> s[i].b >> s[i].t; id[i] = i; }
        sort(id + 1, id + 1 + n, cmp);
        for (int pos = 1, now = 0; pos <= n; pos++)
        {
            int p = id[pos];
            auto &[a, b, t] = s[p];
            if (a < b)
            {
                now += b - a; a = b;
                for (int i = p + 1; i <= n && s[i].a < b + i - p; i++)
                {
                    now += b + i - p - s[i].a;
                    s[i].a = b + i - p;
                }
            }
            else if (a > b)
            {
                now += a - b; a = b;
                for (int i = p - 1; i >= 1 && s[i].a > b - i + p; i--)
                {
                    now += s[i].a - (b - i + p);
                    s[i].a = b - i + p;
                }
            }
            if (now > t) return false;
        }
        return true;
    }
}
namespace solve2
{
    constexpr int N = 2e5 + 5;
    int n, id[N], f[N];
    struct Node { int a, b, t; } s[N];
    bool cmp(int x, int y) { return s[x].t < s[y].t; }
    int find(int x) { return f[x] == x ? x : f[x] = find(f[x]); }
    bool solve()
    {
        cin >> n;
        for (int i = 1; i <= n; i++) { cin >> s[i].a >> s[i].b >> s[i].t; id[i] = i; }
        sort(id + 1, id + 1 + n, cmp);

        for (int i = 1; i <= n; i++) f[i] = i;

        for (int pos = 1, now = 0; pos <= n; pos++)
        {
            int p = id[pos];
            int np = find(p);
            auto &[a, b, t] = s[p];
            if (np > p) a = s[np].a - np + p;
            if (np < p) a = s[np].a - p + np;

            if (a < b)
            {
                now += (b - a) * (abs(np - p) + 1);
                a = b;
                for (int i = find(np + 1), las = np; i <= n ; i = find(i + 1))
                {
                    int ne = b + i - p;
                    if (s[i].a >= ne) break;
                    now += (ne - s[i].a) * (abs(i - las) + 1);
                    s[i].a = ne;
                    f[las] = i;
                    las = i;
                }
            }
            else if (a > b)
            {
                now += (a - b) * (abs(np - p) + 1);
                a = b;

                for (int i = find(np - 1), las = np; i >= 1; i = find(i - 1))
                {
                    int ne = b - i + p;
                    if (s[i].a <= ne) break;
                    now += (s[i].a - ne) * (abs(i - las) + 1);
                    s[i].a = ne;
                    f[las] = i;
                    las = i;

                }
            }
            if (now > t) return false;
        }
        return true;
    }
}
signed main()
{
    freopen("move.in", "r", stdin);
    freopen("move.out", "w", stdout);
    cin.tie(nullptr)->sync_with_stdio(false);
    int c, T; cin >> c >> T; 
    if (c<=11) {while (T--) cout << (solve1::solve() ? "Yes\n" : "No\n");}
    else {while (T--) cout << (solve2::solve() ? "Yes\n" : "No\n");}
}

递交者: ZJ-103
题目: NOISX2025GFD NOISX2025GFD
比赛: 【官方数据 ZJ】联合省选 2025 批量测试
语言: C++14(O2, GCC 9.3.0)
代码长度: 3.2 KiB
递交时间: 2025-3-6 19:41:24
评测时间: 2025-3-6 19:45:06

分数: 24
总耗时: 2997ms
峰值时间: 363ms
峰值内存: 11.1 MiB

24 Wrong Answer

代码

信息

还没有账户？

登录