# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
898647 | ozner77 | Arranging Shoes (IOI19_shoes) | C++17 | 14 ms | 1996 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>
#include <vector>
#include <iostream>
#include <string>
using namespace std;
long long count_swaps(std::vector<int> s) {
int c,d,e=s.size(),xd;
long long swaps=0;
for(int i=0;i<e;i+=2){
c=s[i+1];
for(int k=i+1;k<e;k++){
if(s[k]+s[i]==0){
swaps+=(k-(i+1));
s[i+1]=s[k];
s[k]=c;
break;
}else{
d=s[k];
s[k]=c;
c=d;
}
}
return swaps;
}
}
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... |