oj.uz

Submission #296714

# Submission time Handle Problem Language Result Execution time Memory
296714 2020-09-10T20:17:06 Z peti1234 Sorting (IOI15_sorting) C++17
20 / 100
 2 ms 512 KB 
#include <bits/stdc++.h>

using namespace std;
const int c=200002;
int lo, hi, mid, st=0, a[c], ia[c], b[c], ib[c], cs1, cs2;
int findSwapPairs(int n, int s[], int m, int x[], int y[], int p[], int q[]) {
    lo=-1, hi=n;
    while(hi-lo>1) {
        mid=(hi+lo)/2, st=0;
        for (int i=0; i<n; i++) a[i]=s[i], b[i]=i, ia[s[i]]=i, ib[i]=i, p[i]=0, q[i]=0;
        for (int i=mid-1; i>=0; i--) swap(ib[b[x[i]]], ib[b[y[i]]]), swap(b[x[i]], b[y[i]]);
        for (int i=0; i<n; i++) {
            if (a[i]!=b[i]) {
                cs1=i, cs2=ia[b[i]];
                p[st]=cs1, q[st]=cs2;
                swap(ia[a[cs1]], ia[a[cs2]]), swap(a[cs1], a[cs2]);
                cs1=x[st], cs2=y[st];
                swap(ia[a[cs1]], ib[b[cs2]]), swap(a[cs1], a[cs2]);
                swap(ib[b[cs1]], ib[b[cs2]]), swap(b[cs1], b[cs2]);
                st++;
            }
        }
        if (st<=mid) hi=mid;
        else lo=mid;
    }
    return hi;
}

Compilation message

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:6:39: warning: unused parameter 'm' [-Wunused-parameter]
    6 | int findSwapPairs(int n, int s[], int m, int x[], int y[], int p[], int q[]) {
      |                                   ~~~~^

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct

Subtask #3
0 / 16.0

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

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Incorrect 1 ms 384 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 512 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 512 KB Output isn't correct
2 Halted 0 ms 0 KB -