제출 #168980

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
168980		pulpy_orange	Arranging Shoes (IOI19_shoes)	C++14	50 / 100	1085 ms	4856 KiB

shoes

#include<bits/stdc++.h>
using namespace std;
#define ll long long

ll count_swaps(vector<int>S){
     int n=S.size();
     int ans=0;

     ll vis[n];
     memset(vis, 0, sizeof(vis));

     for(ll i=0;i<n;i++){
          if(vis[i])continue;
          ll curr=S[i];
          vis[i]=1;
          int cnt=0;
          if(curr<0){
               for(ll j=i+1;j<n;j++){
                    if(vis[j])cnt++;
                    if(!vis[j] and S[j]>0 and curr==-1*S[j]){
                         vis[j]=1;
                         ans+=(j-1-i)-cnt;
                         break;
                    }
               }
          }
          else{
               for(ll j=i+1;j<n;j++){
                    if(vis[j])cnt++;
                    if(!vis[j] and S[j]<0 and curr==-1*S[j]){
                         vis[j]=1;
                         ans+=(j-i)-cnt;
                         break;
                    }
               }
          }
     }
     return ans;
}

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