Submission #800409

# Submission time Handle Problem Language Result Execution time Memory
800409 2023-08-01T14:23:13 Z Dan4Life Sorting (IOI15_sorting) C++17
20 / 100
2 ms 448 KB
#include <bits/stdc++.h>
using namespace std;
const int N = (int)2e5+10;
int n, tot, a[N], t[N], x[N], y[N], p[N], vis[N];
 
bool chk(int m, int P[], int Q[]){
    for(int i = 0; i < n; i++) a[i] = t[i], vis[i]=0;
    for(int i = 0; i < m; i++) swap(a[x[i]],a[y[i]]), P[i]=Q[i]=0;
    for(int i = 0; i < n; i++) p[a[i]]=i;
    tot = 0; fill(vis,vis+n,0);
    for(int i = 0; i < n; i++){
		if(vis[i]) continue; 
        int j = i; vector<int> v; v.clear();
		while(!vis[j]){
            vis[j] = 1; if(vis[p[j]]) break; 
            P[tot]=j,Q[tot++]=p[j], j = p[j];
        }
    }
    return tot<=m;
}
 
int findSwapPairs(int N, int A[], int m, int X[], int Y[], int P[], int Q[]) {
    n = N; if(is_sorted(A,A+n)) return 0;
    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 = m;
    while(l<r){
        int mid = (l+r)/2;
        if(chk(mid,P,Q)) r=mid;
        else l=mid+1;
    }
    chk(l,P,Q); return l;
}

Compilation message

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:22:23: warning: declaration of 'N' shadows a global declaration [-Wshadow]
   22 | int findSwapPairs(int N, int A[], int m, int X[], int Y[], int P[], int Q[]) {
      |                   ~~~~^
sorting.cpp:3:11: note: shadowed declaration is here
    3 | const int N = (int)2e5+10;
      |           ^
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 308 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 308 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 304 KB Output is correct
2 Incorrect 0 ms 308 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 308 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 304 KB Output is correct
14 Incorrect 0 ms 308 KB Output isn't correct
15 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 448 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 448 KB Output isn't correct
2 Halted 0 ms 0 KB -