Submission #616140
Source Code Expand
// Standard I/O
#include <iostream>
#include <sstream>
#include <cstdio>
// Standard Library
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <cmath>
// Template Class
#include <complex>
#include <string>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
// Container Control
#include <algorithm>
using namespace std;
#define rep( i, n ) for( int i = 0; i < n; ++i )
#define irep( i, n ) for( int i = n-1; i >= 0; --i )
#define reep( i, s, n ) for ( int i = s; i < n; ++i )
#define ireep( i, n, s ) for ( int i = n-1; i >= s; --i )
#define foreach(itr, x) for( typeof(x.begin()) itr = x.begin(); itr != x.end(); ++itr)
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define all( v ) v.begin(), v.end()
#define fs first
#define sc second
#define vc vector
// for visualizer.html
double SCALE = 1.0;
double OFFSET_X = 0.0;
double OFFSET_Y = 0.0;
#define LINE(x,y,a,b) cerr << "line(" << SCALE*(x) + OFFSET_X << "," \
<< SCALE*(y) + OFFSET_Y << "," \
<< SCALE*(a) + OFFSET_X << "," \
<< SCALE*(b) + OFFSET_Y << ")" << endl;
#define CIRCLE(x,y,r) cerr << "circle(" << SCALE*(x) + OFFSET_X << "," \
<< SCALE*(y) + OFFSET_Y << "," \
<< SCALE*(r) << ")" << endl;
typedef long long ll;
typedef complex<double> Point;
typedef pair<int, int> pii;
typedef pair<int, pii> ipii;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector< vector<int> > vii;
typedef vector< vector<double> > vdd;
typedef vector<int>::iterator vi_itr;
const int IINF = 1 << 28;
const double INF = 1e30;
const double EPS = 1e-10;
const double PI = acos(-1.0);
// Direction : L U R D
const int dx[] = { -1, 0, 1, 0};
const int dy[] = { 0, -1, 0, 1 };
int n, K[100000], L[100001];
int main()
{
cin >> n;
rep(i, n-1) cin >>K[i];
L[0] = 1;
rep(i, n-1){
if( i-1 >= 0 && K[i-1] > K[i] ) L[i] = L[i+1] = K[i];
else L[i+1] = K[i];
}
rep(i, n){
if( i != 0 ) cout << " ";
cout << L[i];
}
cout << endl;
}
Submission Info
Submission Time |
|
Task |
B - 積み鉛筆 |
User |
gyuuto |
Language |
C++11 (GCC 4.9.2) |
Score |
0 |
Code Size |
2099 Byte |
Status |
WA |
Exec Time |
115 ms |
Memory |
1572 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
0 / 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 |
29 ms |
804 KB |
sample2.txt |
AC |
25 ms |
796 KB |
sample3.txt |
AC |
25 ms |
916 KB |
subtask0_0.txt |
AC |
109 ms |
1444 KB |
subtask0_1.txt |
AC |
91 ms |
1552 KB |
subtask0_10.txt |
AC |
86 ms |
1432 KB |
subtask0_11.txt |
WA |
95 ms |
1444 KB |
subtask0_12.txt |
WA |
106 ms |
1444 KB |
subtask0_13.txt |
AC |
93 ms |
1500 KB |
subtask0_14.txt |
AC |
101 ms |
1572 KB |
subtask0_2.txt |
AC |
85 ms |
1316 KB |
subtask0_3.txt |
AC |
101 ms |
1444 KB |
subtask0_4.txt |
AC |
90 ms |
1444 KB |
subtask0_5.txt |
AC |
87 ms |
1344 KB |
subtask0_6.txt |
AC |
101 ms |
1432 KB |
subtask0_7.txt |
AC |
84 ms |
1320 KB |
subtask0_8.txt |
AC |
94 ms |
1444 KB |
subtask0_9.txt |
AC |
115 ms |
1436 KB |