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>
#define ll long long
using namespace std;
const int mxN=1010;
bool Chk[2*mxN];
int N;
ll ans;
long long count_swaps(vector<int> s)
{
N=s.size()/2;
for(int i=0;i<2*N;i+=2)
{
for(int j=i+1;j<2*N;j++)
{
if(s[i]!=-s[j]) continue;
for(int k=j;k>=i+2;k--)
{
swap(s[k], s[k-1]);
ans++;
}
if(s[i]>0) ans++;
break;
}
}
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... |