NOI批量评测 - 记录详情

foo.cc: In function 'int main()':
foo.cc:24:16: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   24 |     for (auto &[u, v] : e) std::cin >> u >> v;
      |                ^
foo.cc:31:17: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   31 |       for (auto [u, v] : e) {
      |                 ^
foo.cc:35:17: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   35 |       for (auto [ai, bi] : ne)
      |                 ^
foo.cc:36:19: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   36 |         for (auto [aj, bj] : ne)
      |                   ^
Expand

#	状态分数	耗时	内存占用

#1	Accepted 4	114ms	404 KiB
#2	Accepted 4	151ms	404 KiB
#3	Time Exceeded 0	≥2701ms	≥404 KiB
#4	Time Exceeded 0	≥2700ms	≥404 KiB
#5	Time Exceeded 0	≥2700ms	≥404 KiB
#6	Time Exceeded 0	≥2700ms	≥532 KiB
#7	Time Exceeded 0	≥2700ms	≥404 KiB
#8	Time Exceeded 0	≥2701ms	≥408 KiB
#9	Time Exceeded 0	≥2700ms	≥404 KiB
#10	Time Exceeded 0	≥2701ms	≥404 KiB
#11	Time Exceeded 0	≥2700ms	≥408 KiB
#12	Time Exceeded 0	≥2701ms	≥3 MiB
#13	Time Exceeded 0	≥2700ms	≥3 MiB
#14	Time Exceeded 0	≥2700ms	≥3.1 MiB
#15	Time Exceeded 0	≥2701ms	≥3.1 MiB
#16	Time Exceeded 0	≥2700ms	≥4.4 MiB
#17	Time Exceeded 0	≥2700ms	≥4.4 MiB
#18	Time Exceeded 0	≥2702ms	≥4.3 MiB
#19	Time Exceeded 0	≥2700ms	≥1.4 MiB
#20	Time Exceeded 0	≥2700ms	≥1.3 MiB
#21	Time Exceeded 0	≥2700ms	≥1.3 MiB
#22	Time Exceeded 0	≥2701ms	≥1.3 MiB
#23	Time Exceeded 0	≥2701ms	≥1.4 MiB
#24	Time Exceeded 0	≥2701ms	≥1.3 MiB
#25	Time Exceeded 0	≥2701ms	≥1.4 MiB

#include <bits/stdc++.h>
template <class T>
using V = std::vector<T>;
template <class T>
void chkmax(T &x, const T &y) {
  if (x < y) x = y;
}
template <class T>
void chkmin(T &x, const T &y) {
  if (x > y) x = y;
}
using ll = long long;

int main() {
  std::cin.tie(0)->sync_with_stdio(0);
  freopen("graperm.in", "r", stdin);
  freopen("graperm.out", "w", stdout);
  int c, t;
  std::cin >> c >> t;
  while (t--) {
    int n, m;
    std::cin >> n >> m;
    V<std::pair<int, int>> e(m);
    for (auto &[u, v] : e) std::cin >> u >> v;
    V<int> p(n);
    std::iota(p.begin(), p.end(), 1);
    do {
      V<int> np(n + 1);
      for (int i = 0; i < n; i++) np[p[i]] = i;
      V<std::pair<int, int>> ne;
      for (auto [u, v] : e) {
        ne.push_back(std::minmax(np[u], np[v]));
      }
      bool ok = 1;
      for (auto [ai, bi] : ne)
        for (auto [aj, bj] : ne)
          ok &= !(ai < aj && aj < bi && bi < bj);
      if (ok) {
        for (int i = 0; i < n; i++)
          std::cout << p[i] << " \n"[i == n - 1];
        break;
      } 
    } while (std::next_permutation(p.begin(), p.end()));
  }
}

递交者: HL-S004
题目: NOISX2025GFC NOISX2025GFC
比赛: 【官方数据 HL】联合省选 2025 批量测试
语言: C++14(O2, GCC 9.3.0)
代码长度: 1.1 KiB
递交时间: 2025-3-7 14:30:46
评测时间: 2025-3-7 14:32:24

分数: 8
总耗时: ≥62378ms
峰值时间: ≥2702ms
峰值内存: ≥4.4 MiB

8 Time Exceeded

代码

信息

还没有账户？

登录