Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- using namespace std;
- using ll = long long;
- using ld = long double;
- using ull = unsigned long long;
- using pii = pair<int, int>;
- using pll = pair<ll, ll>;
- using pld = pair<ld, ld>;
- #define fi first
- #define se second
- #define pb push_back
- #define pf push_front
- #define mp make_pair
- #define ins insert
- #define btpc __builtin_popcount
- #define btclz __builtin_clz
- #define sz(x) (int)(x.size());
- #define all(x) x.begin(), x.end()
- #define debug(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
- mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
- int d4x[4] = {1, 0, -1, 0}; int d4y[4] = {0, 1, 0, -1};
- int d8x[8] = {0, 1, 1, 1, 0, -1, -1, -1};
- int d8y[8] = {1, 1, 0, -1, -1, -1, 0, 1};
- template<class X, class Y>
- bool minimize(X &x, const Y &y) {
- if (x > y)
- {
- x = y;
- return true;
- }
- return false;
- }
- template<class X, class Y>
- bool maximize(X &x, const Y &y) {
- if (x < y)
- {
- x = y;
- return true;
- }
- return false;
- }
- const int MOD = 1e9 + 7; //998244353
- template<class X, class Y>
- void add(X &x, const Y &y) {
- x = (x + y);
- if(x >= MOD) x -= MOD;
- }
- template<class X, class Y>
- void sub(X &x, const Y &y) {
- x = (x - y);
- if(x < 0) x += MOD;
- }
- /* Author : Le Ngoc Bao Anh, 11A5, LQD High School for Gifted Student*/
- const ll INF = 1e9;
- const int size = 40;
- bool image[size + 1][size + 1];
- bool current[size + 1][size + 1];
- string Encode(bool image[size + 1][size + 1], int number) {
- string ans = "";
- bool found = false;
- for(int i = 1; i <= size; i++) {
- for(int j = 1; j <= size; j++) {
- if(image[i][j]) {
- ans += i + '0';
- int pos = j;
- for(int k = j; k <= size; k++) {
- if(image[i][k]) pos = k;
- else break;
- }
- ans += j + '0';
- ans += pos + '0';
- j = pos;
- }
- }
- }
- ans += number + '0';
- return ans;
- }
- int Decode(string Encode) {
- int sz = Encode.size();
- int number = Encode.back() - '0';
- for(int i = 1; i <= size; i++) {
- for(int j = 1; j <= size; j++) current[i][j] = 0;
- }
- for(int i = 0; i + 2 < sz; i += 3) {
- int row = Encode[i] - '0';
- int L = Encode[i + 1] - '0';
- int R = Encode[i + 2] - '0';
- for(int j = L; j <= R; j++) current[row][j] = 1;
- }
- return number;
- }
- void solve() {
- for(int i = 1; i <= size; i++) {
- for(int j = 1; j <= size; j++) {
- cin >> image[i][j];
- }
- }
- int number; cin >> number;
- string Encoded = Encode(image, number);
- number = Decode(Encoded);
- for(int i = 1; i <= size; i++) {
- for(int j = 1; j <= size; j++) {
- cout << current[i][j] << " ";
- }
- cout << endl;
- }
- }
- int main()
- {
- ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
- #ifndef ONLINE_JUDGE
- freopen("input.txt", "r", stdin);
- freopen("output.txt", "w", stdout);
- #else
- //online
- #endif
- int tc = 1, ddd = 0;
- // cin >> tc;
- while(tc--) {
- //ddd++;
- //cout << "Case #" << ddd << ": ";
- solve();
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement