답안 #364066

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
364066 2021-02-08T07:47:28 Z super_j6 Sailing Race (CEOI12_race) C++14
0 / 100
592 ms 9708 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[2][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++){
		int u = j * n + i, v = l * n + x - 1;
		g[0][u].push_back(v);
		g[1][v].push_back(u);
	}
	
	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];
		for(int p = 0; p < 2; p++)
		for(int l : g[p][i[j ^ p]]) if(l >= i[0] && l <= i[1]){
			int ii[2];
			ii[j] = l, ii[!j] = i[!j];
			dpc = max(dpc, dp[ii[0]][ii[1]][j ^ p] + 1);
		}
		if(dpc > ret) ret = dpc, x = i[j];
	}
	
	cout << ret << " " << (x % n + 1) << endl;
	
	return 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 2 ms 876 KB Output isn't correct
6 Incorrect 3 ms 1004 KB Output isn't correct
7 Incorrect 7 ms 1132 KB Output isn't correct
8 Incorrect 4 ms 1132 KB Output isn't correct
9 Incorrect 12 ms 1388 KB Output isn't correct
10 Incorrect 28 ms 1772 KB Output isn't correct
11 Incorrect 13 ms 1516 KB Output isn't correct
12 Incorrect 37 ms 2796 KB Output isn't correct
13 Incorrect 67 ms 4460 KB Output isn't correct
14 Incorrect 137 ms 5996 KB Output isn't correct
15 Incorrect 362 ms 8556 KB Output isn't correct
16 Incorrect 466 ms 9452 KB Output isn't correct
17 Incorrect 366 ms 8556 KB Output isn't correct
18 Incorrect 152 ms 7788 KB Output isn't correct
19 Incorrect 545 ms 9452 KB Output isn't correct
20 Incorrect 592 ms 9708 KB Output isn't correct