Submission #18363020
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
int main()
{
static const int mod = 1e+5;
int n, m;
cin >> n >> m;
vector<int> s_vec(n - 1);
for (int i = 0; i < n - 1; ++i)
cin >> s_vec.at(i);
vector<int> a_vec(m);
for (int i = 0; i < m; ++i)
cin >> a_vec.at(i);
vector<int> cumsum(n, 0);
for (int i = 0; i < n - 1; ++i)
cumsum.at(i + 1) = cumsum.at(i) + s_vec.at(i);
int src = 0;
int sum = 0;
for (int a : a_vec) {
int dst = src + a;
sum += abs(cumsum.at(dst) - cumsum.at(src));
sum %= mod;
src = dst;
}
cout << sum << endl;
}
Submission Info
| Submission Time | |
|---|---|
| Task | A - 旅人 |
| User | atug |
| Language | C++ (GCC 9.2.1) |
| Score | 20 |
| Code Size | 639 Byte |
| Status | AC |
| Exec Time | 51 ms |
| Memory | 4200 KiB |
Judge Result
| Set Name | set01 | set02 | set03 | set04 | set05 | set06 | set07 | set08 | set09 | set10 | ||||||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Score / Max Score | 2 / 2 | 2 / 2 | 2 / 2 | 2 / 2 | 2 / 2 | 2 / 2 | 2 / 2 | 2 / 2 | 2 / 2 | 2 / 2 | ||||||||||||||||||||
| Status |
|
|
|
|
|
|
|
|
|
|
| Set Name | Test Cases |
|---|---|
| set01 | data1 |
| set02 | data2 |
| set03 | data3 |
| set04 | data4 |
| set05 | data5 |
| set06 | data6 |
| set07 | data7 |
| set08 | data8 |
| set09 | data9 |
| set10 | data10 |
| Case Name | Status | Exec Time | Memory |
|---|---|---|---|
| data1 | AC | 9 ms | 3524 KiB |
| data10 | AC | 49 ms | 4120 KiB |
| data2 | AC | 6 ms | 3600 KiB |
| data3 | AC | 2 ms | 3548 KiB |
| data4 | AC | 2 ms | 3532 KiB |
| data5 | AC | 3 ms | 3408 KiB |
| data6 | AC | 50 ms | 4072 KiB |
| data7 | AC | 48 ms | 4116 KiB |
| data8 | AC | 51 ms | 4200 KiB |
| data9 | AC | 49 ms | 4060 KiB |