QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#877828#9911. 路南柯Chenly61.748738 12ms3968kbC++141.0kb2025-02-01 10:00:262025-02-01 10:00:26

Judging History

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

  • [2025-02-01 10:00:26]
  • 评测
  • 测评结果：61.748738
  • 用时：12ms
  • 内存：3968kb
查看
  • [2025-02-01 10:00:26]
  • 提交

answer

// #define NDEBUG
#include<bits/stdc++.h>
#define For(i,j,k) for(int i=(j);i<=(k);i++)
#define ForD(i,j,k) for(int i=(j);i>=(k);i--)
#define int long long
#define endl '\n'
using namespace std;
bool Mbe;
const int N=105;
vector<int> E[N];
#define pb push_back
int tot,tim,ans[N][N];
void dfs(int u,int fa){
    ans[tot][++tim]=u;
    for(int v:E[u]) if(v!=fa) dfs(v,u);
}
void solve(){
    int n; cin>>n; tot=0;
    For(i,1,n) E[i].clear();
    For(i,1,n-1){
        int u,v; cin>>u>>v;
        E[u].pb(v),E[v].pb(u);
    }
    For(i,1,n) if(E[i].size()==1){
        ++tot; tim=0;
        dfs(i,0);
    }
    cout<<tot<<endl;
    For(i,1,tot){
        ForD(j,n,1) cout<<ans[i][j]<<' ';
        cout<<endl;
    }
}
bool Med;
signed main(){
    fprintf(stderr,"%.3lf MB\n",(&Mbe-&Med)/1048576.0);
    // freopen("1.in","r",stdin), freopen("1.out","w",stdout);
    ios::sync_with_stdio(false); cin.tie(0),cout.tie(0);
    int _=1;
    cin>>_;
    while(_--) solve();
    cerr<<1e3*clock()/CLOCKS_PER_SEC<<" ms\n";
    return 0;
}
Source code, Language: C++14

Details

Tip: Click on the bar to expand more detailed information

Subtask #1:

score: 18.7173
Acceptable Answer

Test #1:

score: 18.7173
Acceptable Answer
time: 1ms
memory: 3968kb

input:

10
10
4 2
5 1
8 6
1 9
3 7
1 8
10 2
6 4
3 4
10
4 3
3 1
5 3
6 3
2 3
8 7
8 2
7 10
8 9
10
5 4
10 8
10 3
6 3
9 8
1 10
4 2
2 7
8 4
10
10 6
6 8
1 7
2 6
3 5
3 9
4 2
6 9
3 1
10
2 8
10 4
9 1
9 3
5 7
6 3
1 8
8 7
4 2
10
9 2
9 1
7 1
5 6
8 2
3 9
5 10
5 4
1 10
10
2 9
8 1
8 5
6 3
7 1
6 2
9 8
2 10
4 2
10
5 7
6 2
8 7...

output:

4
7 3 10 2 4 6 8 9 1 5 
9 5 1 8 6 10 2 4 3 7 
7 3 10 2 4 6 8 5 1 9 
7 3 9 5 1 8 6 4 2 10 
6
9 10 7 8 2 6 5 4 3 1 
9 10 7 8 2 6 5 1 3 4 
9 10 7 8 2 6 1 4 3 5 
9 10 7 8 2 5 1 4 3 6 
6 5 1 4 3 2 10 7 8 9 
9 6 5 1 4 3 2 8 7 10 
5
6 3 7 2 5 4 9 8 10 1 
9 1 6 3 10 8 7 2 4 5 
1 7 2 5 4 9 8 10 3 6 
9 1 6 3 ...

result:

points 0.935865781 Partial correct.

Subtask #2:

score: 43.0314
Acceptable Answer

Test #2:

score: 43.0314
Acceptable Answer
time: 12ms
memory: 3968kb

input:

100
100
90 19
79 98
23 34
50 41
31 52
61 19
50 30
49 5
95 65
22 44
72 89
49 77
27 7
48 2
28 25
56 12
97 63
98 43
10 4
50 33
12 13
54 16
100 43
23 69
53 5
56 85
39 6
64 92
100 59
2 71
44 29
59 97
64 39
75 53
59 89
16 35
67 16
6 43
38 51
36 22
58 70
3 29
9 61
99 11
49 95
27 72
73 89
23 3
14 3
61 57
26...

output:

38
18 86 8 58 70 83 81 21 14 60 80 87 15 42 82 57 9 61 19 90 62 63 97 78 67 31 52 71 2 48 54 16 35 93 24 66 20 26 91 76 88 40 37 84 92 64 39 6 47 45 79 98 43 100 59 7 27 72 89 73 69 34 23 3 68 10 4 75 53 51 38 65 95 94 28 25 77 49 5 17 36 22 44 29 33 41 50 30 46 55 99 11 32 74 96 85 56 12 13 1 
60 8...

result:

points 0.5378927802 Partial correct.
English 繁體中文 简体中文

Server Time: 2025-02-01 15:52:33 | OpenSource Project