oj.uz

답안 #362396

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
362396 2021-02-03T01:22:32 Z super_j6 Sailing Race (CEOI12_race) C++14
5 / 100
 582 ms 8692 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(i[0] == i[1]) dpc = 1;
		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 - 1) << " " << (x % n + 1) << endl;
	
	return 0;
}

Subtask #1
5.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 492 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 3 ms 876 KB Output isn't correct
6 Incorrect 2 ms 876 KB Output isn't correct
7 Incorrect 7 ms 1152 KB Output isn't correct
8 Incorrect 3 ms 1132 KB Output isn't correct
9 Incorrect 8 ms 1388 KB Output isn't correct
10 Correct 24 ms 1516 KB Output is correct
11 Incorrect 12 ms 1388 KB Output isn't correct
12 Incorrect 35 ms 2796 KB Output isn't correct
13 Incorrect 67 ms 4332 KB Output isn't correct
14 Incorrect 110 ms 6068 KB Output isn't correct
15 Incorrect 391 ms 8044 KB Output isn't correct
16 Incorrect 486 ms 8692 KB Output isn't correct
17 Incorrect 367 ms 8044 KB Output isn't correct
18 Incorrect 143 ms 7660 KB Output isn't correct
19 Incorrect 569 ms 8556 KB Output isn't correct
20 Incorrect 582 ms 8556 KB Output isn't correct