oj.uz

Submission #402709

# Submission time Handle Problem Language Result Execution time Memory
402709 2021-05-12T09:24:21 Z dxz05 Duathlon (APIO18_duathlon) C++14
8 / 100
 78 ms 31856 KB 
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimize("unroll-loops")

#include <bits/stdc++.h>

using namespace std;

void debug_out() { cerr << endl; }

template<typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << "[" << H << "]";
    debug_out(T...);
}

#ifdef dddxxz
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

#define SZ(s) ((int)s.size())
#define all(x) (x).begin(), (x).end()
#define revall(x) (x).rbegin(), (x).rend()

clock_t startTime;

double getCurrentTime() {
    return (double) (clock() - startTime) / CLOCKS_PER_SEC;
}

typedef long long ll;
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
const double eps = 0.00001;
const int MOD = 1e9 + 7;
const int INF = 1000000101;
const long long LLINF = 1223372000000000555;
const int N = 1e6 + 3e2;
const int M = 2222;

vector<int> g[N];

int cnt = 0;
int color[N];
bool cycle = false;
void dfs(int v, int p){
    color[v] = 1;
    cnt++;
    for (int u : g[v]){
        if (u == p) continue;
        if (color[u] == 1) cycle = true;
        if (color[u] == 0) dfs(u, v);
    }
    color[v] = 2;
}

void solve(int TC) {
    int n, m;
    cin >> n >> m;

    while (m--){
        int u, v;
        cin >> u >> v;
        g[u].push_back(v);
        g[v].push_back(u);
    }

    ll ans = 0;
    for (int i = 1; i <= n; i++){
        if (color[i] == 0){
            cnt = 0;
            cycle = false;
            dfs(i, 0);
            ans += 1ll * cnt * (cnt - 1) * (cnt - 2) / (cycle ? 1 : 3);
        }
    }

    cout << ans;

}


int main() {
    startTime = clock();
    cin.tie(nullptr); cout.tie(nullptr);
    ios_base::sync_with_stdio(false);

    bool llololcal = false;
#ifdef dddxxz
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
    llololcal = true;
#endif

    int TC = 1;
    //  cin >> TC;

    for (int test = 1; test <= TC; test++) {
        //debug(test);
        //cout << "Case #" << test << ": ";
        solve(test);
    }

    if (llololcal) cerr << endl << "Time: " << int(getCurrentTime() * 1000) << " ms" << endl;

    return 0;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 23756 KB Output is correct
2 Correct 14 ms 23756 KB Output is correct
3 Correct 14 ms 23796 KB Output is correct
4 Correct 15 ms 23812 KB Output is correct
5 Correct 14 ms 23820 KB Output is correct
6 Correct 15 ms 23756 KB Output is correct
7 Incorrect 15 ms 23820 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 23756 KB Output is correct
2 Correct 14 ms 23756 KB Output is correct
3 Correct 14 ms 23796 KB Output is correct
4 Correct 15 ms 23812 KB Output is correct
5 Correct 14 ms 23820 KB Output is correct
6 Correct 15 ms 23756 KB Output is correct
7 Incorrect 15 ms 23820 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 62 ms 31812 KB Output is correct
2 Correct 78 ms 31856 KB Output is correct
3 Correct 73 ms 30144 KB Output is correct
4 Correct 73 ms 30972 KB Output is correct
5 Correct 65 ms 29648 KB Output is correct
6 Correct 62 ms 29600 KB Output is correct
7 Correct 67 ms 29336 KB Output is correct
8 Correct 65 ms 29380 KB Output is correct
9 Correct 59 ms 28792 KB Output is correct
10 Correct 59 ms 29168 KB Output is correct
11 Correct 52 ms 28228 KB Output is correct
12 Correct 54 ms 28172 KB Output is correct
13 Correct 54 ms 28076 KB Output is correct
14 Correct 49 ms 28004 KB Output is correct
15 Correct 42 ms 27344 KB Output is correct
16 Correct 40 ms 27340 KB Output is correct
17 Correct 15 ms 24112 KB Output is correct
18 Correct 15 ms 24140 KB Output is correct
19 Correct 15 ms 24136 KB Output is correct
20 Correct 15 ms 24196 KB Output is correct
21 Correct 15 ms 24140 KB Output is correct
22 Correct 15 ms 24156 KB Output is correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 15 ms 23772 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 73 ms 28784 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 15 ms 23756 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 58 ms 28604 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 23756 KB Output is correct
2 Correct 14 ms 23756 KB Output is correct
3 Correct 14 ms 23796 KB Output is correct
4 Correct 15 ms 23812 KB Output is correct
5 Correct 14 ms 23820 KB Output is correct
6 Correct 15 ms 23756 KB Output is correct
7 Incorrect 15 ms 23820 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 23756 KB Output is correct
2 Correct 14 ms 23756 KB Output is correct
3 Correct 14 ms 23796 KB Output is correct
4 Correct 15 ms 23812 KB Output is correct
5 Correct 14 ms 23820 KB Output is correct
6 Correct 15 ms 23756 KB Output is correct
7 Incorrect 15 ms 23820 KB Output isn't correct
8 Halted 0 ms 0 KB -