oj.uz

답안 #332223

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
332223 2020-12-01T17:52:17 Z Atill83 Semiexpress (JOI17_semiexpress) C++14
100 / 100
 9 ms 492 KB 
#include <bits/stdc++.h>
#define ff first
#define ss second
#define endl '\n'
using namespace std;
const long long INF = (long long) 1e18;
const int mod = (int) 1e9+7;
const int MAXN = (int) 3e5+5;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll n, m, k, A, B, C, T;
ll s[MAXN];
ll tim[MAXN];
int32_t main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);cout.tie(nullptr);

    #ifdef Local
        freopen("C:/Users/Admin/Desktop/Yazilim/C/IO/int.txt","r",stdin);
        freopen("C:/Users/Admin/Desktop/Yazilim/C/IO/out.txt","w",stdout);
    #endif

    cin>>n>>m>>k>>A>>B>>C>>T;

    multiset<pair<ll, pll>> st;
    ll ans = 0;
    for(int i = 0; i < m; i++){
        cin>>s[i];
        tim[i] = B * (s[i] - 1);
        if(tim[i] < T) ans += (i != 0);
        if(i && tim[i - 1] < T){
            ll lmx = (T - tim[i - 1]) / A;
            ll len = s[i] - s[i - 1] - 1;
            //cerr<<lmx<<endl;
            if(lmx >= len){
                ans += len;
                continue;
            }
            len -= lmx;
            ans += lmx;
            cerr<<lmx<<endl;
            ll val = min(len, (T - tim[i - 1] - (lmx + 1)*C) / A + 1);
            if(tim[i - 1] + (lmx + 1) * C > T) continue;
            st.insert({val, {len, tim[i - 1] + (lmx + 1) * C}});
        }
    }
    //cerr<<ans<<endl;
    for(int i = 0; i < k - m && !st.empty(); i++){
        auto u = prev(st.end());

        auto cur = *u;
        //cerr<<cur.ff<<" "<<cur.ss.ff<<" "<<cur.ss.ss<<endl;
        ans += cur.ff;

        st.erase(u);

        ll len = cur.ss.ff,
            tm = cur.ss.ss;
        len -= cur.ff;
        if(!len) continue;
        ll val = min(len, (T - tm - C*cur.ff) / A + 1);
        if(val == 0 || tm + cur.ff * C > T) 
            continue;
        st.insert({val, {len, tm + cur.ff * C}});
    }

    cout<<ans<<endl;


    #ifdef Local
        cout<<endl<<fixed<<setprecision(2)<<1000.0 * clock() / CLOCKS_PER_SEC<< " milliseconds ";
    #endif
}

Subtask #1
18.0 / 18.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 1 ms 364 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

Subtask #2
30.0 / 30.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 1 ms 364 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 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 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 492 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct

Subtask #3
52.0 / 52.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 1 ms 364 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 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 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 492 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 380 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 2 ms 364 KB Output is correct
23 Correct 9 ms 492 KB Output is correct
24 Correct 6 ms 492 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 8 ms 492 KB Output is correct
28 Correct 9 ms 492 KB Output is correct
29 Correct 3 ms 384 KB Output is correct
30 Correct 1 ms 364 KB Output is correct