oj.uz

Submission #60175

# Submission time Handle Problem Language Result Execution time Memory
60175 2018-07-23T20:14:54 Z duality Duathlon (APIO18_duathlon) C++11
49 / 100
 1000 ms 28820 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]);
        //ans -= 2LL*size[u]*size[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;
        if (u != s) 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 += (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:60: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:72: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:107:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (j = 0; j < com[i].size(); j++) {
                     ~~^~~~~~~~~~~~~~~
count_triplets.cpp:81: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:83: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
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 9720 KB Output is correct
2 Correct 14 ms 9836 KB Output is correct
3 Correct 15 ms 9904 KB Output is correct
4 Correct 13 ms 9904 KB Output is correct
5 Correct 14 ms 10028 KB Output is correct
6 Correct 13 ms 10028 KB Output is correct
7 Correct 10 ms 10028 KB Output is correct
8 Correct 11 ms 10028 KB Output is correct
9 Correct 11 ms 10028 KB Output is correct
10 Correct 12 ms 10028 KB Output is correct
11 Correct 16 ms 10028 KB Output is correct
12 Correct 11 ms 10028 KB Output is correct
13 Correct 15 ms 10028 KB Output is correct
14 Correct 10 ms 10028 KB Output is correct
15 Correct 14 ms 10136 KB Output is correct
16 Correct 11 ms 10136 KB Output is correct
17 Correct 11 ms 10136 KB Output is correct
18 Correct 10 ms 10136 KB Output is correct
19 Correct 13 ms 10136 KB Output is correct
20 Correct 13 ms 10136 KB Output is correct
21 Correct 10 ms 10136 KB Output is correct
22 Correct 12 ms 10136 KB Output is correct
23 Correct 12 ms 10136 KB Output is correct
24 Correct 11 ms 10136 KB Output is correct
25 Correct 12 ms 10136 KB Output is correct
26 Correct 15 ms 10136 KB Output is correct
27 Correct 10 ms 10136 KB Output is correct
28 Correct 11 ms 10136 KB Output is correct
29 Correct 10 ms 10136 KB Output is correct
30 Correct 13 ms 10136 KB Output is correct
31 Correct 12 ms 10136 KB Output is correct
32 Correct 12 ms 10136 KB Output is correct
33 Correct 11 ms 10136 KB Output is correct
34 Correct 12 ms 10136 KB Output is correct
35 Correct 13 ms 10176 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 9720 KB Output is correct
2 Correct 14 ms 9836 KB Output is correct
3 Correct 15 ms 9904 KB Output is correct
4 Correct 13 ms 9904 KB Output is correct
5 Correct 14 ms 10028 KB Output is correct
6 Correct 13 ms 10028 KB Output is correct
7 Correct 10 ms 10028 KB Output is correct
8 Correct 11 ms 10028 KB Output is correct
9 Correct 11 ms 10028 KB Output is correct
10 Correct 12 ms 10028 KB Output is correct
11 Correct 16 ms 10028 KB Output is correct
12 Correct 11 ms 10028 KB Output is correct
13 Correct 15 ms 10028 KB Output is correct
14 Correct 10 ms 10028 KB Output is correct
15 Correct 14 ms 10136 KB Output is correct
16 Correct 11 ms 10136 KB Output is correct
17 Correct 11 ms 10136 KB Output is correct
18 Correct 10 ms 10136 KB Output is correct
19 Correct 13 ms 10136 KB Output is correct
20 Correct 13 ms 10136 KB Output is correct
21 Correct 10 ms 10136 KB Output is correct
22 Correct 12 ms 10136 KB Output is correct
23 Correct 12 ms 10136 KB Output is correct
24 Correct 11 ms 10136 KB Output is correct
25 Correct 12 ms 10136 KB Output is correct
26 Correct 15 ms 10136 KB Output is correct
27 Correct 10 ms 10136 KB Output is correct
28 Correct 11 ms 10136 KB Output is correct
29 Correct 10 ms 10136 KB Output is correct
30 Correct 13 ms 10136 KB Output is correct
31 Correct 12 ms 10136 KB Output is correct
32 Correct 12 ms 10136 KB Output is correct
33 Correct 11 ms 10136 KB Output is correct
34 Correct 12 ms 10136 KB Output is correct
35 Correct 13 ms 10176 KB Output is correct
36 Correct 10 ms 10176 KB Output is correct
37 Correct 10 ms 10176 KB Output is correct
38 Correct 14 ms 10176 KB Output is correct
39 Correct 12 ms 10176 KB Output is correct
40 Correct 11 ms 10176 KB Output is correct
41 Correct 11 ms 10176 KB Output is correct
42 Correct 11 ms 10176 KB Output is correct
43 Correct 11 ms 10176 KB Output is correct
44 Correct 11 ms 10176 KB Output is correct
45 Correct 11 ms 10176 KB Output is correct
46 Correct 12 ms 10176 KB Output is correct
47 Correct 12 ms 10176 KB Output is correct
48 Correct 13 ms 10176 KB Output is correct
49 Correct 14 ms 10248 KB Output is correct
50 Correct 13 ms 10248 KB Output is correct
51 Correct 14 ms 10248 KB Output is correct
52 Correct 13 ms 10248 KB Output is correct
53 Correct 12 ms 10248 KB Output is correct
54 Correct 13 ms 10248 KB Output is correct
55 Correct 13 ms 10248 KB Output is correct
56 Correct 13 ms 10248 KB Output is correct
57 Correct 15 ms 10248 KB Output is correct
58 Correct 15 ms 10248 KB Output is correct
59 Correct 12 ms 10248 KB Output is correct
60 Correct 15 ms 10248 KB Output is correct
61 Correct 13 ms 10248 KB Output is correct
62 Correct 13 ms 10248 KB Output is correct
63 Correct 14 ms 10248 KB Output is correct
64 Correct 13 ms 10248 KB Output is correct
65 Correct 14 ms 10320 KB Output is correct

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 200 ms 28744 KB Output is correct
2 Correct 179 ms 28744 KB Output is correct
3 Execution timed out 1079 ms 28820 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 28820 KB Output is correct
2 Correct 40 ms 28820 KB Output is correct
3 Correct 38 ms 28820 KB Output is correct
4 Correct 50 ms 28820 KB Output is correct
5 Correct 45 ms 28820 KB Output is correct
6 Correct 39 ms 28820 KB Output is correct
7 Correct 60 ms 28820 KB Output is correct
8 Correct 44 ms 28820 KB Output is correct
9 Correct 43 ms 28820 KB Output is correct
10 Correct 37 ms 28820 KB Output is correct
11 Correct 32 ms 28820 KB Output is correct
12 Correct 21 ms 28820 KB Output is correct
13 Correct 15 ms 28820 KB Output is correct
14 Correct 14 ms 28820 KB Output is correct
15 Correct 15 ms 28820 KB Output is correct
16 Correct 13 ms 28820 KB Output is correct
17 Correct 32 ms 28820 KB Output is correct
18 Correct 28 ms 28820 KB Output is correct
19 Correct 24 ms 28820 KB Output is correct
20 Correct 29 ms 28820 KB Output is correct

Subtask #5
0 / 13.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1066 ms 28820 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 28820 KB Output is correct
2 Correct 43 ms 28820 KB Output is correct
3 Correct 29 ms 28820 KB Output is correct
4 Correct 20 ms 28820 KB Output is correct
5 Correct 17 ms 28820 KB Output is correct
6 Correct 16 ms 28820 KB Output is correct
7 Correct 14 ms 28820 KB Output is correct
8 Correct 14 ms 28820 KB Output is correct
9 Correct 15 ms 28820 KB Output is correct
10 Correct 14 ms 28820 KB Output is correct
11 Correct 14 ms 28820 KB Output is correct
12 Correct 36 ms 28820 KB Output is correct
13 Correct 38 ms 28820 KB Output is correct
14 Correct 30 ms 28820 KB Output is correct
15 Correct 29 ms 28820 KB Output is correct
16 Correct 25 ms 28820 KB Output is correct
17 Correct 21 ms 28820 KB Output is correct
18 Correct 16 ms 28820 KB Output is correct
19 Correct 16 ms 28820 KB Output is correct
20 Correct 11 ms 28820 KB Output is correct
21 Correct 28 ms 28820 KB Output is correct
22 Correct 35 ms 28820 KB Output is correct
23 Correct 22 ms 28820 KB Output is correct
24 Correct 29 ms 28820 KB Output is correct
25 Correct 12 ms 28820 KB Output is correct
26 Correct 12 ms 28820 KB Output is correct
27 Correct 13 ms 28820 KB Output is correct

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1083 ms 28820 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 9720 KB Output is correct
2 Correct 14 ms 9836 KB Output is correct
3 Correct 15 ms 9904 KB Output is correct
4 Correct 13 ms 9904 KB Output is correct
5 Correct 14 ms 10028 KB Output is correct
6 Correct 13 ms 10028 KB Output is correct
7 Correct 10 ms 10028 KB Output is correct
8 Correct 11 ms 10028 KB Output is correct
9 Correct 11 ms 10028 KB Output is correct
10 Correct 12 ms 10028 KB Output is correct
11 Correct 16 ms 10028 KB Output is correct
12 Correct 11 ms 10028 KB Output is correct
13 Correct 15 ms 10028 KB Output is correct
14 Correct 10 ms 10028 KB Output is correct
15 Correct 14 ms 10136 KB Output is correct
16 Correct 11 ms 10136 KB Output is correct
17 Correct 11 ms 10136 KB Output is correct
18 Correct 10 ms 10136 KB Output is correct
19 Correct 13 ms 10136 KB Output is correct
20 Correct 13 ms 10136 KB Output is correct
21 Correct 10 ms 10136 KB Output is correct
22 Correct 12 ms 10136 KB Output is correct
23 Correct 12 ms 10136 KB Output is correct
24 Correct 11 ms 10136 KB Output is correct
25 Correct 12 ms 10136 KB Output is correct
26 Correct 15 ms 10136 KB Output is correct
27 Correct 10 ms 10136 KB Output is correct
28 Correct 11 ms 10136 KB Output is correct
29 Correct 10 ms 10136 KB Output is correct
30 Correct 13 ms 10136 KB Output is correct
31 Correct 12 ms 10136 KB Output is correct
32 Correct 12 ms 10136 KB Output is correct
33 Correct 11 ms 10136 KB Output is correct
34 Correct 12 ms 10136 KB Output is correct
35 Correct 13 ms 10176 KB Output is correct
36 Correct 10 ms 10176 KB Output is correct
37 Correct 10 ms 10176 KB Output is correct
38 Correct 14 ms 10176 KB Output is correct
39 Correct 12 ms 10176 KB Output is correct
40 Correct 11 ms 10176 KB Output is correct
41 Correct 11 ms 10176 KB Output is correct
42 Correct 11 ms 10176 KB Output is correct
43 Correct 11 ms 10176 KB Output is correct
44 Correct 11 ms 10176 KB Output is correct
45 Correct 11 ms 10176 KB Output is correct
46 Correct 12 ms 10176 KB Output is correct
47 Correct 12 ms 10176 KB Output is correct
48 Correct 13 ms 10176 KB Output is correct
49 Correct 14 ms 10248 KB Output is correct
50 Correct 13 ms 10248 KB Output is correct
51 Correct 14 ms 10248 KB Output is correct
52 Correct 13 ms 10248 KB Output is correct
53 Correct 12 ms 10248 KB Output is correct
54 Correct 13 ms 10248 KB Output is correct
55 Correct 13 ms 10248 KB Output is correct
56 Correct 13 ms 10248 KB Output is correct
57 Correct 15 ms 10248 KB Output is correct
58 Correct 15 ms 10248 KB Output is correct
59 Correct 12 ms 10248 KB Output is correct
60 Correct 15 ms 10248 KB Output is correct
61 Correct 13 ms 10248 KB Output is correct
62 Correct 13 ms 10248 KB Output is correct
63 Correct 14 ms 10248 KB Output is correct
64 Correct 13 ms 10248 KB Output is correct
65 Correct 14 ms 10320 KB Output is correct
66 Correct 13 ms 28820 KB Output is correct
67 Correct 15 ms 28820 KB Output is correct
68 Correct 17 ms 28820 KB Output is correct
69 Correct 12 ms 28820 KB Output is correct
70 Correct 15 ms 28820 KB Output is correct
71 Correct 13 ms 28820 KB Output is correct
72 Correct 14 ms 28820 KB Output is correct
73 Correct 14 ms 28820 KB Output is correct
74 Correct 17 ms 28820 KB Output is correct
75 Correct 14 ms 28820 KB Output is correct
76 Correct 10 ms 28820 KB Output is correct
77 Correct 24 ms 28820 KB Output is correct
78 Correct 19 ms 28820 KB Output is correct
79 Correct 16 ms 28820 KB Output is correct
80 Correct 12 ms 28820 KB Output is correct
81 Correct 16 ms 28820 KB Output is correct
82 Correct 15 ms 28820 KB Output is correct
83 Correct 14 ms 28820 KB Output is correct
84 Correct 16 ms 28820 KB Output is correct
85 Correct 17 ms 28820 KB Output is correct
86 Correct 17 ms 28820 KB Output is correct
87 Correct 16 ms 28820 KB Output is correct
88 Correct 13 ms 28820 KB Output is correct
89 Correct 15 ms 28820 KB Output is correct
90 Correct 15 ms 28820 KB Output is correct
91 Correct 16 ms 28820 KB Output is correct
92 Correct 18 ms 28820 KB Output is correct

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 9720 KB Output is correct
2 Correct 14 ms 9836 KB Output is correct
3 Correct 15 ms 9904 KB Output is correct
4 Correct 13 ms 9904 KB Output is correct
5 Correct 14 ms 10028 KB Output is correct
6 Correct 13 ms 10028 KB Output is correct
7 Correct 10 ms 10028 KB Output is correct
8 Correct 11 ms 10028 KB Output is correct
9 Correct 11 ms 10028 KB Output is correct
10 Correct 12 ms 10028 KB Output is correct
11 Correct 16 ms 10028 KB Output is correct
12 Correct 11 ms 10028 KB Output is correct
13 Correct 15 ms 10028 KB Output is correct
14 Correct 10 ms 10028 KB Output is correct
15 Correct 14 ms 10136 KB Output is correct
16 Correct 11 ms 10136 KB Output is correct
17 Correct 11 ms 10136 KB Output is correct
18 Correct 10 ms 10136 KB Output is correct
19 Correct 13 ms 10136 KB Output is correct
20 Correct 13 ms 10136 KB Output is correct
21 Correct 10 ms 10136 KB Output is correct
22 Correct 12 ms 10136 KB Output is correct
23 Correct 12 ms 10136 KB Output is correct
24 Correct 11 ms 10136 KB Output is correct
25 Correct 12 ms 10136 KB Output is correct
26 Correct 15 ms 10136 KB Output is correct
27 Correct 10 ms 10136 KB Output is correct
28 Correct 11 ms 10136 KB Output is correct
29 Correct 10 ms 10136 KB Output is correct
30 Correct 13 ms 10136 KB Output is correct
31 Correct 12 ms 10136 KB Output is correct
32 Correct 12 ms 10136 KB Output is correct
33 Correct 11 ms 10136 KB Output is correct
34 Correct 12 ms 10136 KB Output is correct
35 Correct 13 ms 10176 KB Output is correct
36 Correct 10 ms 10176 KB Output is correct
37 Correct 10 ms 10176 KB Output is correct
38 Correct 14 ms 10176 KB Output is correct
39 Correct 12 ms 10176 KB Output is correct
40 Correct 11 ms 10176 KB Output is correct
41 Correct 11 ms 10176 KB Output is correct
42 Correct 11 ms 10176 KB Output is correct
43 Correct 11 ms 10176 KB Output is correct
44 Correct 11 ms 10176 KB Output is correct
45 Correct 11 ms 10176 KB Output is correct
46 Correct 12 ms 10176 KB Output is correct
47 Correct 12 ms 10176 KB Output is correct
48 Correct 13 ms 10176 KB Output is correct
49 Correct 14 ms 10248 KB Output is correct
50 Correct 13 ms 10248 KB Output is correct
51 Correct 14 ms 10248 KB Output is correct
52 Correct 13 ms 10248 KB Output is correct
53 Correct 12 ms 10248 KB Output is correct
54 Correct 13 ms 10248 KB Output is correct
55 Correct 13 ms 10248 KB Output is correct
56 Correct 13 ms 10248 KB Output is correct
57 Correct 15 ms 10248 KB Output is correct
58 Correct 15 ms 10248 KB Output is correct
59 Correct 12 ms 10248 KB Output is correct
60 Correct 15 ms 10248 KB Output is correct
61 Correct 13 ms 10248 KB Output is correct
62 Correct 13 ms 10248 KB Output is correct
63 Correct 14 ms 10248 KB Output is correct
64 Correct 13 ms 10248 KB Output is correct
65 Correct 14 ms 10320 KB Output is correct
66 Correct 200 ms 28744 KB Output is correct
67 Correct 179 ms 28744 KB Output is correct
68 Execution timed out 1079 ms 28820 KB Time limit exceeded
69 Halted 0 ms 0 KB -