답안 #116257

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
116257 2019-06-11T15:45:02 Z SpeedOfMagic Brunhilda’s Birthday (BOI13_brunhilda) C++17
100 / 100
355 ms 2476 KB
/** MIT License Copyright (c) 2018 Vasilyev Daniil **/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
#pragma GCC optimize("Ofast")
template<typename T> using v = vector<T>;
template<typename T, typename U>  using hmap = __gnu_pbds::gp_hash_table<T, U>;
//#define int long long
typedef long double ld;
typedef string str;
typedef vector<int> vint;
#define rep(a, l, r) for(int a = (l); a < (r); a++)
#define pb push_back
#define fs first
#define sc second
#define sz(a) ((int) a.size())
const long long inf = 4611686018427387903; //2^62 - 1
#if 0  //FileIO
const string fileName = "";
ifstream fin ((fileName == "" ? "input.txt"  : fileName + ".in" ));
ofstream fout((fileName == "" ? "output.txt" : fileName + ".out"));
#define get fin>>
#define put fout<<
#else
#define get cin>>
#define put cout<<
#endif
#define eol put endl
#define check(a) put #a << ": " << a << endl;
void read() {}     template<typename Arg,typename... Args> void read (Arg& arg,Args&... args){get (arg)     ;read(args...) ;}
void print(){}     template<typename Arg,typename... Args> void print(Arg  arg,Args...  args){put (arg)<<" ";print(args...);}
void debug(){eol;} template<typename Arg,typename... Args> void debug(Arg  arg,Args...  args){put (arg)<<" ";debug(args...);}
int getInt(){int a; get a; return a;}
//code goes here
const long long N = 1e7 + 1;
const int LIM = 20;
int dp[N];
 
void run() {
    int m, q;
    read(m, q);
 
    int p[m];
    rep(i, 0, m) 
        get p[i];
    
    long long mul = 1;
    rep(i, 0, m) {
        mul *= p[i];
        if (mul > N) {
            mul = 1e9;
            break;
        }
    }
    
    vint order;
    int n = 0;
int z = 0;
    while (n < min(N, mul - 1)) {
        order.pb(n);
        int d = 0;
        for (int i : p)
            d = max(d, n / i * i + i - 1);
        n = d;
    }
 
    rep(i, 0, q) {
        int n;
        get n;
        if (n >= mul)
            put "oo";
        else
            put lower_bound(order.begin(), order.end(), n) - order.begin();
        eol;
    }
}
 
int32_t main() {srand(time(0)); ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); put fixed; put setprecision(15); run(); return 0;}

Compilation message

brunhilda.cpp: In function 'void run()':
brunhilda.cpp:58:5: warning: unused variable 'z' [-Wunused-variable]
 int z = 0;
     ^
# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 512 KB Output is correct
2 Correct 7 ms 640 KB Output is correct
3 Correct 3 ms 512 KB Output is correct
4 Correct 16 ms 384 KB Output is correct
5 Correct 9 ms 1532 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 3 ms 512 KB Output is correct
8 Correct 3 ms 768 KB Output is correct
9 Correct 15 ms 2476 KB Output is correct
10 Correct 11 ms 1024 KB Output is correct
11 Correct 11 ms 1024 KB Output is correct
12 Correct 3 ms 384 KB Output is correct
13 Correct 8 ms 384 KB Output is correct
14 Correct 20 ms 384 KB Output is correct
15 Correct 5 ms 512 KB Output is correct
16 Correct 6 ms 640 KB Output is correct
17 Correct 19 ms 640 KB Output is correct
18 Correct 16 ms 512 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 512 KB Output is correct
2 Correct 11 ms 768 KB Output is correct
3 Correct 10 ms 768 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 8 ms 640 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 4 ms 512 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 10 ms 768 KB Output is correct
10 Correct 10 ms 896 KB Output is correct
11 Correct 8 ms 640 KB Output is correct
12 Correct 4 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 3 ms 384 KB Output is correct
15 Correct 8 ms 640 KB Output is correct
16 Correct 11 ms 768 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 13 ms 896 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 64 ms 792 KB Output is correct
2 Correct 44 ms 792 KB Output is correct
3 Correct 85 ms 888 KB Output is correct
4 Correct 128 ms 760 KB Output is correct
5 Correct 149 ms 1004 KB Output is correct
6 Correct 136 ms 908 KB Output is correct
7 Correct 104 ms 948 KB Output is correct
8 Correct 67 ms 820 KB Output is correct
9 Correct 67 ms 764 KB Output is correct
10 Correct 21 ms 512 KB Output is correct
11 Correct 35 ms 512 KB Output is correct
12 Correct 37 ms 512 KB Output is correct
13 Correct 140 ms 888 KB Output is correct
14 Correct 154 ms 1520 KB Output is correct
15 Correct 43 ms 512 KB Output is correct
16 Correct 38 ms 556 KB Output is correct
17 Correct 26 ms 640 KB Output is correct
18 Correct 46 ms 724 KB Output is correct
19 Correct 33 ms 512 KB Output is correct
20 Correct 88 ms 888 KB Output is correct
21 Correct 152 ms 1176 KB Output is correct
22 Correct 157 ms 1044 KB Output is correct
23 Correct 152 ms 736 KB Output is correct
24 Correct 143 ms 804 KB Output is correct
25 Correct 143 ms 1016 KB Output is correct
26 Correct 129 ms 864 KB Output is correct
27 Correct 89 ms 920 KB Output is correct
28 Correct 141 ms 744 KB Output is correct
29 Correct 153 ms 1016 KB Output is correct
30 Correct 148 ms 1016 KB Output is correct
31 Correct 131 ms 776 KB Output is correct
32 Correct 138 ms 764 KB Output is correct
33 Correct 135 ms 912 KB Output is correct
34 Correct 91 ms 1016 KB Output is correct
35 Correct 355 ms 760 KB Output is correct
36 Correct 154 ms 1144 KB Output is correct
37 Correct 152 ms 972 KB Output is correct
38 Correct 141 ms 760 KB Output is correct
39 Correct 152 ms 740 KB Output is correct
40 Correct 137 ms 844 KB Output is correct
41 Correct 92 ms 948 KB Output is correct
42 Correct 146 ms 920 KB Output is correct