Submission #1221329

#TimeUsernameProblemLanguageResultExecution timeMemory
1221329lorenzo-frittoliInfinite Race (EGOI24_infiniterace2)C++20
29 / 100
31 ms1224 KiB
#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main() {
  int N, Q; cin >> N >> Q;
  vector<bool> im_in_front(N, false);
  vector<int> laps(N, 0);
  while (Q--) {
    int raw; cin >> raw;
    int i = abs(raw) - 1;
    bool im_surpassing = raw > 0;

    if (im_in_front[i] && im_surpassing) laps[i]++;

    im_in_front[i] = im_surpassing;
  }
  cout << *max_element(laps.begin(), laps.end()) << 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...