結果
問題 | No.870 無敵囲い |
ユーザー |
![]() |
提出日時 | 2019-08-30 21:33:36 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 2 ms / 300 ms |
コード長 | 2,114 bytes |
コンパイル時間 | 1,528 ms |
コンパイル使用メモリ | 166,804 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-06-29 06:15:30 |
合計ジャッジ時間 | 2,258 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 18 |
ソースコード
#include <bits/stdc++.h>using namespace std;#define REP(i, m, n) for (int i = (m); i < (int)(n); i++)#define rep(i, n) REP(i, 0, n)#define rrep(i, x) for (int i = ((int)(x)-1); i >= 0; i--)#define all(x) (x).begin(), (x).end()#define rall(x) (x).rbegin(), (x).rend()#define pb push_back#define mp make_pairtypedef long long ll;const ll INF = 1LL << 60;const ll mod = 1e9 + 7;template <class T>bool chmax(T &a, const T &b){if (a < b){a = b;return 1;}return 0;}template <class T>bool chmin(T &a, const T &b){if (b < a){a = b;return 1;}return 0;}ll modpow(ll a, ll p){if (p == 0)return 1;if (!(p % 2)){ll halfP = p / 2;ll half = modpow(a, halfP);return half * half % mod;}else{return a * modpow(a, p - 1) % mod;}}ll comb(int a, int b){if (b > a - b)return comb(a, a - b);ll ansMul = 1;ll ansDiv = 1;for (int i = 0; i < b; i++){ansMul *= a - i;ansDiv *= i + 1;ansMul %= mod;ansDiv %= mod;}ll ans = ansMul * modpow(ansDiv, mod - 2) % mod;return ans;}/*int num = 200010;vector<ll> fact(num), ifact(num);fact[0] = 1;fact[1] = 1;for (int i = 2; i < num; i++) {fact[i] = fact[i-1] * i;fact[i] %= mod;}for (int i = 0; i < num; i++) {ifact[i] = modpow(ifact[i], mod-2);ifact[i] %= mod;}*/int main() {int N; cin >> N;int a, b, c, d, e, f;a = 2; b = 8;c = 3; d = 9;e = 7; f = 9;rep(i, N) {int x, y; cin >> x >> y;int nx, ny; cin >> nx >> ny;if (x == a && y == b){a = nx;b = ny;}else if (x == c && y == d){c = nx;d = ny;}else if (x == e && y == f){e = nx;f = ny;}}if (a == 5 && b == 8 && c == 4 && d == 8 && e == 6 && f == 8) {cout << "YES" << endl;} else {cout << "NO" << endl;}}