| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1304020 | lufychop | Arranging Shoes (IOI19_shoes) | C++20 | 1 ms | 340 KiB |
#include "shoes.h"
#include <bits/stdc++.h>
using namespace std;
int n;
// vector<long long> seg(1000000,0);
long long count_swaps(vector<int> s)
{
long long ans=0;
int LL=0,RR=2*n-1;
while(LL<RR)
{
if(s[LL]!=0)
{
int tmp=0;
for(int i=LL+1;i<=RR;i++)
{
if(s[i]==0)
{
tmp++;
}
if(s[i]==-s[LL])
{
ans=ans+i-LL-1;
if(s[i]<0)
{
ans=ans+1;
}
s[i]=0;
s[LL]=0;
break;
}
}
}
if(s[RR]!=0)
{
int tmp=0;
for(int i=RR-1;i>=LL;i--)
{
if(s[i]==0)
{
tmp++;
}
if(s[i]==-s[RR])
{
ans=ans+RR-i-1-tmp;
if(s[i]>0)
{
ans=ans+1;
}
s[i]=0;
s[RR]=0;
break;
}
}
}
LL++;
RR--;
}
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... | ||||
