제출 #145663

#제출 시각아이디문제언어결과실행 시간메모리
145663AKaan37Arranging Shoes (IOI19_shoes)C++17
10 / 100
56 ms48120 KiB
#include <bits/stdc++.h>
#include "shoes.h"

using namespace std;

typedef long long lo;
typedef pair< lo,lo > 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,hak[li],hak1[li],butun,butun1,farkli,farkli1,vis[li],vis1[li];
vector<int> vv;
vector<PII> sag[li];
vector<PII> 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";
		//~ cout<<butun<<endl;
		if(v[i]<0){
			//~ cout<<-v[i]<<endl;
			//~ cout<<sag[-v[i]][0].se<<" "<<sol[v[i]].size()<<endl;
			if((lo)sag[-v[i]].size()-hak[-v[i]]>0){
				hak[-v[i]]++;
				for(int j=i-1;j>=0;j--){
					if(v[j+1]==-v[i])break;
					cev++;
					swap(v[j],v[j+1]);
				}
			}
			else{sol[-v[i]].pb(mp(i,butun1));}
			
		}
		else{
			if((lo)sol[v[i]].size()-hak1[v[i]]>0){
				hak1[v[i]]++;
				for(int j=i;j>=0;j--){
					if(v[j-1]==-v[i])break;
					cev++;
					swap(v[j],v[j-1]);
				}
			}
			else{sag[v[i]].pb(mp(i,butun));}
		}
		
	}
	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);
//~ }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...