結果
| 問題 | No.97 最大の値を求めるくえり |
| ユーザー |
 heno239
|
| 提出日時 | 2020-04-08 12:12:53 |
| 言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 1,798 ms / 5,000 ms |
| コード長 | 3,887 bytes |
| コンパイル時間 | 984 ms |
| コンパイル使用メモリ | 117,572 KB |
| 実行使用メモリ | 8,516 KB |
| 最終ジャッジ日時 | 2024-07-18 09:00:39 |
| 合計ジャッジ時間 | 6,599 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge5 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| other | AC * 19 |
ソースコード
#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 longtypedef long long ll;typedef unsigned long long ul;typedef unsigned int ui;ll mod = 100003;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 a, ll n, ll m = mod) {ll res = 1;while (n) {if (n & 1)res = res * a%m;a = a * a%m; 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 << 18;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];}int dx[4] = { 0,1,0,-1 };int dy[4] = { 1,0,-1,0 };modint invs[100003];void init() {rep1(i, 100002) {invs[i] = (modint)1 / (modint)i;}}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));}void generateA(int N, vector<int> &A) {A.resize(N);for (int i = 0; i < N; ++i)A[i] = xor128() % 100003;}void solve() {init();int n, q; cin >> n >> q;vector<int> a(n);generateA(n, a);if (n <= 300) {rep(i, q) {ll s; cin >> s;if (s == 0) {cout << 0 << "\n"; continue;}int ma = 0;rep(j, n) {int t = s * a[j] % mod;ma = max(ma, t);}cout << ma << "\n";}}else {vector<bool> exi(mod);rep(i, n)exi[a[i]] = true;rep(i, q) {int s; cin >> s;if (s == 0) {cout << 0 << "\n"; continue;}int ans = 0;for (int r = mod - 1; r >= 1; r--) {int t = r * (ll)invs[s] % mod;if (exi[t]) {ans = r; break;}}cout << ans << "\n";}}}signed main() {ios::sync_with_stdio(false);cin.tie(0);cout << fixed << setprecision(7);//init_f();//init();//int t; cin >> t; rep(i, t)solve();solve();stopreturn 0;}