Submission #9900450
Source Code Expand
#include<iostream> #include<vector> #include<algorithm> using namespace std; int main() { int n; cin >> n; vector<int>a(n); for (auto&& x : a)cin >> x; long long ans1 = 0, ans2 = 0, sum = 0; for (int i = 0; i < n; i++) { sum += a[i]; if (i % 2 == 0 && sum <= 0) { ans1 += -sum + 1; sum = 1; } else if (i % 2 == 1 && sum >= 0) { ans1 += sum + 1; sum = -1; } } sum = 0; for (int i = 0; i < n; i++) { sum += a[i]; if (i % 2 == 1 && sum <= 0) { ans2 += -sum + 1; sum = 1; } else if (i % 2 == 0 && sum >= 0) { ans2 += sum + 1; sum = -1; } } cout << min(ans1, ans2) << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Sequence |
User | nekosun |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 669 Byte |
Status | AC |
Exec Time | 44 ms |
Memory | 640 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 00-00.txt, 00-01.txt, 00-02.txt |
All | 00-00.txt, 00-01.txt, 00-02.txt, 01-00.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, 01-14.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00-00.txt | AC | 1 ms | 256 KB |
00-01.txt | AC | 1 ms | 256 KB |
00-02.txt | AC | 1 ms | 256 KB |
01-00.txt | AC | 44 ms | 640 KB |
01-01.txt | AC | 43 ms | 640 KB |
01-02.txt | AC | 42 ms | 640 KB |
01-03.txt | AC | 40 ms | 640 KB |
01-04.txt | AC | 39 ms | 640 KB |
01-05.txt | AC | 35 ms | 512 KB |
01-06.txt | AC | 42 ms | 640 KB |
01-07.txt | AC | 38 ms | 640 KB |
01-08.txt | AC | 43 ms | 640 KB |
01-09.txt | AC | 39 ms | 640 KB |
01-10.txt | AC | 32 ms | 512 KB |
01-11.txt | AC | 42 ms | 640 KB |
01-12.txt | AC | 43 ms | 640 KB |
01-13.txt | AC | 39 ms | 640 KB |
01-14.txt | AC | 43 ms | 640 KB |