| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1369167 | ezzzay | A String Problem (EGOI25_stringproblem) | C++20 | 0 ms | 344 KiB |
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define int long long
const int N=3e5;
int d[N];
signed main(){
int n;
cin>>n;
vector<int>v;
for(int i=1;i<=n;i++){
int l,r;
cin>>l>>r;
if(l>r)swap(l,r);
d[r]= r-l;
v.pb(r);
}
int mx=0;
for(auto a:v){
if(d[a]%2==0)continue;
int cnt=0;
for(auto b:v){
if(a<b)continue;
// a ni maax r
if((a-b)*2==d[a]-d[b])cnt++;
}
mx=max(mx,cnt);
}
cout<<n-mx;
}| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
