oj.uz

Submission #594585

# Submission time Handle Problem Language Result Execution time Memory
594585 2022-07-12T17:21:42 Z davi_bart Sorting (IOI15_sorting) C++14
56 / 100
 1000 ms 15688 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;
    vector<pair<int, int> > scambi;
    while (1) {
        int k = scambi.size();
        for (int i = 0; i < N; i++) {
            if (v[i] != i) {
                scambi.pb({v[i], i});
                swap(v[find(v.begin(), v.end(), i) - v.begin()], v[i]);
            }
        }
        if (k == scambi.size()) break;
    }
    v = ini;
    for (int i = 0; i < ans; i++) {
        swap(v[P[i]], v[Q[i]]);
        for (int j = 0; j < N; j++) {
            if (v[j] == scambi[i].fi) X[i] = j;
        }
        for (int j = 0; j < N; j++) {
            if (v[j] == scambi[i].se) Y[i] = j;
        }
        swap(v[X[i]], v[Y[i]]);
    }
    v = ini;
    for (int i = 0; i < ans; i++) {
        swap(v[P[i]], v[Q[i]]);
        swap(v[X[i]], v[Y[i]]);
    }
    for (int i = 0; i < N; i++) assert(v[i] == i);
    return ans;
    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;
      |     ^
sorting.cpp:63:28: warning: conversion from 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} to 'int' may change value [-Wconversion]
   63 |         int k = scambi.size();
      |                 ~~~~~~~~~~~^~
sorting.cpp:70: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]
   70 |         if (k == scambi.size()) break;
      |             ~~^~~~~~~~~~~~~~~~

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 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 304 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 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 304 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 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
16.0 / 16.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 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct

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 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 304 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 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 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 304 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 6 ms 468 KB Output is correct
22 Correct 5 ms 468 KB Output is correct
23 Correct 5 ms 468 KB Output is correct
24 Correct 4 ms 432 KB Output is correct
25 Runtime error 3 ms 852 KB Execution killed with signal 6
26 Halted 0 ms 0 KB -

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 51 ms 400 KB Output is correct
2 Correct 53 ms 452 KB Output is correct
3 Correct 55 ms 432 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 4 ms 468 KB Output is correct
6 Correct 8 ms 460 KB Output is correct
7 Correct 29 ms 460 KB Output is correct
8 Correct 57 ms 444 KB Output is correct
9 Correct 61 ms 448 KB Output is correct
10 Correct 61 ms 436 KB Output is correct
11 Correct 55 ms 468 KB Output is correct
12 Correct 29 ms 468 KB Output is correct
13 Correct 58 ms 448 KB Output is correct
14 Correct 1 ms 392 KB Output is correct

Subtask #6
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 51 ms 400 KB Output is correct
2 Correct 53 ms 452 KB Output is correct
3 Correct 55 ms 432 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 4 ms 468 KB Output is correct
6 Correct 8 ms 460 KB Output is correct
7 Correct 29 ms 460 KB Output is correct
8 Correct 57 ms 444 KB Output is correct
9 Correct 61 ms 448 KB Output is correct
10 Correct 61 ms 436 KB Output is correct
11 Correct 55 ms 468 KB Output is correct
12 Correct 29 ms 468 KB Output is correct
13 Correct 58 ms 448 KB Output is correct
14 Correct 1 ms 392 KB Output is correct
15 Execution timed out 1043 ms 15688 KB Time limit exceeded
16 Halted 0 ms 0 KB -