| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1348005 | msb.83 | A String Problem (EGOI25_stringproblem) | C++20 | 155 ms | 188456 KiB |
//Rahman ve Rahim olan Allah'ın adıyla
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define int long long
#define pb push_back
#define fi first
#define se second
#define mid (st+end)/2
using namespace std;
const int i12=12;
const int i24=24;
const int i36=36;
const int i48=48;
int32_t main(){
ios_base::sync_with_stdio(false);cin.tie(0);
freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
int n;cin>>n;vector<array<int,2>>arr(n);vector<int>res(n*2,0);vector<array<int,2>>ans;
for(int i=0;i<n;i++){
cin>>arr[i][0]>>arr[i][1];res[(arr[i][0]+arr[i][1])%(2*n)]++;
}int mx=0,mxi=0;for(int i=1;i<n*2;i+=2){
if(res[i]>mx){mx=res[i];mxi=i;}
}cout<<n-mx<<"\n";
for(int i=0;i<n;i++){
if((arr[i][0]+arr[i][1])%(n*2)==mxi) continue;
cout<<i<<" "<<arr[i][1]<<" "<<(mxi-arr[i][0]+(n*2))%(n*2)<<"\n";
}
}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... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
