| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1334933 | SpyrosAliv | A String Problem (EGOI25_stringproblem) | C++20 | 0 ms | 344 KiB |
#include <bits/stdc++.h>
using namespace std;
void solve() {
int n; cin >> n;
map<int, int> cnt;
vector<pair<int, int>> arr;
int mx = 0;
for (int i = 0; i < n; i++) {
int u, v; cin >> u >> v;
arr.push_back({u, v});
if (abs(u - v) % 2 == 0) {
continue;
}
cnt[(u+v)/2]++;
mx = max(mx, cnt[(u+v)/2]);
}
cout << n - mx << "\n";
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
solve();
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... | ||||
