結果

問題 No.1717 Levi-Civita Triangle
ユーザー fuppy_kyoprofuppy_kyopro
提出日時 2021-10-22 23:12:11
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 92 ms / 2,000 ms
コード長 5,012 bytes
コンパイル時間 2,314 ms
コンパイル使用メモリ 204,344 KB
最終ジャッジ日時 2025-01-25 04:11:16
ジャッジサーバーID
（参考情報） 		judge5 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 42
権限があれば一括ダウンロードができます

ソースコード

diff # 

/*
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
//*/

#include <bits/stdc++.h>

// #include <atcoder/all>
// #include <atcoder/modint>

using namespace std;
// using namespace atcoder;

#define DEBUG(x) cerr << #x << ": " << x << endl;
#define DEBUG_VEC(v)                                        \
    cerr << #v << ":";                                      \
    for (int iiiiiiii = 0; iiiiiiii < v.size(); iiiiiiii++) \
        cerr << " " << v[iiiiiiii];                         \
    cerr << endl;
#define DEBUG_MAT(v)                            \
    cerr << #v << endl;                         \
    for (int i = 0; i < v.size(); i++) {        \
        for (int j = 0; j < v[i].size(); j++) { \
            cerr << v[i][j] << " ";             \
        }                                       \
        cerr << endl;                           \
    }
typedef long long ll;
// #define int ll

#define vi vector<int>
#define vl vector<ll>
#define vii vector<vector<int>>
#define vll vector<vector<ll>>
#define vs vector<string>
#define pii pair<int, int>
#define pis pair<int, string>
#define psi pair<string, int>
#define pll pair<ll, ll>
template <class S, class T>
pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) {
    return pair<S, T>(s.first + t.first, s.second + t.second);
}
template <class S, class T>
pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template <class S, class T>
ostream &operator<<(ostream &os, pair<S, T> p) {
    os << "(" << p.first << ", " << p.second << ")";
    return os;
}
#define X first
#define Y second
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define rrep1(i, n) for (int i = (int)(n); i > 0; i--)
#define REP(i, a, b) for (int i = a; i < b; i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(), c.end()
void YES(bool t = true) {
    cout << (t ? "YES" : "NO") << endl;
}
void Yes(bool t = true) { cout << (t ? "Yes" : "No") << endl; }
void yes(bool t = true) { cout << (t ? "yes" : "no") << endl; }
void NO(bool t = true) { cout << (t ? "NO" : "YES") << endl; }
void No(bool t = true) { cout << (t ? "No" : "Yes") << endl; }
void no(bool t = true) { cout << (t ? "no" : "yes") << endl; }
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 (a > b) {
        a = b;
        return 1;
    }
    return 0;
}
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const long double pi = 3.1415926535897932384626433832795028841971L;
int popcount(ll t) { return __builtin_popcountll(t); }
// int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
// int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
vi dx = {0, 1, 0, -1}, dy = {-1, 0, 1, 0};
// vi dx2 = { 1,1,0,-1,-1,-1,0,1 }, dy2 = { 0,1,1,1,0,-1,-1,-1 };
struct Setup_io {
    Setup_io() {
        ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
        cout << fixed << setprecision(25);
    }
} setup_io;
// const ll MOD = 1000000007;
const ll MOD = 998244353;
// #define mp make_pair
//#define endl '\n'

int calc(vi b) {
    vi c(1);

    vi diffs;
    rep(i, 3) {
        int d = b[(i + 1) % 3] - b[i];
        d = (d + 3) % 3;
        diffs.push_back(d);
    }
    sort(all(diffs));

    if (diffs[0] == diffs.back() && diffs[0] != 0)
        return diffs[0];
    else
        return 0;
}

vi change(vi a) {
    vi res;
    rep(i, a.size() - 2) {
        vi temp = {a[i], a[i + 1], a[i + 2]};
        res.push_back(calc(temp));
    }
    return res;
}

signed main() {
    int n;
    cin >> n;
    n = 2 * n + 1;

    vi a(n);
    rep(i, n) cin >> a[i];

    vi b(3);
    rep(i, 3) b[i] = a[i];
    vi c(1);
    c[0] = calc(b);

    // n = 13;
    for (int i = 3; i < n; i++) {
        bool flag = false;
        rep(x, 3) {
            if (x == b.back()) continue;

            vi temp = {b[b.size() - 2], b.back(), x};
            int y = calc(temp);
            if (y == c.back()) continue;

            b.push_back(x);
            c.push_back(y);
            flag = true;
            break;
        }
        if (!flag) {
            cout << 0 << endl;
            return 0;
        }
    }

    // DEBUG_VEC(b);
    // rep(i, n / 2) {
    //     b = change(b);
    //     DEBUG_VEC(b);
    // }

    // DEBUG_VEC(b);
    // DEBUG_VEC(c);

    if (a != b) {
        cout << 0 << endl;
        return 0;
    }

    int syu = n / 2;
    syu--;

    if (c[0] == 0) {
        cout << 0 << endl;
    } else {
        if (syu % 2 == 0) {
            cout << c[0] << endl;
        } else {
            if (c[0] == 1)
                cout << 2 << endl;
            else
                cout << 1 << endl;
        }
    }
}
0