제출 #1019079

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

shoes

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

typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef pair<int,int> pi;
typedef vector<pi> pii;
typedef tuple<int,int,int> tii;

#define REP(i,a,b) for(int i=a;i<b;i++)
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define LSOne(s) ((s)&(-s))

ll INF=1e18+10;
int inf=1e9+10;
ll M=1e9+7;

long long count_swaps(std::vector<int> s) {
	int n=s.size();
	int m=n/2;
	ll ans=0;
	REP(i,0,m){
		int pos=0;
		REP(j,i,n)if(s[j]==-s[i]){
			pos=j;
			break;
		}
		ans+=pos-i;
		s.erase(s.begin()+pos);
		if(s[i]<0)ans--;
	}
	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