oj.uz

답안 #49071

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
49071 2018-05-21T19:08:20 Z yusufake 철인 이종 경기 (APIO18_duathlon) C++
31 / 100
 231 ms 36516 KB 
#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   = 3e5 + 5; 

vector < int > U[N],V[N]; 

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

void f(int x, int p){
    ll t = sz[x] + U[x].size();
    for(auto y : U[x]){
	    f(y,x);
        sz[x] += sz[y];
        if(x > n){
            asd -= a = (t-1+(p!=-1)) * sz[y] * (sz[y]-1);
            //cout << x << " " << a << " " << t << " -\n";
        }
    }	
    if(x > n) {
        asd -= a = t * (nn-sz[x]) * (nn-sz[x]-1);
        //cout << x << " " << a << " -\n";
    }
}

void g(int x, int p){
    D[x] = low[x] = ++T; nn++;
	S.push(x);
    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]++;
                sz[x] = 1;
				U[x].pb(++bcc);
                for(; S.top() != x ;){
					int z = S.top();
					S.pop();
					if(AP[z]) U[bcc].pb(z);
                    else sz[bcc]++;
			    }
			}
		}
        else if(y != p) low[x] = min(low[x] , D[y]);
    }	
}
int main(){
  cin >> n >> m;
  for(;m--;){
  	scanf("%d%d",&x,&y);
  	V[x].pb(y); V[y].pb(x);
  }
  
  bcc = n;
  for(i=1;i<=n;i++)
  	if(!D[i]){
  		for(;S.size();) S.pop();
  	    nn = 0; g(i,-1);
  		asd += nn * (nn-1) * (nn-2);
        if(AP[i]) f(i,-1);
        else{
            x = U[i][0]; sz[x]++; f(x,-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 15 ms 14456 KB Output is correct
2 Correct 15 ms 14456 KB Output is correct
3 Correct 18 ms 14492 KB Output is correct
4 Correct 16 ms 14548 KB Output is correct
5 Correct 15 ms 14596 KB Output is correct
6 Correct 14 ms 14596 KB Output is correct
7 Incorrect 15 ms 14648 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 14456 KB Output is correct
2 Correct 15 ms 14456 KB Output is correct
3 Correct 18 ms 14492 KB Output is correct
4 Correct 16 ms 14548 KB Output is correct
5 Correct 15 ms 14596 KB Output is correct
6 Correct 14 ms 14596 KB Output is correct
7 Incorrect 15 ms 14648 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #3
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 147 ms 29972 KB Output is correct
2 Correct 125 ms 29984 KB Output is correct
3 Correct 157 ms 30932 KB Output is correct
4 Correct 135 ms 30932 KB Output is correct
5 Correct 185 ms 30932 KB Output is correct
6 Correct 177 ms 30932 KB Output is correct
7 Correct 154 ms 30932 KB Output is correct
8 Correct 153 ms 30932 KB Output is correct
9 Correct 165 ms 30932 KB Output is correct
10 Correct 163 ms 30932 KB Output is correct
11 Correct 118 ms 30932 KB Output is correct
12 Correct 135 ms 30932 KB Output is correct
13 Correct 108 ms 30932 KB Output is correct
14 Correct 107 ms 30932 KB Output is correct
15 Correct 78 ms 30932 KB Output is correct
16 Correct 79 ms 30932 KB Output is correct
17 Correct 18 ms 30932 KB Output is correct
18 Correct 25 ms 30932 KB Output is correct
19 Correct 20 ms 30932 KB Output is correct
20 Correct 20 ms 30932 KB Output is correct
21 Correct 21 ms 30932 KB Output is correct
22 Correct 20 ms 30932 KB Output is correct

Subtask #4
10.0 / 10.0

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

Subtask #5
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 158 ms 30932 KB Output is correct
2 Correct 180 ms 30932 KB Output is correct
3 Correct 164 ms 30932 KB Output is correct
4 Correct 174 ms 30932 KB Output is correct
5 Correct 149 ms 30932 KB Output is correct
6 Correct 181 ms 36516 KB Output is correct
7 Correct 197 ms 36516 KB Output is correct
8 Correct 214 ms 36516 KB Output is correct
9 Correct 182 ms 36516 KB Output is correct
10 Correct 168 ms 36516 KB Output is correct
11 Correct 182 ms 36516 KB Output is correct
12 Correct 154 ms 36516 KB Output is correct
13 Correct 231 ms 36516 KB Output is correct
14 Correct 145 ms 36516 KB Output is correct
15 Correct 121 ms 36516 KB Output is correct
16 Correct 80 ms 36516 KB Output is correct
17 Correct 68 ms 36516 KB Output is correct
18 Correct 73 ms 36516 KB Output is correct
19 Correct 112 ms 36516 KB Output is correct
20 Correct 92 ms 36516 KB Output is correct

Subtask #6
0 / 15.0

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

Subtask #7
0 / 20.0

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

Subtask #8
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 14456 KB Output is correct
2 Correct 15 ms 14456 KB Output is correct
3 Correct 18 ms 14492 KB Output is correct
4 Correct 16 ms 14548 KB Output is correct
5 Correct 15 ms 14596 KB Output is correct
6 Correct 14 ms 14596 KB Output is correct
7 Incorrect 15 ms 14648 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 14456 KB Output is correct
2 Correct 15 ms 14456 KB Output is correct
3 Correct 18 ms 14492 KB Output is correct
4 Correct 16 ms 14548 KB Output is correct
5 Correct 15 ms 14596 KB Output is correct
6 Correct 14 ms 14596 KB Output is correct
7 Incorrect 15 ms 14648 KB Output isn't correct
8 Halted 0 ms 0 KB -