oj.uz

Submission #364013

# Submission time Handle Problem Language Result Execution time Memory
364013 2021-02-08T03:12:02 Z super_j6 Sailing Race (CEOI12_race) C++14
5 / 100
 602 ms 8428 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] = {0}; i[0] < 2 * n; i[0]++)
	for(i[1] = i[0]; i[1] < 2 * 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; p < 2; p++){
			if((l > i[p]) == p){
				int ii[2];
				ii[!p] = i[!p], ii[p] = l;
				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
5.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB Output isn't 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 2 ms 896 KB Output isn't correct
6 Incorrect 3 ms 876 KB Output isn't correct
7 Incorrect 8 ms 1132 KB Output isn't correct
8 Incorrect 3 ms 1132 KB Output isn't correct
9 Incorrect 9 ms 1260 KB Output isn't correct
10 Correct 24 ms 1516 KB Output is correct
11 Incorrect 12 ms 1400 KB Output isn't correct
12 Incorrect 34 ms 2668 KB Output isn't correct
13 Incorrect 62 ms 4332 KB Output isn't correct
14 Incorrect 110 ms 5868 KB Output isn't correct
15 Incorrect 381 ms 7916 KB Output isn't correct
16 Incorrect 465 ms 8348 KB Output isn't correct
17 Incorrect 372 ms 8044 KB Output isn't correct
18 Incorrect 146 ms 7404 KB Output isn't correct
19 Incorrect 549 ms 8388 KB Output isn't correct
20 Incorrect 602 ms 8428 KB Output isn't correct