# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1088698 | juansigler | Infinite Race (EGOI24_infiniterace2) | C++14 | 19 ms | 12636 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <limits.h>
#include <math.h>
#include <stdio.h>
#include <algorithm>
#include <complex>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
typedef long long int lld;
typedef long double llf;
typedef pair<int, int> pii;
int minLaps(const vector<int> &overtakes) {
int n = overtakes.size();
int ans = 0;
bool iAmFirst = false;
for (auto overtake : overtakes) {
if (overtake == 1) {
// Aka alcanzo al oponente
ans += (iAmFirst ? 1 : 0);
iAmFirst = true;
} else {
// El oponente alcanzo a Aka
iAmFirst = false;
}
}
return ans;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, m;
cin >> n;
cin >> m;
vector<vector<int>> arr(n, vector<int>());
for (int i = 0; i < m; ++i) {
int x;
cin >> x;
arr[abs(x)].push_back(x < 0 ? -1 : 1);
}
int ans = 0;
for (int i = 1; i < n; ++i) {
ans = max(ans, minLaps(arr[i]));
}
cout << ans << endl;
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |