| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1351394 | ElayV13 | Arranging Shoes (IOI19_shoes) | C++20 | 0 ms | 344 KiB |
#include "shoes.h"
#include "bits/stdc++.h"
using namespace std;
#define ll long long
ll count_swaps(vector<int>s)
{
int n=(int)s.size();
vector<bool>used(n,false);
ll res=0;
for(int i=0;i<n;i++){
if(used[i]) continue;
for(int j=i+1;j<n;j++){
if(!used[j]&&s[j]==-s[i]){
if(s[i]>0) ++res;
for(int k=i+1;k<=j-1;k++) res+=(!used[j]);
used[i]=used[j]=1;
break;
}
}
}
return res;
}
| # | 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... | ||||
