# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
779510 | mindiyak | Arranging Shoes (IOI19_shoes) | C++14 | 1094 ms | 139872 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 "shoes.h"
#include <vector>
#include <deque>
#include <iostream>
#include <algorithm>
#define pb push_back
#define mp make_pair
#define ll long long
using namespace std;
long long count_swaps(vector<int> s) {
vector<deque<ll>> arr;
vector<ll> effected_swap(s.size(),0);
vector<ll> in_list;
ll ans = 0;
deque<ll> a;
for(int i=0;i<200003;i++){
arr.pb(a);
}
for(int i=0;i<s.size();i++){
// cout << s[i] << " (" << 100001-s[i] << ") " << arr[100001-s[i]].size();
if(arr[100001-s[i]].size() != 0){
// cout << " yes - " << arr[100001-s[i]][0] << " " << (i-arr[100001-s[i]][0]) << " ";
if(s[i] > 0){
ans -= 1;
}
ans += (i-arr[100001-s[i]][0]-effected_swap[arr[100001-s[i]][0]]);
for(int j=0;j<in_list.size();j++){
if(arr[100001-s[i]][0] <= in_list[j]){
effected_swap[in_list[j]] += 1;
}
}
in_list.erase(lower_bound(in_list.begin(), in_list.end(),arr[100001-s[i]][0]));
arr[100001-s[i]].pop_front();
}else{
// cout << " no - " << s[i]+100001 << " ";
arr[s[i]+100001].push_back(i);
in_list.pb(i);
}
// cout << ans << endl;
}
return ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |