# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
573030 | sff_user | Arranging Shoes (IOI19_shoes) | C++17 | 1088 ms | 1864 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>
#define vi vector<int>
#define ll long long
using namespace std;
ll count_swaps(vector<int> s) {
int n = s.size()/2;
ll ans = 0;
for(int i = 0 ;i < 2*n ; i++){
for(int j = i+1;j < 2*n ; j++){
if(s[j]+s[i] == 0){
if(s[i]>0){
ans+= j-i;
}else {
ans+=j-i-1;
}
s.erase(s.begin()+j);
break;
}
}
}
return ans;
}
# | 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... |