| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1331399 | AndreyPavlov | A String Problem (EGOI25_stringproblem) | C++20 | 16 ms | 1092 KiB |
#include <iostream>
#include <vector>
#include <numeric>
using namespace std;
using pii = pair<int,int>;
int main() {
ios::sync_with_stdio(false);
int n;
cin >> n;
vector <int> cnt(2 * n);
for (int i = 0; i < n; ++i) {
int u, v;
cin >> u >> v;
cnt[(u + v) % (2 * n)]++;
}
int res = 0;
for (int i = 1; i < 2 * n; i += 2) {
res = max(res, cnt[i]);
}
cout << n - res << '\n';
return 0;
}| # | 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... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
