oj.uz

Submission #49190

# Submission time Handle Problem Language Result Execution time Memory
49190 2018-05-23T14:14:36 Z someone_aa Duathlon (APIO18_duathlon) C++17
10 / 100
 1000 ms 9104 KB 
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
using namespace std;

const int maxn = 100100;
vector<int>g[maxn];
bool visited[maxn];
int n, m, u, v;
ll result;

void dfs(int node, int depth=0) {
    if(visited[node]) return;
    visited[node] = true;
    if(depth >= 2) result += depth - 1;
    for(int i:g[node]) {
        if(!visited[i]) {
            dfs(i, depth+1);
        }
    }
}

int main() {
    cin>>n>>m;
    for(int i=0;i<m;i++) {
        cin>>u>>v;
        g[u].pb(v);
        g[v].pb(u);
    }

    for(int i=1;i<=n;i++) {
        memset(visited,0,sizeof(visited));
        dfs(i);
    }
    cout<<result<<"\n";
    return 0;
}

Subtask #1
0 / 5.0

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

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 2752 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 1065 ms 9104 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
10.0 / 10.0

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

Subtask #5
0 / 13.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1063 ms 9104 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 9104 KB Output is correct
2 Correct 26 ms 9104 KB Output is correct
3 Incorrect 33 ms 9104 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 1070 ms 9104 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
0 / 8.0

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

Subtask #9
0 / 10.0

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