oj.uz

Submission #364146

# Submission time Handle Problem Language Result Execution time Memory
364146 2021-02-08T09:56:35 Z super_j6 Sailing Race (CEOI12_race) C++14
10 / 100
 1008 ms 8684 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, m;
int dp[mxn][mxn][2];
vector<int> g[mxn];
 
int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> n >> m;
	
	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] = {0}; i[1] < 2 * n; i[1]++)
	for(i[0] = i[1]; ~i[0] && i[1] - i[0] < n; i[0]--)
	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 k : g[i[j]])
		for(int l = 0, ii[2]; l < 2; l++) if((k > i[l]) == l){
			ii[l] = k, ii[!l] = i[!k];
			dp[ii[0]][ii[1]][l] = max(dp[ii[0]][ii[1]][l], 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 620 KB Output isn't correct
4 Incorrect 1 ms 748 KB Output isn't correct
5 Incorrect 3 ms 876 KB Output isn't correct
6 Incorrect 3 ms 876 KB Output isn't correct
7 Incorrect 10 ms 1132 KB Output isn't correct
8 Incorrect 4 ms 1132 KB Output isn't correct
9 Incorrect 13 ms 1260 KB Output isn't correct
10 Correct 39 ms 1516 KB Output is correct
11 Incorrect 19 ms 1388 KB Output isn't correct
12 Incorrect 54 ms 2796 KB Output isn't correct
13 Incorrect 98 ms 4332 KB Output isn't correct
14 Incorrect 174 ms 5868 KB Output isn't correct
15 Incorrect 640 ms 8004 KB Output isn't correct
16 Incorrect 990 ms 8300 KB Output isn't correct
17 Incorrect 638 ms 7816 KB Output isn't correct
18 Incorrect 229 ms 7660 KB Output isn't correct
19 Incorrect 1008 ms 8684 KB Output isn't correct
20 Incorrect 944 ms 8496 KB Output isn't correct