結果
問題 | No.870 無敵囲い |
ユーザー |
![]() |
提出日時 | 2020-03-21 01:13:32 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 2 ms / 300 ms |
コード長 | 2,433 bytes |
コンパイル時間 | 2,115 ms |
コンパイル使用メモリ | 196,756 KB |
最終ジャッジ日時 | 2025-01-09 08:54:24 |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 18 |
ソースコード
#include <bits/stdc++.h>using namespace std;using ll = long long;using VI = vector<int>;using VL = vector<ll>;using PII = std::pair<int, int>;using PLL = std::pair<ll, ll>;#define rep(i, n) for (int i = 0; i < (int)(n); i++)#define repr(i, n) for (int i = (int)(n)-1; i >= 0; i--)#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)#define allpt(v) (v).begin(), (v).end()#define allpt_c(v) (v).cbegin(), (v).cend()#define allpt_r(v) (v).rbegin(), (v).rend()const int mod = 1e9 + 7;const string wsp = " ";const string tb = "\t";const string rt = "\n";template <typename T>void show1dvec(const vector<T> &v){if (v.size() == 0)return;int n = v.size() - 1;rep(i, n) cout << v[i] << wsp;cout << v[n] << rt;return;}template <typename T>void show2dvec(const vector<vector<T>> &v){int n = v.size();rep(i, n) show1dvec(v[i]);}template <typename T, typename S>void show1dpair(const vector<pair<T, S>> &v){int n = v.size();rep(i, n) cout << v[i].first << wsp << v[i].second << rt;return;}template <typename T, typename S>void pairzip(const vector<pair<T, S>> &v, vector<T> &t, vector<T> &s){int n = v.size();rep(i, n){t.push_back(v[i].first);s.push_back(v[i].second);}return;}template <typename T>void maxvec(vector<T> &v){T s = v[0];int n = v.size();rep(i, n - 1){if (s > v[i + 1]){v[i + 1] = s;}s = v[i + 1];}}template <typename T, typename S>bool myfind(T t, S s){return find(t.cbegin(), t.cend(), s) != t.cend();}void cumsum(VL &v){ll s = 0;rep(i, v.size()){s += v[i];if (s >= mod)s -= mod;v[i] = s;}}int main(){#ifdef DEBUGcout << "DEBUG MODE" << endl;ifstream in("input.txt"); //for debugcin.rdbuf(in.rdbuf()); //for debug#endifint n, x1, y1, x2, y2;PII p;cin >> n;vector<PII> koma = {make_pair(2, 8), make_pair(3, 9), make_pair(7, 9)},koma2 = {make_pair(5, 8), make_pair(4, 8), make_pair(6, 8)};rep(i, n){cin >> x1 >> y1 >> x2 >> y2;p = make_pair(x1, y1);rep(j, 3){if (koma[j] == p)koma[j] = make_pair(x2, y2);}}cout << ((koma == koma2) ? "YES" : "NO") << rt;return 0;}