제출 #955669

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
955669		IUA_Hasin	Arranging Shoes (IOI19_shoes)	C++17	45 / 100	19 ms	3416 KiB

shoes

#include <bits/stdc++.h>
 
#define endl                                "\n"
#define finp                                for(int i=0; i<n; i++)
#define fknp                                for(int k=0; k<n; k++)
#define yeap                                cout<<"YES"<<endl
#define nope                                cout<<"NO"<<endl
#define inpintn                             int n; cin>>n
#define inpintarrn                          int arr[n]; for(int i=0; i<n; i++){cin>>arr[i];}
#define inpllarrn                           long long arr[n]; for(int i=0; i<n; i++){cin>>arr[i];}
#define ll                                  long long
 
using namespace std; 

#include "shoes.h"

long long count_swaps(std::vector<int> s) {
	ll n = s.size();
	ll ind = 0;
	ll ans = 0;
	for(int i=0; i<n; i++){
		if(s[i]<0){
			ll dist = abs(i-ind);
			ans = ans+dist;
			ind = ind+2;
		}
	}
	return ans;
}

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