結果
| 問題 | No.1056 2D Lamps |
| ユーザー |
 NyaanNyaan
|
| 提出日時 | 2020-05-15 22:30:47 |
| 言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 8,072 bytes |
| コンパイル時間 | 2,449 ms |
| コンパイル使用メモリ | 169,184 KB |
| 実行使用メモリ | 16,368 KB |
| 最終ジャッジ日時 | 2023-10-19 15:20:48 |
| 合計ジャッジ時間 | 6,576 ms |
|
ジャッジサーバーID （参考情報） |
judge11 / judge12 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | WA | - |
| testcase_01 | WA | - |
| testcase_02 | WA | - |
| testcase_03 | WA | - |
| testcase_04 | WA | - |
| testcase_05 | WA | - |
| testcase_06 | WA | - |
| testcase_07 | WA | - |
| testcase_08 | WA | - |
| testcase_09 | WA | - |
| testcase_10 | WA | - |
| testcase_11 | WA | - |
| testcase_12 | WA | - |
| testcase_13 | WA | - |
| testcase_14 | WA | - |
| testcase_15 | WA | - |
| testcase_16 | WA | - |
ソースコード
#pragma region kyopro_template
#include <bits/stdc++.h>
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define each(x, v) for (auto &x : v)
#define all(v) (v).begin(), (v).end()
#define sz(v) ((int)(v).size())
#define mem(a, val) memset(a, val, sizeof(a))
#define ini(...) \
int __VA_ARGS__; \
in(__VA_ARGS__)
#define inl(...) \
long long __VA_ARGS__; \
in(__VA_ARGS__)
#define ins(...) \
string __VA_ARGS__; \
in(__VA_ARGS__)
#define inc(...) \
char __VA_ARGS__; \
in(__VA_ARGS__)
#define in2(s, t) \
for (int i = 0; i < (int)s.size(); i++) { \
in(s[i], t[i]); \
}
#define in3(s, t, u) \
for (int i = 0; i < (int)s.size(); i++) { \
in(s[i], t[i], u[i]); \
}
#define in4(s, t, u, v) \
for (int i = 0; i < (int)s.size(); i++) { \
in(s[i], t[i], u[i], v[i]); \
}
#define rep(i, N) for (long long i = 0; i < (long long)(N); i++)
#define repr(i, N) for (long long i = (long long)(N)-1; i >= 0; i--)
#define rep1(i, N) for (long long i = 1; i <= (long long)(N); i++)
#define repr1(i, N) for (long long i = (N); (long long)(i) > 0; i--)
using namespace std;
void solve();
using ll = long long;
template <class T = ll>
using V = vector<T>;
using vi = vector<int>;
using vl = vector<long long>;
using vvi = vector<vector<int>>;
using vd = V<double>;
using vs = V<string>;
using vvl = vector<vector<long long>>;
using P = pair<long long, long long>;
using vp = vector<P>;
using pii = pair<int, int>;
using vpi = vector<pair<int, int>>;
constexpr int inf = 1001001001;
constexpr long long infLL = (1LL << 61) - 1;
template <typename T, typename U>
inline bool amin(T &x, U y) {
return (y < x) ? (x = y, true) : false;
}
template <typename T, typename U>
inline bool amax(T &x, U y) {
return (x < y) ? (x = y, true) : false;
}
template <typename T, typename U>
ll ceil(T a, U b) {
return (a + b - 1) / b;
}
constexpr ll TEN(int n) {
ll ret = 1, x = 10;
while (n) {
if (n & 1) ret *= x;
x *= x;
n >>= 1;
}
return ret;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << p.first << " " << p.second;
return os;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p) {
is >> p.first >> p.second;
return is;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
int s = (int)v.size();
for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v) {
for (auto &x : v) is >> x;
return is;
}
void in() {}
template <typename T, class... U>
void in(T &t, U &... u) {
cin >> t;
in(u...);
}
void out() { cout << "\n"; }
template <typename T, class... U>
void out(const T &t, const U &... u) {
cout << t;
if (sizeof...(u)) cout << " ";
out(u...);
}
template <typename T>
void die(T x) {
out(x);
exit(0);
}
#ifdef NyaanDebug
#include "NyaanDebug.h"
#define trc(...) \
do { \
cerr << #__VA_ARGS__ << " = "; \
dbg_out(__VA_ARGS__); \
} while (0)
#define trca(v, N) \
do { \
cerr << #v << " = "; \
array_out(v, N); \
} while (0)
#define trcc(v) \
do { \
cerr << #v << " = {"; \
each(x, v) { cerr << " " << x << ","; } \
cerr << "}" << endl; \
} while (0)
#else
#define trc(...)
#define trca(...)
#define trcc(...)
int main() { solve(); }
#endif
struct IoSetupNya {
IoSetupNya() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
cerr << fixed << setprecision(7);
}
} iosetupnya;
inline int popcount(unsigned long long a) { return __builtin_popcountll(a); }
inline int lsb(unsigned long long a) { return __builtin_ctzll(a); }
inline int msb(unsigned long long a) { return 63 - __builtin_clzll(a); }
template <typename T>
inline int getbit(T a, int i) {
return (a >> i) & 1;
}
template <typename T>
inline void setbit(T &a, int i) {
a |= (1LL << i);
}
template <typename T>
inline void delbit(T &a, int i) {
a &= ~(1LL << i);
}
template <typename T>
int lb(const vector<T> &v, const T &a) {
return lower_bound(begin(v), end(v), a) - begin(v);
}
template <typename T>
int ub(const vector<T> &v, const T &a) {
return upper_bound(begin(v), end(v), a) - begin(v);
}
template <typename T>
vector<T> mkrui(const vector<T> &v) {
vector<T> ret(v.size() + 1);
for (int i = 0; i < int(v.size()); i++) ret[i + 1] = ret[i] + v[i];
return ret;
};
template <typename T>
vector<T> mkuni(const vector<T> &v) {
vector<T> ret(v);
sort(ret.begin(), ret.end());
ret.erase(unique(ret.begin(), ret.end()), ret.end());
return ret;
}
template <typename T>
vector<int> mkord(int N, function<bool(int, int)> f) {
vector<int> ord(N);
iota(begin(ord), end(ord), 0);
sort(begin(ord), end(ord), f);
return ord;
}
#pragma endregion
constexpr long long MOD = /** 1000000007; //*/ 998244353;
template <size_t N>
bitset<N> gcd(bitset<N> x, bitset<N> y) {
int xm = int(N) - 1, ym = int(N) - 1;
while (xm != -1 && x[xm] == 0) xm--;
while (ym != -1 && y[ym] == 0) ym--;
if (xm < ym) swap(x, y), swap(xm, ym);
while (ym >= 0) {
x ^= y << (xm - ym);
while (xm != -1 && x[xm] == 0) xm--;
while (ym != -1 && y[ym] == 0) ym--;
if (xm < ym) swap(x, y), swap(xm, ym);
}
return x;
}
template <size_t MAX_H, size_t MAX_W>
struct BitMat {
int H, W;
bitset<MAX_W> a[MAX_H];
BitMat(int h, int w) : H(h), W(w) {}
inline bitset<MAX_W> &operator[](int i) { return a[i]; }
};
template <size_t MAX_H, size_t MAX_W>
int Gauss(BitMat<MAX_H, MAX_W> &A, bool is_greater = true,
bool is_extended = false) {
int rank = 0, H = A.H, W = (is_extended ? A.W - 1 : A.W);
for (int j = (is_greater ? W - 1 : 0); j != (is_greater ? -1 : W);
j += (is_greater ? -1 : 1)) {
for (int i = rank; i < H; i++) {
if (A[i][j] == 1) {
swap(A[rank], A[i]);
for (int k = 0; k < H; k++) {
if (k != rank && A[k][j]) A[k] ^= A[rank];
}
rank++;
break;
}
}
}
if (is_extended) {
for (int i = rank; i < H; i++)
if (A[i][W] == 1) return -1;
}
return rank;
}
template <size_t MAX_H, size_t MAX_W>
void OrthogonalComplement(BitMat<MAX_H, MAX_W> &A, int N) {
int rank = 0;
while (rank < N && A[rank].any()) rank++;
for (int i = 0; i < rank; i++) {
int j = A[i]._Find_first();
if (j != i)
for (int k = 0; k < rank; k++) {
int buf = A[k][i];
A[k][i] = A[k][j];
A[k][j] = buf;
}
}
for (int i = rank; i < N; i++) {
for (int j = 0; j < N; j++) {
A[i][j] = (j < rank ? A[j][i] : i == j);
}
}
}
void solve(){
ini(N,M);
BitMat<1300, 40100> mat(6*N,N*N),mat2(M,N*N);
rep(i,M)rep(j,N)rep(k,N){
inc(c);
if(c=='#') mat2[i][j*N+k]=1;
}
// 基底
// ヨコ
rep(i,N){
rep(j,N) mat[i][N*i+j]=1;
}
// タテ
for(int i=N;i<2*N;i++){
rep(j,N) mat[i][N*j+i-N]=1;
}
// ナナメ
for(int s=0;s<2*N-1;s++){
int i=2*N+s;
rep(j,s+1){
int k=s-j;
if(j>=N||k>=N)continue;
trc(j,k);
mat[i][j*N+k]=1;
}
}
// 逆斜め
for(int s=0;s<2*N-1;s++){
int i=4*N+s;
rep(j,s+1){
int k=s-j;
if(j>=N||k>=N)continue;
mat[i][(N-1-j)*N+k]=1;
}
}
#ifdef NyaanDebug
rep(i,N*6) {
rep(j,N*N)cerr<<mat[i][j]<<" ";
cerr<<endl;
}
cerr<<endl;
#endif
int rank = Gauss(mat, false);
#ifdef NyaanDebug
rep(i,rank) {
rep(j,N*N)cerr<<mat[i][j]<<" ";
cerr<<endl;
}
#endif
rep(n,rank){
int b1 = mat[n]._Find_first();
rep(i,M) {
if(mat2[i][b1] == 1) mat2[i] ^= mat[n];
}
}
rep(i,M) {
for(int j=i+1;j<M;j++){
cout<< (mat2[i] == mat2[j]);
}
cout<<endl;
}
}