oj.uz

Submission #734339

# Submission time Handle Problem Language Result Execution time Memory
734339 2023-05-02T09:47:41 Z cig32 Duathlon (APIO18_duathlon) C++17
0 / 100
 144 ms 45196 KB 
#include "bits/stdc++.h"
#define int long long
using namespace std;
const int MAXN = 4e5 + 10;
vector<int> adj[MAXN];
vector<int> rst[MAXN]; // round-square tree
int n, m, cur;
int tin[MAXN], low[MAXN], vis[MAXN];
stack<int> stk;
int nxt;
int ans = 0;
void dfs(int node, int prv) {
  vis[node] = 1;
  tin[node] = ++cur;
  low[node] = tin[node];
  stk.push(node);
  for(int x: adj[node]) {
    if(x != prv) {
      if(!vis[x]) {
        dfs(x, node);
        low[node] = min(low[node], low[x]);
        if(low[x] >= tin[node]) {
          while(1) {
            int u = stk.top();
            stk.pop();
            rst[u].push_back(nxt);
            rst[nxt].push_back(u);
            if(u == x) break;
          }
          rst[node].push_back(nxt);
          rst[nxt].push_back(node);
          nxt++;
        }
      }
      else {
        low[node] = min(low[node], tin[x]);
      }
    }
  }
}
int w[MAXN];
int bruh;
int calc(int node, int prv) {
  int ret = (node <= n);
  vector<int> vt;
  for(int x: rst[node]) {
    if(x != prv) {
      int v = calc(x, node);
      ret += v;
      vt.push_back(v);
    }
  }
  vt.push_back(bruh - ret);
  int con = (node <= n ? 2 * (bruh-1) : 0);
  int ps = 0;
  for(int x: vt) {
    con += ps * x * 2;
    ps += x;
  }
  ans += con * w[node];
  return ret;
}
void count(int node, int prv) {
  vis[node] = 1;
  bruh += (node <= n);
  for(int x: rst[node]) if(x != prv) count(x, node);
}
int32_t main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cin >> n >> m;
  for(int i=1; i<=m; i++) {
    int u, v;
    cin >> u >> v;
    adj[u].push_back(v);
    adj[v].push_back(u);
  }
  nxt = n+1;
  for(int i=1; i<=n; i++) {
    if(!vis[i]) {
      dfs(1, -1);
      while(stk.size()) stk.pop();
    }
  }
  m = nxt-1 - n;
  for(int i=1; i<=n; i++) w[i] = -1;
  for(int i=n+1; i<=n+m; i++) w[i] = rst[i].size();
  for(int i=1; i<=n+m; i++) vis[i] = 0;
  for(int i=1; i<=n+m; i++) {
    if(!vis[i]) {
      bruh = 0;
      count(i, -1);
      calc(i, -1);
    }
  }
  cout << ans << '\n';
}

Subtask #1
0 / 5.0

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

Subtask #2
0 / 11.0

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

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 80 ms 41812 KB Output is correct
2 Correct 103 ms 41780 KB Output is correct
3 Incorrect 63 ms 33548 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 19240 KB Output is correct
2 Correct 11 ms 19284 KB Output is correct
3 Correct 12 ms 19284 KB Output is correct
4 Correct 11 ms 19412 KB Output is correct
5 Correct 11 ms 19280 KB Output is correct
6 Correct 12 ms 19284 KB Output is correct
7 Correct 11 ms 19332 KB Output is correct
8 Correct 14 ms 19284 KB Output is correct
9 Correct 11 ms 19284 KB Output is correct
10 Incorrect 10 ms 19152 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #5
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 109 ms 34328 KB Output is correct
2 Correct 118 ms 34368 KB Output is correct
3 Correct 117 ms 34460 KB Output is correct
4 Correct 108 ms 34424 KB Output is correct
5 Correct 111 ms 34436 KB Output is correct
6 Correct 125 ms 45196 KB Output is correct
7 Correct 123 ms 42084 KB Output is correct
8 Correct 130 ms 40096 KB Output is correct
9 Correct 117 ms 38168 KB Output is correct
10 Incorrect 77 ms 30784 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 19284 KB Output is correct
2 Correct 10 ms 19284 KB Output is correct
3 Correct 10 ms 19248 KB Output is correct
4 Correct 10 ms 19156 KB Output is correct
5 Correct 10 ms 19156 KB Output is correct
6 Correct 12 ms 19184 KB Output is correct
7 Correct 10 ms 19156 KB Output is correct
8 Correct 10 ms 19156 KB Output is correct
9 Correct 11 ms 19156 KB Output is correct
10 Correct 12 ms 19156 KB Output is correct
11 Correct 10 ms 19156 KB Output is correct
12 Correct 11 ms 19284 KB Output is correct
13 Correct 11 ms 19284 KB Output is correct
14 Correct 12 ms 19336 KB Output is correct
15 Correct 10 ms 19336 KB Output is correct
16 Incorrect 10 ms 19216 KB Output isn't correct
17 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 107 ms 34440 KB Output is correct
2 Correct 120 ms 34188 KB Output is correct
3 Correct 120 ms 33756 KB Output is correct
4 Correct 114 ms 32728 KB Output is correct
5 Correct 112 ms 31472 KB Output is correct
6 Correct 102 ms 30880 KB Output is correct
7 Correct 92 ms 30664 KB Output is correct
8 Correct 92 ms 30156 KB Output is correct
9 Correct 95 ms 30196 KB Output is correct
10 Correct 86 ms 29996 KB Output is correct
11 Correct 89 ms 29896 KB Output is correct
12 Correct 84 ms 30068 KB Output is correct
13 Correct 82 ms 30028 KB Output is correct
14 Correct 84 ms 32660 KB Output is correct
15 Correct 138 ms 42000 KB Output is correct
16 Correct 136 ms 39304 KB Output is correct
17 Correct 144 ms 40300 KB Output is correct
18 Correct 136 ms 37896 KB Output is correct
19 Incorrect 116 ms 32272 KB Output isn't correct
20 Halted 0 ms 0 KB -

Subtask #8
0 / 8.0

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

Subtask #9
0 / 10.0

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