oj.uz

Submission #797448

# Submission time Handle Problem Language Result Execution time Memory
797448 2023-07-29T11:37:03 Z QwertyPi Roller Coaster Railroad (IOI16_railroad) C++14
0 / 100
 68 ms 12068 KB 
#include "railroad.h"
#include <bits/stdc++.h>
#define fi first
#define se second
using namespace std;

long long dp[200011];

int f(int a, int b){
	return max(0, a - b);
}

long long plan_roller_coaster(vector<int> s, vector<int> t) {
    int n = (int) s.size();
    vector<pair<int, int>> S, T;
    for(int i = 0; i < n; i++){
    	S.push_back({s[i], i});
	}
	for(int i = 0; i < n; i++){
		T.push_back({t[i], i});
	}
	sort(S.begin(), S.end());
	sort(T.begin(), T.end());
	fill(dp + 1, dp + n + 1, 1LL << 60);
	for(int i = 0; i < n; i++){
		if(S[i].se != T[i].se) dp[i + 1] = min(dp[i + 1], dp[i] + f(S[i].fi, T[i].fi));
		if(i > 0 && S[i].se != T[i - 1].se && S[i - 1].se != T[i].se) dp[i + 1] = min(dp[i + 1], dp[i - 1] + f(S[i].fi, T[i - 1].fi) + f(S[i - 1].fi, T[i].fi));
	}
    return dp[n];
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB answer is not correct: 744370413 instead of 0
2 Halted 0 ms 0 KB -

Subtask #2
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB answer is not correct: 744370413 instead of 0
2 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 68 ms 12068 KB answer is not correct: 1 instead of 0
2 Halted 0 ms 0 KB -

Subtask #4
0 / 36.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB answer is not correct: 744370413 instead of 0
2 Halted 0 ms 0 KB -