Submission #616027
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
#define all(c) (c).begin(),(c).end()
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define REP(i,m,n) for(int i=(int)(m);i<(int)(n);i++)
#define rep(i,n) REP(i,0,n)
#define iter(c) __typeof((c).begin())
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
#define mem(a) memset(a,0,sizeof(a))
#define pd(a) printf("%.10f\n",a)
#define pb(a) push_back(a)
#define in(a) insert(a)
#define pi M_PI
#define R cin>>
#define F first
#define S second
#define C class
#define ll long long
#define ln cout<<'\n'
#define _(_1,_2,_3,N,...)N
#define pr(...) _(__VA_ARGS__,pr3,pr2,pr1)(__VA_ARGS__)
template<C T>void pr1(T a){cout<<a;ln;}
template<C T,C T2>void pr2(T a,T2 b){cout<<a<<' '<<b;ln;}
template<C T,C T2,C T3>void pr3(T a,T2 b,T3 c){cout<<a<<' '<<b<<' '<<c;ln;}
template<C T>void PR(T a,int n){rep(i,n){if(i)cout<<' ';cout<<a[i];}ln;}
bool check(int n,int m,int x,int y){return x>=0&&x<n&&y>=0&&y<m;}
const ll MAX=1000000007,MAXL=1LL<<60,dx[4]={-1,0,1,0},dy[4]={0,1,0,-1};
typedef pair<int,int> P;
void Main() {
int n;
cin >> n;
int a[n];
rep(i,n-1) R a[i+1];
a[0]=a[1];
rep(i,n) {
if(i) cout << " ";
if(i<n-1&&a[i]>=a[i+1]) cout << a[i+1];
else cout << a[i];
}
ln;
}
int main() {
ios::sync_with_stdio(0);cin.tie(0);
Main();return 0;
}
Submission Info
Submission Time |
|
Task |
B - 積み鉛筆 |
User |
kzyKT |
Language |
C++ (GCC 4.9.2) |
Score |
80 |
Code Size |
1374 Byte |
Status |
AC |
Exec Time |
58 ms |
Memory |
1192 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
80 / 80 |
Status |
|
|
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 |
25 ms |
928 KB |
sample2.txt |
AC |
25 ms |
804 KB |
sample3.txt |
AC |
26 ms |
816 KB |
subtask0_0.txt |
AC |
57 ms |
1052 KB |
subtask0_1.txt |
AC |
54 ms |
1188 KB |
subtask0_10.txt |
AC |
51 ms |
1064 KB |
subtask0_11.txt |
AC |
54 ms |
1192 KB |
subtask0_12.txt |
AC |
56 ms |
1052 KB |
subtask0_13.txt |
AC |
52 ms |
1188 KB |
subtask0_14.txt |
AC |
57 ms |
1192 KB |
subtask0_2.txt |
AC |
51 ms |
1064 KB |
subtask0_3.txt |
AC |
55 ms |
1060 KB |
subtask0_4.txt |
AC |
54 ms |
1188 KB |
subtask0_5.txt |
AC |
51 ms |
1048 KB |
subtask0_6.txt |
AC |
55 ms |
1060 KB |
subtask0_7.txt |
AC |
49 ms |
1064 KB |
subtask0_8.txt |
AC |
55 ms |
1192 KB |
subtask0_9.txt |
AC |
58 ms |
1192 KB |