Submission #2966531


Source Code Expand

#include <bits/stdc++.h>

using namespace std;
const int N = 1e5+10;
vector<pair<int,int> >edge[N];
int vis[N],dis[N];
void spfa(int st)
{
    queue<int>q;
    q.push(st);
    vis[st] = 1;
    dis[st] = 1;
    while(!q.empty())
    {
        int top = q.front();q.pop();
       // cout<<top<<endl;
        vis[top] = 0;
        for(int i = 0;i < edge[top].size();i++)
        {
            int to = edge[top][i].first,w = edge[top][i].second;
            if(!vis[to] && dis[to] > dis[top] + w)
            {
                vis[to] = 1;
                dis[to] = dis[top] + w;
                q.push(to);
            }
        }
    }
}
int main()
{
    int k;
    scanf("%d",&k);
    for(int i = 1;i < k;i++)
    {
        edge[i].push_back(make_pair((i+1)%k,1));
        edge[i].push_back(make_pair(i*10%k,0));
    }
    memset(vis,0,sizeof(vis));
    memset(dis,0x3f,sizeof(dis));
    spfa(1);
    printf("%d\n",dis[0]);
    return 0;
}

Submission Info

Submission Time
Task D - Small Multiple
User jade
Language C++14 (GCC 5.4.1)
Score 0
Code Size 984 Byte
Status WA
Exec Time 48 ms
Memory 6656 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:33:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&k);
                   ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 700
Status
AC × 3
AC × 52
WA × 15
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 3 ms 3456 KB
02.txt WA 3 ms 3328 KB
03.txt AC 3 ms 3328 KB
04.txt WA 3 ms 3328 KB
05.txt AC 3 ms 3328 KB
06.txt AC 3 ms 3328 KB
07.txt AC 3 ms 3328 KB
08.txt WA 3 ms 3328 KB
09.txt AC 3 ms 3328 KB
10.txt AC 3 ms 3328 KB
11.txt AC 3 ms 3328 KB
12.txt AC 3 ms 3328 KB
13.txt WA 3 ms 3328 KB
14.txt AC 3 ms 3328 KB
15.txt AC 3 ms 3328 KB
16.txt WA 3 ms 3328 KB
17.txt AC 3 ms 3328 KB
18.txt AC 3 ms 3328 KB
19.txt WA 2 ms 3328 KB
20.txt WA 3 ms 3328 KB
21.txt AC 15 ms 6528 KB
22.txt AC 15 ms 6528 KB
23.txt AC 39 ms 6656 KB
24.txt WA 41 ms 6656 KB
25.txt AC 22 ms 6528 KB
26.txt AC 40 ms 6656 KB
27.txt WA 37 ms 6656 KB
28.txt AC 27 ms 6656 KB
29.txt AC 30 ms 6656 KB
30.txt WA 48 ms 6656 KB
31.txt WA 3 ms 3328 KB
32.txt WA 3 ms 3328 KB
33.txt WA 31 ms 5760 KB
34.txt AC 13 ms 4608 KB
35.txt WA 28 ms 5632 KB
36.txt WA 28 ms 6400 KB
37.txt AC 7 ms 4096 KB
38.txt AC 11 ms 4608 KB
39.txt AC 14 ms 5120 KB
40.txt AC 4 ms 3584 KB
41.txt AC 17 ms 6144 KB
42.txt AC 25 ms 6528 KB
43.txt AC 5 ms 3712 KB
44.txt AC 3 ms 3456 KB
45.txt AC 12 ms 4992 KB
46.txt AC 17 ms 5376 KB
47.txt AC 4 ms 3584 KB
48.txt AC 16 ms 6272 KB
49.txt AC 19 ms 6144 KB
50.txt AC 13 ms 5120 KB
51.txt AC 6 ms 4096 KB
52.txt AC 10 ms 4736 KB
53.txt AC 14 ms 5632 KB
54.txt AC 7 ms 4480 KB
55.txt AC 11 ms 4992 KB
56.txt AC 13 ms 5632 KB
57.txt AC 17 ms 6528 KB
58.txt AC 11 ms 5376 KB
59.txt AC 14 ms 6016 KB
60.txt AC 12 ms 5504 KB
61.txt AC 5 ms 3968 KB
62.txt AC 9 ms 4992 KB
63.txt AC 15 ms 6528 KB
64.txt AC 15 ms 6528 KB
s1.txt AC 3 ms 3328 KB
s2.txt AC 3 ms 3328 KB
s3.txt AC 13 ms 5888 KB