-
Notifications
You must be signed in to change notification settings - Fork 29
/
E.cc
97 lines (77 loc) · 1.96 KB
/
E.cc
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
#include <deque>
using namespace std;
#define print(x) cout << x << endl
#define input(x) cin >> x
typedef long long llint;
const int MAXN = 1234567;
const int MAXM = 12345;
const int MAXG = 1111;
const int MAXR = 1111;
const llint INF = 0x3f3f3f3f3f3f3f3fLL;
char visited[MAXM][MAXG];
int dis[MAXM][MAXG];
int main() {
int n, m;
input(n >> m);
vector<int> sf(m);
for (int i = 0; i < m; i++) {
scanf("%d", &sf[i]);
}
sort(sf.begin(), sf.end());
int G, R;
input(G >> R);
deque<pair<int, int> > dq;
dq.push_back({0, 0});
memset(visited, 0, sizeof(visited));
memset(dis, 0x3f, sizeof(dis));
dis[0][0] = 0;
llint ans = INF;
while (!dq.empty()) {
int cur = dq.front().first;
int mod = dq.front().second;
dq.pop_front();
if (visited[cur][mod]) {
continue;
}
visited[cur][mod] = 1;
if (mod == 0) {
int disM = n - sf[cur];
if (disM <= G) {
llint res = (R + G) * dis[cur][mod] + disM;
ans = min(ans, res);
}
}
if (mod == G) {
if (dis[cur][0] > dis[cur][G] + 1) {
dis[cur][0] = dis[cur][G] + 1;
dq.push_back({cur, 0});
}
continue;
}
if (cur - 1 >= 0) {
int dnxt = mod + sf[cur] - sf[cur - 1];
if (dnxt <= G) {
dis[cur - 1][dnxt] = dis[cur][mod];
dq.push_front({cur - 1, dnxt});
}
}
if (cur + 1 < m) {
int dnxt = mod + sf[cur + 1] - sf[cur];
if (dnxt <= G) {
dis[cur + 1][dnxt] = dis[cur][mod];
dq.push_front({cur + 1, dnxt});
}
}
}
if (ans >= INF) {
ans = -1;
}
print(ans);
return 0;
}