Submission #615971


Source Code Expand

#include <iostream>
#include <vector>
#include <string>
#include <algorithm>

#define rep(i,n) for(int i=0; i<(n); i++)
#define rrep(i,n) for(int i=(n)-1; i>=0; i--)
#define all(X) (X).begin(),(X).end()

using namespace std;
// 型
typedef long long int ll;
typedef pair<int,int> P;
// 比較&代入
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }

const int INF = 0x3fffffff;


int main(){
	int N, K[100005], ans[100005]={};

	cin >> N;
	rep(i,N-1){
		cin >> K[i];
		if( i > 0 ){
			ans[i] = min(K[i-1], K[i]);
		}else{
			ans[i] = K[i];
		}
	}
	ans[N-1] = K[N-2];

	rep(i,N)
		cout << ans[i] << " ";
	cout << endl;

	return 0;
}

Submission Info

Submission Time
Task B - 積み鉛筆
User oyas
Language C++11 (GCC 4.9.2)
Score 80
Code Size 801 Byte
Status AC
Exec Time 118 ms
Memory 1572 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 80 / 80
Status
AC × 3
AC × 15
Set Name Test Cases
Sample sample1.txt, sample2.txt, sample3.txt
All subtask0_0.txt, subtask0_1.txt, subtask0_10.txt, subtask0_11.txt, subtask0_12.txt, subtask0_13.txt, subtask0_14.txt, subtask0_2.txt, subtask0_3.txt, subtask0_4.txt, subtask0_5.txt, subtask0_6.txt, subtask0_7.txt, subtask0_8.txt, subtask0_9.txt
Case Name Status Exec Time Memory
sample1.txt AC 28 ms 1180 KB
sample2.txt AC 26 ms 1120 KB
sample3.txt AC 27 ms 1188 KB
subtask0_0.txt AC 105 ms 1444 KB
subtask0_1.txt AC 89 ms 1572 KB
subtask0_10.txt AC 84 ms 1448 KB
subtask0_11.txt AC 95 ms 1572 KB
subtask0_12.txt AC 103 ms 1436 KB
subtask0_13.txt AC 86 ms 1432 KB
subtask0_14.txt AC 96 ms 1560 KB
subtask0_2.txt AC 87 ms 1440 KB
subtask0_3.txt AC 99 ms 1424 KB
subtask0_4.txt AC 91 ms 1572 KB
subtask0_5.txt AC 89 ms 1444 KB
subtask0_6.txt AC 100 ms 1444 KB
subtask0_7.txt AC 82 ms 1436 KB
subtask0_8.txt AC 93 ms 1444 KB
subtask0_9.txt AC 118 ms 1500 KB