結果

問題 No.2324 Two Countries within UEC
ユーザー deuteridayodeuteridayo
提出日時 2023-05-28 13:50:03
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 250 ms / 2,000 ms
コード長 2,633 bytes
コンパイル時間 4,322 ms
コンパイル使用メモリ 266,928 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-06-26 23:17:31
合計ジャッジ時間 11,075 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 239 ms
6,812 KB
testcase_01 AC 250 ms
6,940 KB
testcase_02 AC 46 ms
6,944 KB
testcase_03 AC 186 ms
6,940 KB
testcase_04 AC 212 ms
6,944 KB
testcase_05 AC 47 ms
6,940 KB
testcase_06 AC 87 ms
6,940 KB
testcase_07 AC 38 ms
6,944 KB
testcase_08 AC 183 ms
6,940 KB
testcase_09 AC 191 ms
6,940 KB
testcase_10 AC 250 ms
6,944 KB
testcase_11 AC 242 ms
6,944 KB
testcase_12 AC 75 ms
6,944 KB
testcase_13 AC 76 ms
6,944 KB
testcase_14 AC 45 ms
6,944 KB
testcase_15 AC 39 ms
6,940 KB
testcase_16 AC 167 ms
6,940 KB
testcase_17 AC 105 ms
6,940 KB
testcase_18 AC 49 ms
6,940 KB
testcase_19 AC 247 ms
6,940 KB
testcase_20 AC 33 ms
6,944 KB
testcase_21 AC 166 ms
6,940 KB
testcase_22 AC 209 ms
6,944 KB
testcase_23 AC 65 ms
6,940 KB
testcase_24 AC 176 ms
6,944 KB
testcase_25 AC 250 ms
6,944 KB
testcase_26 AC 193 ms
6,944 KB
testcase_27 AC 208 ms
6,944 KB
testcase_28 AC 194 ms
6,940 KB
testcase_29 AC 195 ms
6,944 KB
testcase_30 AC 196 ms
6,944 KB
testcase_31 AC 2 ms
6,940 KB
testcase_32 AC 1 ms
6,940 KB
testcase_33 AC 2 ms
6,940 KB
testcase_34 AC 2 ms
6,940 KB
testcase_35 AC 2 ms
6,940 KB
testcase_36 AC 2 ms
6,940 KB
testcase_37 AC 1 ms
6,944 KB
testcase_38 AC 2 ms
6,940 KB
testcase_39 AC 2 ms
6,944 KB
testcase_40 AC 2 ms
6,940 KB
testcase_41 AC 2 ms
6,944 KB
testcase_42 AC 2 ms
6,940 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include"bits/stdc++.h"
#include"atcoder/all"
using namespace std;
using namespace atcoder;
using lint = long long;
using ulint = unsigned long long;
#define endl '\n'
int const INF = 1<<30;
lint const INF64 = 1LL<<61;
lint const mod107 = 1e9+7;
using mint107 = modint1000000007;
long const mod = 998244353;
using mint = modint998244353;
lint ceilDiv(lint x, lint y){if(x >= 0){return (x+y-1)/y;}else{return x/y;}}
lint floorDiv(lint x, lint y){if(x >= 0){return x/y;}else{return (x-y+1)/y;}}
lint Sqrt(lint x){lint upper = 1e9;lint lower = 0;while(upper - lower > 0){lint mid = (1+upper + lower)/2;if(mid * mid > x){upper = mid-1;}else{lower = mid;}}return upper;}
lint gcd(lint a,lint b){if(a<b)swap(a,b);if(a%b==0)return b;else return gcd(b,a%b);}
lint lcm(lint a,lint b){return (a / gcd(a,b)) * b;}
lint chmin(vector<lint>&v){lint ans = INF64;for(lint i:v){ans = min(ans, i);}return ans;}
lint chmax(vector<lint>&v){lint ans = -INF64;for(lint i:v){ans = max(ans, i);}return ans;}
double dist(double x1, double y1, double x2, double y2){return sqrt(pow(x1-x2, 2) + pow(y1-y2,2));}
string toString(lint n){string ans = "";if(n == 0){ans += "0";}else{while(n > 0){int a = n%10;char b = '0' + a;string c = "";c += b;n /= 10;ans = c + ans;}}return ans;}
string toString(lint n, lint k){string ans = toString(n);string tmp = "";while(ans.length() + tmp.length() < k){tmp += "0";}return tmp + ans;}
vector<lint>prime;void makePrime(lint n){prime.push_back(2);for(lint i=3;i<=n;i+=2){bool chk = true;for(lint j=0;j<prime.size() && prime[j]*prime[j] <= i;j++){if(i % prime[j]==0){chk=false;break;}}if(chk)prime.push_back(i);}}
lint Kai[20000001]; bool firstCallnCr = true; 
lint ncrmodp(lint n,lint r,lint p){ if(firstCallnCr){ Kai[0] = 1; for(int i=1;i<=20000000;i++){ Kai[i] = Kai[i-1] * i; Kai[i] %= mod;} firstCallnCr = false;} if(n<0)return 0;
if(n < r)return 0;if(n==0)return 1;lint ans = Kai[n];lint tmp = (Kai[r] * Kai[n-r]) % p;for(lint i=1;i<=p-2;i*=2){if(i & p-2){ans *= tmp;ans %= p;}tmp *= tmp;tmp %= p;}return ans;}
#define rep(i, n) for(int i = 0; i < n; i++)
#define repp(i, x, y) for(int i = x; i < y; i++)
#define vec vector
#define pb push_back
#define se second
#define fi first
#define al(x) x.begin(),x.end()

struct edge{
    int to;
    lint a,b;
};
using graph = vector<vec<int>>;



int main(){
	lint n,m,p,q;
	cin>>n>>m>>p>>q;
	using mintt=modint;
	mintt::set_mod(p);
	rep(i,q){
		mintt x,f;
		lint xx,ff;
		cin>>xx>>ff;
		x=xx%p;f=ff%p;
		if(x==0){
			if(f==0)cout<<m<<endl;
			else cout<<0<<endl;
			continue;
		}
		lint y=(f/x).val();
		if(y<=m%p&&y>0)cout<<(m)/p+1<<endl;
		else cout<<m/p<<endl;
	}
	
}
0