fork download
copy 
  1. // ROOT : DRAGON3012009
  2. #include <bits/stdc++.h>
  3. #define ll int
  4. #define ld long double
  5. #define el "\n"
  6. #define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  7. #define __ROOT__ int main()
  8. #pragma GCC optimize("O2")
  9. //#pragma GCC optimize("unroll-loops")
  10. //#pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")
  11. #define FOR(i,l,r) for(int i = l ; i <= r ; i ++)
  12. #define FORD(i,r,l) for(int i = r ; i >= l ; i --)
  13. #define REP(i, a ) for(int i = 0 ; i < a ; i ++ )
  14. #define fi first
  15. #define se second
  16. #define M 1000000007
  17. #define MAXN 1200001
  18. #define INF (1ll<<30)
  19. #define BLOCK_SIZE 425
  20. #define MAX_NODE 1001001
  21. #define LOG 19
  22. #define ALPHA_SIZE 26
  23. #define BASE 256
  24. #define NAME "file"
  25. #define compare(v) sort((v).begin(), (v).end()); (v).erase(unique((v).begin(), (v).end()), (v).end());
  26. using namespace std;
  27. using namespace chrono ;
  28. const ll MOD[] = {(ll)1e9 + 2277, (ll)1e9 + 5277, (ll)1e9 + 8277, (ll)1e9 + 9277, (ll) 1e9 + 7 };
  29. const ll NMOD = 1;
  30. const int dx[] = {-1, 0, 1,0};
  31. const int dy[] = {0, 1, 0, -1};
  32. //**Variable**//
  33. ll n , q  , max_value = 0   ;
  34. ll arr[MAXN];
  35. vector<ll> a ;
  36. set<ll> s ;
  37. ll ma[ MAXN] , mi[ MAXN] ;
  38. //**Struct**//
  39.  
  40. //**Function**//
  41. template<class X, class Y >
  42. bool minimize(X & x, const Y &y ) {
  43.     return x > y ? x = y, 1:0 ;
  44. }
  45. template<class X, class Y >
  46. bool maximize(X &x, const Y &y ) {
  47.     return x < y ? x = y, 1:0 ;
  48. }
  49.  
  50. void init() {
  51.     cin>>n >> q ;
  52.     max_value = 0 ;
  53.     FOR(i,1, n) cin >> arr[i]  , a.push_back(arr[i]) , maximize(max_value , arr[i] );
  54.     compare(a);
  55. }
  56.  
  57. void solve() {
  58.     FOR(i , 0 , MAXN - 1  )mi[i] = INF ;
  59.     for(ll v :  a )  {
  60.     for(ll i = v ; i < MAXN ; i += v ) maximize( ma[i] ,  i )  ;
  61.     for(ll i = 1 *  v ; i < MAXN ; i += v )minimize( mi[i - 1 ]  , i - v )   ;
  62.     }
  63.     FORD(i , MAXN -2 ,  0 ) minimize(mi[i] , mi[i + 1]) ;
  64.     FOR(i , 1, MAXN - 1 ) maximize(ma[i] , ma[i-1]) ;
  65.     FOR(i , 1,  q  ) {
  66.     ll x; cin >> x  ;
  67.     ll res2 = x - mi[x] ;
  68.     if(x < max_value ) res2 = x;
  69.     cout << x - ma[x] << " " << res2  << el ;
  70.     }
  71. }
  72.  
  73. __ROOT__ {
  74.     // freopen(NAME".inp" , "r" , stdin);
  75.     // freopen(NAME".out" , "w", stdout) ;
  76.     fast;
  77.     int t = 1; // cin >> t ;
  78.     while(t--) {
  79.         init();
  80.         solve();
  81.     }
  82.     return (0&0);
  83. }
  84.  
  85.  
  86.  
  87.  
Success #stdin #stdout 0.01s 12124KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Standard output is empty
https://ideone.com/yEhFue
language:
C++14 (gcc 8.3)
created:
9 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!