-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathDay13_Part2.cpp
59 lines (58 loc) · 1.17 KB
/
Day13_Part2.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
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
int n=787;
vector<vector<int>>v(n);
vector<vector<char>>result(1000,vector<char>(1000,'.'));
for(int j=0;j<n;j++){
string str;
cin>>str;
stringstream ss(str);
for (int i; ss >> i;) {
v[j].push_back(i);
if (ss.peek() == ',')
ss.ignore();
}
}
int a=1000;
int b=1000;
vector<char>d(12);
vector<int>num(12);
for(int i=0;i<12;i++){
cin>>d[i]>>num[i];
}
for(int z=0;z<12;z++){
if(d[z]=='x'){
for(int i=0;i<n;i++){
if(v[i][0]>num[z] && v[i][0]<a){
int diff=v[i][0]-num[z];
diff*=2;
v[i][0]-=diff;
}
}
a=num[z];
}else{
for(int i=0;i<n;i++){
if(v[i][1]>num[z] && v[i][1]<b){
int diff=v[i][1]-num[z];
diff*=2;
v[i][1]-=diff;
}
}
b=num[z];
}
}
for(int i=0;i<n;i++){
if(v[i][0]<a && v[i][1]<b){
result[v[i][0]][v[i][1]]='#';
}
}
for(int i=0;i<b;i++){
for(int j=0;j<a;j++){
cout<<result[j][i];
}
cout<<endl;
}
return 0;
}