QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#186069#6634. Central SubsetPERAPROWA 40ms3636kbC++141.4kb2023-09-23 05:29:222023-09-23 05:29:23

Judging History

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

  • [2023-09-23 05:29:23]
  • 评测
  • 测评结果:WA
  • 用时:40ms
  • 内存:3636kb
  • [2023-09-23 05:29:22]
  • 提交

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);
    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: 100
Accepted
time: 0ms
memory: 3600kb

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:

1
2 
1
1 

result:

ok correct (2 test cases)

Test #2:

score: -100
Wrong Answer
time: 40ms
memory: 3636kb

input:

10000
15 14
13 12
5 4
9 8
11 12
15 14
10 9
14 13
2 3
2 1
6 5
10 11
3 4
7 6
8 7
6 5
2 1
2 4
4 6
2 3
3 5
10 9
8 3
9 4
5 6
5 10
3 2
5 4
2 7
1 2
4 3
2 1
2 1
2 1
2 1
9 8
9 8
5 4
1 2
6 5
3 4
3 2
7 8
7 6
2 1
1 2
14 13
3 10
5 6
2 9
11 4
2 3
2 1
8 7
13 6
5 4
5 12
6 7
4 3
7 14
16 15
2 3
2 1
6 10
6 9
6 4
9 11
...

output:

3
11 6 1 
1
1 
1
2 
0

0

2
6 2 
0

1
4 
2
10 3 
0

3
15 9 3 
1
3 
1
2 
1
5 
0

3
11 6 1 
1
1 
0

1
2 
0

1
2 
1
3 
1
4 
2
5 1 
0

3
11 6 1 
1
1 
2
5 1 
1
1 
0

3
16 10 4 
1
2 
1
4 
2
7 4 
0

1
3 
1
2 
1
3 
3
7 6 1 
0

2
8 3 
1
1 
1
3 
1
2 
0

2
6 1 
1
3 
1
3 
2
5 1 
0

3
13 7 1 
1
1 
1
3 
1
4 
0

3...

result:

wrong answer Integer 0 violates the range [1, 2] (test case 4)