-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathDay 3, Part 2
63 lines (60 loc) · 1.75 KB
/
Day 3, Part 2
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
#include <fstream>
using namespace std;
ifstream fin ("data.in");
ofstream fout ("data.out");
char s[100];
int poz1[2005], poz2[2005], dim1[2005], dim2[20005], v[10003][10003], cont, k, sol;
bool ok;
///cel mai brut existent
int main()
{
while(fin.getline(s, 200)){
k++;
for(int i = 0; s[i] != 0; i++){
if(s[i] == '@' && s[i + 1] == ' '){
for(int j = i + 2; s[j] != ','; j++){
poz1[k] = poz1[k] * 10 + (s[j] - '0');
}
}
else if(s[i] == ','){
for(int j = i + 1; s[j] != ':'; j++){
poz2[k] = poz2[k] * 10 + (s[j] - '0');
}
}
else if(s[i] == ':' && s[i + 1] == ' '){
for(int j = i + 2; s[j] != 'x'; j++){
dim1[k] = dim1[k] * 10 + (s[j] - '0');
}
}
else if(s[i] == 'x'){
for(int j = i + 1; s[j] != 0; j++){
dim2[k] = dim2[k] * 10 + (s[j] - '0');
}
}
}
for(int i = poz1[k] + 1; i <= poz1[k] + dim1[k]; i++){
for(int j = poz2[k] + 1; j <= poz2[k] + dim2[k]; j++){
if(v[i][j] == 0){
v[i][j] = k;
}
else{
v[i][j] = -1;
}
}
}
}
for(int t = 1; t <= k; t++){
sol += t;
ok = true;
for(int i = poz1[t] + 1; i <= poz1[t] + dim1[t] && ok; i++){
for(int j = poz2[t] + 1; j <= poz2[t] + dim2[t] && ok; j++){
if(v[i][j] == -1){
sol -= t;
ok = false;
}
}
}
}
fout<<sol;
return 0;
}