| Task: | Increasing Array |
| Sender: | phid |
| Submission time: | 2020-09-26 13:15:45 +0300 |
| Language: | C++ (C++11) |
| Status: | READY |
| Result: | WRONG ANSWER |
| test | verdict | time | |
|---|---|---|---|
| #1 | ACCEPTED | 0.01 s | details |
| #2 | WRONG ANSWER | 0.01 s | details |
| #3 | WRONG ANSWER | 0.01 s | details |
| #4 | ACCEPTED | 0.04 s | details |
| #5 | WRONG ANSWER | 0.04 s | details |
| #6 | RUNTIME ERROR | 0.01 s | details |
| #7 | ACCEPTED | 0.01 s | details |
Code
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long int> v;
long long int ans = 0;
long long int x = 0;
cin >> x;
v.push_back(x);
for (int i = 1; i < n; i++) {
cin >> x;
v.push_back(x);
ans += (v[i - 1] > v[i] ? v[i - 1] - v[i] : 0);
v[x] += ans;
}
cout << ans;
return 0;
}Test details
Test 1
Verdict: ACCEPTED
| input |
|---|
| 10 1 1 1 1 1 1 1 1 1 1 |
| correct output |
|---|
| 0 |
| user output |
|---|
| 0 |
Test 2
Verdict: WRONG ANSWER
| input |
|---|
| 10 1000000000 1 1 1 1 1 1 1 1 1 |
| correct output |
|---|
| 8999999991 |
| user output |
|---|
| 1999999998 |
Test 3
Verdict: WRONG ANSWER
| input |
|---|
| 10 6 10 4 10 2 8 9 2 7 7 |
| correct output |
|---|
| 31 |
| user output |
|---|
| 21 |
Test 4
Verdict: ACCEPTED
| input |
|---|
| 200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
| correct output |
|---|
| 0 |
| user output |
|---|
| 0 |
Test 5
Verdict: WRONG ANSWER
| input |
|---|
| 200000 1000000000 1 1 1 1 1 1 1 1 1 1... |
| correct output |
|---|
| 199998999800001 |
| user output |
|---|
| 1999999998 |
Test 6
Verdict: RUNTIME ERROR
| input |
|---|
| 200000 763977854 530688450 486447012 ... |
| correct output |
|---|
| 100126194120455 |
| user output |
|---|
| (empty) |
Test 7
Verdict: ACCEPTED
| input |
|---|
| 1 329873232 |
| correct output |
|---|
| 0 |
| user output |
|---|
| 0 |
