oj.uz

Submission #369431

# Submission time Handle Problem Language Result Execution time Memory
369431 2021-02-21T16:35:34 Z ACmachine Brunhilda’s Birthday (BOI13_brunhilda) C++17
97.7778 / 100
 669 ms 157948 KB 
#include <bits/stdc++.h>
using namespace std;

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename U> using ordered_map = tree<T, U, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;

typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<str> vstr;

#define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
#define FORD(i,j,k,in) for(int i=(j); i >=(k);i-=in)
#define REP(i,b) FOR(i,0,b,1)
#define REPD(i,b) FORD(i,b,0,1)
#define pb push_back 
#define mp make_pair
#define ff first
#define ss second
#define all(x) begin(x), end(x)
#define rsz resize 
#define MANY_TESTS int tcase; cin >> tcase; while(tcase--)
	
const double EPS = 1e-9;
const int MOD = 1e9+7; // 998244353;
const ll INFF = 1e18;
const int INF = 1e9;
const ld PI = acos((ld)-1);
const vi dy = {1, 0, -1, 0, -1, 1, 1, -1};
const vi dx = {0, 1, 0, -1, -1, 1, -1, 1};

#ifdef DEBUG
#define DBG if(1)
#else
#define DBG if(0)
#endif

#define dbg(x) cout << "(" << #x << " : " << x << ")" << endl;
// ostreams
template <class T, class U>
ostream& operator<<(ostream& out, const pair<T, U> &par) {out << "[" << par.first << ";" << par.second << "]"; return out;}
template <class T>
ostream& operator<<(ostream& out, const set<T> &cont) { out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template <class T, class U>
ostream& operator<<(ostream& out, const map<T, U> &cont) {out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template<class T>
ostream& operator<<(ostream& out, const vector<T> &v){ out << "[";  REP(i, v.size()) out << v[i] << ", ";  out << "]"; return out;}
// istreams
template<class T>
istream& operator>>(istream& in, vector<T> &v){ for(auto &x : v) in >> x; return in; }
template<class T, class U>
istream& operator>>(istream& in, pair<T, U> &p){ in >> p.ff >> p.ss; return in; }
//searches
template<typename T, typename U>
T bsl(T lo, T hi, U f){ hi++; T mid; while(lo < hi){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid+1; } return lo; }
template<typename U>
double bsld(double lo, double hi, U f, double p = 1e-9){ int r = 3 + (int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid; } return (lo + hi)/2; }
template<typename T, typename U>
T bsh(T lo, T hi, U f){ lo--; T mid; while(lo < hi){ mid = (lo + hi + 1)/2; f(mid) ? lo = mid : hi = mid-1; } return lo; }
template<typename U>
double bshd(double lo, double hi, U f, double p = 1e-9){ int r = 3+(int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? lo = mid : hi = mid; } return (lo + hi)/2; }
// some more utility functions
template<typename T>
pair<T, int> get_min(vector<T> &v){ typename vector<T> :: iterator it = min_element(v.begin(), v.end()); return mp(*it, it - v.begin());}
template<typename T>
pair<T, int> get_max(vector<T> &v){ typename vector<T> :: iterator it = max_element(v.begin(), v.end()); return mp(*it, it - v.begin());}        
template<typename T> bool ckmin(T& a, const T& b){return b < a ? a = b , true : false;}
template<typename T> bool ckmax(T& a, const T& b){return b > a ? a = b, true : false;}

    
int main(){
 	ios_base::sync_with_stdio(false);
 	cin.tie(NULL); cout.tie(NULL);
    const int mx = 2e7 + 120;
	int m, q;
    cin >> m >> q;
    vi p(m); cin >> p;
    vi n(q); cin >> n;
    vector<int> re(mx, 0);
    REP(i, m){
        for(int j = p[i] - 1; j < mx; j += p[i])
            re[j] = p[i] - 1;
    }
    REPD(i, mx - 5){
        if(re[i] < re[i + 1] - 1) 
            re[i] = re[i + 1] - 1;
    }
    vector<int> dp(mx, INF);
    dp[0] = 0;
    FOR(i, 1, mx, 1){
        if(re[i] == 0) continue;
        dp[i] = dp[i - re[i]] + 1;
    }
    REP(i, q){
        if(dp[n[i]] == INF) cout << "oo" << "\n";
        else cout << dp[n[i]] << "\n";
    }
	
    return 0;
}

Subtask #1
17.7777777778 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 218 ms 156908 KB Output isn't correct
2 Correct 285 ms 156952 KB Output is correct
3 Correct 255 ms 156860 KB Output is correct
4 Correct 205 ms 157036 KB Output is correct
5 Correct 248 ms 156908 KB Output is correct
6 Incorrect 215 ms 157036 KB Output isn't correct
7 Correct 243 ms 156908 KB Output is correct
8 Correct 282 ms 156908 KB Output is correct
9 Correct 319 ms 156908 KB Output is correct
10 Correct 345 ms 156908 KB Output is correct
11 Correct 309 ms 156908 KB Output is correct
12 Correct 198 ms 156872 KB Output is correct
13 Correct 509 ms 156976 KB Output is correct
14 Correct 523 ms 157036 KB Output is correct
15 Correct 292 ms 156908 KB Output is correct
16 Correct 284 ms 156908 KB Output is correct
17 Correct 253 ms 157036 KB Output is correct
18 Correct 203 ms 157164 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 240 ms 157088 KB Output is correct
2 Correct 252 ms 157292 KB Output is correct
3 Correct 616 ms 157164 KB Output is correct
4 Correct 279 ms 156908 KB Output is correct
5 Correct 436 ms 157036 KB Output is correct
6 Correct 263 ms 156908 KB Output is correct
7 Correct 235 ms 157036 KB Output is correct
8 Correct 272 ms 156996 KB Output is correct
9 Correct 498 ms 157164 KB Output is correct
10 Correct 612 ms 157164 KB Output is correct
11 Correct 595 ms 157164 KB Output is correct
12 Correct 358 ms 157036 KB Output is correct
13 Correct 219 ms 156908 KB Output is correct
14 Correct 273 ms 157020 KB Output is correct
15 Correct 514 ms 157044 KB Output is correct
16 Correct 255 ms 157292 KB Output is correct
17 Correct 542 ms 156908 KB Output is correct
18 Correct 504 ms 157272 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 524 ms 157420 KB Output is correct
2 Correct 623 ms 157316 KB Output is correct
3 Correct 626 ms 157420 KB Output is correct
4 Correct 390 ms 157548 KB Output is correct
5 Correct 293 ms 157948 KB Output is correct
6 Correct 504 ms 157548 KB Output is correct
7 Correct 441 ms 157676 KB Output is correct
8 Correct 522 ms 157364 KB Output is correct
9 Correct 530 ms 157548 KB Output is correct
10 Correct 411 ms 157036 KB Output is correct
11 Correct 351 ms 157116 KB Output is correct
12 Correct 470 ms 157164 KB Output is correct
13 Correct 582 ms 157640 KB Output is correct
14 Correct 390 ms 157932 KB Output is correct
15 Correct 512 ms 157132 KB Output is correct
16 Correct 549 ms 157164 KB Output is correct
17 Correct 472 ms 157172 KB Output is correct
18 Correct 617 ms 157420 KB Output is correct
19 Correct 261 ms 157164 KB Output is correct
20 Correct 614 ms 157420 KB Output is correct
21 Correct 427 ms 157932 KB Output is correct
22 Correct 646 ms 157936 KB Output is correct
23 Correct 295 ms 157696 KB Output is correct
24 Correct 252 ms 157676 KB Output is correct
25 Correct 423 ms 157644 KB Output is correct
26 Correct 396 ms 157548 KB Output is correct
27 Correct 669 ms 157616 KB Output is correct
28 Correct 260 ms 157676 KB Output is correct
29 Correct 561 ms 157932 KB Output is correct
30 Correct 522 ms 157804 KB Output is correct
31 Correct 291 ms 157548 KB Output is correct
32 Correct 321 ms 157568 KB Output is correct
33 Correct 231 ms 157548 KB Output is correct
34 Correct 438 ms 157548 KB Output is correct
35 Correct 272 ms 157676 KB Output is correct
36 Correct 615 ms 157932 KB Output is correct
37 Correct 284 ms 157932 KB Output is correct
38 Correct 521 ms 157548 KB Output is correct
39 Correct 267 ms 157532 KB Output is correct
40 Correct 447 ms 157548 KB Output is correct
41 Correct 437 ms 157548 KB Output is correct
42 Correct 544 ms 157676 KB Output is correct