Submission #1370222

#TimeUsernameProblemLanguageResultExecution timeMemory
1370222AndreyRestaurant Recommendation Rescue (CCO25_day2problem1)C++17
7 / 25
21 ms4188 KiB
#include<bits/stdc++.h>
using namespace std;

const long long MOD = 998244353;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    int n,q,a;
    cin >> n >> q;
    vector<int> haha(n+1);
    for(int i = 1; i <= n; i++) {
        cin >> a;
        a--;
        haha[i] = haha[i-1]+a;
    }
    vector<int> pr(n+1);
    for(int i = 1; i <= n; i++) {
        pr[i] = min(pr[i-1],haha[i]);
    }
    long long br = 0,sb = 0,sm = INT_MAX;
    for(int i = n; i >= 1; i--) {
        sm = min(haha[i],(int)sm);
        if(haha[i] == sm) {
            if(pr[i-1] >= sm+1) {
                br++;
                sb+=(long long)(i%n);
            }
        }
    }
    cout << br << " " << sb%MOD;
    return 0;
}
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...