Submission #1089811


Source Code Expand

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;

#define FOR(i, a, n) for (int i = (int)a; i < (int)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define MOD 1000000007
#define INF 1000000000
#define PI 3.14159265359
#define EPS 1e-12

int main(void)
{
  int n, k[100010];
  cin >> n;
  REP(i, n-1) cin >> k[i];

  int ans[10010];
  ans[0] = k[0];
  FOR(i, 1, n-1) {
    if(k[i] >= k[i-1]) {
      ans[i] = k[i-1];
    } 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 ferin_tech
Language C++11 (GCC 4.9.2)
Score 80
Code Size 768 Byte
Status AC
Exec Time 70 ms
Memory 1188 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 20 ms 916 KB
sample2.txt AC 18 ms 796 KB
sample3.txt AC 17 ms 800 KB
subtask0_0.txt AC 65 ms 1180 KB
subtask0_1.txt AC 57 ms 1140 KB
subtask0_10.txt AC 54 ms 1132 KB
subtask0_11.txt AC 60 ms 1132 KB
subtask0_12.txt AC 66 ms 1064 KB
subtask0_13.txt AC 55 ms 1188 KB
subtask0_14.txt AC 61 ms 1132 KB
subtask0_2.txt AC 54 ms 1120 KB
subtask0_3.txt AC 64 ms 1120 KB
subtask0_4.txt AC 59 ms 1184 KB
subtask0_5.txt AC 54 ms 1052 KB
subtask0_6.txt AC 63 ms 1140 KB
subtask0_7.txt AC 50 ms 1132 KB
subtask0_8.txt AC 60 ms 1188 KB
subtask0_9.txt AC 70 ms 1180 KB