結果
問題 | No.2702 Nand Nor Matrix |
ユーザー | tokusakurai |
提出日時 | 2024-03-29 22:01:06 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 6,013 bytes |
コンパイル時間 | 2,303 ms |
コンパイル使用メモリ | 204,044 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-09-30 15:57:58 |
合計ジャッジ時間 | 9,137 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
5,248 KB |
testcase_01 | WA | - |
testcase_02 | AC | 45 ms
5,248 KB |
testcase_03 | AC | 46 ms
5,248 KB |
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 | AC | 46 ms
5,248 KB |
testcase_16 | WA | - |
testcase_17 | AC | 31 ms
5,248 KB |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | AC | 83 ms
5,248 KB |
testcase_28 | WA | - |
testcase_29 | WA | - |
testcase_30 | WA | - |
testcase_31 | WA | - |
testcase_32 | WA | - |
testcase_33 | WA | - |
testcase_34 | WA | - |
testcase_35 | WA | - |
testcase_36 | AC | 94 ms
5,248 KB |
testcase_37 | WA | - |
testcase_38 | WA | - |
testcase_39 | AC | 95 ms
5,248 KB |
testcase_40 | WA | - |
testcase_41 | WA | - |
testcase_42 | WA | - |
testcase_43 | WA | - |
testcase_44 | WA | - |
testcase_45 | WA | - |
testcase_46 | WA | - |
testcase_47 | WA | - |
testcase_48 | WA | - |
testcase_49 | WA | - |
testcase_50 | WA | - |
testcase_51 | AC | 60 ms
5,248 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; #define rep(i, n) for (int i = 0; i < (n); i++) #define per(i, n) for (int i = (n)-1; i >= 0; i--) #define rep2(i, l, r) for (int i = (l); i < (r); i++) #define per2(i, l, r) for (int i = (r)-1; i >= (l); i--) #define each(e, v) for (auto &e : v) #define MM << " " << #define pb push_back #define eb emplace_back #define all(x) begin(x), end(x) #define rall(x) rbegin(x), rend(x) #define sz(x) (int)x.size() using ll = long long; using pii = pair<int, int>; using pil = pair<int, ll>; using pli = pair<ll, int>; using pll = pair<ll, ll>; template <typename T> using minheap = priority_queue<T, vector<T>, greater<T>>; template <typename T> using maxheap = priority_queue<T>; template <typename T> bool chmax(T &x, const T &y) { return (x < y) ? (x = y, true) : false; } template <typename T> bool chmin(T &x, const T &y) { return (x > y) ? (x = y, true) : false; } template <typename T> int flg(T x, int i) { return (x >> i) & 1; } int pct(int x) { return __builtin_popcount(x); } int pct(ll x) { return __builtin_popcountll(x); } int topbit(int x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); } int topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); } int botbit(int x) { return (x == 0 ? -1 : __builtin_ctz(x)); } int botbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); } template <typename T> void print(const vector<T> &v, T x = 0) { int n = v.size(); for (int i = 0; i < n; i++) cout << v[i] + x << (i == n - 1 ? '\n' : ' '); if (v.empty()) cout << '\n'; } template <typename T> void printn(const vector<T> &v, T x = 0) { int n = v.size(); for (int i = 0; i < n; i++) cout << v[i] + x << '\n'; } template <typename T> void err_print(const vector<T> &v, T x = 0) { int n = v.size(); for (int i = 0; i < n; i++) cerr << v[i] + x << ' '; cerr << endl; } template <typename T> int lb(const vector<T> &v, T x) { return lower_bound(begin(v), end(v), x) - begin(v); } template <typename T> int ub(const vector<T> &v, T x) { return upper_bound(begin(v), end(v), x) - begin(v); } template <typename T> void rearrange(vector<T> &v) { sort(begin(v), end(v)); v.erase(unique(begin(v), end(v)), end(v)); } template <typename T> vector<int> id_sort(const vector<T> &v, bool greater = false) { int n = v.size(); vector<int> ret(n); iota(begin(ret), end(ret), 0); sort(begin(ret), end(ret), [&](int i, int j) { return greater ? v[i] > v[j] : v[i] < v[j]; }); return ret; } template <typename T> void reorder(vector<T> &a, const vector<int> &ord) { int n = a.size(); vector<T> b(n); for (int i = 0; i < n; i++) b[i] = a[ord[i]]; swap(a, b); } template <typename T> T floor(T x, T y) { assert(y != 0); if (y < 0) x = -x, y = -y; return (x >= 0 ? x / y : (x - y + 1) / y); } template <typename T> T ceil(T x, T y) { assert(y != 0); if (y < 0) x = -x, y = -y; return (x >= 0 ? (x + y - 1) / y : x / y); } template <typename S, typename T> pair<S, T> operator+(const pair<S, T> &p, const pair<S, T> &q) { return make_pair(p.first + q.first, p.second + q.second); } template <typename S, typename T> pair<S, T> operator-(const pair<S, T> &p, const pair<S, T> &q) { return make_pair(p.first - q.first, p.second - q.second); } template <typename S, typename T> istream &operator>>(istream &is, pair<S, T> &p) { S a; T b; is >> a >> b; p = make_pair(a, b); return is; } template <typename S, typename T> ostream &operator<<(ostream &os, const pair<S, T> &p) { return os << p.first << ' ' << p.second; } struct io_setup { io_setup() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout << fixed << setprecision(15); cerr << fixed << setprecision(15); } } io_setup; constexpr int inf = (1 << 30) - 1; constexpr ll INF = (1LL << 60) - 1; // constexpr int MOD = 1000000007; constexpr int MOD = 998244353; struct Random_Number_Generator { mt19937_64 mt; Random_Number_Generator() : mt(chrono::steady_clock::now().time_since_epoch().count()) {} // 区間 [l,r) の整数で乱数発生 int64_t operator()(int64_t l, int64_t r) { uniform_int_distribution<int64_t> dist(l, r - 1); return dist(mt); } // 区間 [0,r) の整数で乱数発生 int64_t operator()(int64_t r) { return (*this)(0, r); } } rng; void solve() { int N; cin >> N; vector<int> a(N, 0), b(N, 0); rep(i, N) cin >> a[i]; rep2(i, 1, N) cin >> b[i]; int x = 1, y = 1; while (x < N && (a[1] + x - 1) % 2 == a[x] % 2) x++; while (y < N && (b[1] + y - 1) % 2 == b[y] % 2) y++; int Q; cin >> Q; while (Q--) { ll T; int i, j; cin >> T >> i >> j; i--, j--; if (i == 0) { cout << a[j] << '\n'; } else if (j == 0) { cout << b[i] << '\n'; } else if (a[1] != b[1]) { cout << T % 2 << '\n'; } else if (i >= x || j >= y) { cout << T % 2 << '\n'; } else if (T >= i + j - 1) { if (a[1] == 0) { cout << (i + j + 1) % 2 << '\n'; } else { cout << (i + j) % 2 << '\n'; } } else { cout << T % 2 << '\n'; } } // vector<vector<int>> a(N, vector<int>(N, 0)); // // rep(i, N) a[0][i] = rng(2), a[i][0] = rng(2); // rep(i, N) cin >> a[0][i]; // rep(i, N) cin >> a[i][0]; // rep(_, 10) { // rep(i, N) print(a[i]); // cout << "----------------------------------------------\n"; // auto b = a; // rep2(i, 1, N) rep2(j, 1, N) { // if (a[i][j] == 0) { // b[i][j] = (a[i - 1][j] & a[i][j - 1]) ^ 1; // } else { // b[i][j] = (a[i - 1][j] | a[i][j - 1]) ^ 1; // } // } // swap(a, b); // } } int main() { int T = 1; // cin >> T; while (T--) solve(); }