Submission #1521366
Source Code Expand
#include "iostream" #include "climits" #include "list" #include "queue" #include "stack" #include "set" #include "functional" #include "algorithm" #include "string" #include "map" #include "iomanip" #include "random" using namespace std; const long long int MOD = 1000000007; const long double EPS = 0.00000001; long long int N, M, K, W, H, L, R; long long int ans; int main() { ios::sync_with_stdio(false); cin >> N >> M; long long int num[200000] = {}; for (int i = 0; i < N; i++) { cin >> num[i]; } for (int i = 0; i < M; i++) { cin >> K; K--; ans += num[K]; } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - コンテスト |
User | olphe |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 656 Byte |
Status | AC |
Exec Time | 2 ms |
Memory | 1792 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt |
All | sample_01.txt, sample_02.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 2 ms | 1792 KB |
sample_02.txt | AC | 2 ms | 1792 KB |
subtask1_01.txt | AC | 2 ms | 1792 KB |
subtask1_02.txt | AC | 2 ms | 1792 KB |
subtask1_03.txt | AC | 2 ms | 1792 KB |
subtask1_04.txt | AC | 2 ms | 1792 KB |
subtask1_05.txt | AC | 2 ms | 1792 KB |
subtask1_06.txt | AC | 2 ms | 1792 KB |
subtask1_07.txt | AC | 2 ms | 1792 KB |
subtask1_08.txt | AC | 2 ms | 1792 KB |
subtask1_09.txt | AC | 2 ms | 1792 KB |
subtask1_10.txt | AC | 2 ms | 1792 KB |
subtask1_11.txt | AC | 2 ms | 1792 KB |
subtask1_12.txt | AC | 2 ms | 1792 KB |