| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 145525 | AKaan37 | Arranging Shoes (IOI19_shoes) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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<lo> vv;
vector<lo> sag[li];
vector<lo> sol[li];
long long count_swaps(vector<lo> 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]][0];sag[-v[i]].erase(sag[-v[i]].begin());}
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);
//~ }