oj.uz

Submission #1040187

# Submission time Handle Problem Language Result Execution time Memory
1040187 2024-07-31T17:50:33 Z Zicrus Sorting (IOI15_sorting) C++17
74 / 100
 1000 ms 15120 KB 
#pragma GCC optimize("O3","unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")

#include <bits/stdc++.h>
#include "sorting.h"
using namespace std;
 
typedef int ll;
 
int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P1[], int Q1[]) {
    vector<ll> h(N);
    for (int i = 0; i < N; i++) h[i] = S[i];
 
    ll ooo = 0;
    for (int i = 0; i < N; i++) {
        if (h[i] != i) ooo++;
    }
    if (ooo == 0) return 0;
    
vector<int> P(N), Q(N); //
 
    vector<ll> revH(N);
    for (int i = 0; i < N; i++) {
        revH[h[i]] = i;
    }
 
    ll res1 =0;
    ll low = 1, high = N;
    while (low < high) {
        ll g = (low + high) / 2;
 
        ll res = 0;
        vector<ll> s = h;
        vector<ll> order = s;
        vector<ll> revOrd = revH, revS = revH;
        for (int j = 0; j < g; j++) {
            swap(order[X[j]], order[Y[j]]);
            swap(revOrd[order[X[j]]], revOrd[order[Y[j]]]);
        }
        int id1 = -1;
        for (int i = 0; i < g; i++) {
            swap(s[X[i]], s[Y[i]]);
            swap(revS[s[X[i]]], revS[s[Y[i]]]);
            int firstOut = -1, id = -1;
            for (int j = id1+1; j < N; j++) {
                if (order[j] != j) {
                    firstOut = order[id = j];
                    break;
                }
            }
            id1 = id;
            if (firstOut == -1) {
                P[res] = Q[res] = 0;
                res++;
            }
            else {
                ll iter = revOrd[id];
                ll v = order[iter];
 
                ll id1 = revS[firstOut];
                ll id2 = revS[v];
                swap(s[id1], s[id2]);
                swap(revS[s[id1]], revS[s[id2]]);
                swap(order[iter], order[id]);
                swap(revOrd[order[iter]], revOrd[order[id]]);
                P[res] = id1;
                Q[res] = id2;
                res++;
            }
        }
        ll ooo = 0;
        for (int i = 0; i < N; i++) {
            if (s[i] != i) ooo++;
        }
        if (ooo == 0) {
            res1 = res;
            high = res;
 
            memcpy(P1, &(P[0]), res * sizeof(ll));
            memcpy(Q1, &(Q[0]), res * sizeof(ll));
        }else {
            low = g+1;
        }
    }
	return res1;
}

Compilation message

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:60:20: warning: declaration of 'id1' shadows a previous local [-Wshadow]
   60 |                 ll id1 = revS[firstOut];
      |                    ^~~
sorting.cpp:40:13: note: shadowed declaration is here
   40 |         int id1 = -1;
      |             ^~~
sorting.cpp:71:12: warning: declaration of 'ooo' shadows a previous local [-Wshadow]
   71 |         ll ooo = 0;
      |            ^~~
sorting.cpp:14:8: note: shadowed declaration is here
   14 |     ll ooo = 0;
      |        ^~~
sorting.cpp:10:39: warning: unused parameter 'M' [-Wunused-parameter]
   10 | int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P1[], int Q1[]) {
      |                                   ~~~~^

Subtask #1
8.0 / 8.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
16.0 / 16.0

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

Subtask #4
18.0 / 18.0

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

Subtask #5
20.0 / 20.0

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

Subtask #6
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 568 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 2 ms 348 KB Output is correct
15 Correct 127 ms 12168 KB Output is correct
16 Correct 139 ms 12492 KB Output is correct
17 Correct 161 ms 12988 KB Output is correct
18 Correct 29 ms 6132 KB Output is correct
19 Correct 111 ms 14472 KB Output is correct
20 Correct 700 ms 15120 KB Output is correct
21 Correct 694 ms 14912 KB Output is correct
22 Correct 129 ms 13288 KB Output is correct
23 Correct 146 ms 13504 KB Output is correct
24 Correct 166 ms 13408 KB Output is correct
25 Correct 162 ms 13188 KB Output is correct
26 Correct 114 ms 13004 KB Output is correct
27 Execution timed out 1077 ms 11860 KB Time limit exceeded
28 Halted 0 ms 0 KB -