oj.uz

답안 #393967

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
393967 2021-04-25T05:08:36 Z 79brue 철인 이종 경기 (APIO18_duathlon) C++14
0 / 100
 75 ms 21152 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

int n, m;
vector<int> link[100002];
ll ans;

void input();
void makeBCC();

int main(){
    input();
    makeBCC();
    printf("%lld", ans);
}

void input(){
    scanf("%d %d", &n, &m);
    for(int i=1; i<=m; i++){
        int x, y;
        scanf("%d %d", &x, &y);
        link[x].push_back(y);
        link[y].push_back(x);
    }
}

bool seen[100002];
ll seenCnt;

int dfsn[100002];
int dcnt;
stack<pair<int, int> > stk;
vector<vector<pair<int, int> > > BCC;

int dfs(int x, int prv = -1){
    int result = dfsn[x] = ++dcnt;
    seenCnt++;
    for(auto y: link[x]){
        if(prv == y) continue;
        if(dfsn[x] > dfsn[y]) stk.push(make_pair(x, y));
        if(dfsn[y] > 0) result = min(result, dfsn[y]);
        else{
            int tmp = dfs(y, x);
            result = min(result, tmp);
            if(tmp >= dfsn[x]){
                vector<pair<int, int> > currBCC;
                while(!stk.empty() && stk.top() != make_pair(x, y)){
                    currBCC.push_back(stk.top());
                    stk.pop();
                }
                currBCC.push_back(stk.top());
                stk.pop();
                BCC.push_back(currBCC);
            }
        }
    }
    return result;
}

void makeBCC(){
    for(int i=1; i<=n; i++){
        if(!seen[i]){
            seenCnt = 0;
            dfs(i);
            ans += seenCnt * (seenCnt-1) * (seenCnt-2) / 3;
        }
    }
}

Compilation message

count_triplets.cpp: In function 'void input()':
count_triplets.cpp:21:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   21 |     scanf("%d %d", &n, &m);
      |     ~~~~~^~~~~~~~~~~~~~~~~
count_triplets.cpp:24:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   24 |         scanf("%d %d", &x, &y);
      |         ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 2636 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 2636 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 70 ms 21152 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 2764 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 75 ms 13296 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 2764 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 75 ms 13308 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 2636 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 2636 KB Output isn't correct
2 Halted 0 ms 0 KB -