oj.uz

Submission #49204

# Submission time Handle Problem Language Result Execution time Memory
49204 2018-05-23T15:35:01 Z BThero Duathlon (APIO18_duathlon) C++17
5 / 100
 1000 ms 1100 KB 
// Why am I so stupid? :c
#include <bits/stdc++.h>

#define pb push_back
#define mp make_pair

#define all(x) (x).begin(), (x).end()

#define fi first
#define se second

typedef long long ll;

using namespace std;

vector <int> adj[105];

bool can[105];

bool u[105];

int n, m;

int ans;

void dfs(int v, int fn) {
    if (v == fn) {
        for (int i = 1; i <= n; ++i) {
            can[i] |= u[i];
        }

        return;
    }

    u[v] = 1;

    for (int to : adj[v]) {
        if (u[to]) {
            continue;
        }

        dfs(to, fn);
    }

    u[v] = 0;
}

void solve() {
    scanf("%d %d", &n, &m);

    for (int i = 1, u, v; i <= m; ++i) {
        scanf("%d %d", &u, &v);

        adj[u].pb(v);
        adj[v].pb(u);
    }

    for (int a = 1; a <= n; ++a) {
        for (int b = 1; b <= n; ++b) {
            if (a == b) {
                continue;
            }

            for (int i = 0; i <= n; ++i) {
                can[i] = 0;
                u[i] = 0;
            }

            dfs(a, b);

            for (int i = 1; i <= n; ++i) {
                if (i != a) {
                    ans += can[i];
                }
            }
        }
    }

    printf("%d\n", ans);
}

int main() {
#ifdef BThero
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif // BThero

    int tt = 1;

    while (tt--) {
        solve();
    }

    return 0;
}

Compilation message

count_triplets.cpp: In function 'void solve()':
count_triplets.cpp:49: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:52: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 2 ms 248 KB Output is correct
2 Correct 2 ms 356 KB Output is correct
3 Correct 2 ms 392 KB Output is correct
4 Correct 3 ms 468 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 2 ms 468 KB Output is correct
8 Correct 3 ms 544 KB Output is correct
9 Correct 23 ms 604 KB Output is correct
10 Correct 516 ms 604 KB Output is correct
11 Correct 3 ms 604 KB Output is correct
12 Correct 2 ms 628 KB Output is correct
13 Correct 2 ms 628 KB Output is correct
14 Correct 3 ms 628 KB Output is correct
15 Correct 2 ms 628 KB Output is correct
16 Correct 2 ms 628 KB Output is correct
17 Correct 2 ms 628 KB Output is correct
18 Correct 2 ms 628 KB Output is correct
19 Correct 2 ms 628 KB Output is correct
20 Correct 2 ms 628 KB Output is correct
21 Correct 2 ms 628 KB Output is correct
22 Correct 2 ms 628 KB Output is correct
23 Correct 2 ms 628 KB Output is correct
24 Correct 3 ms 628 KB Output is correct
25 Correct 2 ms 628 KB Output is correct
26 Correct 2 ms 628 KB Output is correct
27 Correct 2 ms 628 KB Output is correct
28 Correct 2 ms 628 KB Output is correct
29 Correct 2 ms 628 KB Output is correct
30 Correct 2 ms 628 KB Output is correct
31 Correct 2 ms 628 KB Output is correct
32 Correct 3 ms 628 KB Output is correct
33 Correct 2 ms 628 KB Output is correct
34 Correct 2 ms 628 KB Output is correct
35 Correct 2 ms 628 KB Output is correct

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 356 KB Output is correct
3 Correct 2 ms 392 KB Output is correct
4 Correct 3 ms 468 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 2 ms 468 KB Output is correct
8 Correct 3 ms 544 KB Output is correct
9 Correct 23 ms 604 KB Output is correct
10 Correct 516 ms 604 KB Output is correct
11 Correct 3 ms 604 KB Output is correct
12 Correct 2 ms 628 KB Output is correct
13 Correct 2 ms 628 KB Output is correct
14 Correct 3 ms 628 KB Output is correct
15 Correct 2 ms 628 KB Output is correct
16 Correct 2 ms 628 KB Output is correct
17 Correct 2 ms 628 KB Output is correct
18 Correct 2 ms 628 KB Output is correct
19 Correct 2 ms 628 KB Output is correct
20 Correct 2 ms 628 KB Output is correct
21 Correct 2 ms 628 KB Output is correct
22 Correct 2 ms 628 KB Output is correct
23 Correct 2 ms 628 KB Output is correct
24 Correct 3 ms 628 KB Output is correct
25 Correct 2 ms 628 KB Output is correct
26 Correct 2 ms 628 KB Output is correct
27 Correct 2 ms 628 KB Output is correct
28 Correct 2 ms 628 KB Output is correct
29 Correct 2 ms 628 KB Output is correct
30 Correct 2 ms 628 KB Output is correct
31 Correct 2 ms 628 KB Output is correct
32 Correct 3 ms 628 KB Output is correct
33 Correct 2 ms 628 KB Output is correct
34 Correct 2 ms 628 KB Output is correct
35 Correct 2 ms 628 KB Output is correct
36 Correct 2 ms 628 KB Output is correct
37 Correct 3 ms 628 KB Output is correct
38 Correct 38 ms 628 KB Output is correct
39 Execution timed out 1083 ms 628 KB Time limit exceeded
40 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Runtime error 3 ms 636 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 5 ms 1036 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #5
0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 3 ms 1036 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# Verdict Execution time Memory Grader output
1 Runtime error 6 ms 1100 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 1100 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #8
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 356 KB Output is correct
3 Correct 2 ms 392 KB Output is correct
4 Correct 3 ms 468 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 2 ms 468 KB Output is correct
8 Correct 3 ms 544 KB Output is correct
9 Correct 23 ms 604 KB Output is correct
10 Correct 516 ms 604 KB Output is correct
11 Correct 3 ms 604 KB Output is correct
12 Correct 2 ms 628 KB Output is correct
13 Correct 2 ms 628 KB Output is correct
14 Correct 3 ms 628 KB Output is correct
15 Correct 2 ms 628 KB Output is correct
16 Correct 2 ms 628 KB Output is correct
17 Correct 2 ms 628 KB Output is correct
18 Correct 2 ms 628 KB Output is correct
19 Correct 2 ms 628 KB Output is correct
20 Correct 2 ms 628 KB Output is correct
21 Correct 2 ms 628 KB Output is correct
22 Correct 2 ms 628 KB Output is correct
23 Correct 2 ms 628 KB Output is correct
24 Correct 3 ms 628 KB Output is correct
25 Correct 2 ms 628 KB Output is correct
26 Correct 2 ms 628 KB Output is correct
27 Correct 2 ms 628 KB Output is correct
28 Correct 2 ms 628 KB Output is correct
29 Correct 2 ms 628 KB Output is correct
30 Correct 2 ms 628 KB Output is correct
31 Correct 2 ms 628 KB Output is correct
32 Correct 3 ms 628 KB Output is correct
33 Correct 2 ms 628 KB Output is correct
34 Correct 2 ms 628 KB Output is correct
35 Correct 2 ms 628 KB Output is correct
36 Correct 2 ms 628 KB Output is correct
37 Correct 3 ms 628 KB Output is correct
38 Correct 38 ms 628 KB Output is correct
39 Execution timed out 1083 ms 628 KB Time limit exceeded
40 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 356 KB Output is correct
3 Correct 2 ms 392 KB Output is correct
4 Correct 3 ms 468 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 2 ms 468 KB Output is correct
8 Correct 3 ms 544 KB Output is correct
9 Correct 23 ms 604 KB Output is correct
10 Correct 516 ms 604 KB Output is correct
11 Correct 3 ms 604 KB Output is correct
12 Correct 2 ms 628 KB Output is correct
13 Correct 2 ms 628 KB Output is correct
14 Correct 3 ms 628 KB Output is correct
15 Correct 2 ms 628 KB Output is correct
16 Correct 2 ms 628 KB Output is correct
17 Correct 2 ms 628 KB Output is correct
18 Correct 2 ms 628 KB Output is correct
19 Correct 2 ms 628 KB Output is correct
20 Correct 2 ms 628 KB Output is correct
21 Correct 2 ms 628 KB Output is correct
22 Correct 2 ms 628 KB Output is correct
23 Correct 2 ms 628 KB Output is correct
24 Correct 3 ms 628 KB Output is correct
25 Correct 2 ms 628 KB Output is correct
26 Correct 2 ms 628 KB Output is correct
27 Correct 2 ms 628 KB Output is correct
28 Correct 2 ms 628 KB Output is correct
29 Correct 2 ms 628 KB Output is correct
30 Correct 2 ms 628 KB Output is correct
31 Correct 2 ms 628 KB Output is correct
32 Correct 3 ms 628 KB Output is correct
33 Correct 2 ms 628 KB Output is correct
34 Correct 2 ms 628 KB Output is correct
35 Correct 2 ms 628 KB Output is correct
36 Correct 2 ms 628 KB Output is correct
37 Correct 3 ms 628 KB Output is correct
38 Correct 38 ms 628 KB Output is correct
39 Execution timed out 1083 ms 628 KB Time limit exceeded
40 Halted 0 ms 0 KB -