Submission #616164
Source Code Expand
#include <iostream> #include <string> #include <vector> #include <algorithm> #include <climits> #include <cfloat> #include <cstdio> #include <cstring> #include <map> #include <cmath> #include <stack> #include <complex> #include <queue> #include <set> #include <cassert> using namespace std; const double EPS = 1e-14; #define REP(i,n) for(int i=0;i<n;i++) #define ALL(v) (v).begin(), (v).end() #define ZERO(a) memset(a,0,sizeof(a)) #define MINUS(a) memset(a,0xff,sizeof(a)) #define INF LLONG_MAX/3 #define DINF DBL_MAX/2 #define MOD 1000000007 #define PB(x) push_back(x) #define MP(x,y) make_pair((x),(y)) #define debug(x) cout<<#x<<":"<<x<<endl typedef long long ll; typedef long long LL; typedef pair<int, int> pii; typedef vector<int> vi; typedef vector<LL> vLL; typedef vector<ll> vll; typedef map<ll, ll> mll; typedef map<int, int> mii; template<class T> T gcd(T a, T b){ return b ? gcd(b, a%b) : a; } int main(){ int N; cin >> N; ll K[100001]; REP(i, N-1) cin >> K[i]; vi ans(N); ans[0] = K[0]; ans[N - 1] = K[N - 2]; for (int i = 1; i <= N - 2; i++){ if (ans[i - 1] == K[i - 1]){ ans[i] = min(K[i - 1], K[i]); } else{ ans[i] = K[i - 1]; } } for (int i = 0; i < N - 1; i++){ cout << ans[i] << " "; } cout << ans[N - 1] << endl; }
Submission Info
Submission Time | |
---|---|
Task | B - 積み鉛筆 |
User | chakku000 |
Language | C++ (GCC 4.9.2) |
Score | 80 |
Code Size | 1326 Byte |
Status | AC |
Exec Time | 116 ms |
Memory | 1956 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 | 26 ms | 932 KB |
sample2.txt | AC | 28 ms | 800 KB |
sample3.txt | AC | 26 ms | 792 KB |
subtask0_0.txt | AC | 106 ms | 1824 KB |
subtask0_1.txt | AC | 92 ms | 1956 KB |
subtask0_10.txt | AC | 86 ms | 1820 KB |
subtask0_11.txt | AC | 96 ms | 1832 KB |
subtask0_12.txt | AC | 105 ms | 1700 KB |
subtask0_13.txt | AC | 91 ms | 1828 KB |
subtask0_14.txt | AC | 100 ms | 1956 KB |
subtask0_2.txt | AC | 88 ms | 1704 KB |
subtask0_3.txt | AC | 102 ms | 1696 KB |
subtask0_4.txt | AC | 93 ms | 1892 KB |
subtask0_5.txt | AC | 88 ms | 1692 KB |
subtask0_6.txt | AC | 102 ms | 1708 KB |
subtask0_7.txt | AC | 78 ms | 1700 KB |
subtask0_8.txt | AC | 95 ms | 1876 KB |
subtask0_9.txt | AC | 116 ms | 1836 KB |