oj.uz

Submission #364140

# Submission time Handle Problem Language Result Execution time Memory
364140 2021-02-08T09:51:37 Z super_j6 Sailing Race (CEOI12_race) C++14
10 / 100
 174 ms 5484 KB 
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
using namespace std;
#define endl '\n'
#define ll long long
#define pi pair<int, int>
#define f first
#define s second
 
const int mxn = 1000;
int n, k;
int dp[mxn][mxn][2];
vector<int> g[mxn];
 
int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> n >> k;
	
	for(int i = 0, x; i < n; i++)
	for(cin >> x; x; cin >> x)
	for(int j = 0; j < 2; j++)
	for(int l = 0; l < 2; l++){
		g[l * n + x - 1].push_back(j * n + i);
	}
	
	int ret = 0, x = 0;
	for(int i[2] = {2 * n - 1}; ~i[0]; i[0]--)
	for(i[1] = i[0]; i[1] < n && i[1] - i[0] < n; i[1]++)
	for(int j = 0; j < 2; j++){
		int &dpc = dp[i[0]][i[1]][j];
		if(dpc > ret) ret = dpc, x = i[j];
		for(int l : g[i[j]])
		for(int p = 0, ii[2]; p < 2; p++) if((l > i[p]) == p){
			ii[p] = l, ii[!p] = i[!p];
			dp[ii[0]][ii[1]][p] = max(dp[ii[0]][ii[1]][p], dpc + 1);
		}
	}
	
	cout << ret << " " << (x % n + 1) << endl;
	
	return 0;
}

Subtask #1
10.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Incorrect 1 ms 492 KB Output isn't correct
3 Incorrect 1 ms 492 KB Output isn't correct
4 Incorrect 1 ms 492 KB Output isn't correct
5 Incorrect 1 ms 620 KB Output isn't correct
6 Incorrect 1 ms 620 KB Output isn't correct
7 Incorrect 4 ms 748 KB Output isn't correct
8 Incorrect 2 ms 748 KB Output isn't correct
9 Incorrect 3 ms 876 KB Output isn't correct
10 Correct 9 ms 1132 KB Output is correct
11 Incorrect 5 ms 1004 KB Output isn't correct
12 Incorrect 12 ms 1900 KB Output isn't correct
13 Incorrect 21 ms 2796 KB Output isn't correct
14 Incorrect 36 ms 3692 KB Output isn't correct
15 Incorrect 112 ms 4972 KB Output isn't correct
16 Incorrect 144 ms 5484 KB Output isn't correct
17 Incorrect 111 ms 4972 KB Output isn't correct
18 Incorrect 45 ms 4588 KB Output isn't correct
19 Incorrect 174 ms 5484 KB Output isn't correct
20 Incorrect 173 ms 5484 KB Output isn't correct