제출 #1110772

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

shoes

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

//#define int long long
#define OYY LLONG_MAX
#define mod 1000000007
#define faster ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define FOR for(int i=1;i<=n;i++)
#define mid (start+end)/2
#define lim 300005
#define fi first
#define se second

long long count_swaps(std::vector<int> s) {
	int n=s.size();
	if(n==2){
		if(s[0]<0)return 0;
		return 1;
	}
	int tut=1,cev=0;
	FOR{
		if(s[i-1]<0){
			cev+=abs(tut-i);
			tut+=2;
		}
	}
	return cev;
}
/*
int main(){
	faster
	int n;cin>>n;
	
	vector<int> v;
	
	FOR{
		int x,y;
		cin>>x>>y;
		v.push_back(x);
		v.push_back(y);
	}
	
	cout<<count_swaps(v)<<'\n';
	
	return 0;
}
*/

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