QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#201686#7338. Education NightmarekjhhjkiWA 638ms11816kbC++142.0kb2023-10-05 16:07:262023-10-05 16:07:26

Judging History

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

  • [2023-10-05 16:07:26]
  • 评测
  • 测评结果:WA
  • 用时:638ms
  • 内存:11816kb
  • [2023-10-05 16:07:26]
  • 提交

answer

#pragma GCC optimize(2)
#include <bits/stdc++.h>
#define MAXN 200005
#define For(I,A,B) for(int I = (A), endi = (B); I <= endi; ++I)
#define foR(I,A,B) for(int I = (A), endi = (B); I >= endi; --I)
#define ForE(I,A) for(int I = head[A]; I; I = e[I].nxt)
using namespace std;
typedef long long _ll;
typedef unsigned int ui;

struct Edge { int to,nxt; } e[MAXN<<1];
int head[MAXN],tot;
void add_edge(int x,int y) { e[++tot] = (Edge){y,head[x]}; head[x] = tot; }

int T,mx,ans,cnt,dis,n,m,s,u,v,dep[MAXN],pre[MAXN];
bool hasS[MAXN],inS[MAXN];
void dfs(int u, int prev)
{
    pre[u] = prev;
    if(u == s) hasS[u] = 1;
    ForE(i,u)
    {
        int v = e[i].to;
        if(v == prev) continue;
        dep[v] = dep[u] + 1;
        dfs(v,u);
        if(hasS[v]) hasS[u] = 1;
    }
}
void dfs2(int u, int pre)
{
    inS[u] = 1;
    ForE(i,u)
    {
        int v = e[i].to;
        if(v == pre) continue;
        dfs2(v,u);
    }
}
void dfs3(int u, int pre)
{
    ++cnt;
    dis = max(dis,dep[u]);
    ForE(i,u)
    {
        int v = e[i].to;
        if(v == pre) continue;
        dfs3(v,u);
    }
}
void solve()
{
    cin >> n >> s >> m; mx = ans = 0;
    tot = 0; fill(head,head+n+1,0); 
    fill(hasS,hasS+n+1,0); fill(dep,dep+n+1,0); fill(inS,inS+n+1,0);
    For(i,2,n) cin >> u >> v, add_edge(u,v), add_edge(v,u);
    dfs(m,0); 
    ForE(i,m)
        if(hasS[e[i].to]) 
            dfs2(e[i].to,m);
    For(i,1,n) if(!inS[i]) mx = max(mx,dep[s]+dep[i]);
    u = s; ans = mx;
    if(s == m)
    {
        For(i,1,n) ans = max(ans,dep[i]);
        cout << ans << '\n';
        return;
    }
    do
    {
        dis = cnt = 0;
        ForE(i,u)
        {
            int v = e[i].to;
            if(v != pre[u] && !hasS[v]) dfs3(v,u);
        }
        ans = max(ans,min(dis+dep[s],cnt*2+mx));
        u = pre[u];
    }while(u != m);
    cout << max(ans,mx) << '\n';
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    cin >> T;
    while(T--) solve();
    return 0;
}

詳細信息

Test #1:

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

input:

1
4 2 3
1 2
1 3
1 4

output:

4

result:

ok 1 number(s): "4"

Test #2:

score: -100
Wrong Answer
time: 638ms
memory: 11816kb

input:

14966
15 13 8
7 14
7 10
5 3
1 3
15 3
1 13
9 5
7 2
6 13
10 11
13 8
5 10
5 12
14 4
16 14 9
16 11
14 9
8 15
14 15
13 10
6 11
3 2
9 5
6 7
10 6
6 8
1 5
15 4
10 2
11 12
100 49 58
67 43
55 34
84 42
3 74
84 54
20 6
86 83
88 51
2 99
4 78
91 64
14 59
82 38
91 44
24 12
12 2
39 19
43 46
5 80
41 35
80 97
79 8
47...

output:

9
8
63
12
3
9
131
8
119
10
11
95
6
76
121
4
85
2
111
7
121
132
107
69
7
117
0
96
91
6
108
90
7
9
4
97
70
94
12
3
3
10
10
12
8
5
103
115
90
5
84
130
3
6
1
114
9
137
84
4
1
132
99
8
1
3
4
13
5
88
104
123
82
5
9
127
85
12
86
11
5
4
8
5
9
4
9
64
8
105
68
2
124
83
1
108
2
1
9
78
6
121
9
0
9
13
87
0
4
9
5...

result:

wrong answer 11th numbers differ - expected: '13', found: '11'