Submission #3768104
Source Code Expand
#include<iostream> #include<vector> #include<queue> using namespace std; int k; vector<int> a; struct edge{ int cost, from; }; void dijkstra(){ priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> q; q.push({1, 1}); while(!q.empty()){ pair<int, int> p = q.top(); q.pop(); edge e = {p.first, p.second}; if(a[e.from] < a[(e.from * 10) % k]){ a[(e.from * 10) % k] = e.cost; q.push({e.cost, (e.from * 10) % k}); } if(a[e.from] + 1 < a[(e.from + 1) % k]){ a[(e.from + 1) % k] = e.cost + 1; q.push({e.cost + 1, (e.from + 1) % k}); } } } int main(){ cin >> k; a = vector<int>(k, 999999); a[1] = 1; dijkstra(); cout << a[0] << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Small Multiple |
User | lucky3977 |
Language | C++14 (GCC 5.4.1) |
Score | 700 |
Code Size | 856 Byte |
Status | AC |
Exec Time | 20 ms |
Memory | 1276 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 700 / 700 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | s1.txt, s2.txt, s3.txt |
All | 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, 37.txt, 38.txt, 39.txt, 40.txt, 41.txt, 42.txt, 43.txt, 44.txt, 45.txt, 46.txt, 47.txt, 48.txt, 49.txt, 50.txt, 51.txt, 52.txt, 53.txt, 54.txt, 55.txt, 56.txt, 57.txt, 58.txt, 59.txt, 60.txt, 61.txt, 62.txt, 63.txt, 64.txt, s1.txt, s2.txt, s3.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | AC | 1 ms | 256 KB |
02.txt | AC | 1 ms | 256 KB |
03.txt | AC | 1 ms | 256 KB |
04.txt | AC | 1 ms | 256 KB |
05.txt | AC | 1 ms | 256 KB |
06.txt | AC | 1 ms | 256 KB |
07.txt | AC | 1 ms | 256 KB |
08.txt | AC | 1 ms | 256 KB |
09.txt | AC | 1 ms | 256 KB |
10.txt | AC | 1 ms | 256 KB |
11.txt | AC | 1 ms | 256 KB |
12.txt | AC | 1 ms | 256 KB |
13.txt | AC | 1 ms | 256 KB |
14.txt | AC | 1 ms | 256 KB |
15.txt | AC | 1 ms | 256 KB |
16.txt | AC | 1 ms | 256 KB |
17.txt | AC | 1 ms | 256 KB |
18.txt | AC | 1 ms | 256 KB |
19.txt | AC | 1 ms | 256 KB |
20.txt | AC | 1 ms | 256 KB |
21.txt | AC | 12 ms | 768 KB |
22.txt | AC | 12 ms | 768 KB |
23.txt | AC | 15 ms | 1276 KB |
24.txt | AC | 20 ms | 1276 KB |
25.txt | AC | 14 ms | 1024 KB |
26.txt | AC | 14 ms | 1024 KB |
27.txt | AC | 16 ms | 1276 KB |
28.txt | AC | 14 ms | 1276 KB |
29.txt | AC | 16 ms | 1024 KB |
30.txt | AC | 18 ms | 1276 KB |
31.txt | AC | 1 ms | 256 KB |
32.txt | AC | 1 ms | 256 KB |
33.txt | AC | 14 ms | 1148 KB |
34.txt | AC | 6 ms | 640 KB |
35.txt | AC | 13 ms | 896 KB |
36.txt | AC | 14 ms | 1024 KB |
37.txt | AC | 5 ms | 512 KB |
38.txt | AC | 6 ms | 512 KB |
39.txt | AC | 8 ms | 640 KB |
40.txt | AC | 2 ms | 256 KB |
41.txt | AC | 12 ms | 768 KB |
42.txt | AC | 14 ms | 1024 KB |
43.txt | AC | 3 ms | 384 KB |
44.txt | AC | 2 ms | 256 KB |
45.txt | AC | 8 ms | 640 KB |
46.txt | AC | 10 ms | 672 KB |
47.txt | AC | 2 ms | 256 KB |
48.txt | AC | 11 ms | 768 KB |
49.txt | AC | 12 ms | 896 KB |
50.txt | AC | 8 ms | 640 KB |
51.txt | AC | 4 ms | 384 KB |
52.txt | AC | 7 ms | 640 KB |
53.txt | AC | 10 ms | 768 KB |
54.txt | AC | 5 ms | 512 KB |
55.txt | AC | 8 ms | 640 KB |
56.txt | AC | 10 ms | 768 KB |
57.txt | AC | 14 ms | 896 KB |
58.txt | AC | 8 ms | 640 KB |
59.txt | AC | 11 ms | 640 KB |
60.txt | AC | 9 ms | 640 KB |
61.txt | AC | 3 ms | 384 KB |
62.txt | AC | 6 ms | 512 KB |
63.txt | AC | 12 ms | 768 KB |
64.txt | AC | 12 ms | 768 KB |
s1.txt | AC | 1 ms | 256 KB |
s2.txt | AC | 1 ms | 256 KB |
s3.txt | AC | 10 ms | 640 KB |