Submission #3450907
Source Code Expand
#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<(b);++i)
#define erep(i,a,b) for(int i=a;i<=(int)(b);++i)
#define per(i,a,b) for(int i=(a);i>(b);--i)
#define eper(i,a,b) for(int i=(a);i>=b;--i)
#define pb push_back
#define mp make_pair
#define INF 100100100100
#define inf 2001001001
#define MOD 1000000007
#define ALL(x) begin(x),end(x)
using namespace std;
using ll = long long;
using pii = pair<int,int>;
using vii = vector<int>;
using vll = vector<ll>;
template<class T>using vv = vector<T>;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }
int dy[]={0, 0, 1, -1};
int dx[]={1, -1, 0, 0};
int gcd(int a,int b){return b?gcd(b,a%b):a;}
int lcm(int a,int b){return a/gcd(a, b)*b;}
int n;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n;
vii a(n);
rep(i, 0, n-1) cin >> a[i];
vii b(a);
b.insert(b.begin(), a[0]);
rep(i, 0, n-1) b[i] = min(b[i], b[i+1]);
rep(i, 0, n) cout << b[i] << (i != n-1 ? " " : "\n");
return 0;
}
Submission Info
Submission Time |
|
Task |
B - 積み鉛筆 |
User |
kage |
Language |
C++14 (GCC 5.4.1) |
Score |
80 |
Code Size |
1116 Byte |
Status |
AC |
Exec Time |
19 ms |
Memory |
1924 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 |
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 |
17 ms |
1832 KB |
subtask0_1.txt |
AC |
16 ms |
1536 KB |
subtask0_10.txt |
AC |
15 ms |
1440 KB |
subtask0_11.txt |
AC |
16 ms |
1672 KB |
subtask0_12.txt |
AC |
17 ms |
1712 KB |
subtask0_13.txt |
AC |
16 ms |
1548 KB |
subtask0_14.txt |
AC |
17 ms |
1656 KB |
subtask0_2.txt |
AC |
14 ms |
1476 KB |
subtask0_3.txt |
AC |
16 ms |
1724 KB |
subtask0_4.txt |
AC |
16 ms |
1540 KB |
subtask0_5.txt |
AC |
15 ms |
1468 KB |
subtask0_6.txt |
AC |
16 ms |
1728 KB |
subtask0_7.txt |
AC |
13 ms |
1348 KB |
subtask0_8.txt |
AC |
16 ms |
1676 KB |
subtask0_9.txt |
AC |
19 ms |
1924 KB |