oj.uz

답안 #265140

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
265140 2020-08-14T13:23:26 Z extraterrestrial 철인 이종 경기 (APIO18_duathlon) C++14
31 / 100
 99 ms 13808 KB 
#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
#define F first
#define S second
#define pb push_back  
#define all(x) (x).begin(), (x).end()
#define SZ(x) (int)(x).size()
//#define int ll    

const int N = 1e5 + 10;
vector<int> g[N], comp;
bool used[N];
int sz[N], root[N], pr[N];

void dfs(int v, int rt) {
  comp.pb(v);
  used[v] = true;
  sz[v] = 1;
  root[v] = rt;
  for (auto u : g[v]) {
    if (!used[u]) {
      pr[u] = v;
      dfs(u, rt);
      sz[v] += sz[u];
    }
  }
}

signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0); 
  cout.tie(0);
  int n, m;
  cin >> n >> m;
  for (int i = 0; i < m; i++) {
    int u, v;
    cin >> u >> v;
    g[u].pb(v);
    g[v].pb(u);
  }
  bool gr2 = true;
  for (int i = 1; i <= n; i++) {
    if (SZ(g[i]) > 2) {
      gr2 = false;
      break;
    }
  }
  if (gr2) {
    ll ans = 0;
    for (int i = 1; i <= n; i++) {
      if (!used[i]) {
        comp = {};
        dfs(i, i);
        int sum_sz = 0;
        for (int v : comp) {
          sum_sz += SZ(g[v]);
        } 
        if (sum_sz == 2 * sz[i]) {
          ans += 1ll * sz[i] * (sz[i] - 1) * (sz[i] - 2);
        }
        else {
          assert(sum_sz == 2 * (sz[i] - 1));
          ans += 1ll * sz[i] * (sz[i] - 1) * (sz[i] - 2) / 3;
        }
      }
    }
    cout << ans << '\n';
    exit(0);
  }
  for (int i = 1; i <= n; i++) {
    if (!used[i]) {
      dfs(i, i);
    }
  }
  ll ans = 0;
  for (int v = 1; v <= n; v++) {
    for (auto u : g[v]) {
      if (u == pr[v]) {
        ans += (sz[root[v]] - sz[v]) * 1ll * (sz[v] - 1);
      }
      else {
        ans += sz[u] * 1ll * (sz[root[v]] - sz[u] - 1);
      }
    }
  }
  cout << ans << '\n';
}

Subtask #1
0 / 5.0

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

Subtask #2
0 / 11.0

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

Subtask #3
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 75 ms 13808 KB Output is correct
2 Correct 65 ms 13808 KB Output is correct
3 Correct 65 ms 10484 KB Output is correct
4 Correct 67 ms 13424 KB Output is correct
5 Correct 62 ms 10748 KB Output is correct
6 Correct 63 ms 10744 KB Output is correct
7 Correct 70 ms 9820 KB Output is correct
8 Correct 64 ms 10356 KB Output is correct
9 Correct 66 ms 9068 KB Output is correct
10 Correct 76 ms 9720 KB Output is correct
11 Correct 58 ms 8056 KB Output is correct
12 Correct 69 ms 7928 KB Output is correct
13 Correct 51 ms 7928 KB Output is correct
14 Correct 49 ms 7800 KB Output is correct
15 Correct 43 ms 7296 KB Output is correct
16 Correct 33 ms 7160 KB Output is correct
17 Correct 4 ms 3840 KB Output is correct
18 Correct 5 ms 3840 KB Output is correct
19 Correct 4 ms 3840 KB Output is correct
20 Correct 5 ms 3840 KB Output is correct
21 Correct 4 ms 3840 KB Output is correct
22 Correct 4 ms 3840 KB Output is correct

Subtask #4
10.0 / 10.0

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

Subtask #5
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 55 ms 7896 KB Output is correct
2 Correct 77 ms 7796 KB Output is correct
3 Correct 70 ms 7796 KB Output is correct
4 Correct 72 ms 7796 KB Output is correct
5 Correct 63 ms 7796 KB Output is correct
6 Correct 99 ms 11128 KB Output is correct
7 Correct 82 ms 9840 KB Output is correct
8 Correct 70 ms 9328 KB Output is correct
9 Correct 69 ms 8820 KB Output is correct
10 Correct 61 ms 7796 KB Output is correct
11 Correct 63 ms 7796 KB Output is correct
12 Correct 64 ms 7796 KB Output is correct
13 Correct 70 ms 7796 KB Output is correct
14 Correct 75 ms 7800 KB Output is correct
15 Correct 58 ms 7672 KB Output is correct
16 Correct 47 ms 6904 KB Output is correct
17 Correct 44 ms 8304 KB Output is correct
18 Correct 53 ms 8176 KB Output is correct
19 Correct 43 ms 8172 KB Output is correct
20 Correct 40 ms 8180 KB Output is correct

Subtask #6
0 / 15.0

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

Subtask #7
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 54 ms 7796 KB Output is correct
2 Correct 54 ms 7800 KB Output is correct
3 Incorrect 64 ms 7800 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #8
0 / 8.0

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

Subtask #9
0 / 10.0

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