# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
340622 | israeladewuyi | Arranging Shoes (IOI19_shoes) | C++17 | 1086 ms | 4716 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>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<string> vs;
#define PB push_back
#define pb pop_back
#define in insert
#define endl "\n"
const unsigned int M = 1000000007;
ll count_swaps(vi S){
ll n = S.size();
vector<ll>arr(n);
for(int i = 0; i < n; i++){
arr[i] = S[i];
}
ll swaps = 0;
for(ll i= 0; i < n; i+=2){
ll ind = -1;
for(ll j = i + 1; j < n; j++){
if(arr[j] == - arr[i]){
ind = j;
break;
}
}
for(ll j = ind; j > i + 1; j--){
swap(arr[j], arr[j-1]);
# | 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... |