NOI批量评测 - 记录详情

#	状态分数	耗时	内存占用

#1	Accepted 4	105ms	424 KiB
#2	Accepted 4	127ms	436 KiB
#3	Time Exceeded 0	≥5400ms	≥708 KiB
#4	Time Exceeded 0	≥5400ms	≥480 KiB
#5	Time Exceeded 0	≥5401ms	≥508 KiB
#6	Time Exceeded 0	≥5400ms	≥508 KiB
#7	Time Exceeded 0	≥5400ms	≥612 KiB
#8	Time Exceeded 0	≥5400ms	≥648 KiB
#9	Runtime Error 0 Segmentation fault	2ms	580 KiB
#10	Runtime Error 0 Segmentation fault	2ms	660 KiB
#11	Runtime Error 0 Segmentation fault	3ms	532 KiB
#12	Runtime Error 0 Segmentation fault	2ms	580 KiB
#13	Runtime Error 0 Segmentation fault	3ms	660 KiB
#14	Runtime Error 0 Segmentation fault	2ms	660 KiB
#15	Runtime Error 0 Segmentation fault	3ms	660 KiB
#16	Runtime Error 0 Segmentation fault	2ms	660 KiB
#17	Runtime Error 0 Segmentation fault	2ms	660 KiB
#18	Runtime Error 0 Segmentation fault	3ms	660 KiB
#19	Wrong Answer 0 读取到 0，应为 831262838。	19ms	532 KiB
#20	Runtime Error 0 Segmentation fault	2ms	404 KiB
#21	Runtime Error 0 Segmentation fault	2ms	660 KiB
#22	Runtime Error 0 Segmentation fault	2ms	532 KiB
#23	Runtime Error 0 Segmentation fault	2ms	532 KiB
#24	Runtime Error 0 Segmentation fault	2ms	532 KiB
#25	Runtime Error 0 Segmentation fault	2ms	532 KiB

#include <bits/stdc++.h>

using namespace std;

// #define int long long 
// #define x first
// #define y second
#define File(x) freopen(x".in", "r", stdin), freopen(x".out", "w", stdout);

inline void debug() { cerr << '\n'; }
template<typename T, typename ...Args>
inline void debug(const T &x, const Args&... y) { cerr << x << ' ', debug(y...); }
#define DEBUG(x...) cerr << #x << " = ", debug(x)

typedef unsigned long long ULL;
typedef long long LL;
typedef pair<int, int> PII;

constexpr int N = 110, base = 131;
constexpr int INF = 0x3f3f3f3f;

template<typename Type>
inline void read(Type &res)
{
    res = 0;
    int ch = getchar(), flag = 0;
    while (!isdigit(ch)) flag |= ch == '-', ch = getchar();
    while (isdigit(ch)) res = (res << 3) + (res << 1) + (ch ^ 48), ch = getchar();
    res = flag ? -res : res;
}
template<typename Type, typename... Args>
inline void read(Type &res, Args&... y) { read(res), read(y...); }
mt19937_64 rnd(time(NULL));

int c, T, n, m, val[N], ans;
int a[N], temp[N], p[N], idx;
unordered_map<ULL, bool> mp;

inline ULL gethash(int *a, int len)
{
    ULL res = 0;
    for (int i = 0; i < len; i ++)
        res = (res * base) + (ULL)val[a[i]];
    return res;
}

void dfs(int st, int ed)
{
    if (st <= ed)
    {
        ULL res = gethash(a + st, ed - st + 1);
        if (!mp.count(res)) mp[res] = true, ans ++;
        // for (int i = st; i <= ed; i ++) 
        //     cout << a[i] << ' ';
        // cout << '\n';
    }

    for (int i = st, maxn = 0; i <= ed; i ++)
        if (a[i] > maxn && a[i] != 1)
        {
            a[ed + 1] = a[i] - 1;
            dfs(i + 1, ed + 1);
            a[ed + 1] = 0, maxn = a[i];
        }
        else if (a[i] > maxn)
        {
            dfs(i + 1, ed);
            maxn = a[i];
        }
}

void solve()
{
    mp.clear();
    read(n, m), idx = ans = 0;
    for (int i = 1; i <= n; i ++) read(a[i]);

    dfs(1, n);
    cout << ans << '\n';
}

signed main()
{
    File("seal");
    for (int i = 0; i < N; i ++) val[i] = rnd();
    read(c, T);
    while (T --) solve();
    return 0;
}

递交者: JX-050
题目: NOISX2025GFF NOISX2025GFF
比赛: 【官方数据 JX】联合省选 2025 批量测试
语言: C++14(O2, GCC 9.3.0)
代码长度: 2 KiB
递交时间: 2025-3-6 22:57:07
评测时间: 2025-3-7 10:53:29

分数: 8
总耗时: 32687ms
峰值时间: 5401ms
峰值内存: 708 KiB

8 Runtime Error

代码

信息

还没有账户？

登录