This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#include "nonogram.h"
#define fi first
#define se second
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define INF (1<<30)
#define INFL (1LL<<60)
#define EPS ((ld)(1e-9))
#define sz(x) ((int)(x).size())
#define setz(x) memset(x, 0, sizeof(x))
#define all(x) (x).begin(), (x).end()
#define rep(i, e) for (int i = 0, _##i = (e); i < _##i; i++)
#define repp(i, s, e) for (int i = (s), _##i = (e); i < _##i; i++)
#define repr(i, s, e) for (int i = (s)-1, _##i = (e); i >= _##i; i--)
#define repi(i, x) for (auto &i : (x))
#define ARR(...) vector<int>({__VA_ARGS__})
#define ARS(...) vector<string>({__VA_ARGS__})
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef complex<double> base;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
template<typename T, typename V>
ostream &operator<<(ostream &os, const pair<T, V> pai) {
return os << '(' << pai.first << ' ' << pai.second << ')';
}
template<typename T>
ostream &operator<<(ostream &os, const vector<T> v) {
cout << '[';
for (auto p : v) cout << p << ",";
cout << "]";
return os;
}
template<typename T, typename V>
ostream &operator<<(ostream &os, const set<T, V> v) {
cout << "{";
for (auto p : v) cout << p << ",";
cout << "}";
return os;
}
template<typename T, typename V>
ostream &operator<<(ostream &os, const map<T, V> v) {
cout << "{";
for (auto p : v) cout << p << ",";
cout << "}";
return os;
}
#ifndef __SOULTCH
#define debug(...) 0
#define endl '\n'
#else
#define debug(...) cout << " [-] ", _dbg(#__VA_ARGS__, __VA_ARGS__)
template<class TH> void _dbg(const char *sdbg, TH h){ cout << sdbg << '=' << h << endl; }
template<class TH, class... TA> void _dbg(const char *sdbg, TH h, TA... a) {
while(*sdbg != ',') cout << *sdbg++;
cout << '=' << (h) << ',';
_dbg(sdbg+1, a...);
}
#endif
template<typename T> void get_max(T &a, T b) {a = max(a, b);}
template<typename T> void get_min(T &a, T b) {a = min(a, b);}
vector<vector<int>> SolveNonogram(int N, int M, vector<vector<int>> Rclue, vector<vector<int>> Cclue) {
vector<vector<int>> res(N);
rep(i, N) res[i].resize(M);
rep(i, N) if (~i&1) {
int p = 0;
rep(j, sz(Rclue[i])) {
rep(k, Rclue[i][j]) res[i][p++] = 1;
p++;
}
}
rep(i, M) if (~i&1) {
int p = 0;
rep(j, sz(Cclue[i])) {
rep(k, Cclue[i][j]) res[p++][i] = 1;
p++;
}
}
rep(i, N) rep(j, M) if (((i+j)&1) == 0) res[i][j] = 1;
return res;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |