답안 #594586

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
594586 2022-07-12T17:22:36 Z davi_bart 정렬하기 (IOI15_sorting) C++14
56 / 100
1000 ms 8000 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;
      |             ~~^~~~~~~~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 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
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 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 1 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 1 ms 340 KB Output is correct
# 결과 실행 시간 메모리 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 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 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 1 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 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 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 4 ms 340 KB Output is correct
22 Correct 5 ms 340 KB Output is correct
23 Correct 4 ms 340 KB Output is correct
24 Correct 4 ms 340 KB Output is correct
25 Incorrect 2 ms 340 KB Output isn't correct
26 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 49 ms 384 KB Output is correct
2 Correct 56 ms 380 KB Output is correct
3 Correct 54 ms 380 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 3 ms 340 KB Output is correct
6 Correct 9 ms 352 KB Output is correct
7 Correct 31 ms 400 KB Output is correct
8 Correct 55 ms 392 KB Output is correct
9 Correct 61 ms 340 KB Output is correct
10 Correct 54 ms 392 KB Output is correct
11 Correct 50 ms 524 KB Output is correct
12 Correct 27 ms 404 KB Output is correct
13 Correct 55 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 49 ms 384 KB Output is correct
2 Correct 56 ms 380 KB Output is correct
3 Correct 54 ms 380 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 3 ms 340 KB Output is correct
6 Correct 9 ms 352 KB Output is correct
7 Correct 31 ms 400 KB Output is correct
8 Correct 55 ms 392 KB Output is correct
9 Correct 61 ms 340 KB Output is correct
10 Correct 54 ms 392 KB Output is correct
11 Correct 50 ms 524 KB Output is correct
12 Correct 27 ms 404 KB Output is correct
13 Correct 55 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Execution timed out 1093 ms 8000 KB Time limit exceeded
16 Halted 0 ms 0 KB -