Submission #773851

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>

using namespace std;


#define mins(a,b) a = min(a,b)
#define rep(i,n) for(int i = 0; i < n; i++)
#define REP(i,j,n) for(int i = j; i < n; i++)

const int INF = 1001001001;


int main(){

	int n;
	cin >> n;
	vector<int> a(n+5);
	for(int i = 0; i < n; ++i){
		cin >> a[i];
	}

	vector<int> dp(n+5, INF);
	dp[0] = 0;
	for(int i = 0; i < n; ++i){
		mins(dp[i+1], dp[i] + abs(a[i]-a[i+1]));
		mins(dp[i+2], dp[i] + abs(a[i]-a[i+2]));		
	}

	cout << dp[n-1] <<endl;

	return 0;
}

Submission Info

Submission Time
Task C - 柱柱柱柱柱
User yori1029
Language C++14 (GCC 5.4.1)
Score 100
Code Size 608 Byte
Status AC
Exec Time 49 ms
Memory 1024 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 3
AC × 10
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All sample_01.txt, sample_02.txt, sample_03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt
Case Name Status Exec Time Memory
sample_01.txt AC 4 ms 256 KiB
sample_02.txt AC 4 ms 256 KiB
sample_03.txt AC 4 ms 256 KiB
subtask1_01.txt AC 4 ms 256 KiB
subtask1_02.txt AC 4 ms 256 KiB
subtask1_03.txt AC 4 ms 256 KiB
subtask1_04.txt AC 49 ms 1024 KiB
subtask1_05.txt AC 49 ms 1024 KiB
subtask1_06.txt AC 49 ms 1024 KiB
subtask1_07.txt AC 49 ms 1024 KiB