結果
問題 | No.1717 Levi-Civita Triangle |
ユーザー |
![]() |
提出日時 | 2021-10-22 23:28:00 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 22 ms / 2,000 ms |
コード長 | 2,619 bytes |
コンパイル時間 | 1,403 ms |
コンパイル使用メモリ | 119,980 KB |
最終ジャッジ日時 | 2025-01-25 04:25:09 |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 42 |
ソースコード
#include <iostream>#include <algorithm>#include <iomanip>#include <vector>#include <queue>#include <set>#include <map>#include <tuple>#include <cmath>#include <numeric>#include <functional>#include <cassert>#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }using namespace std;typedef long long ll;template<typename T>void print_vector(vector<T> v, char delimiter=' '){if(v.empty()) {cout << endl;return;}for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;cout << v.back() << endl;}vector<int> as_base3(int x, int n){vector<int> ans;for(int i = 0; i < n; i++){ans.push_back(x%3);x /= 3;}return ans;}int f(int a, int b, int c){if(a == b || b == c || c == a) return 0;int r = (3+b-a)%3;return r;}int calc(vector<int> v){if(v.size() == 1) return v[0];int n = v.size();vector<int> u;for(int i = 1; i < n-1; i++){u.push_back(f(v[i-1], v[i], v[i+1]));}return calc(u);}int solve(vector<int> a){int n = a.size()/2;vector<int> b(2*n);for(int i = 0; i < 2*n; i++) b[i] = (a[i+1]-a[i]+3)%3;// print_vector(b);for(int i = 0; i < 2*n; i++){if(b[i] == 0) return 0;}vector<int> c;for(int i = 0; i < n; i++){if(i%2 == 0) {c.push_back(b[0]);c.push_back(b[0]);}else{c.push_back(3-b[0]);c.push_back(3-b[0]);}}if(b != c) return 0;if(n%2 == 1){return b[0];}else{return 3-b[0];}}void test(int n){int mx = 1;for(int i = 0; i < n; i++) mx *= 3;for(int x = 0; x < mx; x++) {auto v = as_base3(x, n);// print_vector(v);// cout << calc(v) << ' ' << solve(v) << endl;// assert(calc(v) == solve(v));if(calc(v) != 0) {print_vector(v);cout << calc(v) << ' ' << solve(v) << endl;}else{assert(solve(v) == 0);}}}int main(){ios::sync_with_stdio(false);cin.tie(0);cout << setprecision(10) << fixed;int n; cin >> n;// test(n);vector<int> a(2*n+1);for(int i = 0; i < 2*n+1; i++) cin >> a[i];cout << solve(a) << endl;}