QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#135175#6634. Central Subsetwtn135687#WA 74ms28696kbC++141.0kb2023-08-05 12:27:162023-08-05 12:27:21

Judging History

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

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2023-08-05 12:27:21]
  • 评测
  • 测评结果:WA
  • 用时:74ms
  • 内存:28696kb
  • [2023-08-05 12:27:16]
  • 提交

answer

#include<bits/stdc++.h>
#define pll pair<ll, ll>
using namespace std;
typedef long long ll;
#define int ll

const int N = 2e5+10;
const int M = 1e6 + 7;

int n, m, fa[N], mx;
vector<ll> edge[N], ans;
bool vis[N];
void init(){
    for (int i = 0; i <= n; i++)fa[i] = i, edge[i].clear(),vis[i]=0;
    ans.clear();
    mx = sqrt(n);
    if (mx * mx < n)mx++;
}

int dfs(int u,int dis){
    if(dis>mx){
        ans.push_back(u);
        dis=0;
    }
    for(int v:edge[u]){
        if(vis[v])continue;
        vis[v]=1;
        dis=min(dfs(v,dis+1),dis);
    }
    return dis+1;
}




inline void solve(){
    cin >> n >> m;
    init();

    for (int i = 1, u, v; i <= m; i++){
        cin >> u >> v;
        edge[u].push_back(v);
        edge[v].push_back(u);
    }
    ans.push_back(1);
    dfs(1,0);
    cout<<ans.size()<<"\n";for(int i:ans)cout<<i<<" ";cout<<"\n";
}



signed main(){
    ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
    int WTN666=1;cin>>WTN666;
    while(WTN666--){
        solve();
    }
}

詳細信息

Test #1:

score: 100
Accepted
time: 1ms
memory: 9692kb

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
1 4 
2
1 5 

result:

ok correct (2 test cases)

Test #2:

score: 0
Accepted
time: 10ms
memory: 8612kb

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
1 6 11 
1
1 
2
1 6 
1
1 
1
1 
3
1 5 9 
1
1 
2
1 6 
2
1 10 
1
1 
4
1 7 13 19 
2
1 6 
2
1 10 
2
1 13 
1
1 
3
1 6 11 
1
1 
1
1 
2
1 9 
1
1 
2
1 4 
2
1 6 
2
1 6 
2
1 13 
1
1 
3
1 6 11 
1
1 
2
1 6 
1
1 
1
1 
4
1 7 13 19 
3
1 11 13 
2
1 6 
3
1 11 12 
1
1 
2
1 5 
3
1 6 7 
2
1 6 
3
1 10 14 
1
1 
3
1 6 11 ...

result:

ok correct (10000 test cases)

Test #3:

score: 0
Accepted
time: 18ms
memory: 8564kb

input:

100
2000 1999
529 528
885 884
1221 1222
375 374
245 244
758 757
711 710
1521 1522
1875 1874
749 750
823 822
1959 1958
1767 1766
155 154
631 632
825 824
1330 1331
457 456
1344 1343
1817 1818
413 414
582 583
1828 1827
1335 1336
654 655
162 161
1668 1667
1966 1967
1472 1471
1185 1184
518 517
1509 1510
...

output:

44
1 47 93 139 185 231 277 323 369 415 461 507 553 599 645 691 737 783 829 875 921 967 1013 1059 1105 1151 1197 1243 1289 1335 1381 1427 1473 1519 1565 1611 1657 1703 1749 1795 1841 1887 1933 1979 
1
1 
23
1 47 1092 137 183 1228 273 319 1364 409 455 1500 545 1590 1634 1678 723 1768 813 859 905 951 9...

result:

ok correct (100 test cases)

Test #4:

score: 0
Accepted
time: 18ms
memory: 10164kb

input:

10
14914 14913
13959 13958
3643 3642
4582 4581
13378 13379
981 980
12901 12902
12355 12356
14692 14691
9670 9669
14632 14631
1441 1440
1367 1368
6237 6238
8297 8298
1021 1020
5096 5097
4773 4774
7778 7779
3013 3014
5536 5535
11621 11620
13904 13903
3050 3049
14179 14178
7471 7472
13380 13381
7403 74...

output:

121
1 125 249 373 497 621 745 869 993 1117 1241 1365 1489 1613 1737 1861 1985 2109 2233 2357 2481 2605 2729 2853 2977 3101 3225 3349 3473 3597 3721 3845 3969 4093 4217 4341 4465 4589 4713 4837 4961 5085 5209 5333 5457 5581 5705 5829 5953 6077 6201 6325 6449 6573 6697 6821 6945 7069 7193 7317 7441 75...

result:

ok correct (10 test cases)

Test #5:

score: 0
Accepted
time: 30ms
memory: 9548kb

input:

10
20000 19999
6831 6760
15763 15900
10362 10184
5821 5880
17555 17389
16708 16574
11592 11436
186 209
19380 19313
8867 8718
12100 12237
16245 16110
18464 18568
4713 4665
17412 17578
18666 18750
4360 4322
12350 12502
4054 4103
2874 2849
8097 8202
14489 14639
1056 1016
13500 13581
2435 2391
199 173
8...

output:

6
1 4027 15759 16722 15745 4014 
9
1 9171 9184 18169 18123 19879 14324 9164 9159 
7
1 5363 6776 6552 13220 14811 14785 
5
1 4127 15038 16066 14485 
8
1 8448 8715 15078 19952 8424 14542 19333 
7
1 7984 11988 13362 8097 17207 16494 
7
1 7050 7061 7093 14155 14203 18939 
8
1 5804 17984 17993 13752 5878...

result:

ok correct (10 test cases)

Test #6:

score: 0
Accepted
time: 48ms
memory: 28696kb

input:

1
200000 199999
136649 136648
44943 44944
7148 7149
50332 50333
149967 149966
28976 28975
78549 78550
178698 178697
96434 96433
7859 7858
88976 88977
23348 23347
161682 161681
125393 125392
67892 67893
73592 73593
179054 179055
110841 110842
163714 163715
7982 7981
56309 56310
196486 196485
19176 19...

output:

446
1 450 899 1348 1797 2246 2695 3144 3593 4042 4491 4940 5389 5838 6287 6736 7185 7634 8083 8532 8981 9430 9879 10328 10777 11226 11675 12124 12573 13022 13471 13920 14369 14818 15267 15716 16165 16614 17063 17512 17961 18410 18859 19308 19757 20206 20655 21104 21553 22002 22451 22900 23349 23798 ...

result:

ok correct (1 test case)

Test #7:

score: 0
Accepted
time: 57ms
memory: 24776kb

input:

1
200000 199999
58280 58281
132016 32016
45157 45158
35446 35445
158979 58979
185831 85831
74289 174289
195645 95645
31857 131857
168766 68766
95607 95606
39817 39818
58215 158215
74893 74894
18897 118897
63013 163013
58501 58502
94475 194475
77574 77573
152977 52977
3731 103731
20407 20408
186570 8...

output:

224
1 450 100898 1346 1795 2244 102692 103139 3587 4036 4485 4934 5383 5832 6281 106729 7177 107625 108072 8520 8969 9418 109866 110313 110760 11208 11657 112105 112552 13000 113448 13896 14345 114793 15241 115689 116136 16584 17033 17482 117930 18378 118826 19274 119722 120169 120616 21064 121512 2...

result:

ok correct (1 test case)

Test #8:

score: 0
Accepted
time: 74ms
memory: 17288kb

input:

1
200000 199999
84088 84001
74829 74679
40726 41179
113019 113238
112813 113025
77336 77177
60908 61208
4521 4639
144249 144094
102763 102692
112856 113070
2428 2356
114005 113754
168454 168270
114538 114311
36802 36341
170182 170306
31641 32012
92503 92395
143570 143702
6871 6715
51503 51997
140883...

output:

8
1 86647 110748 151202 172839 129376 175544 199270 

result:

ok correct (1 test case)

Test #9:

score: -100
Wrong Answer
time: 6ms
memory: 9644kb

input:

1000
11 19
8 11
4 11
2 11
2 3
8 3
6 1
6 4
11 5
5 3
10 8
7 10
4 7
3 9
5 1
5 7
3 6
10 1
11 7
2 9
70 109
32 69
26 15
65 46
70 62
50 23
17 16
15 31
2 23
18 11
48 57
19 29
52 42
26 31
7 1
53 66
5 69
58 20
59 38
3 4
9 53
7 56
52 66
66 28
22 51
2 6
22 35
5 28
25 51
27 13
26 56
10 50
53 56
60 48
67 33
61 23...

output:

2
1 8 
6
1 32 27 61 70 33 
3
1 11 13 
6
1 32 14 37 71 39 
6
1 3 31 47 1 41 
4
1 10 12 6 
5
1 24 20 18 19 
5
1 33 21 23 22 
4
1 81 21 19 
7
1 81 41 70 27 7 63 
3
1 13 21 
6
1 15 68 17 33 69 
2
1 3 
5
1 10 17 41 1 
4
1 20 43 23 
2
1 12 
2
1 8 
2
1 4 
6
1 38 8 46 11 26 
6
1 46 19 51 45 43 
4
1 19 18 22...

result:

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