oj.uz

Submission #408813

# Submission time Handle Problem Language Result Execution time Memory
408813 2021-05-19T16:58:02 Z MDario Sorting (IOI15_sorting) C++11
36 / 100
 3 ms 1228 KB 
#include "sorting.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
int n, s[200001], m, x[600001], y[600001];
bool f(ll xf){
    int s1[200001];
    for(int i=0; i<n; i++){
        s1[i]=s[i];
    }
    int c=0;
    for(int i=0; i<xf; i++){
        swap(s1[x[i]], s1[y[i]]);
    }
    for(int i=0; i<n; i++){
        while(s1[i]!=i){
            c++;
            swap(s1[i], s1[s1[i]]);
        }
    }
    return (c<=xf);
}
int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
    n=N;
    m=M;
    bool b=1;
    for(int i=0; i<n; i++){
        s[i]=S[i];
        if(S[i]!=i)b=0;
    }
    if(b)return 0;
    for(int i=0; i<n; i++){
        x[i]=X[i];
        y[i]=Y[i];
    }
    int l=0, r=n+1, mid=0;
    while(l+1<r){
        mid=(l+r)/2;
        if(f(mid)){
            r=mid;
        }
        else l=mid;
    }
    int c=0;
    l++;
    int s1[n];
    for(int i=0; i<n; i++){
        s1[i]=i;
    }
    for(int i=0; i<l; i++){
        swap(S[x[i]], S[y[i]]);
        swap(s1[x[i]], s1[y[i]]);
    }
    for(int i=0; i<n; i++){
        while(S[i]!=i){
            swap(s1[x[c]], s1[y[c]]);
            P[c]=s1[i];
            Q[c]=s1[S[i]];
            c++;
            swap(S[i], S[S[i]]);
        }
    }
    for(int i=c; i<l; i++){
        P[i]=0;
        Q[i]=0;
    }
	return l;
}

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 972 KB Output is correct
4 Correct 1 ms 972 KB Output is correct
5 Correct 1 ms 972 KB Output is correct
6 Correct 1 ms 972 KB Output is correct
7 Correct 1 ms 1100 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 972 KB Output is correct
4 Correct 1 ms 972 KB Output is correct
5 Correct 1 ms 972 KB Output is correct
6 Correct 1 ms 972 KB Output is correct
7 Correct 1 ms 1100 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 1100 KB Output is correct
11 Correct 1 ms 1100 KB Output is correct
12 Correct 1 ms 1100 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 1100 KB Output is correct
3 Correct 1 ms 1100 KB Output is correct
4 Correct 1 ms 1100 KB Output is correct
5 Correct 1 ms 1076 KB Output is correct
6 Correct 1 ms 1100 KB Output is correct

Subtask #4
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 972 KB Output is correct
4 Correct 1 ms 972 KB Output is correct
5 Correct 1 ms 972 KB Output is correct
6 Correct 1 ms 972 KB Output is correct
7 Correct 1 ms 1100 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 1100 KB Output is correct
11 Correct 1 ms 1100 KB Output is correct
12 Correct 1 ms 1100 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 1100 KB Output is correct
15 Correct 1 ms 1100 KB Output is correct
16 Correct 1 ms 1100 KB Output is correct
17 Correct 1 ms 1076 KB Output is correct
18 Correct 1 ms 1100 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Incorrect 2 ms 1228 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

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

Subtask #6
0 / 26.0

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