結果
問題 | No.3031 曲面の向き付け |
ユーザー |
👑 ![]() |
提出日時 | 2025-02-21 23:29:55 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 556 ms / 2,000 ms |
コード長 | 5,271 bytes |
コンパイル時間 | 4,436 ms |
コンパイル使用メモリ | 193,092 KB |
実行使用メモリ | 41,472 KB |
最終ジャッジ日時 | 2025-02-21 23:30:09 |
合計ジャッジ時間 | 12,864 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 29 |
ソースコード
#include <algorithm>#include <atcoder/all>#include <bitset>#include <cassert>#include <cmath>#include <ctime>#include <functional>#include <iomanip>#include <iostream>#include <map>#include <queue>#include <random>#include <set>#include <stack>#include <string>#include <tuple>#include <unordered_map>#include <unordered_set>#include <utility>#include <vector>using namespace std;using namespace atcoder;typedef long long 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 repk(i, k, n) for (int i = k; i < (int)(n); i++)#define all(v) v.begin(), v.end()#define mod1 1000000007#define mod2 998244353#define mod3 100000007#define vi vector<int>#define vs vector<string>#define vc vector<char>#define vl vector<ll>#define vb vector<bool>#define vvi vector<vector<int>>#define vvc vector<vector<char>>#define vvl vector<vector<ll>>#define vvb vector<vector<bool>>#define vvvi vector<vector<vector<int>>>#define vvvl vector<vector<vector<ll>>>#define pii pair<int, int>#define pil pair<int, ll>#define pli pair<ll, int>#define pll pair<ll, ll>#define vpii vector<pair<int, int>>#define vpll vector<pair<ll, ll>>#define vvpii vector<vector<pair<int, int>>>#define vvpll vector<vector<pair<ll, ll>>>// using mint = modint998244353;template <typename T>void debug(T e) {cerr << e << endl;}template <typename T>void debug(vector<T> &v) {rep(i, v.size()) { cerr << v[i] << " "; }cerr << endl;}template <typename T>void debug(vector<vector<T>> &v) {rep(i, v.size()) {rep(j, v[i].size()) { cerr << v[i][j] << " "; }cerr << endl;}}template <typename T>void debug(vector<pair<T, T>> &v) {rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }}template <typename T>void debug(set<T> &st) {for (auto itr = st.begin(); itr != st.end(); itr++) {cerr << *itr << " ";}cerr << endl;}template <typename T>void debug(multiset<T> &ms) {for (auto itr = ms.begin(); itr != ms.end(); itr++) {cerr << *itr << " ";}cerr << endl;}template <typename T>void debug(map<T, T> &mp) {for (auto itr = mp.begin(); itr != mp.end(); itr++) {cerr << itr->first << " " << itr->second << endl;}}void debug_out() { cerr << endl; }template <typename Head, typename... Tail>void debug_out(Head H, Tail... T) {cerr << H << " ";debug_out(T...);}using mint = modint998244353;bool issame(vector<ll> &A, vector<ll> &B, vector<ll> &C, ll i, ll j) {// true なら同じ向き,false なら違う向きif (A[i] == A[j] && B[i] == B[j]) {return false;} else if (A[i] == A[j] && B[i] == C[j]) {return true;} else if (A[i] == A[j] && C[i] == B[j]) {return true;} else if (A[i] == A[j] && C[i] == C[j]) {return false;} else if (A[i] == B[j] && B[i] == C[j]) {return false;} else if (A[i] == B[j] && C[i] == C[j]) {return true;} else if (B[i] == A[j] && C[i] == B[j]) {return false;} else if (B[i] == A[j] && C[i] == C[j]) {return true;}return false;}int main() {ll M;cin >> M;vector<ll> A(M);vector<ll> B(M);vector<ll> C(M);for (ll i = 0; i < M; i++) {cin >> A[i] >> B[i] >> C[i];}map<pair<ll, ll>, vector<ll>> mp;for (ll i = 0; i < M; i++) {mp[make_pair(A[i], B[i])].push_back(i);mp[make_pair(A[i], C[i])].push_back(i);mp[make_pair(B[i], C[i])].push_back(i);}vector<vector<ll>> graph(M, vector<ll>(0));for (auto itr = mp.begin(); itr != mp.end(); itr++) {if ((itr->second).size() > 2) {cout << "NO" << endl;return 0;} else if ((itr->second).size() == 2) {ll v1 = (itr->second)[0];ll v2 = (itr->second)[1];graph[v1].push_back(v2);graph[v2].push_back(v1);}}// debug(graph);// 二部グラフ判定// 「単純な二部グラフ」というわけではなさそうであるvector<ll> col(M, -1);queue<ll> que;for (ll i = 0; i < M; i++) {if (col[i] != -1) {continue;}col[i] = 0;que.push(i);while (que.size()) {ll p = que.front();que.pop();for (ll x : graph[p]) {if (col[x] != -1) {if (issame(A, B, C, x, p)) {if (col[x] != col[p]) {cout << "NO" << endl;return 0;}} else {if (col[x] == col[p]) {cout << "NO" << endl;// debug(col);return 0;}}continue;}if (issame(A, B, C, x, p)) {col[x] = col[p];} else {col[x] = 1 - col[p];}que.push(x);}}}cout << "YES" << endl;}