oj.uz

답안 #320167

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
320167 2020-11-07T19:59:11 Z Karen124 MP3 Player (CEOI10_mp3player) C++14
40 / 100
 122 ms 2148 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define ll long long int 
#define F first
#define S second
#define pb push_back
const ll N = 1e5 + 5;
const ll LOG = 30;
const ll MOD = 1e9 + 7;
const ll INF = 1e18 + 10;
ll n, Vmax, V2, a[N], t[N], dif;
ll R_Do_Operations(ll e, ll T){
    for (ll i = n; i >= 2; i--){
        if (t[i] - t[i - 1] <= T){
            e -= a[i];
        }
        e = max(e, 0ll);
        e = min(e, Vmax);
    }
    return e;
}
ll Do_Operations(ll s, ll T){
    for (ll i = 2; i <= n; i++){
        if (t[i] - t[i - 1] <= T){
            s += a[i];
        }
        s = max(s, 0ll);
        s = min(s, Vmax);
    }  
    return s;
}
int ok(ll T){
    ll s = R_Do_Operations(V2, T);
    ll e = Do_Operations(s, T);
    return (e == V2);
}
int main (){
    cin >> n >> Vmax >> V2;
    for (ll i = 1; i <= n; i++){
        char c;
        cin >> c >> t[i];
        a[i] = ((c == '+') ? 1 : -1);
        if (i != 1) dif = max(dif, t[i] - t[i - 1]);
    }
    ll en = V2; 
    for (int i = n; i >= 1; i--){
        en -= a[i];
        en = max(en, 0ll);
        en = min(en, Vmax);
    }
    for (ll i = 1; i <= n; i++){
        en += a[i];
        en = max(en, 0ll);
        en = min(en, Vmax);
    }
    if (en == V2){
        cout << "infinity\n";
        return 0;
    }
    ll l = 0, r = INF;
    while (l + 1 < r){
        ll mid = (l + r) / 2;
        if (ok(mid)) l = mid;
        else r = mid;
    }
    if (dif <= l){
        cout << "infinity\n";
        return 0;
    }
    ll L = R_Do_Operations(V2, l), R = INF;
    while (L + 1 < R){
        ll mid = (L + R) / 2;
        if (Do_Operations(mid, l) == V2) L = mid;
        else R = mid;
    }
    cout << l << ' ' << min(L, Vmax) << '\n';
    return 0;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 492 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 2 ms 364 KB Output is correct
4 Correct 2 ms 364 KB Output is correct

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 364 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 20 ms 748 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 748 KB Output is correct
2 Correct 26 ms 748 KB Output is correct
3 Correct 22 ms 876 KB Output is correct
4 Incorrect 23 ms 620 KB Output isn't correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 748 KB Output is correct
2 Correct 15 ms 748 KB Output is correct
3 Correct 31 ms 876 KB Output is correct
4 Correct 23 ms 748 KB Output is correct

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 48 ms 1024 KB Output is correct
2 Correct 40 ms 1252 KB Output is correct
3 Incorrect 36 ms 1004 KB Output isn't correct

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 111 ms 2020 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 122 ms 1912 KB Output is correct
2 Correct 95 ms 2148 KB Output is correct