Submission #1349602

#	Time	Username	Problem	Language	Result	Execution time	Memory
1349602		simplemind_31	A String Problem (EGOI25_stringproblem)	C++20	0 / 100	0 ms	344 KiB

Main

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n,maxi;
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    cin >> n;
    vector<pair<int,int>> edge(n);
    // de 0 al 2*n-1
    vector<int> con(n+1);
    for(int i=0;i<n;i++){
        cin >> edge[i].first >> edge[i].second;
        if((edge[i].first+edge[i].second)&1){
            if(edge[i].first+edge[i].second>n)con[(edge[i].first+edge[i].second-n)]++;
            else con[(edge[i].first+edge[i].second)]++;
        }
    }
    for(int i=0;i<=n;i++)maxi=max(maxi,con[i]);
    // mover n-maxi pares;
    cout << n-maxi;
}

• Subtask 0: 0 / 0
• Subtask 1: 0 / 14
• Subtask 2: 0 / 16
• Subtask 3: 0 / 12
• Subtask 4: 0 / 28
• Subtask 5: 0 / 30