Submission #8346

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
8346	2014-09-13T02:03:01 Z	tncks0121	일도양단! (kriii1_1)	C++	0 / 1	0 ms	2260 KB

1

#include <stdio.h>
  
int N,P[100100];
long long C[100100],CON,DIS;
  
int find(int x)
{
    if (x != P[x]) P[x] = find(P[x]);
    return P[x];
}
  
int main()
{
    int i,x,y;
  
    scanf ("%d",&N);
    for (i=1;i<=N;i++) P[i] = i, C[i] = 1;
    for (i=1;i<N;i++){
        scanf ("%d",&x);
        y = find(x+1); x = find(x);
        if (x == y){fprintf (stderr,"ERR"); return 0;}
        CON += C[x] * C[y];
        DIS -= C[x] * (C[x] - 1) * (C[x] + 1) / 6;
        DIS -= C[y] * (C[y] - 1) * (C[y] + 1) / 6;
        P[y] = x; C[x] += C[y];
        DIS += C[x] * (C[x] - 1) * (C[x] + 1) / 6;
  
        printf ("%lld %lld\n",CON,DIS);
    }
  
    return 0;
}

Subtask #1

0.0 / 1.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	0 ms	2260 KB	Output isn't correct
2	Halted	0 ms	0 KB	-