結果
問題 | No.2702 Nand Nor Matrix |
ユーザー |
![]() |
提出日時 | 2024-08-11 17:39:56 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 381 ms / 2,000 ms |
コード長 | 5,523 bytes |
コンパイル時間 | 4,087 ms |
コンパイル使用メモリ | 264,112 KB |
実行使用メモリ | 6,528 KB |
最終ジャッジ日時 | 2024-08-11 17:40:18 |
合計ジャッジ時間 | 21,929 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 51 |
ソースコード
#include <bits/stdc++.h>#if __has_include(<atcoder/all>)#include <atcoder/all>using namespace atcoder;#endifusing namespace std;// #include "boost/multiprecision/cpp_int.hpp"// using namespace boost::multiprecision;// #pragma GCC target("avx2")// #pragma GCC optimize("O3")// #pragma GCC optimize("unroll-loops")#define ll long long#define rep(i, n) for (ll i = 0; i < n; ++i)#define rep_up(i, a, n) for (ll i = a; i < n; ++i)#define rep_down(i, a, n) for (ll i = a; i >= n; --i)#define P pair<ll, ll>#define pb push_back#define bit_count(x) __builtin_popcountll(x)#define gcd(a, b) __gcd(a, b)#define lcm(a, b) a / gcd(a, b) * b// #define endl "\n"#define all(v) v.begin(), v.end()#define fi first#define se second#define vll vector<ll>#define vvll vector<vll>#define vvvll vector<vvll>#define vvvvll vector<vvvll>#define pqll priority_queue<ll>#define pqllg priority_queue<ll, vector<ll>, greater<ll>>template <class T>inline void vin(vector<T> &v) { rep(i, v.size()) cin >> v.at(i); }template <class T>using V = vector<T>;constexpr ll INF = (1ll << 60);// constexpr ll mod = 1000000007;constexpr ll mod = 998244353;// using mint = atcoder::modint;using mint = atcoder::modint998244353;// using mint = atcoder::modint1000000007;#define vmint vector<mint>#define vvmint vector<vmint>#define vvvmint vector<vvmint>#define vvvvmint vector<vvvmint>constexpr double pi = 3.14159265358979323846;random_device seed_gen;mt19937 engine(seed_gen());template <typename T>inline bool chmax(T &a, T b){if (a < b){a = b;return 1;}return 0;}template <typename T>inline bool chmin(T &a, T b){if (a > b){a = b;return 1;}return 0;}template <typename T>void pt(T val){cout << val << "\n";}template <typename T>void pt_vll(vector<T> &v){ll vs = v.size();rep(i, vs){cout << v[i];if (i == vs - 1)cout << "\n";elsecout << " ";}}template <typename T>void pt_vmint(vector<T> &v){ll vs = v.size();rep(i, vs){cout << v[i].val();if (i == vs - 1)cout << "\n";elsecout << " ";}}ll mypow(ll a, ll n){ll ret = 1;if (n == 0)return 1;if (a == 0)return 0;rep(i, n){if (ret > (ll)(9e18 + 10) / a)return -1;ret *= a;}return ret;}long long modpow(long long a, long long n, long long mod){long long res = 1;while (n > 0){if (n & 1)res = res * a % mod;a = a * a % mod;n >>= 1;}return res;}long long modinv(long long a, long long m){long long b = m, u = 1, v = 0;while (b){long long t = a / b;a -= t * b;swap(a, b);u -= t * v;swap(u, v);}u %= m;if (u < 0)u += m;return u;}void solve();// ここまでテンプレint main(){ios::sync_with_stdio(false);cin.tie(nullptr);// cout << fixed << setprecision(16);// ll T;// cin >> T;// rep(ca, T)solve();}ll nand(ll x, ll y){if (x == 1 && y == 1)return 0;return 1;}ll nor(ll x, ll y){if (x == 0 && y == 0)return 1;return 0;}void solve(){ll n, m, k, cnt = 0, sum = 0, ans = 0;cin >> n;// ll T = 2 * n;// vvvll z(T + 1, vvll(n, vll(n)));vll x(n);vll y(n);vin(x);// rep(i, n)// {// x[0][0][i] = 0;// }y[0] = x[0];rep(i, n - 1){// x[0][i + 1][0] = 0;cin >> y[i + 1];}// rep(i, n)// {// z[0][0][i] = x[i];// z[0][i][0] = y[i];// }// rep(t, T)// {// rep(i, n)// {// rep(j, n)// {// cout << z[t][i][j];// }// cout << endl;// }// cout << "----" << endl;// rep_up(i, 0, n)// {// rep_up(j, 0, n)// {// if (i == 0 || j == 0)// z[t + 1][i][j] = z[t][i][j];// else if (z[t][i][j] == 0)// z[t + 1][i][j] = nand(z[t][i - 1][j], z[t][i][j - 1]);// else// z[t + 1][i][j] = nor(z[t][i - 1][j], z[t][i][j - 1]);// }// }// }ll mx = n;ll my = n;rep(i, n){if (i > 1 && x[i] == x[i - 1]){my = i;break;}}rep(i, n){if (i > 1 && y[i] == y[i - 1]){mx = i;break;}}if (x[1] != y[1]){chmin(mx, 1ll);chmin(my, 1ll);}// pt(m);mx--;my--;ll q;cin >> q;rep(i, q){ll t, r, c;cin >> t >> r >> c;r--;c--;if (r == 0 || c == 0){if (r == 0)ans = x[c];elseans = y[r];}else if (r > mx || c > my || (r + c) > t + 1){ans = t % 2;}else{// ans = "a");// pt("a");// cout << "a" << endl;ll p = x[1] + r + c + 1;ans = p % 2;}cout << ans << endl;// if (t < T)// assert(ans == z[t][r][c]);}}