#include <bits/stdc++.h>
using namespace std;
#define ll long long
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define usecppio ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define all(x) ((x).begin()),((x).end())
using pii = pair <int, int>;
#define INF 0x7f7f7f7f
const bool debug = false;
const int MX = 30202;
struct Edge
{
int dest, w;
bool operator<(const Edge &p) const
{
return w > p.w;
}
};
bool relax(Edge edge, int u, int dist[])
{
bool flag = 0;
int v = edge.dest, w = edge.w;
if (dist[v] > dist[u] + w && (dist[u]!=INF))
{
flag = true;
dist[v] = dist[u]+w;
}
return flag;
}
void dijkstra(int dist[], int start, vector<Edge> graph[])
{
fill(dist,dist+MX,INF);
dist[start] = 0;
priority_queue<Edge> pq;
pq.push({start,0});
while(!pq.empty())
{
Edge x = pq.top();
int v = x.dest, w = x.w;
pq.pop();
if (w>dist[v])
continue;
for (auto ed : graph[v])
if (relax(ed, v, dist))
pq.push({ed.dest,dist[ed.dest]});
}
}
struct doge
{
int start, power, index;
};
int n, m;
vector <int> bi(30303, 0), pi(30303, 0);
vector <Edge> G[30303];
vector <doge> alldoge[30303];
vector <doge> dogeinfo;
int distances[30303];
bool visit[30303];
bool dogevisit[30303];
void dfs(doge curdoge)
{
dogevisit[curdoge.index] = true;
for (auto it:alldoge[curdoge.start])
if (!dogevisit[it.index])
dfs(it);
for (int i = 1; ;i++)
{
int u = curdoge.start+i*curdoge.power;
if (u >= n)
break;
bool check = false;
for (auto it:alldoge[u])
{
if (it.power == curdoge.power)
check = true;
if (!dogevisit[it.index])
dfs(it);
}
G[curdoge.start].push_back({u,i});
if (check)
break;
}
for (int i = -1; ;i--)
{
int u = curdoge.start+i*curdoge.power;
if (u < 0)
break;
bool check = false;
for (auto it:alldoge[u])
{
if (it.power == curdoge.power)
check = true;
if (!dogevisit[it.index])
dfs(it);
}
G[curdoge.start].push_back({u,-i});
if (check) break;
}
}
int32_t main()
{
usecppio
cin >> n >> m;
for (int i = 0; i<m; i++)
{
cin >> bi[i] >> pi[i];
if (i != 1)
alldoge[bi[i]].push_back({bi[i], pi[i], i});
dogeinfo.push_back({bi[i], pi[i], i});
}
dogevisit[0] = true;
visit[dogeinfo[0].start] = 1;
dfs(dogeinfo[0]);
dijkstra(distances,bi[0],G);
if (distances[bi[1]] >= 10000000)
{
printf("-1");
}
else printf("%d\n",distances[bi[1]]);
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
6 ms |
2168 KB |
Output is correct |
2 |
Correct |
6 ms |
2172 KB |
Output is correct |
3 |
Correct |
6 ms |
2168 KB |
Output is correct |
4 |
Correct |
6 ms |
2168 KB |
Output is correct |
5 |
Correct |
6 ms |
2044 KB |
Output is correct |
6 |
Correct |
6 ms |
2168 KB |
Output is correct |
7 |
Correct |
6 ms |
2168 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
6 ms |
2168 KB |
Output is correct |
2 |
Correct |
6 ms |
2168 KB |
Output is correct |
3 |
Correct |
6 ms |
2168 KB |
Output is correct |
4 |
Correct |
6 ms |
2168 KB |
Output is correct |
5 |
Correct |
6 ms |
2168 KB |
Output is correct |
6 |
Correct |
6 ms |
2168 KB |
Output is correct |
7 |
Correct |
6 ms |
2168 KB |
Output is correct |
8 |
Correct |
6 ms |
2168 KB |
Output is correct |
9 |
Correct |
6 ms |
2168 KB |
Output is correct |
10 |
Correct |
6 ms |
2168 KB |
Output is correct |
11 |
Correct |
7 ms |
2552 KB |
Output is correct |
12 |
Correct |
15 ms |
4588 KB |
Output is correct |
13 |
Correct |
11 ms |
2680 KB |
Output is correct |
14 |
Correct |
6 ms |
2296 KB |
Output is correct |
15 |
Correct |
7 ms |
2296 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
6 ms |
2168 KB |
Output is correct |
2 |
Correct |
6 ms |
2168 KB |
Output is correct |
3 |
Correct |
5 ms |
2168 KB |
Output is correct |
4 |
Correct |
6 ms |
2168 KB |
Output is correct |
5 |
Correct |
6 ms |
2168 KB |
Output is correct |
6 |
Correct |
6 ms |
2168 KB |
Output is correct |
7 |
Correct |
6 ms |
2168 KB |
Output is correct |
8 |
Correct |
6 ms |
2168 KB |
Output is correct |
9 |
Correct |
6 ms |
2168 KB |
Output is correct |
10 |
Correct |
6 ms |
2168 KB |
Output is correct |
11 |
Correct |
7 ms |
2552 KB |
Output is correct |
12 |
Correct |
15 ms |
4580 KB |
Output is correct |
13 |
Correct |
11 ms |
2552 KB |
Output is correct |
14 |
Correct |
6 ms |
2296 KB |
Output is correct |
15 |
Correct |
6 ms |
2296 KB |
Output is correct |
16 |
Correct |
6 ms |
2172 KB |
Output is correct |
17 |
Correct |
7 ms |
2552 KB |
Output is correct |
18 |
Correct |
6 ms |
2168 KB |
Output is correct |
19 |
Correct |
6 ms |
2172 KB |
Output is correct |
20 |
Correct |
7 ms |
2680 KB |
Output is correct |
21 |
Correct |
6 ms |
2168 KB |
Output is correct |
22 |
Correct |
6 ms |
2168 KB |
Output is correct |
23 |
Correct |
6 ms |
2296 KB |
Output is correct |
24 |
Correct |
7 ms |
2424 KB |
Output is correct |
25 |
Correct |
7 ms |
2296 KB |
Output is correct |
26 |
Correct |
82 ms |
35520 KB |
Output is correct |
27 |
Correct |
87 ms |
35388 KB |
Output is correct |
28 |
Correct |
8 ms |
2552 KB |
Output is correct |
29 |
Correct |
8 ms |
2936 KB |
Output is correct |
30 |
Correct |
7 ms |
2424 KB |
Output is correct |
31 |
Correct |
7 ms |
2552 KB |
Output is correct |
32 |
Correct |
7 ms |
2424 KB |
Output is correct |
33 |
Correct |
9 ms |
3448 KB |
Output is correct |
34 |
Correct |
10 ms |
3448 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
6 ms |
2168 KB |
Output is correct |
2 |
Correct |
6 ms |
2168 KB |
Output is correct |
3 |
Correct |
6 ms |
2168 KB |
Output is correct |
4 |
Correct |
6 ms |
2168 KB |
Output is correct |
5 |
Correct |
7 ms |
2168 KB |
Output is correct |
6 |
Correct |
6 ms |
2168 KB |
Output is correct |
7 |
Correct |
7 ms |
2168 KB |
Output is correct |
8 |
Correct |
6 ms |
2168 KB |
Output is correct |
9 |
Correct |
6 ms |
2168 KB |
Output is correct |
10 |
Correct |
6 ms |
2168 KB |
Output is correct |
11 |
Correct |
7 ms |
2552 KB |
Output is correct |
12 |
Correct |
20 ms |
4592 KB |
Output is correct |
13 |
Correct |
11 ms |
2576 KB |
Output is correct |
14 |
Correct |
6 ms |
2296 KB |
Output is correct |
15 |
Correct |
7 ms |
2328 KB |
Output is correct |
16 |
Correct |
6 ms |
2168 KB |
Output is correct |
17 |
Correct |
9 ms |
2552 KB |
Output is correct |
18 |
Correct |
6 ms |
2168 KB |
Output is correct |
19 |
Correct |
6 ms |
2168 KB |
Output is correct |
20 |
Correct |
7 ms |
2556 KB |
Output is correct |
21 |
Correct |
6 ms |
2168 KB |
Output is correct |
22 |
Correct |
6 ms |
2168 KB |
Output is correct |
23 |
Correct |
6 ms |
2296 KB |
Output is correct |
24 |
Correct |
7 ms |
2424 KB |
Output is correct |
25 |
Correct |
7 ms |
2352 KB |
Output is correct |
26 |
Correct |
84 ms |
35520 KB |
Output is correct |
27 |
Correct |
83 ms |
35364 KB |
Output is correct |
28 |
Correct |
7 ms |
2604 KB |
Output is correct |
29 |
Correct |
9 ms |
2940 KB |
Output is correct |
30 |
Correct |
6 ms |
2424 KB |
Output is correct |
31 |
Correct |
8 ms |
2552 KB |
Output is correct |
32 |
Correct |
7 ms |
2424 KB |
Output is correct |
33 |
Correct |
10 ms |
3448 KB |
Output is correct |
34 |
Correct |
10 ms |
3448 KB |
Output is correct |
35 |
Correct |
23 ms |
7988 KB |
Output is correct |
36 |
Correct |
9 ms |
2808 KB |
Output is correct |
37 |
Correct |
23 ms |
8112 KB |
Output is correct |
38 |
Correct |
29 ms |
9652 KB |
Output is correct |
39 |
Correct |
28 ms |
9780 KB |
Output is correct |
40 |
Correct |
30 ms |
9792 KB |
Output is correct |
41 |
Correct |
29 ms |
9652 KB |
Output is correct |
42 |
Runtime error |
960 ms |
262144 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
43 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
6 ms |
2168 KB |
Output is correct |
2 |
Correct |
6 ms |
2168 KB |
Output is correct |
3 |
Correct |
6 ms |
2168 KB |
Output is correct |
4 |
Correct |
6 ms |
2168 KB |
Output is correct |
5 |
Correct |
6 ms |
2168 KB |
Output is correct |
6 |
Correct |
6 ms |
2168 KB |
Output is correct |
7 |
Correct |
6 ms |
2168 KB |
Output is correct |
8 |
Correct |
5 ms |
2168 KB |
Output is correct |
9 |
Correct |
5 ms |
2168 KB |
Output is correct |
10 |
Correct |
6 ms |
2168 KB |
Output is correct |
11 |
Correct |
7 ms |
2552 KB |
Output is correct |
12 |
Correct |
15 ms |
4584 KB |
Output is correct |
13 |
Correct |
11 ms |
2552 KB |
Output is correct |
14 |
Correct |
6 ms |
2300 KB |
Output is correct |
15 |
Correct |
6 ms |
2296 KB |
Output is correct |
16 |
Correct |
6 ms |
2168 KB |
Output is correct |
17 |
Correct |
7 ms |
2680 KB |
Output is correct |
18 |
Correct |
6 ms |
2168 KB |
Output is correct |
19 |
Correct |
6 ms |
2168 KB |
Output is correct |
20 |
Correct |
7 ms |
2680 KB |
Output is correct |
21 |
Correct |
6 ms |
2168 KB |
Output is correct |
22 |
Correct |
6 ms |
2168 KB |
Output is correct |
23 |
Correct |
7 ms |
2296 KB |
Output is correct |
24 |
Correct |
7 ms |
2428 KB |
Output is correct |
25 |
Correct |
7 ms |
2296 KB |
Output is correct |
26 |
Correct |
81 ms |
35392 KB |
Output is correct |
27 |
Correct |
79 ms |
35392 KB |
Output is correct |
28 |
Correct |
7 ms |
2552 KB |
Output is correct |
29 |
Correct |
8 ms |
2808 KB |
Output is correct |
30 |
Correct |
7 ms |
2424 KB |
Output is correct |
31 |
Correct |
7 ms |
2556 KB |
Output is correct |
32 |
Correct |
7 ms |
2424 KB |
Output is correct |
33 |
Correct |
9 ms |
3448 KB |
Output is correct |
34 |
Correct |
9 ms |
3448 KB |
Output is correct |
35 |
Correct |
22 ms |
7988 KB |
Output is correct |
36 |
Correct |
8 ms |
2936 KB |
Output is correct |
37 |
Correct |
23 ms |
8116 KB |
Output is correct |
38 |
Correct |
29 ms |
9648 KB |
Output is correct |
39 |
Correct |
28 ms |
9780 KB |
Output is correct |
40 |
Correct |
28 ms |
9780 KB |
Output is correct |
41 |
Correct |
28 ms |
9652 KB |
Output is correct |
42 |
Runtime error |
956 ms |
262148 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
43 |
Halted |
0 ms |
0 KB |
- |