oj.uz

Submission #800394

# Submission time Handle Problem Language Result Execution time Memory
800394 2023-08-01T14:09:34 Z Dan4Life Sorting (IOI15_sorting) C++17
20 / 100
 1 ms 468 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(i==j) return;
	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[a[j]]) v.push_back(j), vis[a[j]] = 1, j = pos[j];
		for(int i = 0; i < (int)v.size()-1; i++) swp(v[i],v[i+1],P,Q,1);
    }
    return (tot<=m)?m:mxN;
}
 
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 = 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:18:3: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   18 |   if(a[i]==i) continue; int j = i; vector<int> v; v.clear();
      |   ^~
sorting.cpp:18:25: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   18 |   if(a[i]==i) continue; int j = i; vector<int> v; v.clear();
      |                         ^~~
sorting.cpp:20:11: warning: declaration of 'i' shadows a previous local [-Wshadow]
   20 |   for(int i = 0; i < (int)v.size()-1; i++) swp(v[i],v[i+1],P,Q,1);
      |           ^
sorting.cpp:17:13: note: shadowed declaration is here
   17 |     for(int i = 0; i < n; i++){
      |             ^
sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:25:39: warning: unused parameter 'm' [-Wunused-parameter]
   25 | int findSwapPairs(int N, int A[], int m, int X[], int Y[], int P[], int Q[]) {
      |                                   ~~~~^

Subtask #1
8.0 / 8.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
0 / 16.0

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

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 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 1 ms 212 KB Output is correct
14 Incorrect 0 ms 340 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 468 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 26.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 468 KB Output isn't correct
2 Halted 0 ms 0 KB -