제출 #1351388

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1351388		ElayV13	Arranging Shoes (IOI19_shoes)	C++20	10 / 100	0 ms	344 KiB

shoes

#include "shoes.h"
#include "bits/stdc++.h"
using namespace std;

#define ll long long

ll count_swaps(vector<int>s)
{
      int n=(int)s.size();
      vector<int>P[n+1],N[n+1];
      for(int i=0;i<n;i++){
            if(s[i]>0) P[s[i]].push_back(i);
            else N[abs(s[i])].push_back(i);
      }
      vector<pair<int,int>>all;
      for(int val=1;val<=n;val++){
            for(int i=0;i<P[val].size();i++) all.push_back({P[val][i],N[val][i]});
      }
      sort(all.begin(),all.end());
      vector<int>act(n,1);
      ll res=0;
      for(pair<int,int>p:all){
            int i=p.first,j=p.second;
            if(i<j) ++res;
            for(int ii=i+1;ii<=j-1;ii++) res+=act[ii];
            act[i]=0;
            act[j]=0;
      }
      return res;
}

• Subtask 1: 10 / 10
• Subtask 2: 0 / 20
• Subtask 3: 0 / 20
• Subtask 4: 0 / 15
• Subtask 5: 0 / 20
• Subtask 6: 0 / 15