code forces 979C

Posted 2020-11-05 buerdepepeqi

C. Kuro and Walking Route

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Kuro is living in a country called Uberland, consisting of $\mathrm{nn towns,\; numbered\; from 11 to nn,\; and n?1n?1 bidirectional\; roads\; connecting\; these\; towns.\; It\; is\; possible\; to\; reach\; each\; town\; from\; any\; other.\; Each\; road\; connects\; two\; towns aa and bb.\; Kuro\; loves\; walking\; and\; he\; is\; planning\; to\; take\; a\; walking\; marathon,\; in\; which\; he\; will\; choose\; a\; pair\; of\; towns (u,v)(u,v) (u\ne vu\ne v)\; and\; walk\; from uuusing\; the\; shortest\; path\; to vv (note\; that (u,v)(u,v) is\; considered\; to\; be\; different\; from (v,u)(v,u)).}$

Oddly, there are 2 special towns in Uberland named Flowrisa (denoted with the index $\mathrm{xx)\; and\; Beetopia\; (denoted\; with\; the\; index yy).\; Flowrisa\; is\; a\; town\; where\; there\; are\; many\; strong-scent\; flowers,\; and\; Beetopia\; is\; another\; town\; where\; many\; bees\; live.\; In\; particular,\; Kuro\; will\; avoid\; any\; pair\; of\; towns (u,v)(u,v) if\; on\; the\; path\; from uu to vv,\; he\; reaches\; Beetopia\; after\; he\; reached\; Flowrisa,\; since\; the\; bees\; will\; be\; attracted\; with\; the\; flower\; smell\; on\; Kuro’s\; body\; and\; sting\; him.}$

Kuro wants to know how many pair of city $(u,v)(u,v) he\; can\; take\; as\; his\; route.\; Since\; he’s\; not\; really\; bright,\; he\; asked\; you\; to\; help\; him\; with\; this\; problem.$

Input

The first line contains three integers $\mathrm{nn, xx and yy (1\le n\le 3?105,1\le x,y\le n1\le n\le 3?105,1\le x,y\le n, x\ne yx\ne y)\; -\; the\; number\; of\; towns,\; index\; of\; the\; town\; Flowrisa\; and\; index\; of\; the\; town\; Beetopia,\; respectively.}$

$\mathrm{n?1n?1 lines\; follow,\; each\; line\; contains\; two\; integers aa and bb (1\le a,b\le n1\le a,b\le n, a\ne ba\ne b),\; describes\; a\; road\; connecting\; two\; towns aa and bb.}$

It is guaranteed that from each town, we can reach every other town in the city using the given roads. That is, the given map of towns and roads is a tree.

Output

A single integer resembles the number of pair of towns $(u,v)(u,v) that\; Kuro\; can\; use\; as\; his\; walking\; route.$

Examples

input

Copy

3 1 3
1 2
2 3

output

Copy

5

input

Copy

3 1 3
1 2
1 3

output

Copy

4

Note

On the first example, Kuro can choose these pairs:

• $(1,2)(1,2):\; his\; route\; would\; be 1\to 21\to 2,$
• $(2,3)(2,3):\; his\; route\; would\; be 2\to 32\to 3,$
• $(3,2)(3,2):\; his\; route\; would\; be 3\to 23\to 2,$
• $(2,1)(2,1):\; his\; route\; would\; be 2\to 12\to 1,$
• $(3,1)(3,1):\; his\; route\; would\; be 3\to 2\to 13\to 2\to 1.$

Kuro can‘t choose pair $(1,3)(1,3) since\; his\; walking\; route\; would\; be 1\to 2\to 31\to 2\to 3,\; in\; which\; Kuro\; visits\; town 11 (Flowrisa)\; and\; then\; visits\; town 33 (Beetopia),\; which\; is\; not\; allowed\; (note\; that\; pair (3,1)(3,1) is\; still\; allowed\; because\; although\; Kuro\; visited\; Flowrisa\; and\; Beetopia,\; he\; did\; not\; visit\; them\; in\; that\; order).$

On the second example, Kuro can choose the following pairs:

• $(1,2)(1,2):\; his\; route\; would\; be 1\to 21\to 2,$
• $(2,1)(2,1):\; his\; route\; would\; be 2\to 12\to 1,$
• $(3,2)(3,2):\; his\; route\; would\; be 3\to 1\to 23\to 1\to 2,$
• $(3,1)(3,1):\; his\; route\; would\; be 3\to 13\to 1.$

#include<cmath>
#include<queue>
#include<cstdio>
#include<string.h>
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
const int INF=0x3f3f3f3f;
const int N=3e5+10;
vector<int> g[N];
int num[N];
int par[N];
int n,x,y;
int dfs(int u,int fa){
    par[u]=fa;
    int cnt=0;
    for(int v:g[u]){
        if(v!=fa){
            cnt+=dfs(v,u);
        }
    }
    return num[u]=cnt+1;
}
int main() {
    scanf("%d%d%d",&n,&x,&y);
    for(int i=0;i<n-1;i++){
        int u,v;
        scanf("%d%d",&u,&v);
                g[u].push_back(v);
                g[v].push_back(u);
    }
    dfs(x,-1);
    long long ans=0;
    int m=y;
    while(par[m] !=x){
        m=par[m];
    }
    ans=(long long )n*(n-1);
    ans-=(long long )num[y]*(n-num[m]);
    printf("%lld\n",ans);
    return 0;
}

View Code