제출 #145530

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

shoes

#include <bits/stdc++.h>
#include "shoes.h"

using namespace std;

typedef long long lo;
typedef pair< int,int > PII;

#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(lo i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)

const lo MAX = -1000000000000000000;
const lo MIN = 1000000000000000000;
const lo inf = 1000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 500005;
const lo mod = 1000000007;

lo a[li],cev;
vector<int> vv;
vector<lo> sag[li];
vector<lo> sol[li];

long long count_swaps(vector<int> v) {
	//~ cout<<"**\n";
	
	//~ int cev=0;
	for(lo i=0;i<(lo)v.size();i++){
		//~ cout<<"**\n";
		if(v[i]<0){
			//~ cout<<-v[i]<<endl;
			//~ cout<<sag[-v[i]].size()<<" "<<sol[v[i]].size()<<endl;
			if((lo)sag[-v[i]].size()>0){cev+=i-sag[-v[i]][(lo)sag[-v[i]].size()-1];sag[-v[i]].erase(sag[-v[i]].begin()+(lo)sag[-v[i]].size()-1);}
			else sol[-v[i]].pb(i);
			
		}
		else{
			if((lo)sol[v[i]].size()>0){cev+=i-sol[v[i]][0]-1;sol[v[i]].erase(sol[v[i]].begin());}
			else sag[v[i]].pb(i);
		}
		
	}
	return cev;
}

//~ int main(){
	//~ lo n=0;
	//~ scanf("%lld",&n);
	//~ FOR{
		
		//~ scanf("%lld",&a[i]);
		//~ ////~ if(a[i]<0)
		//~ vv.pb(a[i]);
	//~ }
	//~ ////~ cout<<vv[0]<<endl;
	//~ lo at=count_swaps(vv);
	//~ printf("%lld\n",at);
//~ }

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