oj.uz

Submission #108868

# Submission time Handle Problem Language Result Execution time Memory
108868 2019-05-02T10:31:47 Z oolimry Duathlon (APIO18_duathlon) C++14
66 / 100
 430 ms 56416 KB 
#include <bits/stdc++.h>

using namespace std;
int n, m;
typedef vector<int> vi;
typedef pair<int,int> ii;
struct node{
    int depth = -1;
    int low;
    int parent;
    bool vis = false;
    bool isArti = false;
    vi adj;
};

vector<unordered_set<int> > biconnected;
stack<int> s; ///this is only needed for biconnected components
///note: this will ignore single nodes with no edges
static node g[200005];
int rootChildren = 0;
void dfs(int u){
    if(g[u].depth == -1) g[u].depth = g[g[u].parent].depth + 1;
    g[u].low = g[u].depth;
    g[u].vis = true;
    for(int i = 0;i < g[u].adj.size();i++){
        int v = g[u].adj[i];
        if(!g[v].vis){
            g[v].parent = u;
            if(g[u].depth == 0) rootChildren++;
            s.push(u); ///s traces the path of tree traversal
            dfs(v);
            g[u].low = min(g[u].low,g[v].low);

            if(g[v].low >= g[u].depth){
                g[u].isArti = true;
                g[u].low = min(g[u].low,g[v].low);
                unordered_set<int> newSet;
                int nn;
                biconnected.push_back(newSet); ///create new biconnected component
                do{
                    assert(!s.empty());
                    nn = s.top();
                    s.pop();
                    biconnected.back().insert(nn);
                }while(nn != u);
            }
            ///if(g[v].low > g[u].depth{
                  ///u,v is a bridge
            ///}
        }
        else if(v != g[u].parent){
            g[u].low = min(g[u].low,g[v].low);
        }
        s.push(u);
    }
}
struct node2{
    long long sz;
    long long dp = 0;
    bool isArti = false;
    bool vis = false;
    int p = -1;
    vi adj;
};

vector<node2> bct; ///block-cut tree
long long ans = 0ll;
long long dp(int u, int p){
    bct[u].dp = bct[u].sz;
    for(int j = 0;j < bct[u].adj.size();j++){
        int v = bct[u].adj[j];
        if(v != p)
            bct[u].dp += dp(v,u);
    }
    return bct[u].dp;
}
void countWays(int u, long long total){
    long long sz = bct[u].sz;
    //if(bct[u].vis) return;
    bct[u].vis = true;
    if(!bct[u].isArti){
        ans += sz * (sz - 1) * (sz + bct[u].adj.size() - 2);
        ans += 2ll * sz * (sz + bct[u].adj.size() - 2) * (total - sz);
    }
    long long others = total - bct[u].dp;
    for(int j = 0;j < bct[u].adj.size();j++){
        int v = bct[u].adj[j];
        if(!bct[v].vis){
            countWays(v,total);
            long long extra = 0ll;
            if(!bct[u].isArti) extra = bct[u].adj.size()-2;
            ans += 2ll * (bct[u].sz + extra) * bct[v].dp * others;
            others += bct[v].dp;
        }
    }
}
int main()
{
    //freopen("i.txt","r",stdin);
    cin >> n >> m;
    ii edges[m];
    for(int i = 0;i < m;i++){
        int a, b;
        cin >> a >> b;
        a--;
        b--;
        g[a].adj.push_back(b);
        g[b].adj.push_back(a);
        edges[i] = ii(a,b);
    }

    for(int i = 0;i < n;i++){
        if(!g[i].vis){
            rootChildren = 0;
            g[i].depth = 0;
            dfs(i);
            if(rootChildren > 1) g[i].isArti = true;
            else g[i].isArti = false; ///this line is needed
        }
    }
    unordered_map<int,int> artis;
    for(int i = 0;i < n;i++){
        if(g[i].isArti){
            artis[i] = bct.size();
            node2 nn;
            nn.sz = 1;
            nn.isArti = true;
            bct.push_back(nn);
        }
    }


    for(int i = 0;i < biconnected.size();i++){
        node2 nn;
        nn.sz = biconnected[i].size();
        nn.isArti = false;
        for(unordered_set<int>::iterator it = biconnected[i].begin();it != biconnected[i].end();it++){
            //cout << *it << " ";
            if(artis.find(*it) != artis.end()){
                nn.adj.push_back(artis[*it]);
                bct[artis[*it]].adj.push_back(bct.size());
                nn.sz--;
            }
        }
        bct.push_back(nn);
        //cout << "\n";
    }


    for(int i = 0;i < bct.size();i++){

        if(!bct[i].vis) countWays(i,dp(i,-1));

    }
    /*
    long long ans = 0ll;
    for(int i = 0;i < bct.size();i++){
        long long total = bct[bct[i].r].dp - bct[i].sz;
        long long sz = bct[i].sz;
        if(!bct[i].isArti){
            ans += sz * (sz - 1) * (sz + bct[i].adj.size() - 2);
            ans += 2ll * sz * (sz + bct[i].adj.size() - 2) * total;
        }
        long long others = bct[bct[i].r].dp - bct[i].dp;
        for(int j = 0;j < bct[i].adj.size();j++){
            int v = bct[i].adj[j];
            if(v != bct[i].p){
                long long extra = 0ll;
                if(!bct[i].isArti) extra = bct[i].adj.size()-2;
                ans += 2ll * (bct[i].sz + extra) * bct[v].dp * others;
                others += bct[v].dp;
            }
        }


        //if(!bct[i].isArti) ans += (bct[i].sz) * (bct[i].sz - 1) * (bct[i].adj.size());
        //cout << i << " " << ans << "\n";
    }
    */
    cout << ans;
}

/*
8 7
8 5
8 1
7 5
8 6
3 1
3 2
8 3
*/
/*
10 12
6 4
10 3
4 2
4 1
4 3
6 5
9 1
9 4
2 1
9 3
8 5
7 2
*/

Compilation message

count_triplets.cpp: In function 'void dfs(int)':
count_triplets.cpp:25:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0;i < g[u].adj.size();i++){
                   ~~^~~~~~~~~~~~~~~~~
count_triplets.cpp: In function 'long long int dp(int, int)':
count_triplets.cpp:70:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int j = 0;j < bct[u].adj.size();j++){
                   ~~^~~~~~~~~~~~~~~~~~~
count_triplets.cpp: In function 'void countWays(int, long long int)':
count_triplets.cpp:86:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int j = 0;j < bct[u].adj.size();j++){
                   ~~^~~~~~~~~~~~~~~~~~~
count_triplets.cpp: In function 'int main()':
count_triplets.cpp:133:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0;i < biconnected.size();i++){
                   ~~^~~~~~~~~~~~~~~~~~~~
count_triplets.cpp:150:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0;i < bct.size();i++){
                   ~~^~~~~~~~~~~~

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 8192 KB Output is correct
2 Correct 10 ms 8192 KB Output is correct
3 Correct 10 ms 8192 KB Output is correct
4 Correct 9 ms 8192 KB Output is correct
5 Correct 8 ms 8192 KB Output is correct
6 Correct 9 ms 8192 KB Output is correct
7 Correct 10 ms 8192 KB Output is correct
8 Correct 10 ms 8192 KB Output is correct
9 Correct 11 ms 8192 KB Output is correct
10 Correct 10 ms 8192 KB Output is correct
11 Correct 12 ms 8192 KB Output is correct
12 Correct 8 ms 8192 KB Output is correct
13 Correct 10 ms 8192 KB Output is correct
14 Correct 9 ms 8192 KB Output is correct
15 Correct 9 ms 8192 KB Output is correct
16 Correct 9 ms 8192 KB Output is correct
17 Correct 9 ms 8192 KB Output is correct
18 Correct 9 ms 8192 KB Output is correct
19 Correct 9 ms 8192 KB Output is correct
20 Correct 10 ms 8192 KB Output is correct
21 Correct 9 ms 8192 KB Output is correct
22 Incorrect 9 ms 8192 KB Output isn't correct
23 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 8192 KB Output is correct
2 Correct 10 ms 8192 KB Output is correct
3 Correct 10 ms 8192 KB Output is correct
4 Correct 9 ms 8192 KB Output is correct
5 Correct 8 ms 8192 KB Output is correct
6 Correct 9 ms 8192 KB Output is correct
7 Correct 10 ms 8192 KB Output is correct
8 Correct 10 ms 8192 KB Output is correct
9 Correct 11 ms 8192 KB Output is correct
10 Correct 10 ms 8192 KB Output is correct
11 Correct 12 ms 8192 KB Output is correct
12 Correct 8 ms 8192 KB Output is correct
13 Correct 10 ms 8192 KB Output is correct
14 Correct 9 ms 8192 KB Output is correct
15 Correct 9 ms 8192 KB Output is correct
16 Correct 9 ms 8192 KB Output is correct
17 Correct 9 ms 8192 KB Output is correct
18 Correct 9 ms 8192 KB Output is correct
19 Correct 9 ms 8192 KB Output is correct
20 Correct 10 ms 8192 KB Output is correct
21 Correct 9 ms 8192 KB Output is correct
22 Incorrect 9 ms 8192 KB Output isn't correct
23 Halted 0 ms 0 KB -

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 187 ms 32392 KB Output is correct
2 Correct 195 ms 32300 KB Output is correct
3 Correct 298 ms 39148 KB Output is correct
4 Correct 272 ms 37000 KB Output is correct
5 Correct 284 ms 36088 KB Output is correct
6 Correct 311 ms 40068 KB Output is correct
7 Correct 321 ms 39284 KB Output is correct
8 Correct 351 ms 40608 KB Output is correct
9 Correct 389 ms 37788 KB Output is correct
10 Correct 321 ms 35772 KB Output is correct
11 Correct 199 ms 30972 KB Output is correct
12 Correct 254 ms 30532 KB Output is correct
13 Correct 198 ms 30148 KB Output is correct
14 Correct 206 ms 29764 KB Output is correct
15 Correct 135 ms 23980 KB Output is correct
16 Correct 133 ms 23592 KB Output is correct
17 Correct 11 ms 8268 KB Output is correct
18 Correct 13 ms 8272 KB Output is correct
19 Correct 10 ms 8192 KB Output is correct
20 Correct 11 ms 8192 KB Output is correct
21 Correct 10 ms 8192 KB Output is correct
22 Correct 13 ms 8192 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 8448 KB Output is correct
2 Correct 12 ms 8576 KB Output is correct
3 Correct 10 ms 8448 KB Output is correct
4 Correct 12 ms 8704 KB Output is correct
5 Correct 15 ms 8576 KB Output is correct
6 Correct 10 ms 8648 KB Output is correct
7 Correct 13 ms 8576 KB Output is correct
8 Correct 10 ms 8576 KB Output is correct
9 Correct 10 ms 8576 KB Output is correct
10 Correct 10 ms 8576 KB Output is correct
11 Correct 10 ms 8576 KB Output is correct
12 Correct 10 ms 8576 KB Output is correct
13 Correct 11 ms 8448 KB Output is correct
14 Correct 10 ms 8448 KB Output is correct
15 Correct 10 ms 8448 KB Output is correct
16 Correct 11 ms 8320 KB Output is correct
17 Correct 11 ms 8448 KB Output is correct
18 Correct 12 ms 8448 KB Output is correct
19 Correct 11 ms 8448 KB Output is correct
20 Correct 10 ms 8448 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 339 ms 45556 KB Output is correct
2 Correct 348 ms 46776 KB Output is correct
3 Correct 325 ms 46736 KB Output is correct
4 Correct 387 ms 46748 KB Output is correct
5 Correct 364 ms 46900 KB Output is correct
6 Correct 430 ms 56416 KB Output is correct
7 Correct 378 ms 52676 KB Output is correct
8 Correct 345 ms 51048 KB Output is correct
9 Correct 355 ms 49596 KB Output is correct
10 Correct 324 ms 46752 KB Output is correct
11 Correct 385 ms 46816 KB Output is correct
12 Correct 350 ms 46688 KB Output is correct
13 Correct 328 ms 46672 KB Output is correct
14 Correct 275 ms 45112 KB Output is correct
15 Correct 235 ms 36592 KB Output is correct
16 Correct 194 ms 28240 KB Output is correct
17 Correct 208 ms 39792 KB Output is correct
18 Correct 191 ms 39572 KB Output is correct
19 Correct 206 ms 39568 KB Output is correct
20 Correct 229 ms 39584 KB Output is correct

Subtask #6
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 8448 KB Output is correct
2 Correct 11 ms 8448 KB Output is correct
3 Correct 12 ms 8448 KB Output is correct
4 Correct 13 ms 8448 KB Output is correct
5 Correct 10 ms 8320 KB Output is correct
6 Correct 13 ms 8320 KB Output is correct
7 Correct 11 ms 8320 KB Output is correct
8 Correct 11 ms 8320 KB Output is correct
9 Correct 10 ms 8320 KB Output is correct
10 Correct 13 ms 8320 KB Output is correct
11 Correct 10 ms 8320 KB Output is correct
12 Correct 14 ms 8576 KB Output is correct
13 Correct 14 ms 8576 KB Output is correct
14 Correct 11 ms 8576 KB Output is correct
15 Correct 10 ms 8448 KB Output is correct
16 Correct 11 ms 8448 KB Output is correct
17 Correct 9 ms 8448 KB Output is correct
18 Correct 11 ms 8448 KB Output is correct
19 Correct 9 ms 8320 KB Output is correct
20 Correct 10 ms 8320 KB Output is correct
21 Correct 12 ms 8448 KB Output is correct
22 Correct 10 ms 8448 KB Output is correct
23 Correct 10 ms 8448 KB Output is correct
24 Correct 11 ms 8448 KB Output is correct
25 Correct 9 ms 8192 KB Output is correct
26 Correct 8 ms 8116 KB Output is correct
27 Correct 9 ms 8220 KB Output is correct

Subtask #7
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 294 ms 45592 KB Output is correct
2 Correct 343 ms 46876 KB Output is correct
3 Correct 324 ms 45996 KB Output is correct
4 Correct 357 ms 34536 KB Output is correct
5 Correct 293 ms 28024 KB Output is correct
6 Correct 252 ms 25144 KB Output is correct
7 Correct 250 ms 24780 KB Output is correct
8 Correct 217 ms 21592 KB Output is correct
9 Correct 228 ms 21204 KB Output is correct
10 Correct 207 ms 20172 KB Output is correct
11 Correct 209 ms 19000 KB Output is correct
12 Correct 178 ms 18552 KB Output is correct
13 Correct 194 ms 18588 KB Output is correct
14 Correct 206 ms 21880 KB Output is correct
15 Correct 411 ms 52408 KB Output is correct
16 Correct 386 ms 50332 KB Output is correct
17 Correct 368 ms 44512 KB Output is correct
18 Correct 340 ms 42028 KB Output is correct
19 Correct 276 ms 34584 KB Output is correct
20 Correct 334 ms 34680 KB Output is correct
21 Correct 278 ms 34476 KB Output is correct
22 Correct 262 ms 32304 KB Output is correct
23 Correct 272 ms 27044 KB Output is correct
24 Correct 304 ms 39100 KB Output is correct
25 Correct 316 ms 39008 KB Output is correct
26 Correct 310 ms 36916 KB Output is correct
27 Correct 315 ms 36800 KB Output is correct

Subtask #8
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 8192 KB Output is correct
2 Correct 10 ms 8192 KB Output is correct
3 Correct 10 ms 8192 KB Output is correct
4 Correct 9 ms 8192 KB Output is correct
5 Correct 8 ms 8192 KB Output is correct
6 Correct 9 ms 8192 KB Output is correct
7 Correct 10 ms 8192 KB Output is correct
8 Correct 10 ms 8192 KB Output is correct
9 Correct 11 ms 8192 KB Output is correct
10 Correct 10 ms 8192 KB Output is correct
11 Correct 12 ms 8192 KB Output is correct
12 Correct 8 ms 8192 KB Output is correct
13 Correct 10 ms 8192 KB Output is correct
14 Correct 9 ms 8192 KB Output is correct
15 Correct 9 ms 8192 KB Output is correct
16 Correct 9 ms 8192 KB Output is correct
17 Correct 9 ms 8192 KB Output is correct
18 Correct 9 ms 8192 KB Output is correct
19 Correct 9 ms 8192 KB Output is correct
20 Correct 10 ms 8192 KB Output is correct
21 Correct 9 ms 8192 KB Output is correct
22 Incorrect 9 ms 8192 KB Output isn't correct
23 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 8192 KB Output is correct
2 Correct 10 ms 8192 KB Output is correct
3 Correct 10 ms 8192 KB Output is correct
4 Correct 9 ms 8192 KB Output is correct
5 Correct 8 ms 8192 KB Output is correct
6 Correct 9 ms 8192 KB Output is correct
7 Correct 10 ms 8192 KB Output is correct
8 Correct 10 ms 8192 KB Output is correct
9 Correct 11 ms 8192 KB Output is correct
10 Correct 10 ms 8192 KB Output is correct
11 Correct 12 ms 8192 KB Output is correct
12 Correct 8 ms 8192 KB Output is correct
13 Correct 10 ms 8192 KB Output is correct
14 Correct 9 ms 8192 KB Output is correct
15 Correct 9 ms 8192 KB Output is correct
16 Correct 9 ms 8192 KB Output is correct
17 Correct 9 ms 8192 KB Output is correct
18 Correct 9 ms 8192 KB Output is correct
19 Correct 9 ms 8192 KB Output is correct
20 Correct 10 ms 8192 KB Output is correct
21 Correct 9 ms 8192 KB Output is correct
22 Incorrect 9 ms 8192 KB Output isn't correct
23 Halted 0 ms 0 KB -