# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
621072 | mdn2002 | 정렬하기 (IOI15_sorting) | C++14 | 627 ms | 32180 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;
int n , m , a [2003] , aa [2003] , x [20004] , y [20004] , dis [2003][20004];
bool ck ( int xx )
{
for ( int i = 1 ; i <= n ; i ++ ) a [i] = aa [i];
int mm = xx;
for ( int i = 1 ; i <= n ; i ++ ) dis [i][mm] = i;
for ( int j = mm - 1 ; j >= 0 ; j -- )
{
for ( int i = 1 ; i <= n ; i ++ ) dis [i][j] = dis [i][ j + 1 ];
swap ( dis [ x [j] ][j] , dis [ y [j] ][j] );
}
for ( int i = 1 ; i <= mm ; i ++ )
{
int f = 0;
for ( int i = 1 ; i <= n ; i ++ )
{
if ( a [i] != i ) f = 1;
}
if ( f == 0 ) return 1;
swap ( a [ x [ i - 1 ] ] , a [ y [ i - 1 ] ] );
for ( int j = 1 ; j <= n ; j ++ )
{
if ( dis [j][i] != a [j] )
{
int wr;
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... |