結果

問題 No.849 yuki国の分割統治
ユーザー hitonanodehitonanode
提出日時 2019-07-05 22:26:46
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 75 ms / 2,000 ms
コード長 4,538 bytes
コンパイル時間 2,023 ms
コンパイル使用メモリ 177,648 KB
実行使用メモリ 11,648 KB
最終ジャッジ日時 2024-10-06 22:19:26
合計ジャッジ時間 4,573 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 AC 2 ms
5,248 KB
testcase_03 AC 2 ms
5,248 KB
testcase_04 AC 2 ms
5,248 KB
testcase_05 AC 2 ms
5,248 KB
testcase_06 AC 2 ms
5,248 KB
testcase_07 AC 43 ms
6,784 KB
testcase_08 AC 52 ms
8,320 KB
testcase_09 AC 52 ms
7,680 KB
testcase_10 AC 49 ms
7,040 KB
testcase_11 AC 47 ms
7,168 KB
testcase_12 AC 45 ms
6,656 KB
testcase_13 AC 54 ms
7,936 KB
testcase_14 AC 51 ms
7,424 KB
testcase_15 AC 49 ms
7,936 KB
testcase_16 AC 67 ms
10,368 KB
testcase_17 AC 41 ms
6,400 KB
testcase_18 AC 71 ms
10,624 KB
testcase_19 AC 50 ms
7,296 KB
testcase_20 AC 61 ms
9,088 KB
testcase_21 AC 33 ms
6,400 KB
testcase_22 AC 65 ms
9,728 KB
testcase_23 AC 62 ms
9,344 KB
testcase_24 AC 46 ms
7,040 KB
testcase_25 AC 75 ms
11,648 KB
testcase_26 AC 2 ms
5,248 KB
testcase_27 AC 2 ms
5,248 KB
testcase_28 AC 2 ms
5,248 KB
testcase_29 AC 2 ms
5,248 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template<typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template<typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }
template<typename T> bool mmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template<typename T> bool mmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }
template<typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template<typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
///// This part below is only for debug, not used /////
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const deque<T> &vec){ os << "deq["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa){ os << "(" << pa.first << "," << pa.second << ")"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;
///// END /////
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/tag_and_trait.hpp>
using namespace __gnu_pbds; // find_by_order(), order_by_key()
template<typename TK> using pbds_set = tree<TK, null_type, less<TK>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename TK, typename TV> using pbds_map = tree<TK, TV, less<TK>, rb_tree_tag, tree_order_statistics_node_update>;
*/

lint A, B, C, D;
void solve(vector<plint> ps)
{
    dbg(B);
    dbg(C);
    dbg(D);
    if (C == 0)
    {
        set<plint> s;
        lint gcd;
        if (B and D) gcd = __gcd(abs(B), abs(D));
        else gcd = 1;
        REP(i, ps.size()) s.emplace(ps[i].first, ps[i].second % gcd);
        cout << s.size() << endl;
        return;
    }

    set<plint> se;
    for (auto pa : ps)
    {
        lint x = pa.first, y = pa.second;
        lint c = x / C;
        if (B) se.emplace(x % C, ((y - c * D) % B + B) % B);
        else se.emplace(x % C, y - c * D);
    }
    cout << se.size() << endl;
}

int main()
{
    cin >> A >> B >> C >> D;
    int N;
    cin >> N;
    vector<plint> ps(N);
    REP(i, N)
    {
        cin >> ps[i].first >> ps[i].second;
    }

    if (C == 0)
    {
        swap(A, C);
        swap(B, D);
    }
    while (A)
    {
        if (A < C)
        {
            swap(A, C);
            swap(B, D);
        }
        lint m = A / C;
        A -= C * m;
        B -= D * m;
    }
    dbg(A);
    solve(ps);
}
0