Submission #616037
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
#define loop for(;;)
#define trace(var) cerr<<">>> "<<#var<<" = "<<var<<endl;
#define all(v) begin(v),end(v)
#define pb push_back
#define inf (1e9)
#define eps (1e-9)
using Integer = long long;
using Real = long double;
const Real PI = acosl(-1);
using P = pair<int, int>;
template<class S, class T> inline
ostream& operator<<(ostream&os, pair<S,T> p) {
return os << '(' << p.first << ", " << p.second << ')';
}
template<class T, class U> inline
ostream& operator<<(ostream&os, tuple<T,U> t) {
return os << '('
<< get<0>(t) << ", "
<< get<1>(t) << ')';
}
template<class S, class T, class U> inline
ostream& operator<<(ostream&os, tuple<S,T,U> t) {
return os << '('
<< get<0>(t) << ", "
<< get<1>(t) << ", "
<< get<2>(t) << ')';
}
template<class T> inline
ostream& operator<<(ostream&os, set<T> v) {
os << "(set";
for (T item: v) os << ' ' << item;
os << ")";
return os;
}
template<class T> inline
ostream& operator<<(ostream&os, vector<T> v) {
if (v.size() == 0) { return os << "(empty)"; }
os << v[0];
for (int i=1, len=v.size(); i<len; ++i) os << ' ' << v[i];
return os;
}
template<class T> inline
istream& operator>>(istream&is, vector<T>&v) {
rep (i, v.size()) is >> v[i];
return is;
}
// ^ > v <
int dx[] = { -1, 0, 1, 0 };
int dy[] = { 0, 1, 0, -1 };
using vi = vector<int>;
using vvi = vector<vi>;
using vd = vector<double>;
using vvd = vector<vd>;
using vb = vector<bool>;
const string A = "Takahashi";
const string B = "Aoki";
Integer lcm(int a,int b){ int c = __gcd(a,b); return a/c * b; }
int main() {
cin.tie(0);
ios::sync_with_stdio(0);
cout.setf(ios::fixed);
cout.precision(10);
random_device dev;
mt19937 rand(dev());
int n; cin >> n;
vi xs(n-1); cin >> xs;
cout << xs[0];
rep (i, n-2) {
cout << ' ' << min(xs[i], xs[i+1]);
}
cout << ' ';
cout << xs[n-2];
cout << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
B - 積み鉛筆 |
User |
cympfh |
Language |
C++11 (GCC 4.9.2) |
Score |
80 |
Code Size |
2086 Byte |
Status |
AC |
Exec Time |
60 ms |
Memory |
1304 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 |
27 ms |
800 KB |
sample2.txt |
AC |
26 ms |
804 KB |
sample3.txt |
AC |
25 ms |
740 KB |
subtask0_0.txt |
AC |
55 ms |
1056 KB |
subtask0_1.txt |
AC |
53 ms |
1120 KB |
subtask0_10.txt |
AC |
51 ms |
1192 KB |
subtask0_11.txt |
AC |
54 ms |
1296 KB |
subtask0_12.txt |
AC |
55 ms |
1120 KB |
subtask0_13.txt |
AC |
53 ms |
1296 KB |
subtask0_14.txt |
AC |
54 ms |
1304 KB |
subtask0_2.txt |
AC |
48 ms |
1060 KB |
subtask0_3.txt |
AC |
53 ms |
1060 KB |
subtask0_4.txt |
AC |
51 ms |
1180 KB |
subtask0_5.txt |
AC |
50 ms |
1048 KB |
subtask0_6.txt |
AC |
55 ms |
1180 KB |
subtask0_7.txt |
AC |
48 ms |
1068 KB |
subtask0_8.txt |
AC |
54 ms |
1140 KB |
subtask0_9.txt |
AC |
60 ms |
1196 KB |