結果
問題 | No.97 最大の値を求めるくえり |
ユーザー | kei |
提出日時 | 2018-05-08 18:49:13 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 1,071 ms / 5,000 ms |
コード長 | 3,111 bytes |
コンパイル時間 | 1,599 ms |
コンパイル使用メモリ | 169,748 KB |
実行使用メモリ | 7,412 KB |
最終ジャッジ日時 | 2023-09-10 11:05:08 |
合計ジャッジ時間 | 9,039 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 6 ms
5,672 KB |
testcase_01 | AC | 7 ms
6,516 KB |
testcase_02 | AC | 241 ms
6,492 KB |
testcase_03 | AC | 243 ms
6,372 KB |
testcase_04 | AC | 143 ms
6,440 KB |
testcase_05 | AC | 143 ms
6,504 KB |
testcase_06 | AC | 143 ms
6,392 KB |
testcase_07 | AC | 153 ms
6,392 KB |
testcase_08 | AC | 165 ms
6,444 KB |
testcase_09 | AC | 184 ms
6,416 KB |
testcase_10 | AC | 222 ms
6,388 KB |
testcase_11 | AC | 257 ms
6,444 KB |
testcase_12 | AC | 293 ms
6,460 KB |
testcase_13 | AC | 333 ms
6,392 KB |
testcase_14 | AC | 521 ms
6,420 KB |
testcase_15 | AC | 1,071 ms
6,392 KB |
testcase_16 | AC | 155 ms
6,652 KB |
testcase_17 | AC | 158 ms
6,936 KB |
testcase_18 | AC | 157 ms
7,412 KB |
ソースコード
#include "bits/stdc++.h" using namespace std; typedef long long ll; typedef pair<int, int> pii; typedef pair<ll, ll> pll; const int INF = 1e9; const ll LINF = 1e18; template<class S,class T> ostream& operator << (ostream& out,const pair<S,T>& o){ out << "(" << o.first << "," << o.second << ")"; return out; } template<class T> ostream& operator << (ostream& out,const vector<T> V){ for(int i = 0; i < V.size(); i++){ out << V[i]; if(i!=V.size()-1) out << " ";} return out; } template<class T> ostream& operator << (ostream& out,const vector<vector<T> > Mat){ for(int i = 0; i < Mat.size(); i++) { if(i != 0) out << endl; out << Mat[i];} return out; } template<class S,class T> ostream& operator << (ostream& out,const map<S,T> mp){ out << "{ "; for(auto it = mp.begin(); it != mp.end(); it++){ out << it->first << ":" << it->second; if(mp.size()-1 != distance(mp.begin(),it)) out << ", "; } out << " }"; return out; } /* <url:> 問題文============================================================ ================================================================= 解説============================================================= ================================================================ */ unsigned xor128_x = 123456789, xor128_y = 362436069, xor128_z = 521288629, xor128_w = 88675123; unsigned xor128() { unsigned t = xor128_x ^ (xor128_x << 11); xor128_x = xor128_y; xor128_y = xor128_z; xor128_z = xor128_w; return xor128_w = xor128_w ^ (xor128_w >> 19) ^ (t ^ (t >> 8)); } const ll MOD = 1e5+3; const ll MAX_N = 1e5 + 10; ll Inv[MAX_N]; ll fact[MAX_N]; ll factInv[MAX_N]; void Inv_init(){ Inv[1] = 1; for(int i = 2; i < MAX_N; i++) { Inv[i] = Inv[MOD%i] * (MOD - MOD/i) % MOD; } } void fact_init(){ fact[0] = fact[1] = factInv[0] = factInv[1] = 1; for(int i = 2; i < MAX_N; i++){ fact[i] = (fact[i-1] * i) % MOD; factInv[i] = (factInv[i-1] * Inv[i])%MOD; } } // a^b % MOD; ll powmod(ll a,ll b) {ll res=1;a%=MOD; for(;b;b>>=1){if(b&1)res=res*a%MOD;a=a*a%MOD;}return res;} // 逆元 1/a % MOD ll inversemod(ll a) { return powmod(a,MOD - 2);} ll nCr(int n,int r) { if(n < r) return 0; return (fact[n] * (factInv[r] * factInv[n-r] % MOD)) % MOD; } void init(){ Inv_init(); fact_init(); } void solve(){ ll N,Q; cin >> N >> Q; vector<ll> A(N),q(Q); vector<int> fA(100002,0); for(int i = 0; i < N;i++){ A[i] = xor128() % 100003; fA[A[i]] = 1;} for(int i = 0; i < Q;i++) cin >> q[i]; for(int i = 0; i < Q;i++){ if(q[i] == 0){ cout << 0 << endl; continue; } ll res = 0; if(N < 10000){ for(int j = 0; j < N;j++){ res = max(res,(q[i]*A[j])%MOD); } }else{ for(int j = 100002; j >= 0; j--){ if(fA[(j*Inv[q[i]])%MOD] == 1){ res = j; break; } } } cout << res << endl; } } int main(void) { cin.tie(0); ios_base::sync_with_stdio(false); init(); solve(); return 0; }