oj.uz

Submission #55696

# Submission time Handle Problem Language Result Execution time Memory
55696 2018-07-08T15:40:46 Z mohammad_kilani Duathlon (APIO18_duathlon) C++17
5 / 100
 1000 ms 10204 KB 
#include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define oo 1000000000
const int N = 100010;
int n , m , u , v , needed1, needed2;
vector< int > g[N] ; 
int vis[N] ,vis2[N] , vi , vi2;

bool DFS2(int node){
    if(vis[node] == vi || vis2[node] == vi2) return false;
    if(node == needed2) return true;
    vis2[node] = vi2;
    for(int i=0;i<g[node].size();i++){
        if(DFS2(g[node][i]))
            return true;
    }
    return false;
}

bool DFS(int node){
    if(vis[node] == vi) return false;
    if(node == needed1){
        vi2++;
        return DFS2(node);
    }
    vis[node] = vi;
    for(int i=0;i<g[node].size();i++){
        if(DFS(g[node][i]))
            return true;
    }
    vis[node] = 0;
    return false;
}


int main(){
    scanf("%d%d",&n,&m);
    for(int i=0;i<m;i++){
        scanf("%d%d",&u,&v);
        g[u].push_back(v);
        g[v].push_back(u);
    }
    int ans = 0;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            for(int k=1;k<=n;k++){
                if(i == j || i == k || j == k) continue;
                needed1 = j;
                needed2 = k;
                vi++;
                if(DFS(i)){
                    ans++;
                }
            }
        }
    }
    cout << ans << endl;
    return 0;
}

Compilation message

count_triplets.cpp: In function 'bool DFS2(int)':
count_triplets.cpp:14:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<g[node].size();i++){
                 ~^~~~~~~~~~~~~~~
count_triplets.cpp: In function 'bool DFS(int)':
count_triplets.cpp:28:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<g[node].size();i++){
                 ~^~~~~~~~~~~~~~~
count_triplets.cpp: In function 'int main()':
count_triplets.cpp:38:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d",&n,&m);
     ~~~~~^~~~~~~~~~~~~~
count_triplets.cpp:40:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d",&u,&v);
         ~~~~~^~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 2680 KB Output is correct
2 Correct 5 ms 2784 KB Output is correct
3 Correct 4 ms 2784 KB Output is correct
4 Correct 4 ms 2784 KB Output is correct
5 Correct 4 ms 2828 KB Output is correct
6 Correct 4 ms 2828 KB Output is correct
7 Correct 4 ms 2828 KB Output is correct
8 Correct 9 ms 2960 KB Output is correct
9 Correct 18 ms 2960 KB Output is correct
10 Correct 233 ms 2960 KB Output is correct
11 Correct 6 ms 3048 KB Output is correct
12 Correct 4 ms 3048 KB Output is correct
13 Correct 5 ms 3048 KB Output is correct
14 Correct 5 ms 3048 KB Output is correct
15 Correct 5 ms 3048 KB Output is correct
16 Correct 6 ms 3180 KB Output is correct
17 Correct 5 ms 3180 KB Output is correct
18 Correct 5 ms 3180 KB Output is correct
19 Correct 4 ms 3180 KB Output is correct
20 Correct 5 ms 3180 KB Output is correct
21 Correct 7 ms 3180 KB Output is correct
22 Correct 6 ms 3180 KB Output is correct
23 Correct 4 ms 3180 KB Output is correct
24 Correct 4 ms 3228 KB Output is correct
25 Correct 4 ms 3228 KB Output is correct
26 Correct 6 ms 3228 KB Output is correct
27 Correct 5 ms 3228 KB Output is correct
28 Correct 4 ms 3228 KB Output is correct
29 Correct 5 ms 3228 KB Output is correct
30 Correct 5 ms 3228 KB Output is correct
31 Correct 6 ms 3228 KB Output is correct
32 Correct 4 ms 3296 KB Output is correct
33 Correct 4 ms 3296 KB Output is correct
34 Correct 5 ms 3296 KB Output is correct
35 Correct 4 ms 3296 KB Output is correct

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 2680 KB Output is correct
2 Correct 5 ms 2784 KB Output is correct
3 Correct 4 ms 2784 KB Output is correct
4 Correct 4 ms 2784 KB Output is correct
5 Correct 4 ms 2828 KB Output is correct
6 Correct 4 ms 2828 KB Output is correct
7 Correct 4 ms 2828 KB Output is correct
8 Correct 9 ms 2960 KB Output is correct
9 Correct 18 ms 2960 KB Output is correct
10 Correct 233 ms 2960 KB Output is correct
11 Correct 6 ms 3048 KB Output is correct
12 Correct 4 ms 3048 KB Output is correct
13 Correct 5 ms 3048 KB Output is correct
14 Correct 5 ms 3048 KB Output is correct
15 Correct 5 ms 3048 KB Output is correct
16 Correct 6 ms 3180 KB Output is correct
17 Correct 5 ms 3180 KB Output is correct
18 Correct 5 ms 3180 KB Output is correct
19 Correct 4 ms 3180 KB Output is correct
20 Correct 5 ms 3180 KB Output is correct
21 Correct 7 ms 3180 KB Output is correct
22 Correct 6 ms 3180 KB Output is correct
23 Correct 4 ms 3180 KB Output is correct
24 Correct 4 ms 3228 KB Output is correct
25 Correct 4 ms 3228 KB Output is correct
26 Correct 6 ms 3228 KB Output is correct
27 Correct 5 ms 3228 KB Output is correct
28 Correct 4 ms 3228 KB Output is correct
29 Correct 5 ms 3228 KB Output is correct
30 Correct 5 ms 3228 KB Output is correct
31 Correct 6 ms 3228 KB Output is correct
32 Correct 4 ms 3296 KB Output is correct
33 Correct 4 ms 3296 KB Output is correct
34 Correct 5 ms 3296 KB Output is correct
35 Correct 4 ms 3296 KB Output is correct
36 Correct 5 ms 3296 KB Output is correct
37 Correct 11 ms 3296 KB Output is correct
38 Execution timed out 1071 ms 3296 KB Time limit exceeded
39 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

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

Subtask #4
0 / 10.0

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

Subtask #5
0 / 13.0

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

Subtask #6
0 / 15.0

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

Subtask #7
0 / 20.0

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

Subtask #8
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 2680 KB Output is correct
2 Correct 5 ms 2784 KB Output is correct
3 Correct 4 ms 2784 KB Output is correct
4 Correct 4 ms 2784 KB Output is correct
5 Correct 4 ms 2828 KB Output is correct
6 Correct 4 ms 2828 KB Output is correct
7 Correct 4 ms 2828 KB Output is correct
8 Correct 9 ms 2960 KB Output is correct
9 Correct 18 ms 2960 KB Output is correct
10 Correct 233 ms 2960 KB Output is correct
11 Correct 6 ms 3048 KB Output is correct
12 Correct 4 ms 3048 KB Output is correct
13 Correct 5 ms 3048 KB Output is correct
14 Correct 5 ms 3048 KB Output is correct
15 Correct 5 ms 3048 KB Output is correct
16 Correct 6 ms 3180 KB Output is correct
17 Correct 5 ms 3180 KB Output is correct
18 Correct 5 ms 3180 KB Output is correct
19 Correct 4 ms 3180 KB Output is correct
20 Correct 5 ms 3180 KB Output is correct
21 Correct 7 ms 3180 KB Output is correct
22 Correct 6 ms 3180 KB Output is correct
23 Correct 4 ms 3180 KB Output is correct
24 Correct 4 ms 3228 KB Output is correct
25 Correct 4 ms 3228 KB Output is correct
26 Correct 6 ms 3228 KB Output is correct
27 Correct 5 ms 3228 KB Output is correct
28 Correct 4 ms 3228 KB Output is correct
29 Correct 5 ms 3228 KB Output is correct
30 Correct 5 ms 3228 KB Output is correct
31 Correct 6 ms 3228 KB Output is correct
32 Correct 4 ms 3296 KB Output is correct
33 Correct 4 ms 3296 KB Output is correct
34 Correct 5 ms 3296 KB Output is correct
35 Correct 4 ms 3296 KB Output is correct
36 Correct 5 ms 3296 KB Output is correct
37 Correct 11 ms 3296 KB Output is correct
38 Execution timed out 1071 ms 3296 KB Time limit exceeded
39 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 2680 KB Output is correct
2 Correct 5 ms 2784 KB Output is correct
3 Correct 4 ms 2784 KB Output is correct
4 Correct 4 ms 2784 KB Output is correct
5 Correct 4 ms 2828 KB Output is correct
6 Correct 4 ms 2828 KB Output is correct
7 Correct 4 ms 2828 KB Output is correct
8 Correct 9 ms 2960 KB Output is correct
9 Correct 18 ms 2960 KB Output is correct
10 Correct 233 ms 2960 KB Output is correct
11 Correct 6 ms 3048 KB Output is correct
12 Correct 4 ms 3048 KB Output is correct
13 Correct 5 ms 3048 KB Output is correct
14 Correct 5 ms 3048 KB Output is correct
15 Correct 5 ms 3048 KB Output is correct
16 Correct 6 ms 3180 KB Output is correct
17 Correct 5 ms 3180 KB Output is correct
18 Correct 5 ms 3180 KB Output is correct
19 Correct 4 ms 3180 KB Output is correct
20 Correct 5 ms 3180 KB Output is correct
21 Correct 7 ms 3180 KB Output is correct
22 Correct 6 ms 3180 KB Output is correct
23 Correct 4 ms 3180 KB Output is correct
24 Correct 4 ms 3228 KB Output is correct
25 Correct 4 ms 3228 KB Output is correct
26 Correct 6 ms 3228 KB Output is correct
27 Correct 5 ms 3228 KB Output is correct
28 Correct 4 ms 3228 KB Output is correct
29 Correct 5 ms 3228 KB Output is correct
30 Correct 5 ms 3228 KB Output is correct
31 Correct 6 ms 3228 KB Output is correct
32 Correct 4 ms 3296 KB Output is correct
33 Correct 4 ms 3296 KB Output is correct
34 Correct 5 ms 3296 KB Output is correct
35 Correct 4 ms 3296 KB Output is correct
36 Correct 5 ms 3296 KB Output is correct
37 Correct 11 ms 3296 KB Output is correct
38 Execution timed out 1071 ms 3296 KB Time limit exceeded
39 Halted 0 ms 0 KB -