結果

問題 No.849 yuki国の分割統治
ユーザー ningenMeningenMe
提出日時 2019-07-06 13:54:31
言語 C++11
(gcc 11.4.0)
結果
CE  
(最新)
AC  
(最初)
実行時間 -
コード長 3,704 bytes
コンパイル時間 1,252 ms
コンパイル使用メモリ 168,156 KB
最終ジャッジ日時 2024-11-14 21:30:29
合計ジャッジ時間 3,143 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。（リジャッジ後のコンパイルエラーは公開されます）
ただし、clay言語の場合は開発者のデバッグのため、公開されます。

コンパイルメッセージ
main.cpp:23:25: error: ‘make_v’ function uses ‘auto’ type specifier without trailing return type
   23 | template<typename... T> auto make_v(size_t N,T... t){return vector<decltype(make_v(t...))>(N,make_v(t...));}
      |                         ^~~~
main.cpp:23:25: note: deduced return type only available with ‘-std=c++14’ or ‘-std=gnu++14’

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;

#define REP(i,n) for(long long i = 0; i < (n); i++)
#define FOR(i, m, n) for(long long i = (m);i < (n); ++i)
#define ALL(obj) (obj).begin(),(obj).end()
#define SPEED cin.tie(0);ios::sync_with_stdio(false);

template<class T> using V = vector<T>;
template<class T, class U> using P = pair<T, U>;
template<class T> using PQ = priority_queue<T>;
template<class T> using PQR = priority_queue<T,vector<T>,greater<T>>;

constexpr ll MOD = (ll)1e9 + 7;
constexpr ll MOD2 = 998244353;
constexpr ll HIGHINF = (ll)1e18;
constexpr ll LOWINF = (ll)1e15;
constexpr long double PI = 3.1415926535897932384626433;

template<typename T> vector<T> make_v(size_t N,T init){return vector<T>(N,init);}
template<typename... T> auto make_v(size_t N,T... t){return vector<decltype(make_v(t...))>(N,make_v(t...));}
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
template <template <class tmp>  class T, class U> ostream &operator<<(ostream &o, const T<U> &obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr)o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
template <class T> void chmax(T& a, const T b){a=max<T>(a,b);}
template <class T> void chmin(T& a, const T b){a=min<T>(a,b);}
void YN(bool flg) {cout << ((flg) ? "YES" : "NO") << endl;}
void Yn(bool flg) {cout << ((flg) ? "Yes" : "No") << endl;}
void yn(bool flg) {cout << ((flg) ? "yes" : "no") << endl;}

//Greatest Common Divisor
long long GCD(long long a, long long b) {
    return ((b == 0) ? a : GCD(b, a % b));
}

int main() {
	ll a,b,c,d;
	cin >> a >> b >> c >> d;
	
	ll ac = GCD(a,c);
	ll bd = GCD(b,d);
	ll adbc = abs(a*d-b*c);
	ll ans = 0;

	ll N; cin >> N;
	V<ll> x(N),y(N);
	for(int i = 0; i < N; ++i) cin >> x[i] >> y[i];

	if(adbc){
		map<P<ll,ll>,V<int>> mpv;
		for(int i = 0 ; i < N; ++i){
			mpv[{x[i]%ac,y[i]%bd}].push_back(i);
		}
		for(auto e:mpv){
			set<P<ll,ll>> st;
			for(auto i:e.second){
				ll u = d*x[i] - c*y[i];
				ll v = a*y[i] - b*x[i];
				u = (u%adbc + adbc)%adbc;
				v = (v%adbc + adbc)%adbc;
				st.insert({u,v});
			}
			ans += st.size();
		}
	}
	else if(ac == 0 || bd == 0){
		set<P<ll,ll>> st;
		for(int i = 0 ; i < N; ++i){		
			st.insert({(ac?x[i]%ac:x[i]),(bd?y[i]%bd:y[i])});
		}
		ans = st.size();
	}
	else{
		set<P<ll,ll>> st;
		for(int i = 0 ; i < N; ++i){		
			ll k = x[i]/ac; 
			st.insert({(x[i]%ac),(y[i]-bd*k)});
		}
		ans = st.size();
	}

	cout << ans << endl;

    return 0;
}
0