| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1349793 | adriines06 | A String Problem (EGOI25_stringproblem) | C++20 | 29 ms | 5244 KiB |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void solve(){
int n; cin>>n;
vector<pair<int,int>>v(n);
map<int,int>mp;
for(int i=0;i<n;i++){
int a,b; cin>>a>>b;
v[i]={a,b};
int x=(a+b)%(2*n);
if(x%2!=0) mp[x]++;
}
int maxi=0,s;
for(auto x: mp){
maxi=max(maxi,x.second);
if(maxi==x.second) s=x.first;
}
cout<<n-maxi<<"\n";
if(maxi==0) s=2*n-1;
for(int i=0;i<n;i++){
int a=v[i].first, b=v[i].second;
if((a+b)%(2*n)!=s){
cout<<i<<" "<<b<<" "<<(s-a+2*n)%(2*n)<<"\n";
b=(s-a+2*n)%(2*n);
v[i]={a,b};
}
}
}
int main(){
ios::sync_with_stdio(0);
cout.tie(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... | ||||
