답안 #48977 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
48977	2018-05-21T02:49:43 Z	yusufake	철인 이종 경기 (APIO18_duathlon)	C++	31 / 100	166 ms	20596 KB

count_triplets

#include<bits/stdc++.h> 
using namespace std; 

#define pb push_back
typedef long long ll; 
typedef pair < int , int > pp; 
const int mod = 1e9 + 7; 
const int N   = 2e5 + 5; 

vector < int > V[N]; 

ll AP[N],D[N],low[N],T,low2[N],D2[N],sz[N],n,m,i,x,y,nn,asd;
stack < int > S; 

void f(int x, int p){
    D2[x] = low2[x] = ++T;
    sz[x] = 1;
	S.push(x);
	for(auto y : V[x]){
		if(!D2[y]){
			f(y,x);
            low2[x] = min(low2[x] , low2[y]);
			sz[x] += sz[y];
			if(low2[y] >= D2[x]){
				ll t=0,a=0;
				for(; S.top() != x ;){
					int z = S.top();
					S.pop();
					if(AP[z]) t += sz[z] * (sz[z]-1);
					a++;
				}
				asd -= a * t;
				asd -= a * (nn-sz[y]) * (nn-sz[y]-1);
			}
		}
        else if(y != p) low2[x] = min(low2[x] , D2[y]);
    }	
}

int ap;
void g(int x, int p){
    D[x] = low[x] = ++T; nn++;
	AP[x] = p == -1 ? -1 : 0;
	for(auto y : V[x]){
		if(!D[y]){
			g(y,x);
			low[x] = min(low[x] , low[y]);
			if(low[y] >= D[x]) AP[x]++;
        }
		else if(y != p) low[x] = min(low[x] , D[y]);
	}	
    if(AP[x]) ap=x;
}
int main(){
  cin >> n >> m;
  for(;m--;){
  	scanf("%d%d",&x,&y);
  	V[x].pb(y); V[y].pb(x);
  }
  
  for(i=3;i<=n;i++)
  	if(!D[i]){
  		nn = ap = 0; g(i,-1);
  		asd += nn * (nn-1) * (nn-2);
        for(;S.size();) S.pop();
  		if(ap) f(ap,-1);
  	}
    
    cout << asd;
    return 0;
}

Compilation message

count_triplets.cpp: In function 'int main()':
count_triplets.cpp:57:22: warning: format '%d' expects argument of type 'int*', but argument 2 has type 'll* {aka long long int*}' [-Wformat=]
    scanf("%d%d",&x,&y);
                 ~~   ^
count_triplets.cpp:57:22: warning: format '%d' expects argument of type 'int*', but argument 3 has type 'll* {aka long long int*}' [-Wformat=]
count_triplets.cpp:57:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d%d",&x,&y);
    ~~~~~^~~~~~~~~~~~~~

Subtask #1
0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	6 ms	4976 KB	Output is correct
2	Correct	6 ms	5124 KB	Output is correct
3	Correct	5 ms	5176 KB	Output is correct
4	Correct	6 ms	5176 KB	Output is correct
5	Correct	6 ms	5176 KB	Output is correct
6	Correct	6 ms	5228 KB	Output is correct
7	Incorrect	6 ms	5228 KB	Output isn't correct
8	Halted	0 ms	0 KB	-

Subtask #2
0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	6 ms	4976 KB	Output is correct
2	Correct	6 ms	5124 KB	Output is correct
3	Correct	5 ms	5176 KB	Output is correct
4	Correct	6 ms	5176 KB	Output is correct
5	Correct	6 ms	5176 KB	Output is correct
6	Correct	6 ms	5228 KB	Output is correct
7	Incorrect	6 ms	5228 KB	Output isn't correct
8	Halted	0 ms	0 KB	-

Subtask #3
8.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	96 ms	16984 KB	Output is correct
2	Correct	90 ms	16984 KB	Output is correct
3	Correct	128 ms	16984 KB	Output is correct
4	Correct	119 ms	17904 KB	Output is correct
5	Correct	117 ms	17904 KB	Output is correct
6	Correct	127 ms	17904 KB	Output is correct
7	Correct	119 ms	17904 KB	Output is correct
8	Correct	127 ms	17904 KB	Output is correct
9	Correct	123 ms	17904 KB	Output is correct
10	Correct	153 ms	17904 KB	Output is correct
11	Correct	97 ms	17904 KB	Output is correct
12	Correct	92 ms	17904 KB	Output is correct
13	Correct	111 ms	17904 KB	Output is correct
14	Correct	83 ms	17904 KB	Output is correct
15	Correct	90 ms	17904 KB	Output is correct
16	Correct	69 ms	17904 KB	Output is correct
17	Correct	14 ms	17904 KB	Output is correct
18	Correct	11 ms	17904 KB	Output is correct
19	Correct	12 ms	17904 KB	Output is correct
20	Correct	13 ms	17904 KB	Output is correct
21	Correct	13 ms	17904 KB	Output is correct
22	Correct	13 ms	17904 KB	Output is correct

Subtask #4
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	7 ms	17904 KB	Output is correct
2	Correct	7 ms	17904 KB	Output is correct
3	Correct	8 ms	17904 KB	Output is correct
4	Correct	8 ms	17904 KB	Output is correct
5	Correct	7 ms	17904 KB	Output is correct
6	Correct	6 ms	17904 KB	Output is correct
7	Correct	7 ms	17904 KB	Output is correct
8	Correct	6 ms	17904 KB	Output is correct
9	Correct	7 ms	17904 KB	Output is correct
10	Correct	19 ms	17904 KB	Output is correct
11	Correct	7 ms	17904 KB	Output is correct
12	Correct	7 ms	17904 KB	Output is correct
13	Correct	7 ms	17904 KB	Output is correct
14	Correct	7 ms	17904 KB	Output is correct
15	Correct	7 ms	17904 KB	Output is correct
16	Correct	8 ms	17904 KB	Output is correct
17	Correct	8 ms	17904 KB	Output is correct
18	Correct	8 ms	17904 KB	Output is correct
19	Correct	7 ms	17904 KB	Output is correct
20	Correct	7 ms	17904 KB	Output is correct

Subtask #5
13.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	130 ms	17904 KB	Output is correct
2	Correct	123 ms	17904 KB	Output is correct
3	Correct	117 ms	17904 KB	Output is correct
4	Correct	148 ms	17904 KB	Output is correct
5	Correct	127 ms	17904 KB	Output is correct
6	Correct	157 ms	20596 KB	Output is correct
7	Correct	149 ms	20596 KB	Output is correct
8	Correct	166 ms	20596 KB	Output is correct
9	Correct	148 ms	20596 KB	Output is correct
10	Correct	128 ms	20596 KB	Output is correct
11	Correct	121 ms	20596 KB	Output is correct
12	Correct	135 ms	20596 KB	Output is correct
13	Correct	103 ms	20596 KB	Output is correct
14	Correct	86 ms	20596 KB	Output is correct
15	Correct	81 ms	20596 KB	Output is correct
16	Correct	58 ms	20596 KB	Output is correct
17	Correct	66 ms	20596 KB	Output is correct
18	Correct	61 ms	20596 KB	Output is correct
19	Correct	62 ms	20596 KB	Output is correct
20	Correct	94 ms	20596 KB	Output is correct

Subtask #6
0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	8 ms	20596 KB	Output is correct
2	Correct	8 ms	20596 KB	Output is correct
3	Incorrect	8 ms	20596 KB	Output isn't correct
4	Halted	0 ms	0 KB	-

Subtask #7
0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	128 ms	20596 KB	Output is correct
2	Correct	131 ms	20596 KB	Output is correct
3	Incorrect	159 ms	20596 KB	Output isn't correct
4	Halted	0 ms	0 KB	-

Subtask #8
0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	6 ms	4976 KB	Output is correct
2	Correct	6 ms	5124 KB	Output is correct
3	Correct	5 ms	5176 KB	Output is correct
4	Correct	6 ms	5176 KB	Output is correct
5	Correct	6 ms	5176 KB	Output is correct
6	Correct	6 ms	5228 KB	Output is correct
7	Incorrect	6 ms	5228 KB	Output isn't correct
8	Halted	0 ms	0 KB	-

Subtask #9
0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	6 ms	4976 KB	Output is correct
2	Correct	6 ms	5124 KB	Output is correct
3	Correct	5 ms	5176 KB	Output is correct
4	Correct	6 ms	5176 KB	Output is correct
5	Correct	6 ms	5176 KB	Output is correct
6	Correct	6 ms	5228 KB	Output is correct
7	Incorrect	6 ms	5228 KB	Output isn't correct
8	Halted	0 ms	0 KB	-