| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 401194 | victoriad | Arranging Shoes (IOI19_shoes) | C++14 | 36 ms | 3752 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 <cmath>
#include <cstdio>
#include <vector>
using namespace std;
long long count_swaps(std::vector<int> s) {
long long int x=0;
vector<int>menos;
for(int i=0;i<(int)s.size();i++){
if(s[i]<0)menos.push_back(i);
}
for(int i=0;i<(int)menos.size();i++){
x+=abs(i*2-menos[i]);
}
return x;
}| # | 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... | ||||
