# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1079987 | Trumling | Sorting (IOI15_sorting) | C++14 | 1 ms | 604 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 "sorting.h"
#include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define pb push_back
#define all(x) x.begin(),x.end()
#define INF 9999999999999999
typedef long long ll;
int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
vector<pair<ll,ll>>v;
for(int i=0;i<M;i++)
v.pb({P[i],Q[i]});
sort(all(v));
vector<int>s(N);
ll r=0;
do
{
for(int i=0;i<N;i++)
s[i]=S[i];
for(int i=0;i<M;i++)
{
swap(s[v[i].F],s[v[i].S]);
bool tf=1;
for(int j=0;j<N-1;j++)
if(s[j]>s[j+1])
{
tf=0;
break;
}
if(tf)
{
r=i+1;
break;
}
}
if(r!=0)
break;
} while (next_permutation(all(v)));
for(int i=0;i<r;i++)
{
//P[i]=v[i].F;
//Q[i]=v[i].S;
}
return r;
}
Compilation message (stderr)
# | 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... |