oj.uz

답안 #364147

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
364147 2021-02-08T09:57:14 Z super_j6 Sailing Race (CEOI12_race) C++14
40 / 100
 554 ms 8556 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[!l];
			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
40.0 / 100.0

# 결과 실행 시간 메모리 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 Correct 2 ms 876 KB Output is correct
6 Incorrect 2 ms 876 KB Output isn't correct
7 Correct 7 ms 1132 KB Output is correct
8 Incorrect 3 ms 1132 KB Output isn't correct
9 Correct 8 ms 1260 KB Output is correct
10 Correct 25 ms 1516 KB Output is correct
11 Correct 12 ms 1388 KB Output is correct
12 Incorrect 34 ms 2668 KB Output isn't correct
13 Incorrect 66 ms 4332 KB Output isn't correct
14 Correct 109 ms 5868 KB Output is correct
15 Incorrect 363 ms 7916 KB Output isn't correct
16 Incorrect 463 ms 8320 KB Output isn't correct
17 Incorrect 362 ms 7916 KB Output isn't correct
18 Correct 145 ms 7532 KB Output is correct
19 Incorrect 554 ms 8556 KB Output isn't correct
20 Incorrect 553 ms 8428 KB Output isn't correct