oj.uz

답안 #200790

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
200790 2020-02-08T07:22:14 Z balbit Semiexpress (JOI17_semiexpress) C++11
0 / 100
 5 ms 376 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define ull unsigned ll
#define f first
#define s second
#define FOR(i,a,b) for (int i=(a); i<(b); ++i)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) for (int i=(n-1); i>=0; --i)
#define REP1(i,n) FOR(i,1,n+1)
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)x.size()
#define SQ(x) (x)*(x)
#define MN(a,b) a = min(a,(__typeof__(a))(b))
#define MX(a,b) a = max(a,(__typeof__(a))(b))
#define pb push_back
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#ifdef BALBIT
#define IOS()
#define bug(...) fprintf(stderr,"#%d (%s) = ",__LINE__,#__VA_ARGS__),_do(__VA_ARGS__);
template<typename T> void _do(T &&x){cerr<<x<<endl;}
template<typename T, typename ...S> void _do(T &&x, S &&...y){cerr<<x<<", ";_do(y...);}
#else
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0);
#define endl '\n'
#define bug(...)
#endif

const int iinf = 1<<29;
const ll inf = 1ll<<60;
const ll mod = 1e9+7;


void GG(){cout<<"-1\n"; exit(0);}

ll mpow(ll a, ll n, ll mo = mod){ // a^n % mod
    ll re=1;
    while (n>0){
        if (n&1) re = re*a %mo;
        a = a*a %mo;
        n>>=1;
    }
    return re;
}

ll inv (ll b){
    return b==1?1:(mod-mod/b) * inv(mod%b) % mod;
}

const int maxn = 2e5+5;

int n, m, k;
ll A,B,C,T;

struct Ev{
    int add, st, to, en;
    void cal(){
        ll lft = T-(B*st + (to-st)*C);
        if (lft < 0) add = 0;
        else{
            add = min(lft/A+1,(ll)(en-to));
        }
    }
    bool operator < (const Ev &oth) const {
        return add<oth.add;
    }
};

signed main(){
    IOS();
    cin>>n>>m>>k;
    cin>>A>>B>>C>>T;
    ll re = -1;
    vector<int> pos;
    priority_queue<Ev> pq;
    REP(i,m){
        ll x; cin>>x;
        x--; pos.pb(x);
        if (x*B<=T) re ++;
        if (i){
            Ev nw = {0,pos[i-1],pos[i-1]+1,pos[i]};
            nw.cal();
            re += nw.add; nw.to += nw.add;
            nw.cal();
            pq.push(nw);
        }
    }
    REP(j,k-m){
        if (!pq.empty() && pq.top().add >0){
            Ev e = pq.top(); pq.pop();
            bug(e.add, e.st, e.to, e.en);
            re += e.add;
            e.to += e.add;
            e.cal();
            pq.push(e);
        }else break;
    }
    cout<<re<<endl;

    // Check your array bounds!
    // Think about corner cases (smallest or biggest?)
}

Subtask #1
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Incorrect 5 ms 376 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Incorrect 5 ms 376 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 52.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Incorrect 5 ms 376 KB Output isn't correct
6 Halted 0 ms 0 KB -