結果

問題 No.1605 Matrix Shape
ユーザー rniyarniya
提出日時 2021-07-16 21:39:26
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 4,965 bytes
コンパイル時間 2,139 ms
コンパイル使用メモリ 205,744 KB
実行使用メモリ 15,508 KB
最終ジャッジ日時 2023-09-20 13:21:34
合計ジャッジ時間 6,450 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 3 ms
4,624 KB
testcase_01 AC 3 ms
4,868 KB
testcase_02 AC 3 ms
4,580 KB
testcase_03 AC 3 ms
4,692 KB
testcase_04 WA -
testcase_05 AC 3 ms
4,832 KB
testcase_06 AC 3 ms
4,568 KB
testcase_07 AC 3 ms
4,832 KB
testcase_08 AC 4 ms
4,628 KB
testcase_09 AC 3 ms
4,588 KB
testcase_10 AC 3 ms
4,580 KB
testcase_11 AC 3 ms
4,576 KB
testcase_12 AC 3 ms
4,564 KB
testcase_13 AC 3 ms
4,692 KB
testcase_14 AC 3 ms
4,640 KB
testcase_15 AC 3 ms
4,584 KB
testcase_16 AC 3 ms
4,616 KB
testcase_17 AC 3 ms
4,696 KB
testcase_18 AC 3 ms
4,712 KB
testcase_19 AC 266 ms
15,508 KB
testcase_20 AC 182 ms
11,128 KB
testcase_21 AC 192 ms
10,952 KB
testcase_22 WA -
testcase_23 AC 262 ms
15,456 KB
testcase_24 AC 261 ms
15,396 KB
testcase_25 AC 59 ms
6,156 KB
testcase_26 AC 59 ms
6,152 KB
testcase_27 AC 59 ms
6,168 KB
testcase_28 WA -
testcase_29 AC 59 ms
6,140 KB
testcase_30 AC 169 ms
11,024 KB
testcase_31 AC 181 ms
10,976 KB
testcase_32 AC 119 ms
8,528 KB
testcase_33 WA -
testcase_34 AC 45 ms
6,272 KB
testcase_35 AC 151 ms
13,404 KB
testcase_36 AC 77 ms
10,112 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#define LOCAL
#include <bits/stdc++.h>
using namespace std;
#pragma region Macros
typedef long long ll;
typedef __int128_t i128;
typedef unsigned int uint;
typedef unsigned long long ull;
#define ALL(x) (x).begin(), (x).end()

template <typename T> istream& operator>>(istream& is, vector<T>& v) {
    for (T& x : v) is >> x;
    return is;
}
template <typename T> ostream& operator<<(ostream& os, const vector<T>& v) {
    for (int i = 0; i < (int)v.size(); i++) {
        os << v[i] << (i + 1 == (int)v.size() ? "" : " ");
    }
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p) {
    os << '(' << p.first << ',' << p.second << ')';
    return os;
}
template <typename T, typename U, typename V> ostream& operator<<(ostream& os, const tuple<T, U, V>& t) {
    os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ')';
    return os;
}
template <typename T, typename U, typename V, typename W> ostream& operator<<(ostream& os, const tuple<T, U, V, W>& t) {
    os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ',' << get<3>(t) << ')';
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& m) {
    os << '{';
    for (auto itr = m.begin(); itr != m.end();) {
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr != m.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const unordered_map<T, U>& m) {
    os << '{';
    for (auto itr = m.begin(); itr != m.end();) {
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr != m.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const set<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const multiset<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const unordered_set<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const deque<T>& v) {
    for (int i = 0; i < (int)v.size(); i++) {
        os << v[i] << (i + 1 == (int)v.size() ? "" : " ");
    }
    return os;
}

void debug_out() { cerr << '\n'; }
template <class Head, class... Tail> void debug_out(Head&& head, Tail&&... tail) {
    cerr << head;
    if (sizeof...(Tail) > 0) cerr << ", ";
    debug_out(move(tail)...);
}
#ifdef LOCAL
#define debug(...)                                                                   \
    cerr << " ";                                                                     \
    cerr << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << '\n'; \
    cerr << " ";                                                                     \
    debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

template <typename T> T gcd(T x, T y) { return y != 0 ? gcd(y, x % y) : x; }
template <typename T> T lcm(T x, T y) { return x / gcd(x, y) * y; }

template <class T1, class T2> inline bool chmin(T1& a, T2 b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template <class T1, class T2> inline bool chmax(T1& a, T2 b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
#pragma endregion

const int INF = 1e9;
const long long IINF = 1e18;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const char dir[4] = {'D', 'R', 'U', 'L'};
const long long MOD = 1000000007;
// const long long MOD = 998244353;

const int MAX_H = 200010;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N;
    cin >> N;

    vector<int> IN(N + MAX_H, 0), OUT(N + MAX_H, 0);
    set<int> s;
    for (int i = 0; i < N; i++) {
        int H, W;
        cin >> H >> W;
        H--, W--;
        OUT[N + H]++;
        IN[i]++;
        OUT[i]++;
        IN[N + W]++;
        s.emplace(H);
        s.emplace(W);
    }

    vector<int> inv, outv;
    for (int i = 0; i < MAX_H; i++) {
        if (IN[N + i] == OUT[N + i]) continue;
        if (IN[N + i] == OUT[N + i] + 1)
            inv.emplace_back(i);
        else if (IN[N + i] + 1 == OUT[N + i])
            outv.emplace_back(i);
        else {
            cout << 0 << '\n';
            return 0;
        }
    }

    if (inv.empty() && outv.empty()) {
        cout << s.size() << '\n';
        return 0;
    }
    if (inv.size() == 1 && outv.size() == 1) {
        cout << 1 << '\n';
        return 0;
    }
    cout << 0 << '\n';
    return 0;
}
0