Submission #3245410
Source Code Expand
#include <cstdio> #include <complex> using namespace std; int main() { int n; scanf("%d", &n); int a[n + 2], b[n + 2]; a[0] = 0; a[n + 1] = 0; b[0] = 0; for (int i = 1; i <= n; i++) { scanf("%d", &a[i]); } for (int i = 1; i <= n + 1; i++) { b[i] = b[i - 1] + abs(a[i] - a[i - 1]); } int total = b[n + 1]; for (int i = 1; i <= n; i++) { int prev = a[i - 1]; int cur = a[i]; int next = a[i + 1]; int d = (abs(cur - prev) - abs(prev - next)) + abs(cur - next); printf("%d\n", total - d); } return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Traveling Plan |
User | icewaterGreentea |
Language | C++14 (Clang 3.8.0) |
Score | 300 |
Code Size | 597 Byte |
Status | AC |
Exec Time | 21 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 | 21 ms | 2048 KB |
02.txt | AC | 21 ms | 2048 KB |
03.txt | AC | 1 ms | 256 KB |
04.txt | AC | 21 ms | 2048 KB |
05.txt | AC | 21 ms | 2048 KB |
06.txt | AC | 21 ms | 2048 KB |
07.txt | AC | 21 ms | 2048 KB |
08.txt | AC | 21 ms | 2048 KB |
09.txt | AC | 19 ms | 1664 KB |
10.txt | AC | 19 ms | 1664 KB |
11.txt | AC | 19 ms | 1664 KB |
12.txt | AC | 19 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 |