-
Notifications
You must be signed in to change notification settings - Fork 0
/
Mowing the Field.cpp
79 lines (61 loc) · 1.84 KB
/
Mowing the Field.cpp
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
// Problem: http://www.usaco.org/index.php?page=viewproblem2&cpid=593
// Solved on February 4th 2023
#include <math.h>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int n;
long x = 9999999;
int currentX, currentY, movement = 0;
int totalTime = 0;
char direction;
int main()
{
vector<pair<int, int>> coordinates;
vector<pair<int, int>> seenCoordinates;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> direction >> movement;
if (direction == 'N') {
for (int j = 0; j < movement; j++) {
currentY++;
seenCoordinates.push_back((make_pair(currentX, currentY)));
}
}
else if (direction == 'E') {
for (int j = 0; j < movement; j++) {
currentX++;
seenCoordinates.push_back(make_pair(currentX, currentY));
}
}
else if (direction == 'S') {
for (int j = 0; j < movement; j++) {
currentY--;
seenCoordinates.push_back(make_pair(currentX, currentY));
}
}
else if (direction == 'W') {
for (int j = 0; j < movement; j++) {
currentX--;
seenCoordinates.push_back(make_pair(currentX, currentY));
}
}
totalTime += movement;
}
reverse(seenCoordinates.begin(), seenCoordinates.end());
for (int i = totalTime; i > 0; i--) {
pair<int, int> tempCords = seenCoordinates.back();
seenCoordinates.pop_back();
auto count = find(seenCoordinates.begin(),seenCoordinates.end(), tempCords);
if (count != seenCoordinates.end()) {
x = min(x, seenCoordinates.end() - count);
}
}
if (x != 9999999) {
cout << x << endl;
}
else {
cout << -1 << endl;
}
}