| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 900672 | ozner77 | Arranging Shoes (IOI19_shoes) | C++17 | 1 ms | 600 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>
#include <algorithm>
using namespace std;
long long count_swaps(vector<int> s) {
vector<int>::iterator it;
int e=s.size(),k;
long long swaps=0;
for(int i=0;i<e;i++){
if(s[i]>0){
swaps++;
}
it=find(s.begin(),s.end(),-i);
k=(int)*it;
swaps+=(k-(i+1));
s.erase(s.begin()+k);
e=s.size();
}
return swaps;
}| # | 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... | ||||
