oj.uz

Submission #594608

# Submission time Handle Problem Language Result Execution time Memory
594608 2022-07-12T17:48:05 Z davi_bart Sorting (IOI15_sorting) C++14
20 / 100
 1 ms 340 KB 
#pragma GCC optimize("O3")
#include <bits/stdc++.h>

#include "sorting.h"
using namespace std;
#define ll long long
// #define int ll
#define fi first
#define se second
#define ld long double
#define pb push_back
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int N;
vector<int> v;
vector<int> ini;
vector<pair<int, int>> scambi;
vector<bool> vis(200010);
void dfs(int pos, int ini) {
    vis[pos] = 1;
    scambi.pb({pos, v[pos]});
    if (v[pos] == ini) return;
    dfs(v[pos], ini);
}
int findSwapPairs(int N, int S[], int M, int P[], int Q[], int X[], int Y[]) {
    ::N = N;
    for (int i = 0; i < N; i++) v.pb(S[i]);
    ini = v;
    int ans = 0;
    int l = 0, r = N + 2;
    while (l < r) {
        int m = (l + r) / 2;
        v = ini;
        fill(vis.begin(), vis.begin() + N + 10, 0);
        scambi.clear();
        for (int i = 0; i < m; i++) {
            swap(v[P[i]], v[Q[i]]);
        }
        for (int j = 0; j < N; j++) {
            if (vis[j] || v[j] == j) continue;
            dfs(v[j], j);
        }
        if (scambi.size() <= m)
            r = m;
        else
            l = m + 1;
    }
    ans = l;
    v = ini;
    fill(vis.begin(), vis.begin() + N + 10, 0);
    scambi.clear();
    for (int i = 0; i < l; i++) {
        swap(v[P[i]], v[Q[i]]);
    }

    for (int j = 0; j < N; j++) {
        if (vis[j] || v[j] == j) continue;
        dfs(v[j], j);
    }
    v = ini;
    vector<int> pos(N);
    for (int i = 0; i < N; i++) {
        pos[v[i]] = i;
    }
    for (int i = 0; i < ans; i++) {
        swap(v[P[i]], v[Q[i]]);
        pos[v[P[i]]] = Q[i];
        pos[v[Q[i]]] = P[i];
        if (i >= scambi.size()) {
            X[i] = 0;
            Y[i] = 0;
            continue;
        }
        X[i] = pos[scambi[i].fi];
        Y[i] = pos[scambi[i].se];
        // int k = pos[v[X[i]]];
        pos[v[X[i]]] = Y[i];
        pos[v[Y[i]]] = X[i];
        swap(v[X[i]], v[Y[i]]);
        // swap(pos[v[X[i]]], pos[v[Y[i]]]);
    }
    return ans;
}

Compilation message

sorting.cpp: In function 'void dfs(int, int)':
sorting.cpp:18:23: warning: declaration of 'ini' shadows a global declaration [-Wshadow]
   18 | void dfs(int pos, int ini) {
      |                   ~~~~^~~
sorting.cpp:15:13: note: shadowed declaration is here
   15 | vector<int> ini;
      |             ^~~
sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:24:23: warning: declaration of 'N' shadows a global declaration [-Wshadow]
   24 | int findSwapPairs(int N, int S[], int M, int P[], int Q[], int X[], int Y[]) {
      |                   ~~~~^
sorting.cpp:13:5: note: shadowed declaration is here
   13 | int N;
      |     ^
sorting.cpp:42:27: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   42 |         if (scambi.size() <= m)
      |             ~~~~~~~~~~~~~~^~~~
sorting.cpp:68:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   68 |         if (i >= scambi.size()) {
      |             ~~^~~~~~~~~~~~~~~~
sorting.cpp:24:39: warning: unused parameter 'M' [-Wunused-parameter]
   24 | int findSwapPairs(int N, int S[], int M, int P[], int Q[], int X[], int Y[]) {
      |                                   ~~~~^

Subtask #1
8.0 / 8.0

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

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 224 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 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 0 ms 340 KB Output is correct

Subtask #3
0 / 16.0

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