oj.uz

답안 #60190

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
60190 2018-07-23T20:27:05 Z duality 철인 이종 경기 (APIO18_duathlon) C++11
31 / 100
 418 ms 42628 KB 
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
typedef long long int LLI;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<pii> vpii;

vi adjList[100000];
int disc[100000],low[100000],art[100000],num = 0;
vi com[100000];
vpii S;
int bcc = 0;
int doDFS(int u,int p) {
    int i,c = 0;
    disc[u] = low[u] = num++;
    for (i = 0; i < adjList[u].size(); i++) {
        int v = adjList[u][i];
        if (disc[v] == -1) {
            c++;
            S.pb(mp(u,v));
            doDFS(v,u);
            low[u] = min(low[u],low[v]);
            if (((p == -1) && (c > 1)) || ((p != -1) && (low[v] >= disc[u]))) {
                art[u] = 1;
                while (1) {
                    int uu = S.back().first,vv = S.back().second;
                    S.pop_back();
                    com[bcc].pb(uu),com[bcc].pb(vv);
                    if ((u == uu) && (v == vv)) break;
                }
                bcc++;
            }
        }
        else if ((v != p) && (disc[v] < disc[u])) low[u] = min(low[u],disc[v]),S.pb(mp(u,v));
    }
    return 0;
}
int size[100000];
vi adjList2[200000];
LLI ans = 0;
int visited[200000],sub[200000];
int doDFS2(int u,int p) {
    int i;
    sub[u] = (u < bcc) ? size[u]:0;
    visited[u] = 1;
    for (i = 0; i < adjList2[u].size(); i++) {
        int v = adjList2[u][i];
        if (v != p) sub[u] += doDFS2(v,u);
    }
    return sub[u];
}
int doDFS3(int u,int p,int r) {
    int i;
    if (u < bcc) ans += 2LL*size[u]*sub[u]*(sub[r]-sub[u]+size[u]);
    for (i = 0; i < adjList2[u].size(); i++) {
        int v = adjList2[u][i];
        if (v != p) doDFS3(v,u,r);
    }
    return 0;
}
int doDFS4(int u,int p,int s,int sum) {
    int i;
    if (u < bcc) {
        sum += com[u].size()-1;
        ans += (LLI) (com[s].size()-1)*(com[u].size()-1)*(sum);
    }
    for (i = 0; i < adjList2[u].size(); i++) {
        int v = adjList2[u][i];
        if (v != p) doDFS4(v,u,s,sum);
    }
    return 0;
}
int main() {
    int i;
    int n,m,u,v;
    scanf("%d %d",&n,&m);
    for (i = 0; i < m; i++) {
        scanf("%d %d",&u,&v);
        u--,v--;
        adjList[u].pb(v);
        adjList[v].pb(u);
    }

    int j;
    for (i = 0; i < n; i++) disc[i] = low[i] = -1;
    for (i = 0; i < n; i++) {
        if (disc[i] == -1) {
            doDFS(i,-1);
            if (!S.empty()) {
                while (!S.empty()) {
                    int u = S.back().first,v = S.back().second;
                    S.pop_back();
                    com[bcc].pb(u),com[bcc].pb(v);
                }
                bcc++;
            }
        }
    }
    for (i = 0; i < bcc; i++) {
        sort(com[i].begin(),com[i].end());
        com[i].resize(unique(com[i].begin(),com[i].end())-com[i].begin());
        for (j = 0; j < com[i].size(); j++) {
            if (art[com[i][j]]) {
                adjList2[i].pb(com[i][j]+bcc);
                adjList2[com[i][j]+bcc].pb(i);
            }
        }
        size[i] = com[i].size()-1;
        ans += (LLI) com[i].size()*(com[i].size()-1)*(com[i].size()-2);
        ans -= 2LL*size[i]*size[i]*size[i];
        ans += (LLI) size[i]*size[i];
    }
    for (i = 0; i < bcc; i++) {
        if (!visited[i]) {
            doDFS2(i,-1);
            doDFS3(i,-1,i);
            ans -= (LLI) sub[i]*sub[i];
        }
    }
    //for (i = 0; i < bcc; i++) doDFS4(i,-1,i,0);
    printf("%lld\n",ans);

    return 0;
}

Compilation message

count_triplets.cpp: In function 'int doDFS(int, int)':
count_triplets.cpp:18:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < adjList[u].size(); i++) {
                 ~~^~~~~~~~~~~~~~~~~~~
count_triplets.cpp: In function 'int doDFS2(int, int)':
count_triplets.cpp:48:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < adjList2[u].size(); i++) {
                 ~~^~~~~~~~~~~~~~~~~~~~
count_triplets.cpp: In function 'int doDFS3(int, int, int)':
count_triplets.cpp:57:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < adjList2[u].size(); i++) {
                 ~~^~~~~~~~~~~~~~~~~~~~
count_triplets.cpp: In function 'int doDFS4(int, int, int, int)':
count_triplets.cpp:69:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < adjList2[u].size(); i++) {
                 ~~^~~~~~~~~~~~~~~~~~~~
count_triplets.cpp: In function 'int main()':
count_triplets.cpp:104:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (j = 0; j < com[i].size(); j++) {
                     ~~^~~~~~~~~~~~~~~
count_triplets.cpp:78:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d",&n,&m);
     ~~~~~^~~~~~~~~~~~~~~
count_triplets.cpp:80:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d",&u,&v);
         ~~~~~^~~~~~~~~~~~~~~

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 9720 KB Output is correct
2 Correct 15 ms 9836 KB Output is correct
3 Correct 18 ms 9836 KB Output is correct
4 Correct 18 ms 9932 KB Output is correct
5 Correct 16 ms 10008 KB Output is correct
6 Correct 15 ms 10008 KB Output is correct
7 Incorrect 15 ms 10008 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 9720 KB Output is correct
2 Correct 15 ms 9836 KB Output is correct
3 Correct 18 ms 9836 KB Output is correct
4 Correct 18 ms 9932 KB Output is correct
5 Correct 16 ms 10008 KB Output is correct
6 Correct 15 ms 10008 KB Output is correct
7 Incorrect 15 ms 10008 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #3
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 228 ms 28352 KB Output is correct
2 Correct 214 ms 29600 KB Output is correct
3 Correct 323 ms 30404 KB Output is correct
4 Correct 257 ms 30836 KB Output is correct
5 Correct 270 ms 30836 KB Output is correct
6 Correct 339 ms 30836 KB Output is correct
7 Correct 322 ms 30836 KB Output is correct
8 Correct 347 ms 30836 KB Output is correct
9 Correct 347 ms 30836 KB Output is correct
10 Correct 304 ms 30836 KB Output is correct
11 Correct 218 ms 30836 KB Output is correct
12 Correct 178 ms 30836 KB Output is correct
13 Correct 198 ms 30836 KB Output is correct
14 Correct 196 ms 30836 KB Output is correct
15 Correct 124 ms 30836 KB Output is correct
16 Correct 136 ms 30836 KB Output is correct
17 Correct 17 ms 30836 KB Output is correct
18 Correct 17 ms 30836 KB Output is correct
19 Correct 17 ms 30836 KB Output is correct
20 Correct 14 ms 30836 KB Output is correct
21 Correct 16 ms 30836 KB Output is correct
22 Correct 19 ms 30836 KB Output is correct

Subtask #4
10.0 / 10.0

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

Subtask #5
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 303 ms 30836 KB Output is correct
2 Correct 304 ms 30836 KB Output is correct
3 Correct 278 ms 31408 KB Output is correct
4 Correct 298 ms 31460 KB Output is correct
5 Correct 319 ms 31460 KB Output is correct
6 Correct 418 ms 42628 KB Output is correct
7 Correct 389 ms 42628 KB Output is correct
8 Correct 384 ms 42628 KB Output is correct
9 Correct 382 ms 42628 KB Output is correct
10 Correct 321 ms 42628 KB Output is correct
11 Correct 318 ms 42628 KB Output is correct
12 Correct 274 ms 42628 KB Output is correct
13 Correct 306 ms 42628 KB Output is correct
14 Correct 254 ms 42628 KB Output is correct
15 Correct 239 ms 42628 KB Output is correct
16 Correct 148 ms 42628 KB Output is correct
17 Correct 159 ms 42628 KB Output is correct
18 Correct 163 ms 42628 KB Output is correct
19 Correct 186 ms 42628 KB Output is correct
20 Correct 176 ms 42628 KB Output is correct

Subtask #6
0 / 15.0

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

Subtask #7
0 / 20.0

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

Subtask #8
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 9720 KB Output is correct
2 Correct 15 ms 9836 KB Output is correct
3 Correct 18 ms 9836 KB Output is correct
4 Correct 18 ms 9932 KB Output is correct
5 Correct 16 ms 10008 KB Output is correct
6 Correct 15 ms 10008 KB Output is correct
7 Incorrect 15 ms 10008 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 9720 KB Output is correct
2 Correct 15 ms 9836 KB Output is correct
3 Correct 18 ms 9836 KB Output is correct
4 Correct 18 ms 9932 KB Output is correct
5 Correct 16 ms 10008 KB Output is correct
6 Correct 15 ms 10008 KB Output is correct
7 Incorrect 15 ms 10008 KB Output isn't correct
8 Halted 0 ms 0 KB -