Submission #1260094

#TimeUsernameProblemLanguageResultExecution timeMemory
1260094mukhamediyarInfinite Race (EGOI24_infiniterace2)C++20
0 / 100
8 ms1860 KiB
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int maxn = 1e5 + 7, sum = 1e5 + 7;
const int mod = 1e9 + 7;

int dp[maxn];

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n,q;
    cin >> n ;
    cin >> q;
    int cnt = 0;
    vector<int>a(q + 1);
    for(int i = 1; i <= q; i ++){
        cin >> a[i];
        
    }
    for(int i = 1; i <= q;i ++){
        cnt += a[i];
    }
    cout << max(0LL,cnt - 1);
    

}








#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...