# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
829385 | JoksimKaktus | Arranging Shoes (IOI19_shoes) | C++17 | 1073 ms | 1876 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 <iostream>
#include <vector>
#include <cmath>
#include <queue>
#include <map>
#include <algorithm>
#include <iomanip>
#include <set>
using namespace std;
long long count_swaps(vector <int> S){
bool s3 = true;
bool s4 = true;
for(int i = 1;i < S.size();i++){
if(abs(S[i]) != abs(S[i-1])){
s3 = false;
}
if(i < S.size()/2 && i > 0){
s4 = false;
}
}
if(s3 || s4) {
long long res = 0;
int next = 0;
for (int i = 0; i < S.size(); i++) {
if (S[i] < 0) {
res += abs(i - next);
next += 2;
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... |