Submission #438873

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
438873	2021-06-28T20:52:33 Z	NintsiChkhaidze	Sorting (IOI15_sorting)	C++14	74 / 100	59 ms	24176 KB

sorting

#include "sorting.h"
#include <iostream>
#define s second
#define f first
#define pii pair<int,int>
using namespace std;
int idx[200005],a[200005];
pii d[200005];
 
int findSwapPairs(int N, int S[], int M, int x[], int y[], int p[], int q[]) {
    bool c = 1;
    for (int i=0;i<N;i++)
        if (S[i] != i) c=0;
    
    if (c) return 0;
    
    int l = 1,r = M,ans = 0;
    while(l <= r){
        int mid = (l+r)>>1;
        
        for (int i=0;i<N;i++){
            a[i] = S[i];
            idx[S[i]] = i;
        }
        
        for (int i = 0; i < mid; i++){
            swap(a[x[i]],a[y[i]]);
            swap(idx[a[x[i]]],idx[a[y[i]]]);
        }
       
        int cnt = 0;
        for (int i = 0; i < N; i++){
            if (a[i] == i) continue;
            
            d[cnt] = {a[i],i};
            cnt++;
            
            int ind = idx[i];
            swap(idx[a[i]],idx[i]);
            swap(a[i],a[ind]);
        }
        
        for (int i = cnt; i < M; i++)
          d[i] = {0,0};
        
        if (cnt <= mid){
            ans = mid;
            for (int i=0;i<N;i++){
                a[i] = S[i];
                idx[S[i]] = i;
            }
            
            for (int i = 0; i < M; i++){
                swap(a[x[i]],a[y[i]]);
                swap(idx[a[x[i]]],idx[a[y[i]]]);
                
                p[i] = d[i].f; q[i] = d[i].s;
                swap(idx[p[i]],idx[q[i]]);
                p[i] = idx[p[i]]; q[i] = idx[q[i]];
                swap(a[p[i]],a[q[i]]);
             }
            r = mid - 1;
        }
        else {
            l = mid + 1;
        }
    }
    
    return ans;
}

Subtask #1

8.0 / 8.0

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

Subtask #2

12.0 / 12.0

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

Subtask #3

16.0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	2 ms	332 KB	Output is correct
4	Correct	1 ms	332 KB	Output is correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct

Subtask #4

18.0 / 18.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	2 ms	384 KB	Output is correct
11	Correct	1 ms	332 KB	Output is correct
12	Correct	1 ms	332 KB	Output is correct
13	Correct	1 ms	204 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	2 ms	332 KB	Output is correct
16	Correct	1 ms	332 KB	Output is correct
17	Correct	1 ms	332 KB	Output is correct
18	Correct	1 ms	204 KB	Output is correct
19	Correct	1 ms	204 KB	Output is correct
20	Correct	1 ms	204 KB	Output is correct
21	Correct	5 ms	716 KB	Output is correct
22	Correct	5 ms	716 KB	Output is correct
23	Correct	6 ms	716 KB	Output is correct
24	Correct	4 ms	696 KB	Output is correct
25	Correct	5 ms	776 KB	Output is correct
26	Correct	5 ms	716 KB	Output is correct
27	Correct	4 ms	688 KB	Output is correct

Subtask #5

20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	460 KB	Output is correct
2	Correct	3 ms	460 KB	Output is correct
3	Correct	3 ms	460 KB	Output is correct
4	Correct	1 ms	308 KB	Output is correct
5	Correct	3 ms	460 KB	Output is correct
6	Correct	3 ms	460 KB	Output is correct
7	Correct	3 ms	460 KB	Output is correct
8	Correct	3 ms	460 KB	Output is correct
9	Correct	3 ms	432 KB	Output is correct
10	Correct	3 ms	448 KB	Output is correct
11	Correct	3 ms	460 KB	Output is correct
12	Correct	3 ms	460 KB	Output is correct
13	Correct	3 ms	444 KB	Output is correct
14	Correct	3 ms	460 KB	Output is correct

Subtask #6

0 / 26.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	460 KB	Output is correct
2	Correct	3 ms	460 KB	Output is correct
3	Correct	3 ms	460 KB	Output is correct
4	Correct	1 ms	308 KB	Output is correct
5	Correct	3 ms	460 KB	Output is correct
6	Correct	3 ms	460 KB	Output is correct
7	Correct	3 ms	460 KB	Output is correct
8	Correct	3 ms	460 KB	Output is correct
9	Correct	3 ms	432 KB	Output is correct
10	Correct	3 ms	448 KB	Output is correct
11	Correct	3 ms	460 KB	Output is correct
12	Correct	3 ms	460 KB	Output is correct
13	Correct	3 ms	444 KB	Output is correct
14	Correct	3 ms	460 KB	Output is correct
15	Runtime error	59 ms	24176 KB	Execution killed with signal 11
16	Halted	0 ms	0 KB	-