-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmaptiles2.cpp
108 lines (85 loc) · 2.86 KB
/
maptiles2.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
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
#include <bits/stdc++.h>
using namespace std;
template<typename A, typename B>
ostream &operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type>
ostream &operator<<(ostream &os, const T_container &v) {
os << '{';
string sep;
for (const T &x: v) os << sep << x, sep = ", ";
return os << '}';
}
// https://stackoverflow.com/questions/31162367/significance-of-ios-basesync-with-stdiofalse-cin-tienull
#define fast_io ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
#define ld long double
#define ll long long
#define vec vector
#define arr array
#define str string
#define print(x) cout << #x << " = " << x << endl;
#define OUT(x) cout << x << "\n";
#define FOR(i, from, to_excl, inc) for (int i = from; i < to_excl; i += inc)
#define FORALL(item, container) for (auto item: container)
#define WHILE(n) while (n-- > 0)
const ll INF = 1e9;
const double EPS = 1e-9;
const ld PI = 3.1415926535897932384626433832795;
ll gcd(ll a, ll b) {
return b == 0 ? a : gcd(b, a % b);
}
ll lcm(ll a, ll b) {
return (a / gcd(a, b)) * b;
}
ll floorMod(const ll a, const ll b) {
return (a % b + b) % b;
}
vector<string> tokenize(const string &s, char c) {
vector<string> T;
stringstream ss = stringstream(s);
for (string t; getline(ss, t, c);) {
T.push_back(t);
}
return T;
}
string lower(string s) {
string r(s);
transform(s.begin(), s.end(), r.begin(), [](unsigned char c) { return tolower(c); });
return r;
}
string upper(string s) {
string r(s);
transform(s.begin(), s.end(), r.begin(), [](unsigned char c) { return toupper(c); });
return r;
}
int main() {
fast_io
str s;
cin >> s;
int zoom = s.length();
int x = 0;
int y = 0;
for (char c: s) {
// Get character as integer value
int c_int = c - '0';
// Compute the actual coordinate here; these take care of subdivisions
x *= 2;
y *= 2;
/**
* Binary operations to check which direction the subdivision is
*
* Example:
* c_int = 0: none of these evaluate to true; there are no subdivisions
* c_int = 1; the first evaluates to true, the second does not
* Indeed, if there is a 1, then there is a subdivision in the x direction
* c_int = 2; the first does not evaluate to true, the second one does
* Indeed, if there is a 2, then there is a subdivision in the y direction
* c_int = 3; Both evaluate to true; There are subdivisions in both directions.
*/
if (c_int & 1)
x++;
if (c_int & 2)
y++;
}
cout << zoom << " " << x << " " << y << "\n";
return 0;
}