Submission #616061


Source Code Expand

// This template is based on http://ctylim.hatenablog.com/entry/2015/08/30/191553, provided by ctylim.
#include <iostream>
#include <iomanip>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <numeric>
#include <functional>
#include <cmath>
#include <queue>
#include <stack>
#include <utility>

#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define mrepd(i,a,b) for (int i=(b-1);i>=(a);i--)
#define rep(i,n) repd(i,0,n)
#define mrep(i,n) mrepd(i,0,n)
#define LL long long
#define MOD 1000000007
using namespace std;

template <typename T> void input_array(T * p){
  int a = sizeof(p) / sizeof(p[0]);
  rep(i, a){
    cin >> p[i];
  }
}

void input_vector(vector<int> * p, int a){
  rep(i, a){
    int input;
    cin >> input;
    p -> push_back(input);
  }
}

template <typename T>
void output(T a, int precision) {
  if (precision > 0) {
    cout << setprecision(precision)  << a << "\n";
  } else {
    cout << a << "\n";
  }
}

template <typename T>
void show_array(T arr[]) {
  rep(i, sizeof(*arr)/sizeof(arr[0])) cout << arr[i] << ' ';
  cout << endl;
}


template <typename T>
void show_vec(vector<T> vec) {
  rep(i, vec.size()) cout << vec[i] << ' ';
  cout << endl;
}

bool debug_mode;

int main() {
  int N;
  cin >> N;
  int K[N-1];
  int L[N];
  rep(i, N-1) cin >> K[i];
  L[0] = K[0];
  L[N-1] = K[N-2];
  cout << K[0] << ' ';
  repd(i, 0, N-2) cout << min(K[i-1], K[i]) << ' ';
  cout << K[N-2] << endl;
  return 0;
}

Submission Info

Submission Time
Task B - 積み鉛筆
User gdgdgutta
Language C++11 (Clang++ 3.4)
Score 0
Code Size 1533 Byte
Status WA
Exec Time 113 ms
Memory 1184 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 80
Status
WA × 3
WA × 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 WA 25 ms 800 KB
sample2.txt WA 24 ms 800 KB
sample3.txt WA 23 ms 924 KB
subtask0_0.txt WA 104 ms 1064 KB
subtask0_1.txt WA 90 ms 1184 KB
subtask0_10.txt WA 84 ms 1056 KB
subtask0_11.txt WA 95 ms 1056 KB
subtask0_12.txt WA 104 ms 1060 KB
subtask0_13.txt WA 88 ms 1056 KB
subtask0_14.txt WA 96 ms 1184 KB
subtask0_2.txt WA 82 ms 1052 KB
subtask0_3.txt WA 98 ms 1056 KB
subtask0_4.txt WA 89 ms 1060 KB
subtask0_5.txt WA 84 ms 1056 KB
subtask0_6.txt WA 103 ms 988 KB
subtask0_7.txt WA 79 ms 1052 KB
subtask0_8.txt WA 100 ms 1120 KB
subtask0_9.txt WA 113 ms 1056 KB