Submission #3194737
Source Code Expand
#include <bits/stdc++.h> using namespace std; using ll = long long; using P = pair<int, int>; const ll MOD = 1000000007; int main(){ ll N; cin >> N; vector<ll> A(N + 2); A[0] = 0; A[N + 1] = 0; for(int i=1;i<=N;i++){ cin >> A[i]; } ll s = 0; for(int i=1;i<N+2;i++){ s += abs(A[i] - A[i - 1]); } for(int i=1;i<N+1;i++){ ll diff = abs(A[i - 1] - A[i + 1]) - (abs(A[i] - A[i - 1]) + abs(A[i] - A[i + 1])); cout << s + diff << endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Traveling Plan |
User | zaburo |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 561 Byte |
Status | AC |
Exec Time | 184 ms |
Memory | 2048 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample-01.txt, sample-02.txt, sample-03.txt |
All | 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, sample-01.txt, sample-02.txt, sample-03.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | AC | 179 ms | 2048 KB |
02.txt | AC | 181 ms | 2048 KB |
03.txt | AC | 1 ms | 256 KB |
04.txt | AC | 179 ms | 2048 KB |
05.txt | AC | 184 ms | 2048 KB |
06.txt | AC | 178 ms | 2048 KB |
07.txt | AC | 180 ms | 2048 KB |
08.txt | AC | 178 ms | 2048 KB |
09.txt | AC | 177 ms | 1664 KB |
10.txt | AC | 179 ms | 1664 KB |
11.txt | AC | 180 ms | 1664 KB |
12.txt | AC | 172 ms | 1664 KB |
sample-01.txt | AC | 1 ms | 256 KB |
sample-02.txt | AC | 1 ms | 256 KB |
sample-03.txt | AC | 1 ms | 256 KB |