oj.uz

Submission #59962

# Submission time Handle Problem Language Result Execution time Memory
59962 2018-07-23T11:33:41 Z Flugan42 Duathlon (APIO18_duathlon) C++14
10 / 100
 1000 ms 13788 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<ll> vi;
typedef pair<ll,ll> ii;
typedef vector<ii> vii;
#define rep(i,a,b) for(int i = a; i < b; i++)
#define per(i,a,b) for(int i = a; i >= b; i--)
#define inf 1000000000000000000
#define sz(x) (ll)(x).size()

ll n,m,u,v,cur;
vector<vi> edges;
vi _,vis,tree,vis2,cnt;

void dfs(ll a){
  tree.push_back(a);
  rep(i,0,sz(edges[a])){
    ll b = edges[a][i];
    if (vis[b] == 0) {
      vis[b] = cur;
      dfs(b);
    }
  }
}

ll dfs2(ll a){
  vis2[a] = 1;
  if (cnt[a] != -1) return cnt[a];
  ll ans = 1;
  rep(i,0,sz(edges[a])){
    ll b = edges[a][i];
    if (vis2[b] == 0) {
      ans += dfs2(b);
    }
  }
  return cnt[a] = ans;
}

ll center(ll a){
  ll ans = 0,big = 0;
  rep(i,0,sz(edges[a])){
    ll b = edges[a][i];
    if (cnt[b] > cnt[a]) { continue; }
    ans += (sz(tree)-1-cnt[b])*cnt[b];
    big += cnt[b];
  }
  ans += big*(sz(tree)-1-big);
  return ans;
}

int main(){
  cin >> n >> m;
  edges.assign(n,_);
  rep(i,0,m){
    cin >> u >> v; u--; v--;
    edges[u].push_back(v);
    edges[v].push_back(u);
  }
  vis.assign(n,0);
  cur = 1; ll res = 0;
  rep(i,0,n){
    if (vis[i] != 0) continue;
    tree.clear();
    if (vis[i] == 0) { vis[i] = cur; dfs(i); cur++; }
    vis2.assign(n,0); cnt.assign(n,-1); dfs2(tree[0]);
    rep(i,0,sz(tree)){ res += center(tree[i]);  }
  }
  cout << res << endl;
}

Subtask #1
0 / 5.0

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

Subtask #2
0 / 11.0

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

Subtask #3
0 / 8.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 284 ms 13788 KB Output is correct
2 Correct 249 ms 13788 KB Output is correct
3 Correct 230 ms 13788 KB Output is correct
4 Correct 290 ms 13788 KB Output is correct
5 Correct 191 ms 13788 KB Output is correct
6 Correct 259 ms 13788 KB Output is correct
7 Correct 248 ms 13788 KB Output is correct
8 Correct 280 ms 13788 KB Output is correct
9 Correct 209 ms 13788 KB Output is correct
10 Correct 190 ms 13788 KB Output is correct
11 Correct 224 ms 13788 KB Output is correct
12 Correct 211 ms 13788 KB Output is correct
13 Correct 204 ms 13788 KB Output is correct
14 Execution timed out 1062 ms 13788 KB Time limit exceeded
15 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 13788 KB Output is correct
2 Correct 3 ms 13788 KB Output is correct
3 Incorrect 5 ms 13788 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 213 ms 13788 KB Output is correct
2 Correct 219 ms 13788 KB Output is correct
3 Incorrect 264 ms 13788 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #8
0 / 8.0

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

Subtask #9
0 / 10.0

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