oj.uz

답안 #335222

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
335222 2020-12-11T15:25:05 Z rqi Brunhilda’s Birthday (BOI13_brunhilda) C++14
81.4286 / 100
 1000 ms 41836 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]));
    }

    for(int i = start; i >= 1; i--){
        if(!process[i]) continue;
        while(pq.top().f > i){
            pi a = pq.top();
            pq.pop();
            int newpos = i/a.s*a.s;
            ckmin(curlef, newpos);
            pq.push(mp(newpos, a.s)); 
        }
        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 384 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 364 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 0 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 3 ms 492 KB Output is correct
14 Correct 5 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 38 ms 748 KB Output is correct
2 Correct 41 ms 1900 KB Output is correct
3 Correct 35 ms 1772 KB Output is correct
4 Correct 53 ms 1260 KB Output is correct
5 Correct 23 ms 1284 KB Output is correct
6 Correct 12 ms 748 KB Output is correct
7 Correct 37 ms 840 KB Output is correct
8 Correct 22 ms 1516 KB Output is correct
9 Correct 23 ms 1772 KB Output is correct
10 Correct 37 ms 1772 KB Output is correct
11 Correct 115 ms 1136 KB Output is correct
12 Correct 52 ms 1900 KB Output is correct
13 Correct 26 ms 620 KB Output is correct
14 Correct 48 ms 1388 KB Output is correct
15 Correct 27 ms 1136 KB Output is correct
16 Correct 39 ms 1900 KB Output is correct
17 Correct 107 ms 2944 KB Output is correct
18 Correct 73 ms 1900 KB Output is correct

Subtask #3
41.4285714286 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1018 ms 31800 KB Time limit exceeded
2 Execution timed out 1052 ms 26724 KB Time limit exceeded
3 Correct 139 ms 2156 KB Output is correct
4 Correct 536 ms 41392 KB Output is correct
5 Correct 184 ms 10344 KB Output is correct
6 Execution timed out 1089 ms 41452 KB Time limit exceeded
7 Correct 94 ms 2408 KB Output is correct
8 Execution timed out 1014 ms 31980 KB Time limit exceeded
9 Execution timed out 1000 ms 31856 KB Time limit exceeded
10 Correct 631 ms 38116 KB Output is correct
11 Correct 500 ms 39916 KB Output is correct
12 Correct 736 ms 39972 KB Output is correct
13 Correct 122 ms 2288 KB Output is correct
14 Correct 159 ms 25964 KB Output is correct
15 Correct 804 ms 40556 KB Output is correct
16 Execution timed out 1016 ms 40556 KB Time limit exceeded
17 Execution timed out 1089 ms 37996 KB Time limit exceeded
18 Execution timed out 1050 ms 27244 KB Time limit exceeded
19 Correct 162 ms 38636 KB Output is correct
20 Correct 138 ms 2156 KB Output is correct
21 Correct 173 ms 40972 KB Output is correct
22 Execution timed out 1095 ms 22248 KB Time limit exceeded
23 Correct 381 ms 27888 KB Output is correct
24 Correct 221 ms 41452 KB Output is correct
25 Correct 755 ms 41708 KB Output is correct
26 Correct 537 ms 41580 KB Output is correct
27 Correct 152 ms 2664 KB Output is correct
28 Correct 65 ms 2412 KB Output is correct
29 Execution timed out 1064 ms 21736 KB Time limit exceeded
30 Execution timed out 1045 ms 24424 KB Time limit exceeded
31 Correct 314 ms 41636 KB Output is correct
32 Correct 473 ms 41548 KB Output is correct
33 Correct 151 ms 41324 KB Output is correct
34 Correct 94 ms 2408 KB Output is correct
35 Correct 85 ms 3052 KB Output is correct
36 Execution timed out 1085 ms 25960 KB Time limit exceeded
37 Correct 177 ms 10344 KB Output is correct
38 Execution timed out 1087 ms 41552 KB Time limit exceeded
39 Correct 313 ms 41452 KB Output is correct
40 Correct 895 ms 41836 KB Output is correct
41 Correct 51 ms 2280 KB Output is correct
42 Correct 218 ms 5120 KB Output is correct