# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
481162 | glome | Arranging Shoes (IOI19_shoes) | C++17 | 810 ms | 3120 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<bits/stdc++.h>
using namespace std;
bool check(vector<int> s) {
for (int i = 0; i<s.size(); i+=2) {
if(s[i] > 0 || -s[i] != s[i+1]) {
return 0;
}
}
return 1;
}
long long count_swaps(std::vector<int> s) {
int n = s.size() / 2;
if(s.size() <= 20000) {
long long ans = 0;
while(!check(s)) {
vector<int> news;
for (int i = 0; i<s.size(); i+=2) {
if(-s[i] == s[i + 1] && s[i] < 0) {
continue;
}
if(s[i] < 0) {
for (int j = i + 1; j<s.size(); j++) {
if(s[j] == -s[i]) {
ans += abs((i + 1) - j);
for (int k = 0; k<s.size(); k++) {
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... |