oj.uz

답안 #259068

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
259068 2020-08-07T06:40:52 Z _7_7_ 철인 이종 경기 (APIO18_duathlon) C++14
5 / 100
 1000 ms 13048 KB 
#include <bits/stdc++.h>                                           
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
 
using namespace std;
using namespace __gnu_pbds;
 
//#define int long long
//#pragma GCC optimize("Ofast")
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4")
 
 
#define file(s) freopen(s".in","r",stdin); freopen(s".out","w",stdout);
#define fastio ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define all(x) x.begin(), x.end()
#define sz(s) (int)s.size()
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define s second
#define f first
 
 
 
 
typedef pair < long long, long long > pll;    
typedef pair < int, int > pii;  
typedef unsigned long long ull;         
typedef vector < pii > vpii;                                   	
typedef vector < int > vi;
typedef long double ldb;  
typedef long long ll;  
typedef double db;
 
typedef tree < int, null_type, less < int >, rb_tree_tag, tree_order_statistics_node_update > ordered_set;
 
const int inf = 1e9, maxn = 2e5 + 48, mod = 998244353, N = 1e5 + 512;
const int dx[] = {1, -1, 0, 0}, dy[] = {0, 0, 1, -1}, block = 300;
const pii base = mp(1171, 3307), Mod = mp(1e9 + 7, 1e9 + 9);
const db eps = 1e-12, pi = acos(-1);
const ll INF = 1e18;
 
int n, m, v, u, ans;
bool was[55];
vi g[N];

void dfs (int v, int p) {
	was[v] = 1;
	for (auto to : g[v])
		if (to != p && !was[to])
			dfs(to, p);
}


main () {
	fastio
	cin >> n >> m;
	while (m--) {
		cin >> v >> u;
		g[v].pb(u);
		g[u].pb(v);
	}

	for (int s = 1; s <= n; ++s)
		for (int c = 1; c <= n; ++c)
			if (s != c)
				for (int f = 1; f <= n; ++f)
					if (f != c && f != s) {
						bool ok = 1;
						for (int v = 1; v <= n; ++v) {
							if (v == c)
								continue;
							memset(was, 0, sizeof(was));
							if (v != s)
								dfs(s, v);

							int cur = was[c];
							memset(was, 0, sizeof(was));
							if (v != c)
								dfs(c, v);

							cur += was[f];
							if (!cur) {
								ok = 0; 
								break;
							}
						}

						if (ok)
							++ans;
					}

	cout << ans << endl;
}

Compilation message

count_triplets.cpp:56:7: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main () {
       ^

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2688 KB Output is correct
2 Correct 2 ms 2688 KB Output is correct
3 Correct 2 ms 2688 KB Output is correct
4 Correct 2 ms 2688 KB Output is correct
5 Correct 2 ms 2688 KB Output is correct
6 Correct 2 ms 2688 KB Output is correct
7 Correct 2 ms 2688 KB Output is correct
8 Correct 4 ms 2688 KB Output is correct
9 Correct 4 ms 2688 KB Output is correct
10 Correct 6 ms 2688 KB Output is correct
11 Correct 2 ms 2688 KB Output is correct
12 Correct 3 ms 2688 KB Output is correct
13 Correct 2 ms 2688 KB Output is correct
14 Correct 4 ms 2688 KB Output is correct
15 Correct 3 ms 2688 KB Output is correct
16 Correct 4 ms 2688 KB Output is correct
17 Correct 3 ms 2688 KB Output is correct
18 Correct 3 ms 2688 KB Output is correct
19 Correct 2 ms 2688 KB Output is correct
20 Correct 2 ms 2664 KB Output is correct
21 Correct 2 ms 2688 KB Output is correct
22 Correct 2 ms 2688 KB Output is correct
23 Correct 2 ms 2688 KB Output is correct
24 Correct 2 ms 2688 KB Output is correct
25 Correct 2 ms 2740 KB Output is correct
26 Correct 3 ms 2688 KB Output is correct
27 Correct 2 ms 2688 KB Output is correct
28 Correct 2 ms 2688 KB Output is correct
29 Correct 2 ms 2688 KB Output is correct
30 Correct 3 ms 2688 KB Output is correct
31 Correct 2 ms 2688 KB Output is correct
32 Correct 3 ms 2688 KB Output is correct
33 Correct 3 ms 2688 KB Output is correct
34 Correct 3 ms 2688 KB Output is correct
35 Correct 2 ms 2688 KB Output is correct

Subtask #2
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2688 KB Output is correct
2 Correct 2 ms 2688 KB Output is correct
3 Correct 2 ms 2688 KB Output is correct
4 Correct 2 ms 2688 KB Output is correct
5 Correct 2 ms 2688 KB Output is correct
6 Correct 2 ms 2688 KB Output is correct
7 Correct 2 ms 2688 KB Output is correct
8 Correct 4 ms 2688 KB Output is correct
9 Correct 4 ms 2688 KB Output is correct
10 Correct 6 ms 2688 KB Output is correct
11 Correct 2 ms 2688 KB Output is correct
12 Correct 3 ms 2688 KB Output is correct
13 Correct 2 ms 2688 KB Output is correct
14 Correct 4 ms 2688 KB Output is correct
15 Correct 3 ms 2688 KB Output is correct
16 Correct 4 ms 2688 KB Output is correct
17 Correct 3 ms 2688 KB Output is correct
18 Correct 3 ms 2688 KB Output is correct
19 Correct 2 ms 2688 KB Output is correct
20 Correct 2 ms 2664 KB Output is correct
21 Correct 2 ms 2688 KB Output is correct
22 Correct 2 ms 2688 KB Output is correct
23 Correct 2 ms 2688 KB Output is correct
24 Correct 2 ms 2688 KB Output is correct
25 Correct 2 ms 2740 KB Output is correct
26 Correct 3 ms 2688 KB Output is correct
27 Correct 2 ms 2688 KB Output is correct
28 Correct 2 ms 2688 KB Output is correct
29 Correct 2 ms 2688 KB Output is correct
30 Correct 3 ms 2688 KB Output is correct
31 Correct 2 ms 2688 KB Output is correct
32 Correct 3 ms 2688 KB Output is correct
33 Correct 3 ms 2688 KB Output is correct
34 Correct 3 ms 2688 KB Output is correct
35 Correct 2 ms 2688 KB Output is correct
36 Correct 5 ms 2688 KB Output is correct
37 Correct 17 ms 2688 KB Output is correct
38 Execution timed out 1097 ms 2688 KB Time limit exceeded
39 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 70 ms 12792 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1089 ms 2688 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 48 ms 13048 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1084 ms 2688 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 55 ms 13048 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #8
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2688 KB Output is correct
2 Correct 2 ms 2688 KB Output is correct
3 Correct 2 ms 2688 KB Output is correct
4 Correct 2 ms 2688 KB Output is correct
5 Correct 2 ms 2688 KB Output is correct
6 Correct 2 ms 2688 KB Output is correct
7 Correct 2 ms 2688 KB Output is correct
8 Correct 4 ms 2688 KB Output is correct
9 Correct 4 ms 2688 KB Output is correct
10 Correct 6 ms 2688 KB Output is correct
11 Correct 2 ms 2688 KB Output is correct
12 Correct 3 ms 2688 KB Output is correct
13 Correct 2 ms 2688 KB Output is correct
14 Correct 4 ms 2688 KB Output is correct
15 Correct 3 ms 2688 KB Output is correct
16 Correct 4 ms 2688 KB Output is correct
17 Correct 3 ms 2688 KB Output is correct
18 Correct 3 ms 2688 KB Output is correct
19 Correct 2 ms 2688 KB Output is correct
20 Correct 2 ms 2664 KB Output is correct
21 Correct 2 ms 2688 KB Output is correct
22 Correct 2 ms 2688 KB Output is correct
23 Correct 2 ms 2688 KB Output is correct
24 Correct 2 ms 2688 KB Output is correct
25 Correct 2 ms 2740 KB Output is correct
26 Correct 3 ms 2688 KB Output is correct
27 Correct 2 ms 2688 KB Output is correct
28 Correct 2 ms 2688 KB Output is correct
29 Correct 2 ms 2688 KB Output is correct
30 Correct 3 ms 2688 KB Output is correct
31 Correct 2 ms 2688 KB Output is correct
32 Correct 3 ms 2688 KB Output is correct
33 Correct 3 ms 2688 KB Output is correct
34 Correct 3 ms 2688 KB Output is correct
35 Correct 2 ms 2688 KB Output is correct
36 Correct 5 ms 2688 KB Output is correct
37 Correct 17 ms 2688 KB Output is correct
38 Execution timed out 1097 ms 2688 KB Time limit exceeded
39 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2688 KB Output is correct
2 Correct 2 ms 2688 KB Output is correct
3 Correct 2 ms 2688 KB Output is correct
4 Correct 2 ms 2688 KB Output is correct
5 Correct 2 ms 2688 KB Output is correct
6 Correct 2 ms 2688 KB Output is correct
7 Correct 2 ms 2688 KB Output is correct
8 Correct 4 ms 2688 KB Output is correct
9 Correct 4 ms 2688 KB Output is correct
10 Correct 6 ms 2688 KB Output is correct
11 Correct 2 ms 2688 KB Output is correct
12 Correct 3 ms 2688 KB Output is correct
13 Correct 2 ms 2688 KB Output is correct
14 Correct 4 ms 2688 KB Output is correct
15 Correct 3 ms 2688 KB Output is correct
16 Correct 4 ms 2688 KB Output is correct
17 Correct 3 ms 2688 KB Output is correct
18 Correct 3 ms 2688 KB Output is correct
19 Correct 2 ms 2688 KB Output is correct
20 Correct 2 ms 2664 KB Output is correct
21 Correct 2 ms 2688 KB Output is correct
22 Correct 2 ms 2688 KB Output is correct
23 Correct 2 ms 2688 KB Output is correct
24 Correct 2 ms 2688 KB Output is correct
25 Correct 2 ms 2740 KB Output is correct
26 Correct 3 ms 2688 KB Output is correct
27 Correct 2 ms 2688 KB Output is correct
28 Correct 2 ms 2688 KB Output is correct
29 Correct 2 ms 2688 KB Output is correct
30 Correct 3 ms 2688 KB Output is correct
31 Correct 2 ms 2688 KB Output is correct
32 Correct 3 ms 2688 KB Output is correct
33 Correct 3 ms 2688 KB Output is correct
34 Correct 3 ms 2688 KB Output is correct
35 Correct 2 ms 2688 KB Output is correct
36 Correct 5 ms 2688 KB Output is correct
37 Correct 17 ms 2688 KB Output is correct
38 Execution timed out 1097 ms 2688 KB Time limit exceeded
39 Halted 0 ms 0 KB -