Submission #1323143

#	Time	Username	Problem	Language	Result	Execution time	Memory
1323143		syanvu	MP3 Player (CEOI10_mp3player)	C++20	0 / 100	735 ms	1200 KiB

mp3player

// #pragma optimize ("g",on)
// #pragma GCC optimize ("inline")
// #pragma GCC optimize ("Ofast")
// #pragma GCC optimize ("unroll-loops")
// #pragma GCC optimize ("03")
#include <bits/stdc++.h>

#define SS ios_base::sync_with_stdio(0);cin.tie(nullptr);cout.tie(nullptr);
// #define int long long
#define all(v) v.begin(),v.end()
using namespace std;
// mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());

const int N = 1e4 + 1, MX = 40, inf = 1e18;

void solve(){
    int n, vmx, vf;
    cin >> n >> vmx >> vf;
    pair<char, int> p[n + 1];
    p[0].second = 0;
    int cm = 0, cp = 0, mx = 0;
    for(int i = 1; i <= n; i++){
        cin >> p[i].first >> p[i].second;
    }
    int rest = 0, resv = 0;
    for(int vs = 0; vs <= vmx; vs++){
        int cur = vs;
        for(int i = 2; i <= n; i++){
            cur = max(0, cur - (p[i].first == '-'));
            cur = min(vmx, cur + (p[i].first == '+'));
        }
        if(cur == vf){
            cout << "infinty";
            return;
        }
    }
    for(int t = 5000; t >= 1; t--){
        int vs = vmx;
        for(int i = 2; i <= n; i++){
            if(p[i].second - p[i - 1].second <= t){
                vs = max(0, vs - (p[i].first == '-'));
                vs = min(vmx, vs + (p[i].first == '+'));
            }
        }
        if(vs < vf) continue;
        if(vs >= vf){
            cout << t << ' ' << vmx - (vs - vf) << '\n';
            return;
        }
    }
}

signed main(){
    SS
    // freopen("trains.in", "r", stdin);
    // freopen("trains.out", "w", stdout);

    int t = 1;
    // cin >> t; 
    while(t--){
        solve();
    }
}

Compilation message (stderr)

mp3player.cpp:14:39: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+18' to '2147483647' [-Woverflow]
   14 | const int N = 1e4 + 1, MX = 40, inf = 1e18;
      |                                       ^~~~

• Subtask 1: 0 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 10
• Subtask 5: 0 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10