oj.uz

답안 #36692

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
36692 2017-12-13T09:05:44 Z RockyB Sailing Race (CEOI12_race) C++11
5 / 100
 3000 ms 32280 KB 
/// In The Name Of God

#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,sse3,sse4,popcnt,abm,mmx")

#include <bits/stdc++.h>

#define f first
#define s second

#define pb push_back
#define pp pop_back
#define mp make_pair

#define sz(x) (int)x.size()
#define sqr(x) ((x) * 1ll * (x))
#define all(x) x.begin(), x.end()

#define Kazakhstan ios_base :: sync_with_stdio(0), cin.tie(0), cout.tie(0);

#define nl '\n'
#define ioi exit(0);

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;

const int N = (int)150 + 7, inf = (int)1e9 + 7, mod = (int)1e9 + 7;
const ll linf = (ll)1e18 + 7;
const int dx[] = {-1, 0, 1, 0, 1, -1, -1, 1}, dy[] = {0, 1, 0, -1, 1, -1, 1, -1};

using namespace std;

int n, k;
vector <int> g[N];
bool ok[N][N];

int dp[N][N][N][2];
int calc(int v, int l, int r, int type) {
	if (~dp[v][l][r][type]) return dp[v][l][r][type];
	int res = 0;
	for (auto to : g[v]) {
		if (to == l || to == r) continue;
		if (type) {
			if (l < to && to < r) {
				res = max(res, max(calc(to, l, to, type), calc(to, to, r, type)) + 1);
			}
		}
	}
	return dp[v][l][r][type] = res;
}
int main() {
	#ifdef IOI2018
		freopen ("in.txt", "r", stdin);
	#endif
	scanf ("%d%d", &n, &k);
	assert(0 <= k && k <= 1);
	assert(n <= 150);
	for (int i = 1; i <= n; i++) {
		int to;
		while (scanf ("%d", &to) && to) {
			ok[i][to] = 1;
			g[i].pb(to);
		}
	}
	if (n == 1) {
		assert(0);
		printf ("0\n1");
		ioi
	}
	if (!k) {
		int mx = -inf, opt = -1;
		
		for (int i = 1; i <= n; i++) {
			for (int j = 1; j <= n; j++) {
				if (i == j || !ok[i][j]) continue;
				memset(dp, -1, sizeof(dp));
				int now = calc(j, min(i, j), max(i, j), 1) + 1;
				if (now > mx) {
					mx = now;
					opt = i;
				}
			}
		}
		printf ("%d\n%d", mx, opt);
		ioi
	}
	else assert(0);
	ioi
}

Compilation message

race.cpp: In function 'int main()':
race.cpp:56:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf ("%d%d", &n, &k);
                        ^

Subtask #1
5.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 53 ms 32276 KB Output is correct
2 Runtime error 0 ms 32280 KB Execution killed because of forbidden syscall gettid (186)
3 Runtime error 0 ms 32280 KB Execution killed because of forbidden syscall gettid (186)
4 Runtime error 0 ms 32280 KB Execution killed because of forbidden syscall gettid (186)
5 Execution timed out 3000 ms 32276 KB Execution timed out
6 Runtime error 0 ms 32280 KB Execution killed because of forbidden syscall gettid (186)
7 Execution timed out 3000 ms 32276 KB Execution timed out
8 Runtime error 0 ms 32280 KB Execution killed because of forbidden syscall gettid (186)
9 Execution timed out 3000 ms 32276 KB Execution timed out
10 Execution timed out 3000 ms 32276 KB Execution timed out
11 Execution timed out 3000 ms 32276 KB Execution timed out
12 Runtime error 0 ms 32280 KB Execution killed because of forbidden syscall gettid (186)
13 Runtime error 0 ms 32280 KB Execution killed because of forbidden syscall gettid (186)
14 Runtime error 0 ms 32280 KB Execution killed because of forbidden syscall gettid (186)
15 Runtime error 0 ms 32280 KB Execution killed because of forbidden syscall gettid (186)
16 Runtime error 0 ms 32280 KB Execution killed because of forbidden syscall gettid (186)
17 Runtime error 0 ms 32280 KB Execution killed because of forbidden syscall gettid (186)
18 Runtime error 0 ms 32280 KB Execution killed because of forbidden syscall gettid (186)
19 Runtime error 0 ms 32280 KB Execution killed because of forbidden syscall gettid (186)
20 Runtime error 0 ms 32280 KB Execution killed because of forbidden syscall gettid (186)