# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
421125 | daanolav | Arranging Shoes (IOI19_shoes) | C++14 | 1 ms | 280 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 <bitset>
#include <tuple>
#include <cmath>
using namespace std;
typedef vector<int> vi;
typedef pair<vi,vi> vivi;
int n,num,shoeSize,index;
long long count_swaps(std::vector<int> s) {
n = s.size() / 2;
vivi sizes[n + 1];
for(index = 0; index < 2 * n; ++index) {
num = s[index];
//cerr << "shoe num " << index << " is " << num << endl;
shoeSize = abs(num);
if(num < 0) {
sizes[shoeSize].first.push_back(index);
} else {
sizes[shoeSize].second.push_back(index);
}
}
long long swapsNeeded = 0;
for(vivi shoes : sizes) {
//cerr << "lop" << endl;
//cerr << shoes.first.size() << endl;
for(index = 0; index < shoes.first.size(); ++index) {
//cerr << "comparing " << shoes.first[index] << " and " << shoes.second[index] << endl;
if(shoes.second[index] > shoes.first[index]) {
swapsNeeded += shoes.second[index] - shoes.first[index] - 1;
} else {
swapsNeeded += shoes.first[index] - shoes.second[index];
}
}
}
return swapsNeeded;
}
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... |