Submission #36704

# Submission time Handle Problem Language Result Execution time Memory
36704 2017-12-13T09:50:14 Z RockyB Sailing Race (CEOI12_race) C++14
40 / 100
583 ms 6560 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)500 + 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][2][2];
int calc(int l, int r, bool type, bool f) {
	if (~dp[l][r][type][f]) return dp[l][r][type][f];
	int v = !f ? l : r;
	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(l, to, type, 1), calc(to, r, type, 0)) + 1);
			}
		}
		else {
			if (!(l < to && to < r)) {
				if (to > r) {
					res = max(res, max(calc(l, to, 0, 1), calc(r, to, 1, 1)) + 1);
				}
				else {
					res = max(res, max(calc(to, l, 1, 0), calc(to, r, 0, 0)) + 1);
				}
			}
		}
	}
	return dp[l][r][type][f] = res;
}
int main() {
	#ifdef IOI2018
		freopen ("in.txt", "r", stdin);
	#endif
	scanf ("%d%d", &n, &k);
	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) {
		printf ("0\n1");
		ioi
	}
	if (!k || k) {
		int mx = 0, opt = 1;
		memset(dp, -1, sizeof(dp));
		for (int i = 1; i <= n; i++) {
			for (int j = 1; j <= n; j++) {
				if (i == j || !ok[i][j]) continue;
				int now = max(calc(min(i, j), max(i, j), 0, i < j), calc(min(i, j), max(i, j), 1, i < j)) + 1;
				if (now > mx) {
					mx = now;
					opt = i;
				}
			}
		}
		printf ("%d\n%d", mx + k * 2, opt);
		ioi
	}
	else assert(0);
	ioi
}

Compilation message

race.cpp: In function 'int main()':
race.cpp:67:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf ("%d%d", &n, &k);
                        ^
# Verdict Execution time Memory Grader output
1 Correct 0 ms 6296 KB Output is correct
2 Incorrect 0 ms 6296 KB Output isn't correct
3 Incorrect 0 ms 6296 KB Output isn't correct
4 Incorrect 3 ms 6296 KB Output isn't correct
5 Correct 3 ms 6296 KB Output is correct
6 Incorrect 0 ms 6296 KB Output isn't correct
7 Correct 6 ms 6296 KB Output is correct
8 Incorrect 3 ms 6296 KB Output isn't correct
9 Correct 6 ms 6296 KB Output is correct
10 Correct 16 ms 6428 KB Output is correct
11 Correct 6 ms 6296 KB Output is correct
12 Incorrect 23 ms 6296 KB Output isn't correct
13 Incorrect 53 ms 6296 KB Output isn't correct
14 Correct 103 ms 6428 KB Output is correct
15 Incorrect 309 ms 6428 KB Output isn't correct
16 Incorrect 419 ms 6560 KB Output isn't correct
17 Incorrect 376 ms 6428 KB Output isn't correct
18 Correct 139 ms 6428 KB Output is correct
19 Incorrect 509 ms 6560 KB Output isn't correct
20 Incorrect 583 ms 6560 KB Output isn't correct