結果

問題 No.849 yuki国の分割統治
ユーザー heno239heno239
提出日時 2020-06-20 09:29:01
言語 C++14
(gcc 13.2.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 3,413 bytes
コンパイル時間 1,009 ms
コンパイル使用メモリ 115,748 KB
実行使用メモリ 26,040 KB
最終ジャッジ日時 2023-09-16 16:58:51
合計ジャッジ時間 4,719 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge13
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 7 ms
19,712 KB
testcase_01 AC 6 ms
19,780 KB
testcase_02 AC 6 ms
19,808 KB
testcase_03 AC 6 ms
19,712 KB
testcase_04 AC 7 ms
19,736 KB
testcase_05 AC 7 ms
19,736 KB
testcase_06 WA -
testcase_07 AC 95 ms
20,044 KB
testcase_08 AC 96 ms
22,100 KB
testcase_09 AC 98 ms
21,284 KB
testcase_10 AC 99 ms
20,660 KB
testcase_11 AC 88 ms
21,400 KB
testcase_12 AC 94 ms
20,172 KB
testcase_13 AC 101 ms
21,468 KB
testcase_14 AC 100 ms
20,912 KB
testcase_15 AC 93 ms
21,924 KB
testcase_16 AC 120 ms
23,772 KB
testcase_17 AC 91 ms
19,792 KB
testcase_18 AC 121 ms
24,020 KB
testcase_19 AC 101 ms
20,612 KB
testcase_20 AC 113 ms
22,584 KB
testcase_21 AC 83 ms
19,740 KB
testcase_22 WA -
testcase_23 WA -
testcase_24 WA -
testcase_25 AC 124 ms
25,220 KB
testcase_26 AC 6 ms
20,060 KB
testcase_27 AC 6 ms
19,724 KB
testcase_28 AC 7 ms
19,724 KB
testcase_29 AC 7 ms
19,796 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acos(-1.0);

ll mod_pow(ll x, ll n) {
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x%mod;
		x = x * x%mod; n >>= 1;
	}
	return res;
}
struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n%mod + mod) % mod;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint &a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint &a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint &a, modint b) { a.n = ((ll)a.n*b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, int n) {
	if (n == 0)return modint(1);
	modint res = (a*a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p%a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }

const int max_n = 1 << 20;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}

ll gcd(ll a, ll b) {
	a = abs(a), b = abs(b);
	if (a < b)swap(a, b);
	while (b) {
		ll r = a % b; a = b; b = r;
	}
	return a;
}
void solve() {
	ll a, b, c, d; cin >> a >> b >> c>>d;
	if (a < c) {
		swap(a, c);
		swap(b, d);
	}
	while (c) {
		ll dd = a / c;
		ll nc = a - dd * c;
		ll nd = b - dd * d;
		a = c, b = d;
		c = nc, d = nd;
	}
	d = abs(d);

	ll g = gcd(b, d);

	if (d < 0)d *= -1;
	int n; cin >> n;
	set<LP> st;
	rep(i, n) {
		ll x, y; cin >> x >> y;
		ll nx, ny;
		if (d == 0) {
			nx = x%a, ny = y;
		}
		else if (a == 0) {
			nx = x;
			ny = y % g;
		}
		else {
			ll dd = x / a;
			nx = x - dd * a;
			ny = y - dd * b;
			ny %= d; if (ny < 0)ny += d;
		}
		st.insert({ nx,ny });
	}
	cout << st.size() << "\n";
}


signed main() {
	//ios::sync_with_stdio(false);
	//cin.tie(0);
	//cout << fixed << setprecision(10);
	//int t; cin >> t; rep(i, t)
		solve();
	stop
		return 0;
}
0