Submission #1891272


Source Code Expand

#include "bits/stdc++.h"
using namespace std;

#define DEBUG(x) cout<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cout<<#v<<":";for(int i=0;i<v.size();i++) cout<<" "<<v[i]; cout<<endl

typedef long long ll;
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
const int inf = 1000000001;
const ll INF = 2e18 * 2;
#define MOD 1000000007
#define mod 1000000009
#define pi 3.14159265358979323846
#define Sp(p) cout<<setprecision(15)<< fixed<<p<<endl;
int dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1 };
int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };

int main() {
	int n, i, j;
	cin >> n;
	vi k(n - 1), l1(n), l2(n);
	for (i = 0; i < n - 1; i++) {
		cin >> k[i];
	}
	l1[0] = k[0];
	for (i = 1; i < n - 1; i++) {
		if (k[i - 1] < k[i]) {
			l1[i] = k[i - 1];
		}
		else {
			l1[i] = k[i];
		}
	}
	l1[n - 1] = k[n - 2];
	for (i = 0; i < n; i++) {
		cout << l1[i] << " ";
	}
	cout << endl;
}

Submission Info

Submission Time
Task B - 積み鉛筆
User fuppy0716
Language C++14 (GCC 5.4.1)
Score 80
Code Size 1141 Byte
Status AC
Exec Time 52 ms
Memory 2304 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 80 / 80
Status
AC × 3
AC × 18
Set Name Test Cases
Sample sample1.txt, sample2.txt, sample3.txt
All sample1.txt, sample2.txt, sample3.txt, 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 1 ms 256 KB
sample2.txt AC 1 ms 256 KB
sample3.txt AC 1 ms 256 KB
subtask0_0.txt AC 46 ms 2176 KB
subtask0_1.txt AC 37 ms 1920 KB
subtask0_10.txt AC 34 ms 1792 KB
subtask0_11.txt AC 39 ms 2048 KB
subtask0_12.txt AC 44 ms 2048 KB
subtask0_13.txt AC 38 ms 1920 KB
subtask0_14.txt AC 41 ms 2048 KB
subtask0_2.txt AC 33 ms 1664 KB
subtask0_3.txt AC 42 ms 2048 KB
subtask0_4.txt AC 37 ms 1920 KB
subtask0_5.txt AC 34 ms 1792 KB
subtask0_6.txt AC 42 ms 2048 KB
subtask0_7.txt AC 30 ms 1664 KB
subtask0_8.txt AC 39 ms 2048 KB
subtask0_9.txt AC 52 ms 2304 KB