Submission #1260091

#TimeUsernameProblemLanguageResultExecution timeMemory
1260091mukhamediyarInfinite Race (EGOI24_infiniterace2)C++20
0 / 100
7 ms1864 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];
        if(i != 1){
            if(a[i - 1] == 1 && a[i] == 1){
                cnt ++;
            }
        }
        
    }
    if(a[1] == 1 && q == 1){
        cout << 1 << "\n";
    }
    else{
        cout << cnt << "\n";
    }
    

}








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