oj.uz

Submission #48990

# Submission time Handle Problem Language Result Execution time Memory
48990 2018-05-21T06:13:23 Z Namnamseo Sorting (IOI15_sorting) C++17
100 / 100
 509 ms 12412 KB 
#include "sorting.h"
#include <algorithm>
#include <vector>
using namespace std;
typedef pair<int,int> pp;

int *x;
int n;

int *ea, *eb;
int *oa, *ob;

int cur[200010];
int mp [200010];

void w(int a,int b){
    swap(cur[a], cur[b]);
    swap(mp[cur[a]], mp[cur[b]]);
}

bool possible(int t){
    for(int i=0; i<n; ++i) cur[i] = x[i], mp[x[i]]=i;
    for(int i=0; i<t; ++i){
        int a=ea[i], b=eb[i];
        w(a,b);
    }
    int ind=0;
    for(int i=0; i<n; ++i){
        if(mp[i]==i) continue;
        int a=i, b=mp[i];
        oa[ind]=cur[i]; ob[ind]=i; ++ind;
        w(a, b);
    }
    if(ind>t) return false;
    for(;ind<t;++ind) oa[ind]=ob[ind]=0;
    for(int i=0; i<n; ++i) cur[i] = x[i], mp[x[i]]=i;
    for(int i=0; i<t; ++i){
        int a=ea[i], b=eb[i];
        swap(cur[a], cur[b]); swap(mp[cur[a]], mp[cur[b]]);
        
        int p=oa[i], q=ob[i];
        oa[i]=mp[p]; ob[i]=mp[q];
        w(oa[i], ob[i]);
    }
    return true;
}

int findSwapPairs(int N, int x_[], int m, int EA[], int EB[], int p[], int q[]) {
	n=N;
	x=x_;
	ea=EA; eb=EB;
	oa=p;  ob=q;
	int l=0, r=m;
	if(possible(l)) return l;
	while(l+1<r){
		int mid=(l+r)/2;
		if(possible(mid)) r=mid;
		else l=mid;
	}
	possible(r);
	return r;
}

Subtask #1
8.0 / 8.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
16.0 / 16.0

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

Subtask #4
18.0 / 18.0

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

Subtask #5
20.0 / 20.0

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

Subtask #6
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 3 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 4 ms 512 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 3 ms 384 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 3 ms 512 KB Output is correct
12 Correct 3 ms 384 KB Output is correct
13 Correct 4 ms 384 KB Output is correct
14 Correct 3 ms 384 KB Output is correct
15 Correct 359 ms 10940 KB Output is correct
16 Correct 476 ms 11384 KB Output is correct
17 Correct 459 ms 11784 KB Output is correct
18 Correct 42 ms 6904 KB Output is correct
19 Correct 201 ms 10744 KB Output is correct
20 Correct 204 ms 10968 KB Output is correct
21 Correct 199 ms 11076 KB Output is correct
22 Correct 291 ms 11900 KB Output is correct
23 Correct 342 ms 12412 KB Output is correct
24 Correct 503 ms 11980 KB Output is correct
25 Correct 381 ms 11868 KB Output is correct
26 Correct 383 ms 11128 KB Output is correct
27 Correct 391 ms 10616 KB Output is correct
28 Correct 341 ms 11928 KB Output is correct
29 Correct 416 ms 11512 KB Output is correct
30 Correct 333 ms 10176 KB Output is correct
31 Correct 445 ms 11772 KB Output is correct
32 Correct 454 ms 11820 KB Output is correct
33 Correct 506 ms 12024 KB Output is correct
34 Correct 509 ms 11996 KB Output is correct
35 Correct 195 ms 10488 KB Output is correct
36 Correct 75 ms 9720 KB Output is correct
37 Correct 340 ms 12252 KB Output is correct
38 Correct 267 ms 11768 KB Output is correct
39 Correct 250 ms 11868 KB Output is correct