oj.uz

Submission #734763

# Submission time Handle Problem Language Result Execution time Memory
734763 2023-05-03T04:43:53 Z keisuke6 Duathlon (APIO18_duathlon) C++14
10 / 100
 1000 ms 7388 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
bool sub3(vector<vector<int>> &G){
  for(int i=0;i<G.size();i++)if(G[i].size() > 2) return false;
  return true;
}
struct Unionfind{
  vector<int> par, siz;
  //初期化
  Unionfind(int n) : par(n,-1) , siz(n,1) {}
  int root(int x) {
    if(par[x] == -1) return x;
    else return par[x] = root(par[x]);
  }
  bool issame(int x,int y) {
    return root(x) == root(y);
  }
  bool unite(int x, int y){
    x = root(x); y = root(y);
    if(x ==  y) return false;
    if(siz[x] < siz[y]) swap(x,y);
    par[y] =  x;
    siz[x] += siz[y];
    return  true;
  }
  int size(int x) {
    return siz[root(x)];
  }
};
signed main(){
  int N,M;
  cin>>N>>M;
  vector<vector<int>> G(N);
  for(int i=0;i<M;i++){
    int a,b;
    cin>>a>>b;
    a--;
    b--;
    G[a].push_back(b);
    G[b].push_back(a);
  }
  int ans = 0;
  for(int i=0;i<N;i++){
    vector<int> dist(N,1e18);
    dist[i] = 0;
    queue<int> q;
    q.push(i);
    while(!q.empty()){
      int pos = q.front();
      q.pop();
      for(int x:G[pos]){
        if(dist[x] != 1e18) continue;
        dist[x] = dist[pos] + 1;
        q.push(x);
      }
    }
    for(int j=0;j<N;j++)if(dist[j] >= 2 && dist[j] != 1e18) ans += dist[j]-1;
  }
  cout<<ans<<endl;
}

Compilation message

count_triplets.cpp: In function 'bool sub3(std::vector<std::vector<long long int> >&)':
count_triplets.cpp:5:16: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::vector<long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    5 |   for(int i=0;i<G.size();i++)if(G[i].size() > 2) return false;
      |               ~^~~~~~~~~

Subtask #1
0 / 5.0

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

Subtask #2
0 / 11.0

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

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1066 ms 6468 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 372 KB Output is correct
2 Correct 20 ms 364 KB Output is correct
3 Correct 21 ms 340 KB Output is correct
4 Correct 25 ms 364 KB Output is correct
5 Correct 24 ms 364 KB Output is correct
6 Correct 24 ms 364 KB Output is correct
7 Correct 25 ms 340 KB Output is correct
8 Correct 25 ms 360 KB Output is correct
9 Correct 25 ms 340 KB Output is correct
10 Correct 19 ms 340 KB Output is correct
11 Correct 16 ms 340 KB Output is correct
12 Correct 11 ms 340 KB Output is correct
13 Correct 7 ms 376 KB Output is correct
14 Correct 3 ms 308 KB Output is correct
15 Correct 3 ms 340 KB Output is correct
16 Correct 3 ms 340 KB Output is correct
17 Correct 12 ms 388 KB Output is correct
18 Correct 12 ms 308 KB Output is correct
19 Correct 12 ms 312 KB Output is correct
20 Correct 12 ms 340 KB Output is correct

Subtask #5
0 / 13.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1091 ms 7388 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 348 KB Output is correct
2 Correct 22 ms 340 KB Output is correct
3 Incorrect 23 ms 368 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1077 ms 7216 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
0 / 8.0

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

Subtask #9
0 / 10.0

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