QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#127397#6634. Central Subsetshielder#WA 42ms16840kbC++202.4kb2023-07-19 16:54:412023-07-19 16:54:45

Judging History

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

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2023-07-19 16:54:45]
  • 评测
  • 测评结果：WA
  • 用时：42ms
  • 内存：16840kb
查看
  • [2023-07-19 16:54:41]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
const int N = 2e5+10;
vector<int> v[N], e[N];
int a[N], b[N];
int dis[N], dep[N];
bool vis[N];
vector<int> ans;
int n, m, k;
int x, y;
int in[N];
int ed, mxdis, st;int _tmp;
void bfs(int st){
    mxdis= 0;
    queue<int> q;
    q.push(st);
    dis[st] = 0;
    vis[st] = 1;
    while(!q.empty()){
        int x = q.front();
        q.pop();
        for(auto y : v[x]){
            if(vis[y]) continue;
            vis[y] = 1;
            e[x].push_back(y);
            dis[y] = dis[x] +1;
            q.push(y);
        }
    }
}
int dfs(int x){
    if(e[x].size() == 0){
        dep[x] = 0;
        return 0 ;
    }
    int mx = 0;
    for(auto y : e[x]) mx = max(dfs(y), mx);
    ++mx;
    dep[x]=mx;
    if((mx+k<_tmp)&&(mx == k || mx %(2*k)==0)){
       ans.push_back(x);
    }
    return mx;
}
int dfs_1(int x){
    if(e[x].size() == 0){
        dep[x] = 0;
        return 0 ;
    }
    int mx=0;
    for(auto y : e[x]) mx = max(dfs_1(y), mx);++mx;return mx;
}

bool cmp(int x,int y){
     return in[x] > in[y];
}
int main(){
    int tt;
    cin >> tt;
    while(tt--){
        cin >> n >> m;
        ans.clear();
        k = ceil(sqrt(n));

        for(int i = 1;i <= m;i++){
            cin >>x >> y;
            in[x]++;
            in[y]++;
            v[x].emplace_back(y);
            v[y].emplace_back(x);
        }
        if(n == 1){
            cout << "1\n1\n";
            continue;
        }
        mxdis = 0;
        for(int i = 1;i <= n;i++) 
            if(in[i] > mxdis) st = i,mxdis = in[i];
        bfs(st);//cout << "-----------\n";
        _tmp=dfs_1(st);
        dfs(st);

        // for(int i = 1;i <= n;i++){
        //     if(dis[i]%(2*k) == 0 && dep[i] > (4 * k - 1))
        //         ans.push_back(i);
        // }
        // ans.push_back(st);
        if(ans.size() > k) cout << "-1\n";
        else{
            if(ans.size()==0) ans.push_back(st);
            cout <<ans.size() << "\n";
            for(auto x : ans) cout <<x << " ";
            cout << "\n";
        }
        for(int i = 1;i <= n;i++){
            v[i].clear();
            e[i].clear();
            vis[i] = 0;
            in[i] = 0;
        }
   }
   return 0;
}
/*
16 15
1 2
2 3
3 4
4 5
5 6
6 7
7 8
8 9
9 10
10 11
11 12
12 13
13 14
14 15
15 16
*/
源文件, 语言: C++20

詳細信息

Test #1:

score: 100
Accepted
time: 4ms
memory: 16736kb

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: 42ms
memory: 16840kb

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:

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

result:

wrong answer Condition failed: "getMaxBfsDist(n, subset) <= csqrtn" (test case 1)
English 繁體中文 简体中文

伺服器時間: 2024-12-05 10:37:27 | 開源專案