Submission #2832615
Source Code Expand
#include<iostream> #include<vector> #include<algorithm> #include<cstdio> #include<cstdlib> #include<string> #include<sstream> #include<cmath> #include<numeric> #include<map> #include<stack> #include<queue> #include<list> #include<cfloat> using namespace std; int mod = 1e9+7; long long int inf = 1e18; int main() { int n; cin >> n; vector<int> a; a.push_back(0); for(int i=0; i<n; i++){ int x; cin >> x; a.push_back(x); } a.push_back(0); int sum = 0; for(int i=0; i<=n; i++){ sum += abs(a[i]-a[i+1]); } for(int i=1; i<=n; i++){ int tmp = sum - ( abs(a[i]-a[i-1]) + abs(a[i]-a[i+1]) ) + abs(a[i-1]-a[i+1]); cout << tmp << endl; } return 0; } //
Submission Info
Submission Time | |
---|---|
Task | C - Traveling Plan |
User | yut071 |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 737 Byte |
Status | AC |
Exec Time | 185 ms |
Memory | 1784 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 | 180 ms | 1784 KB |
02.txt | AC | 185 ms | 1784 KB |
03.txt | AC | 1 ms | 256 KB |
04.txt | AC | 177 ms | 1784 KB |
05.txt | AC | 178 ms | 1784 KB |
06.txt | AC | 179 ms | 1784 KB |
07.txt | AC | 179 ms | 1784 KB |
08.txt | AC | 178 ms | 1784 KB |
09.txt | AC | 175 ms | 1400 KB |
10.txt | AC | 173 ms | 1400 KB |
11.txt | AC | 177 ms | 1400 KB |
12.txt | AC | 174 ms | 1400 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 |