Task: | Ruudukko |
Sender: | Jaahas |
Submission time: | 2019-10-04 13:04:51 +0300 |
Language: | C++ (C++11) |
Status: | READY |
Result: | 0 |
group | verdict | score |
---|---|---|
#1 | WRONG ANSWER | 0 |
test | verdict | time | |
---|---|---|---|
#1 | WRONG ANSWER | 0.01 s | details |
#2 | WRONG ANSWER | 0.01 s | details |
#3 | WRONG ANSWER | 0.01 s | details |
#4 | WRONG ANSWER | 0.01 s | details |
#5 | WRONG ANSWER | 0.01 s | details |
#6 | WRONG ANSWER | 0.01 s | details |
Code
#include <bits/stdc++.h> typedef long long ll; using namespace std; int main() { ll n; cin >> n; ll d[n]; ll c[n]; ll ct[n+1]; c[0] = 0; ct[0] = 0; for(int i=0; i<n; i++) { ll di; cin >> di; d[i] = di; ct[i+1] = 1e9; } for(int i=1; i<n; i++) { ll ci; cin >> ci; c[i] = ci; } for(int i=0; i<n; i++) { for(int j=1; j<=d[i] && i+j<=n; j++) { ct[i+j] = min(ct[i+j], ct[i]+c[i]); } } cout << ct[n] << '\n'; }
Test details
Test 1
Verdict: WRONG ANSWER
input |
---|
1 |
correct output |
---|
1 |
user output |
---|
0 |
Test 2
Verdict: WRONG ANSWER
input |
---|
2 |
correct output |
---|
1 2 2 1 |
user output |
---|
1 |
Test 3
Verdict: WRONG ANSWER
input |
---|
5 |
correct output |
---|
1 2 3 4 5 2 1 4 3 6 3 4 1 2 7 4 3 2 1 8 5 6 7 8 1 |
user output |
---|
4 |
Test 4
Verdict: WRONG ANSWER
input |
---|
42 |
correct output |
---|
1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
user output |
---|
41 |
Test 5
Verdict: WRONG ANSWER
input |
---|
99 |
correct output |
---|
1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
user output |
---|
98 |
Test 6
Verdict: WRONG ANSWER
input |
---|
100 |
correct output |
---|
1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
user output |
---|
99 |