Skip to content

Commit a7ca20f

Browse files
keshavnandankeshavnandan
committed
srm inv 2002 semi 2 500
1 parent 3a445f5 commit a7ca20f

File tree

2 files changed

+310
-0
lines changed

2 files changed

+310
-0
lines changed

‎Escape.cpp

+173
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,173 @@
1+
#include <iostream>
2+
#include <sstream>
3+
#include <vector>
4+
#include <algorithm>
5+
#include <set>
6+
#include <map>
7+
#include <queue>
8+
#include <cstring>
9+
#include <climits>
10+
#include <cstdio>
11+
using namespace std;
12+
typedef pair<int,int> pi;
13+
typedef vector<int> vi;
14+
typedef vector<vi> vvi;
15+
typedef vector<string> vs;
16+
typedef vector<vs> vvs;
17+
int X[] = {1, 0, -1, 0};
18+
int Y[] = {0, 1, 0, -1};
19+
20+
class Escape {
21+
public:
22+
int lowest(vector <string> harmful, vector <string> deadly)
23+
{
24+
int M[501][501];
25+
memset(M, 0, sizeof(M));
26+
for(string s : harmful){
27+
int a1, b1, a2, b2;
28+
sscanf(s.c_str(), "%d%d%d%d", &a1, &b1, &a2, &b2);
29+
if(a1 > a2) swap(a1, a2);
30+
if(b1 > b2) swap(b1, b2);
31+
for(int i = a1; i <= a2; i++)
32+
for(int j = b1; j <= b2; j++)
33+
M[i][j] = 1;
34+
}
35+
36+
for(string s : deadly){
37+
int a1, b1, a2, b2;
38+
sscanf(s.c_str(), "%d%d%d%d", &a1, &b1, &a2, &b2);
39+
if(a1 > a2) swap(a1, a2);
40+
if(b1 > b2) swap(b1, b2);
41+
for(int i = a1; i <= a2; i++)
42+
for(int j = b1; j <= b2; j++)
43+
M[i][j] = 2;
44+
}
45+
46+
47+
deque<pair<pi, int> > Q;
48+
Q.push_back(make_pair(make_pair(0, 0), 0));
49+
int visited[501][501];
50+
memset(visited, 0, sizeof(visited));
51+
M[0][0] = 0;
52+
visited[0][0] = 1;
53+
54+
while(!Q.empty()){
55+
56+
pi p = Q.front().first;
57+
int l = Q.front().second;
58+
Q.pop_front();
59+
int px = p.first, py = p.second;
60+
l += M[px][py];
61+
// cout<<px<<" "<<py<<" "<<l<<endl;
62+
if(px == 500 && py == 500) return l;
63+
64+
for(int k = 0; k < 4; k++)
65+
{
66+
int i = X[k], j = Y[k];
67+
int qx = px+i, qy = py+j;
68+
if(0 <= qx && qx <= 500 && 0 <= qy && qy <= 500 && !visited[qx][qy] && M[qx][qy] < 2){
69+
visited[qx][qy] = 1;
70+
pi q = make_pair(qx, qy);
71+
if(M[qx][qy] == 1) Q.push_back(make_pair(q, l));
72+
else Q.push_front(make_pair(q, l));
73+
}
74+
}
75+
}
76+
77+
return -1;
78+
}
79+
80+
// BEGIN CUT HERE
81+
public:
82+
void run_test(int Case) { if ((Case == -1) || (Case == 0)) test_case_0(); if ((Case == -1) || (Case == 1)) test_case_1(); if ((Case == -1) || (Case == 2)) test_case_2(); if ((Case == -1) || (Case == 3)) test_case_3(); if ((Case == -1) || (Case == 4)) test_case_4(); }
83+
private:
84+
template <typename T> string print_array(const vector<T> &V) { ostringstream os; os << "{ "; for (typename vector<T>::const_iterator iter = V.begin(); iter != V.end(); ++iter) os << '\"' << *iter << "\","; os << " }"; return os.str(); }
85+
void verify_case(int Case, const int &Expected, const int &Received) { cerr << "Test Case #" << Case << "..."; if (Expected == Received) cerr << "PASSED" << endl; else { cerr << "FAILED" << endl; cerr << "\tExpected: \"" << Expected << '\"' << endl; cerr << "\tReceived: \"" << Received << '\"' << endl; } }
86+
void test_case_0() { string Arr0[] = {}; vector <string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); string Arr1[] = {}; vector <string> Arg1(Arr1, Arr1 + (sizeof(Arr1) / sizeof(Arr1[0]))); int Arg2 = 0; verify_case(0, Arg2, lowest(Arg0, Arg1)); }
87+
void test_case_1() { string Arr0[] = {"500 0 0 500"}; vector <string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); string Arr1[] = {"0 0 0 0"}; vector <string> Arg1(Arr1, Arr1 + (sizeof(Arr1) / sizeof(Arr1[0]))); int Arg2 = 1000; verify_case(1, Arg2, lowest(Arg0, Arg1)); }
88+
void test_case_2() { string Arr0[] = {"0 0 250 250","250 250 500 500"}; vector <string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); string Arr1[] = {"0 251 249 500","251 0 500 249"}; vector <string> Arg1(Arr1, Arr1 + (sizeof(Arr1) / sizeof(Arr1[0]))); int Arg2 = 1000; verify_case(2, Arg2, lowest(Arg0, Arg1)); }
89+
void test_case_3() { string Arr0[] = {"0 0 250 250","250 250 500 500"}; vector <string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); string Arr1[] = {"0 250 250 500","250 0 500 250"}; vector <string> Arg1(Arr1, Arr1 + (sizeof(Arr1) / sizeof(Arr1[0]))); int Arg2 = -1; verify_case(3, Arg2, lowest(Arg0, Arg1)); }
90+
void test_case_4() { string Arr0[] = {"468 209 456 32",
91+
"71 260 306 427",
92+
"420 90 424 492",
93+
"374 253 54 253",
94+
"319 334 152 431",
95+
"38 93 204 84",
96+
"246 0 434 263",
97+
"12 18 118 461",
98+
"215 462 44 317",
99+
"447 214 28 475",
100+
"3 89 38 125",
101+
"157 108 138 264",
102+
"363 17 333 387",
103+
"457 362 396 324",
104+
"95 27 374 175",
105+
"381 196 265 302",
106+
"105 255 253 134",
107+
"0 308 453 55",
108+
"169 28 313 498",
109+
"103 247 165 376",
110+
"264 287 363 407",
111+
"185 255 110 415",
112+
"475 126 293 112",
113+
"285 200 66 484",
114+
"60 178 461 301",
115+
"347 352 470 479",
116+
"433 130 383 370",
117+
"405 378 117 377",
118+
"403 324 369 133",
119+
"12 63 174 309",
120+
"181 0 356 56",
121+
"473 380 315 378"}; vector <string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); string Arr1[] = {"250 384 355 234",
122+
"28 155 470 4",
123+
"333 405 12 456",
124+
"329 221 239 215",
125+
"334 20 429 338",
126+
"85 42 188 388",
127+
"219 187 12 111",
128+
"467 453 358 133",
129+
"472 172 257 288",
130+
"412 246 431 86",
131+
"335 22 448 47",
132+
"150 14 149 11",
133+
"224 136 466 328",
134+
"369 209 184 262",
135+
"274 488 425 195",
136+
"55 82 279 253",
137+
"153 201 65 228",
138+
"208 230 132 223",
139+
"369 305 397 267",
140+
"200 145 98 198",
141+
"422 67 252 479",
142+
"231 252 401 190",
143+
"312 20 0 350",
144+
"406 72 207 294",
145+
"488 329 338 326",
146+
"117 264 497 447",
147+
"491 341 139 438",
148+
"40 413 329 290",
149+
"148 245 53 386",
150+
"147 70 186 131",
151+
"300 407 71 183",
152+
"300 186 251 198",
153+
"178 67 487 77",
154+
"98 158 55 433",
155+
"167 231 253 90",
156+
"268 406 81 271",
157+
"312 161 387 153",
158+
"33 442 25 412",
159+
"56 69 177 428",
160+
"5 92 61 247"}; vector <string> Arg1(Arr1, Arr1 + (sizeof(Arr1) / sizeof(Arr1[0]))); int Arg2 = 254; verify_case(4, Arg2, lowest(Arg0, Arg1)); }
161+
162+
// END CUT HERE
163+
164+
};
165+
166+
// BEGIN CUT HERE
167+
int main(){
168+
169+
Escape ___test;
170+
___test.run_test(-1);
171+
172+
}
173+
// END CUT HERE

‎Escape.txt

+137
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,137 @@
1+
PROBLEM STATEMENT
2+
You are playing a video game that involves escaping from a dangerous area. Within the area there are DEADLY regions you can't enter, HARMFUL regions that take 1 life for every step you make in them, and NORMAL regions that don't affect you in any way. You will start from (0,0) and have to make it to (500,500) using only Up, Left, Right, and Down steps. The map will be given as a vector <string> deadly listing the DEADLY regions and a vector <string> harmful listing the HARMFUL regions. The elements in each of these parameters will be formatted as follows:
3+
Input format(quotes for clarity): "X1 Y1 X2 Y2" where
4+
(X1,Y1) is one corner of the region and
5+
(X2,Y2) is the other corner of the region
6+
The corners of the region are inclusive bounds (i.e. (4,1) and (2,2) include x-values between 4 and 2 inclusive and y-values between 1 and 2 inclusive). All unspecified regions are considered NORMAL. If regions overlap for a particular square, then whichever region is worst takes effect (e.g. DEADLY+HARMFUL = DEADLY, HARMFUL+NORMAL = HARMFUL, HARMFUL+HARMFUL = HARMFUL, DEADLY+NORMAL=DEADLY). Damage taken at each step occurs based on the destination square and not on the starting square (e.g. if the square (500,500) is HARMFUL you WILL take a point of damage stepping onto it; if the square (0,0) is HARMFUL you WON'T take a point of damage stepping off of it; this works analogously for DEADLY squares).
7+
Return the least amount of life you will have to lose in order to reach the destination. Return -1 if there is no path to the destination. Your character is not allowed to leave the map (i.e. have X or Y less than 0 or greater than 500).
8+
9+
10+
DEFINITION
11+
Class:Escape
12+
Method:lowest
13+
Parameters:vector <string>, vector <string>
14+
Returns:int
15+
Method signature:int lowest(vector <string> harmful, vector <string> deadly)
16+
17+
18+
NOTES
19+
-If two harmful regions overlap, the area where they overlap is exactly the same as non-overlapping harmful regions (i.e. the effect is NOT cumulative, and the overlapping region still takes exactly 1 life)
20+
21+
22+
CONSTRAINTS
23+
-deadly will contain between 0 and 50 elements inclusive
24+
-harmful will contain between 0 and 50 elements inclusive
25+
-Each element of deadly and harmful will be of the form (quotes for clarity): "X1 Y1 X2 Y2" where X1,Y1,X2, and Y2 are integers between 0 and 500 inclusive and contain no leading zeros
26+
-Each element of deadly and harfmul will contain no leading, trailing or extra whitespace
27+
28+
29+
EXAMPLES
30+
31+
0)
32+
{}
33+
{}
34+
35+
Returns: 0
36+
37+
There are no DEADLY or HARMFUL regions.
38+
39+
1)
40+
{"500 0 0 500"}
41+
{"0 0 0 0"}
42+
43+
Returns: 1000
44+
45+
(0,0) is DEADLY but that doesn't affect our path since we never step onto it (only from it). The rest of the map is NORMAL.
46+
47+
2)
48+
{"0 0 250 250","250 250 500 500"}
49+
{"0 251 249 500","251 0 500 249"}
50+
51+
Returns: 1000
52+
53+
Just enough space to get around the DEADLY regions.
54+
55+
3)
56+
{"0 0 250 250","250 250 500 500"}
57+
{"0 250 250 500","250 0 500 250"}
58+
59+
Returns: -1
60+
61+
No way around the DEADLY regions.
62+
63+
4)
64+
{"468 209 456 32",
65+
"71 260 306 427",
66+
"420 90 424 492",
67+
"374 253 54 253",
68+
"319 334 152 431",
69+
"38 93 204 84",
70+
"246 0 434 263",
71+
"12 18 118 461",
72+
"215 462 44 317",
73+
"447 214 28 475",
74+
"3 89 38 125",
75+
"157 108 138 264",
76+
"363 17 333 387",
77+
"457 362 396 324",
78+
"95 27 374 175",
79+
"381 196 265 302",
80+
"105 255 253 134",
81+
"0 308 453 55",
82+
"169 28 313 498",
83+
"103 247 165 376",
84+
"264 287 363 407",
85+
"185 255 110 415",
86+
"475 126 293 112",
87+
"285 200 66 484",
88+
"60 178 461 301",
89+
"347 352 470 479",
90+
"433 130 383 370",
91+
"405 378 117 377",
92+
"403 324 369 133",
93+
"12 63 174 309",
94+
"181 0 356 56",
95+
"473 380 315 378"}
96+
{"250 384 355 234",
97+
"28 155 470 4",
98+
"333 405 12 456",
99+
"329 221 239 215",
100+
"334 20 429 338",
101+
"85 42 188 388",
102+
"219 187 12 111",
103+
"467 453 358 133",
104+
"472 172 257 288",
105+
"412 246 431 86",
106+
"335 22 448 47",
107+
"150 14 149 11",
108+
"224 136 466 328",
109+
"369 209 184 262",
110+
"274 488 425 195",
111+
"55 82 279 253",
112+
"153 201 65 228",
113+
"208 230 132 223",
114+
"369 305 397 267",
115+
"200 145 98 198",
116+
"422 67 252 479",
117+
"231 252 401 190",
118+
"312 20 0 350",
119+
"406 72 207 294",
120+
"488 329 338 326",
121+
"117 264 497 447",
122+
"491 341 139 438",
123+
"40 413 329 290",
124+
"148 245 53 386",
125+
"147 70 186 131",
126+
"300 407 71 183",
127+
"300 186 251 198",
128+
"178 67 487 77",
129+
"98 158 55 433",
130+
"167 231 253 90",
131+
"268 406 81 271",
132+
"312 161 387 153",
133+
"33 442 25 412",
134+
"56 69 177 428",
135+
"5 92 61 247"}
136+
137+
Returns: 254

0 commit comments

Comments
 (0)