oj.uz

Submission #594581

# Submission time Handle Problem Language Result Execution time Memory
594581 2022-07-12T17:15:37 Z davi_bart Sorting (IOI15_sorting) C++14
0 / 100
 44 ms 372 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;
struct Dsu {
    vector<int> par, dim;
    Dsu(vector<int> &k) {
        par.resize(N);
        dim = vector<int>(N, 1);
        iota(par.begin(), par.end(), 0);
        for (int i = 0; i < k.size(); i++) {
            unite(i, k[i]);
        }
    }
    int find(int pos) {
        return par[pos] = par[pos] == pos ? pos : find(par[pos]);
    }
    void unite(int a, int b) {
        a = find(a);
        b = find(b);
        if (a == b) return;
        if (dim[a] < dim[b]) swap(a, b);
        par[b] = a;
        dim[a] += dim[b];
    }
    int conta() {
        int tot = 0;
        for (int i = 0; i < N; i++) {
            if (i == par[i]) tot += dim[i] - 1;
        }
        return tot;
    }
};
vector<int> v;
vector<int> 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;
    for (int i = 0; i < M; i++) {
        Dsu dsu(v);
        // cout << dsu.conta() << " ";
        if (dsu.conta() <= i) {
            ans = i;
            break;
        }
        swap(v[P[i]], v[Q[i]]);
    }
    // cout << endl;
    int o = 0;
    while (1) {
        int k = o;
        for (int i = 0; i < N; i++) {
            if (v[i] != i) {
                X[o] = v[v[i]];
                Y[o++] = v[i];
                swap(v[i], v[v[i]]);
            }
        }
        if (k == o) break;
    }
    assert(o == ans);
    return o;
    v = ini;
    multiset<int> ok;
    vector<bool> valid;
    for (int i = 0; i < ans; i++) {
        Dsu dsu(v);
        if (dsu.find(P[i]) == dsu.find(Q[i])) {
            swap(v[P[i]], v[Q[i]]);
            ok.insert(P[i]);
            ok.insert(Q[i]);
            valid.pb(1);
        } else
            valid.pb(0);
        cout << valid[i] << endl;
    }
    for (int i = 0; i < ans; i++) {
        if (valid[i]) {
            swap(v[P[i]], v[Q[i]]);
            ok.erase(ok.find(P[i]));
            ok.erase(ok.find(Q[i]));
            for (int j = 0; j < N; j++) {
                if (v[j] != j && ok.count(j) == 0) {
                    X[i] = j;
                    Y[i] = v[j];
                    swap(v[j], v[v[j]]);
                    break;
                }
            }
        } else {
            X[i] = P[i];
            Y[i] = Q[i];
        }
    }
    return ans;
}

Compilation message

sorting.cpp: In constructor 'Dsu::Dsu(std::vector<int>&)':
sorting.cpp:20:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   20 |         for (int i = 0; i < k.size(); i++) {
      |                         ~~^~~~~~~~~~
sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:45:23: warning: declaration of 'N' shadows a global declaration [-Wshadow]
   45 | 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;
      |     ^

Subtask #1
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 1 ms 212 KB Output is correct
5 Incorrect 0 ms 212 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
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 1 ms 212 KB Output is correct
5 Incorrect 0 ms 212 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

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

Subtask #5
0 / 20.0

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

Subtask #6
0 / 26.0

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