QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#186070#6634. Central SubsetPERAPROWA 0ms3680kbC++141.4kb2023-09-23 05:33:152023-09-23 05:33:15

Judging History

你现在查看的是最新测评结果

  • [2023-09-23 05:33:15]
  • 评测
  • 测评结果:WA
  • 用时:0ms
  • 内存:3680kb
  • [2023-09-23 05:33:15]
  • 提交

answer

#include <bits/stdc++.h>
#include <ios>
#define ll long long int
#define ii pair<int, int>
#define ff first
#define ss second
#define vi vector<ll>
#define lli long long
#define vii vector<ii>
#define pb push_back
#define fast_io                                                                \
  ios_base::sync_with_stdio(0);                                                \
  cin.tie(0);                                                                  \
  cout.tie(0);
using namespace std;

const int N = 2e5;
const ll MOD = 1e9 + 7;
const int oo = 1e9 + 7;
vi dis;
vector<bool> vis;
vector<vi> g;
int k;
vi ans;

int dfs(int s) {
  vis[s] = 1;
  int mxDis = 1;
  for (int veci : g[s]) {
    if (vis[veci])
      continue;
    mxDis = max(1 + dfs(veci), mxDis);
  }
  if (mxDis == k + 1) {
    ans.pb(s);
    mxDis = 0;
  }
  return mxDis;
}

int main() {
  int tc;
  cin >> tc;
  while (tc--) {
    int n, m;
    cin >> n >> m;
    g.clear();
    g.resize(n);
    k = sqrt(n);
    if (k * k != n)
      k++;
    for (int i = 0; i < m; i++) {
      int u, v;
      cin >> u >> v;
      u--;
      v--;
      g[u].pb(v);
      g[v].pb(u);
    }
    vis.assign(n, false);
    ans.resize(0);
    dfs(0);
    if (ans.size() < k)
      ans.pb(0);
    cout << ans.size() << endl;
    for (int i : ans) {
      cout << i + 1 << " ";
    }
    cout << endl;
  }
  return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 0
Wrong Answer
time: 0ms
memory: 3680kb

input:

2
4 3
1 2
2 3
3 4
6 7
1 2
2 3
3 1
1 4
4 5
5 6
6 4

output:

2
2 1 
2
1 1 

result:

wrong answer Condition failed: "subset.size() == sz" (test case 2)