Repository navigation
Expand file tree
/
Copy path1345.cpp
More file actions
97 lines (94 loc) · 2.44 KB
/
Copy path1345.cpp
File metadata and controls
97 lines (94 loc) · 2.44 KB
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 "Jutil.h"
using namespace std;
#define KNRM "\x1B[0m"
#define KRED "\x1B[31m"
#define KGRN "\x1B[32m"
struct Data {
int i;
int d;
};
const int N = 5e4;
Data q[N];
bool vis[N];
class Solution {
public:
int minJumps(vector<int>& arr) {
unordered_map<int, vector<int>> mp;
int n = arr.size();
if (n == 1) {
return 0;
}
for (int i = 0; i < n; i++) {
mp[arr[i]].push_back(i);
vis[i] = 0;
}
q[0] = {0, 0};
vis[0] = 1;
int l = 0;
int r = 1;
while (l < r) {
Data u = q[l++];
for (auto v : mp[arr[u.i]]) {
if (vis[v]) {
continue;
}
if (v == n - 1) {
return u.d + 1;
}
q[r++] = {v, u.d + 1};
vis[v] = 1;
}
mp[arr[u.i]].clear();
if (u.i + 1 < n && !vis[u.i + 1]) {
if (u.i + 1 == n - 1) {
return u.d + 1;
}
q[r++] = {u.i + 1, u.d + 1};
vis[u.i + 1] = 1;
}
if (u.i - 1 >= 0 && !vis[u.i - 1]) {
q[r++] = {u.i - 1, u.d + 1};
vis[u.i - 1] = 1;
}
}
return -1;
}
};
int main() {
string problemName = "1345";
auto begin = jtimer();
Solution sol;
ifstream file_in("testcases/" + problemName + "_in.txt");
ifstream file_out("testcases/" + problemName + "_out.txt");
bool allPass = true;
int caseCount = 0;
int passCount = 0;
string line_in;
string line_out;
while (getline(file_in, line_in)) {
auto arr = jread_vector(line_in);
auto res = sol.minJumps(arr);
getline(file_out, line_out);
auto ans = jread_int(line_out);
printf("Case %d", ++caseCount);
if (res == ans) {
passCount++;
printf(" %s(PASS)", KGRN);
} else {
printf(" %s(WRONG)", KRED);
allPass = false;
}
printf("\n%s", KNRM);
jprint(res, "res");
jprint(ans, "ans");
printf("\n");
}
if (allPass) {
printf("%sALL CORRECT [%d/%d]\n%s", KGRN, passCount, caseCount, KNRM);
} else {
printf("%sWRONG ANSWER [%d/%d]\n%s", KRED, passCount, caseCount, KNRM);
}
auto end = jtimer();
jprint_time(begin, end);
return 0;
}