Submission #1146291

#TimeUsernameProblemLanguageResultExecution timeMemory
1146291FZ_LaabidiInfinite Race (EGOI24_infiniterace2)C++20
29 / 100
32 ms3400 KiB
#include <bits/stdc++.h>
#define int long long
using namespace std;
int n, q;
vector<int> x;
signed main() {
    cin >> n >> q;
    x.resize(q);
    for (int i=0; i<q; i++)cin >> x[i];

    int count =0;
    if (n==2) {
      int val = -1;
        for (int i=0; i<q; i++) {
            if (x[i] <0)
                val= -1;
            if (x[i]>0) {
                if (val==0)count++;
                else val= 0;
            }
        }
    }
    else {
        vector<int> vali(n, 0);
        for (int i=0; i<q; i++) {
            vali[x[i]]++;
        }
        count = *max_element(vali.begin(), vali.end())-1;
    }
    cout << count << endl;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...