| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1350869 | mati_gl | A String Problem (EGOI25_stringproblem) | C++20 | 0 ms | 356 KiB |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a;
cin>>a;
int f=0,h=0,b,c;
unordered_map<int,int> m;
for(int i=0;i<a;i++){
cin>>b>>c;
h=(c-b+(2*a))%(2*a);
h=min(h,(2*a)-h);
m[h]++;
}
for(auto & x : m){
f = max(f, x.second);
}
cout<<a-f<<endl;
for(int i=0;i<(a-f);i++){
cout<<a<<" "<<b<<" "<<c<<endl;
}
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... | ||||
