結果

問題 No.97 最大の値を求めるくえり
ユーザー fumiphysfumiphys
提出日時 2019-09-05 01:26:49
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 1,478 ms / 5,000 ms
コード長 4,195 bytes
コンパイル時間 1,678 ms
コンパイル使用メモリ 177,140 KB
実行使用メモリ 7,040 KB
最終ジャッジ日時 2024-06-09 16:34:35
合計ジャッジ時間 8,287 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,812 KB
testcase_01 AC 24 ms
7,040 KB
testcase_02 AC 216 ms
6,940 KB
testcase_03 AC 222 ms
6,944 KB
testcase_04 AC 125 ms
6,940 KB
testcase_05 AC 131 ms
6,944 KB
testcase_06 AC 123 ms
6,944 KB
testcase_07 AC 134 ms
6,944 KB
testcase_08 AC 139 ms
6,940 KB
testcase_09 AC 159 ms
6,944 KB
testcase_10 AC 197 ms
6,944 KB
testcase_11 AC 225 ms
6,940 KB
testcase_12 AC 262 ms
6,944 KB
testcase_13 AC 292 ms
6,944 KB
testcase_14 AC 1,478 ms
6,944 KB
testcase_15 AC 745 ms
6,944 KB
testcase_16 AC 456 ms
6,944 KB
testcase_17 AC 237 ms
6,940 KB
testcase_18 AC 219 ms
7,040 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

// includes
#include <bits/stdc++.h>
using namespace std;

// macros
#define pb emplace_back
#define mk make_pair
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define bit(n) (1LL<<(n))
// functions
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << p.first << " " << p.second; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
//  types
using ll = long long int;
using P = pair<int, int>;
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 100003;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
// io
struct fast_io{
  fast_io(){ios_base::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(20);}
} fast_io_;

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<ll> &A) {
  for(int i = 0; i < N; ++ i)
    A[i] = xor128() % 100003;
}

template<typename T>
T extgcd(T a, T b, T &x, T &y){ 
  T d = a;
  if(b != 0){
    d = extgcd(b, a % b, y, x);
    y -= (a / b) * x;
  }else{
    x = 1, y = 0;
  }
  return d;
}

template <typename T>
T modinv(T a, T m){
  long long x = 0, y = 0;
  extgcd<long long>(a, m, x, y);
  x %= m;
  if(x < 0)x += m;
  return x;
}


int main(int argc, char const* argv[])
{
  int n, q;
  cin >> n >> q;
  vector<ll> a(n);
  generateA(n, a);
  set<ll> st;
  rep(i, n)st.insert(a[i]);
  rep(i_, q){
    ll t;
    cin >> t;
    if(t == 0){
      cout << 0 << endl;
      continue;
    }
    if(n <= 1000){
      ll res = 0;
      rep(i, n){
        res = max(res, t * a[i] % mod);
      }
      cout << res << endl;
    }else{
      for(int i = mod - 1; i >= 0; i--){
        ll tmp = (ll)i * modinv<ll>(t, mod) % mod;
        if(st.find(tmp) != st.end()){
          cout << i << endl;
          break;
        }
      }
    }
  }
  return 0;
}
0