oj.uz

Submission #800353

# Submission time Handle Problem Language Result Execution time Memory
800353 2023-08-01T13:39:46 Z Dan4Life Sorting (IOI15_sorting) C++17
0 / 100
 6 ms 868 KB 
#include "sorting.h"
#include <bits/stdc++.h>
using namespace std;
const int mxN = (int)2e5+10;
int n, tot, a[mxN], t[mxN], x[mxN], y[mxN], pos[mxN], vis[mxN];
 
void swp(int i, int j, int P[], int Q[], bool ok=0){ 
	if(ok) P[tot]=i, Q[tot]=j, tot++;
	swap(pos[a[i]],pos[a[j]]); swap(a[i],a[j]); 
}
 
int chk(int m, int P[], int Q[]){
    for(int i = 0; i < n; i++)
        a[i] = t[i], vis[i]=0, pos[a[i]] = i;
    for(int i = 0; i < m; i++)
        swp(x[i],y[i],P,Q), P[i]=Q[i]=0;
    tot = 0; fill(vis,vis+n,0);
    for(int i = 0; i < n; i++){
		if(a[i]==i) continue;
		int j = i;
		vector<int> v; v.clear();
		while(!vis[j]){
			v.push_back(j);
			vis[j] = 1; j = pos[a[j]];
		}
		reverse(begin(v),end(v));
		for(int i = 0; i < (int)v.size()-1; i++)
			swp(v[i],v[i+1],P,Q,1);
    }
    return (is_sorted(a,a+n) and tot<=m)?m:mxN;
}
 
int findSwapPairs(int N, int A[], int m, int X[], int Y[], int P[], int Q[]) {
    n = N;
    for(int i = 0; i < n; i++){
        a[i] = t[i] = A[i];
        x[i] = X[i], y[i] = Y[i];
    }
    int l = 0, r = n;
    while(l<r){
        int mid = (l+r)/2;
        if(chk(mid,P,Q)<=mid) r=mid;
        else l=mid+1;
    }
    return chk(l,P,Q);
}

Compilation message

sorting.cpp: In function 'int chk(int, int*, int*)':
sorting.cpp:27:11: warning: declaration of 'i' shadows a previous local [-Wshadow]
   27 |   for(int i = 0; i < (int)v.size()-1; i++)
      |           ^
sorting.cpp:18:13: note: shadowed declaration is here
   18 |     for(int i = 0; i < n; i++){
      |             ^
sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:33:39: warning: unused parameter 'm' [-Wunused-parameter]
   33 | int findSwapPairs(int N, int A[], int m, int X[], int Y[], int P[], int Q[]) {
      |                                   ~~~~^

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Runtime error 2 ms 512 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Runtime error 2 ms 512 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Runtime error 2 ms 468 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Runtime error 2 ms 512 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 6 ms 868 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #6
0 / 26.0

# Verdict Execution time Memory Grader output
1 Runtime error 6 ms 868 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -