Submission #8017735


Source Code Expand

#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;

int main() {
  int N; cin >> N;
  vector<int> K(N);
  for(int i = 0; i < N-1; i++) {
    cin >> K[i];
  }
  K[N-1] = K[N-2];
  vector<int> L(N);
  for(int i = 0; i < N; i++) {
    if(i == 0 || i == 1) L[i] = K[0];
    else L[i] = min(K[i], K[i-1]);
  }
  for(int i = 0; i < N; i++) {
    cout << L[i];
    if(i == N-1) cout << endl;
    else cout << " ";
  }
  return 0;
}

Submission Info

Submission Time
Task B - 積み鉛筆
User atsuyoshi
Language C++14 (GCC 5.4.1)
Score 0
Code Size 478 Byte
Status WA
Exec Time 49 ms
Memory 1920 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 80
Status
AC × 3
AC × 16
WA × 2
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 44 ms 1792 KB
subtask0_1.txt AC 37 ms 1536 KB
subtask0_10.txt AC 34 ms 1408 KB
subtask0_11.txt WA 39 ms 1664 KB
subtask0_12.txt WA 43 ms 1792 KB
subtask0_13.txt AC 35 ms 1536 KB
subtask0_14.txt AC 41 ms 1664 KB
subtask0_2.txt AC 33 ms 1408 KB
subtask0_3.txt AC 42 ms 1664 KB
subtask0_4.txt AC 36 ms 1536 KB
subtask0_5.txt AC 34 ms 1408 KB
subtask0_6.txt AC 41 ms 1664 KB
subtask0_7.txt AC 30 ms 1280 KB
subtask0_8.txt AC 38 ms 1664 KB
subtask0_9.txt AC 49 ms 1920 KB