oj.uz

Submission #293332

# Submission time Handle Problem Language Result Execution time Memory
293332 2020-09-07T21:57:47 Z REALITYNB Sorting (IOI15_sorting) C++14
0 / 100
 2 ms 384 KB 
#include <bits/stdc++.h> 
using namespace std ; 
int findSwapPairs(int n , int s[] , int m , int x[] , int y[] , int p[] , int q[]){
   /* if(n==1){
        p[0]=q[0]=0 ; 
        return  0 ; 
    }
    if(n==2){
        if(s[0]<s[1]) p[0]=0,q[0]=1 ; 
        else p[0]=0,q[0]=0 ;  
        return 0 ; 
    }*/
    int times = -1 ;
    int pp = 0 ; 
    for(int i=0;i<m;i++){
        swap(s[x[i]],s[y[i]]); 
        for(int j=0;j<n;j++){
            if(s[j]==pp){
                p[i] = j ; 
                q[i]=pp ; 
                break ; 
            }
        }
        times++  ; 
        pp++ ; 
        if(pp==n) break ; 
    }
    /*if(s[0]>s[1]) p[pp-2]=q[pp-2]=0 ; 
    else p[pp]=0 , q[pp-2]=1 ; */
    return times+1 ; 
}

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 26.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -