oj.uz

답안 #335228

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
335228 2020-12-11T15:48:41 Z rqi Brunhilda’s Birthday (BOI13_brunhilda) C++14
100 / 100
 245 ms 43112 KB 
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef long double ld;
typedef double db; 
typedef string str; 

typedef pair<int,int> pi;
typedef pair<ll,ll> pl; 
typedef pair<db,db> pd; 

typedef vector<int> vi; 
typedef vector<bool> vb; 
typedef vector<ll> vl; 
typedef vector<db> vd; 
typedef vector<str> vs; 
typedef vector<pi> vpi;
typedef vector<pl> vpl; 
typedef vector<pd> vpd; 

#define mp make_pair
#define f first
#define s second
#define sz(x) (int)(x).size()
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend() 
#define sor(x) sort(all(x)) 
#define rsz resize
#define ins insert 
#define ft front() 
#define bk back()
#define pf push_front 
#define pb push_back
#define eb emplace_back 
#define lb lower_bound 
#define ub upper_bound 

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)

const int MOD = 1e9+7; // 998244353;
const int MX = 2e5+5; 
const ll INF = 1e18; 
const ld PI = acos((ld)-1);
const int xd[4] = {1,0,-1,0}, yd[4] = {0,1,0,-1}; 
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count()); 

template<class T> bool ckmin(T& a, const T& b) { 
    return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { 
    return a < b ? a = b, 1 : 0; } 
constexpr int pct(int x) { return __builtin_popcount(x); } 
constexpr int bits(int x) { return 31-__builtin_clz(x); } // floor(log2(x)) 
ll cdiv(ll a, ll b) { return a/b+((a^b)>0&&a%b); } // divide a by b rounded up
ll fdiv(ll a, ll b) { return a/b-((a^b)<0&&a%b); } // divide a by b rounded down
ll half(ll x) { return fdiv(x,2); }

template<class T, class U> T fstTrue(T lo, T hi, U f) { 
    // note: if (lo+hi)/2 is used instead of half(lo+hi) then this will loop infinitely when lo=hi
    hi ++; assert(lo <= hi); // assuming f is increasing
    while (lo < hi) { // find first index such that f is true 
        T mid = half(lo+hi);
        f(mid) ? hi = mid : lo = mid+1; 
    } 
    return lo;
}
template<class T, class U> T lstTrue(T lo, T hi, U f) {
    lo --; assert(lo <= hi); // assuming f is decreasing
    while (lo < hi) { // find first index such that f is true 
        T mid = half(lo+hi+1);
        f(mid) ? lo = mid : hi = mid-1;
    } 
    return lo;
}
template<class T> void remDup(vector<T>& v) { 
    sort(all(v)); v.erase(unique(all(v)),end(v)); }

// INPUT
template<class A> void re(complex<A>& c);
template<class A, class B> void re(pair<A,B>& p);
template<class A> void re(vector<A>& v);
template<class A, size_t SZ> void re(array<A,SZ>& a);

template<class T> void re(T& x) { cin >> x; }
void re(db& d) { str t; re(t); d = stod(t); }
void re(ld& d) { str t; re(t); d = stold(t); }
template<class H, class... T> void re(H& h, T&... t) { re(h); re(t...); }

template<class A> void re(complex<A>& c) { A a,b; re(a,b); c = {a,b}; }
template<class A, class B> void re(pair<A,B>& p) { re(p.f,p.s); }
template<class A> void re(vector<A>& x) { trav(a,x) re(a); }
template<class A, size_t SZ> void re(array<A,SZ>& x) { trav(a,x) re(a); }

// TO_STRING
#define ts to_string
str ts(char c) { return str(1,c); }
str ts(const char* s) { return (str)s; }
str ts(str s) { return s; }
str ts(bool b) { 
    #ifdef LOCAL
        return b ? "true" : "false"; 
    #else 
        return ts((int)b);
    #endif
}
template<class A> str ts(complex<A> c) { 
    stringstream ss; ss << c; return ss.str(); }
str ts(vector<bool> v) {
    str res = "{"; F0R(i,sz(v)) res += char('0'+v[i]);
    res += "}"; return res; }
template<size_t SZ> str ts(bitset<SZ> b) {
    str res = ""; F0R(i,SZ) res += char('0'+b[i]);
    return res; }
template<class A, class B> str ts(pair<A,B> p);
template<class T> str ts(T v) { // containers with begin(), end()
    #ifdef LOCAL
        bool fst = 1; str res = "{";
        for (const auto& x: v) {
            if (!fst) res += ", ";
            fst = 0; res += ts(x);
        }
        res += "}"; return res;
    #else
        bool fst = 1; str res = "";
        for (const auto& x: v) {
            if (!fst) res += " ";
            fst = 0; res += ts(x);
        }
        return res;

    #endif
}
template<class A, class B> str ts(pair<A,B> p) {
    #ifdef LOCAL
        return "("+ts(p.f)+", "+ts(p.s)+")"; 
    #else
        return ts(p.f)+" "+ts(p.s);
    #endif
}

// OUTPUT
template<class A> void pr(A x) { cout << ts(x); }
template<class H, class... T> void pr(const H& h, const T&... t) { 
    pr(h); pr(t...); }
void ps() { pr("\n"); } // print w/ spaces
template<class H, class... T> void ps(const H& h, const T&... t) { 
    pr(h); if (sizeof...(t)) pr(" "); ps(t...); }

// DEBUG
void DBG() { cerr << "]" << endl; }
template<class H, class... T> void DBG(H h, T... t) {
    cerr << ts(h); if (sizeof...(t)) cerr << ", ";
    DBG(t...); }
#ifdef LOCAL // compile with -DLOCAL, chk -> fake assert
    #define dbg(...) cerr << "Line(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
    #define chk(...) if (!(__VA_ARGS__)) cerr << "Line(" << __LINE__ << ") -> function(" \
         << __FUNCTION__  << ") -> CHK FAILED: (" << #__VA_ARGS__ << ")" << "\n", exit(0);
#else
    #define dbg(...) 0
    #define chk(...) 0
#endif

// FILE I/O
void setIn(str s) { freopen(s.c_str(),"r",stdin); }
void setOut(str s) { freopen(s.c_str(),"w",stdout); }
void unsyncIO() { cin.tie(0)->sync_with_stdio(0); }
void setIO(str s = "") {
    unsyncIO();
    // cin.exceptions(cin.failbit); 
    // throws exception when do smth illegal
    // ex. try to read letter into int
    if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
}

int m, Q;
int p[100005];
int n[100005];

const int mx = 10000005;
int curlef;
priority_queue<pi> pq;
bitset<mx> process;
int ans[mx]; //best transition

int main() {
    setIO();

    // clock_t c = clock();
    cin >> m >> Q;
    ll maxval = 1;
    for(int i = 1; i <= m; i++){
        cin >> p[i];
        maxval*=p[i];
        ckmin(maxval, ll(MOD));
    }

    int start = 0;

    for(int i = 1; i <= Q; i++){
        cin >> n[i];
        process[n[i]] = 1;
        ckmax(start, n[i]);
    }
    ckmin(start, int(maxval-1));

    curlef = start;
    for(int i = 1; i <= m; i++){
        int curpos = start/p[i]*p[i];
        ckmin(curlef, curpos);
        pq.push(mp(curpos, p[i]));
    }
    int num = 0;
    int num2 = 0;
    for(int i = start; i >= 1; i--){
        if(!process[i]) continue;
        num2++;
        while(pq.top().f > i){
            pi a = pq.top();
            pq.pop();
            int newpos = i/a.s*a.s;
            ckmin(newpos, (curlef+a.s-1)/a.s*a.s);
            ckmin(curlef, newpos);
            pq.push(mp(newpos, a.s)); 
            num++;
        }
        ans[i] = curlef;
        process[ans[i]] = 1;
    }

    ans[0] = 0;
    for(int i = 1; i <= start; i++){
        if(process[i]){
            ans[i] = ans[ans[i]]+1;
        }
        
    }

    for(int i = 1; i <= Q; i++){
        if(n[i] >= maxval){
            ps("oo");
        }
        else ps(ans[n[i]]);
    }
    // cout << fixed << setprecision(5);
    // cout << double(clock()-c)/CLOCKS_PER_SEC;
    // you should actually read the stuff at the bottom
}

/* stuff you should look for
    * int overflow, array bounds
    * special cases (n=1?)
    * do smth instead of nothing and stay organized
    * WRITE STUFF DOWN
*/

Compilation message

brunhilda.cpp: In function 'void setIn(str)':
brunhilda.cpp:168:28: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
  168 | void setIn(str s) { freopen(s.c_str(),"r",stdin); }
      |                     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
brunhilda.cpp: In function 'void setOut(str)':
brunhilda.cpp:169:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
  169 | void setOut(str s) { freopen(s.c_str(),"w",stdout); }
      |                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 3 ms 492 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 492 KB Output is correct
14 Correct 4 ms 492 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 4 ms 492 KB Output is correct
18 Correct 3 ms 492 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 42 ms 876 KB Output is correct
2 Correct 43 ms 2156 KB Output is correct
3 Correct 51 ms 2156 KB Output is correct
4 Correct 54 ms 1388 KB Output is correct
5 Correct 26 ms 1520 KB Output is correct
6 Correct 15 ms 748 KB Output is correct
7 Correct 42 ms 876 KB Output is correct
8 Correct 24 ms 1408 KB Output is correct
9 Correct 24 ms 2156 KB Output is correct
10 Correct 39 ms 2156 KB Output is correct
11 Correct 125 ms 1392 KB Output is correct
12 Correct 60 ms 1900 KB Output is correct
13 Correct 31 ms 748 KB Output is correct
14 Correct 54 ms 1260 KB Output is correct
15 Correct 30 ms 1392 KB Output is correct
16 Correct 43 ms 2156 KB Output is correct
17 Correct 121 ms 2796 KB Output is correct
18 Correct 80 ms 2284 KB Output is correct

Subtask #3
60.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 183 ms 32236 KB Output is correct
2 Correct 217 ms 41196 KB Output is correct
3 Correct 118 ms 2796 KB Output is correct
4 Correct 145 ms 41836 KB Output is correct
5 Correct 117 ms 10728 KB Output is correct
6 Correct 197 ms 42092 KB Output is correct
7 Correct 103 ms 2920 KB Output is correct
8 Correct 173 ms 32364 KB Output is correct
9 Correct 170 ms 32236 KB Output is correct
10 Correct 143 ms 38252 KB Output is correct
11 Correct 125 ms 39912 KB Output is correct
12 Correct 150 ms 40044 KB Output is correct
13 Correct 94 ms 2928 KB Output is correct
14 Correct 160 ms 26092 KB Output is correct
15 Correct 175 ms 40684 KB Output is correct
16 Correct 197 ms 40684 KB Output is correct
17 Correct 171 ms 38124 KB Output is correct
18 Correct 218 ms 41196 KB Output is correct
19 Correct 70 ms 38892 KB Output is correct
20 Correct 119 ms 2924 KB Output is correct
21 Correct 172 ms 41068 KB Output is correct
22 Correct 240 ms 28136 KB Output is correct
23 Correct 145 ms 28256 KB Output is correct
24 Correct 115 ms 41708 KB Output is correct
25 Correct 184 ms 41836 KB Output is correct
26 Correct 141 ms 41708 KB Output is correct
27 Correct 125 ms 3176 KB Output is correct
28 Correct 68 ms 2796 KB Output is correct
29 Correct 245 ms 28136 KB Output is correct
30 Correct 245 ms 30952 KB Output is correct
31 Correct 116 ms 41708 KB Output is correct
32 Correct 145 ms 41836 KB Output is correct
33 Correct 104 ms 41708 KB Output is correct
34 Correct 91 ms 2920 KB Output is correct
35 Correct 82 ms 3312 KB Output is correct
36 Correct 242 ms 43112 KB Output is correct
37 Correct 119 ms 10600 KB Output is correct
38 Correct 200 ms 42024 KB Output is correct
39 Correct 125 ms 41836 KB Output is correct
40 Correct 173 ms 42092 KB Output is correct
41 Correct 48 ms 2792 KB Output is correct
42 Correct 177 ms 5512 KB Output is correct