oj.uz

답안 #1060104

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1060104 2024-08-15T10:40:04 Z steveonalex 정렬하기 (IOI15_sorting) C++17
74 / 100
 1000 ms 17140 KB 
#include <bits/stdc++.h>
#include "sorting.h"
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
#define block_of_code if(true)
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(a, b);}
ll lcm(ll a, ll b){return a / gcd(a, b) * b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }



int findSwapPairs(int n, int a[], int m, int x[], int y[], int p[], int q[]) {

    for(int r = 0; r <= m; ++r){
        vector<int> perm(n);
        for(int i = 0; i < n; ++i) perm[i] = a[i];

        for(int i = 0; i < r; ++i) swap(perm[x[i]], perm[y[i]]);

        vector<bool> visited(n);
        vector<pair<int,int>> swaps;
        for(int i = 0; i<n; ++i) if (!visited[i]) {
            int u = i;
            while(!visited[u]){
                visited[u] = true;
                if (!visited[perm[u]]) swaps.push_back({u, perm[u]});
                u = perm[u];
            }
        }


        if (swaps.size() <= r) {
            reverse(ALL(swaps));
            vector<int> pos(n);
            for(int i = 0; i<n; ++i) perm[i] = a[i];
            for(int i = 0; i<n; ++i) pos[perm[i]] = i;
            for(int i = 0; i < r; ++i){
                int u = x[i], v = y[i];
                swap(perm[u], perm[v]);
                swap(pos[perm[u]], pos[perm[v]]);
                if (swaps.size()){
                    u = pos[swaps.back().first], v = pos[swaps.back().second];
                    swaps.pop_back();
                }
                else u = v = 0;
                swap(perm[u], perm[v]);
                swap(pos[perm[u]], pos[perm[v]]);

                p[i] = u, q[i] = v;
            }

            return r;
        }
    }
}

// int main(void){
//     ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

//     clock_t start = clock();

//     int n; cin >> n;
//     int a[n];
//     for(int i = 0; i<n; ++i) cin >> a[i];

//     int m; cin >> m;
//     int x[m], y[m];
//     for(int i = 0; i<m; ++i) cin >> x[i] >> y[i];

//     int p[m], q[m];
//     memset(p, -1, sizeof p); memset(q, -1, sizeof q);

//     int r = findSwapPairs(n, a, m, x, y, p, q);
//     cout << r << "\n";
//     for(int i = 0; i < r; ++i) {
//         swap(a[x[i]], a[y[i]]);
//         swap(a[p[i]], a[q[i]]);
//         cout << p[i] << " " << q[i] << "\n"; 
//     }

//     for(int i = 0; i < n; ++i) cout << a[i] << " "; cout << "\n";

//     cerr << "Time elapsed: " << clock() - start << " ms\n";

//     return 0;
// }

/*
5
4 3 2 1 0
6
0 1
1 2
2 3
3 4
0 1
1 2

*/

Compilation message

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:73:26: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   73 |         if (swaps.size() <= r) {
      |             ~~~~~~~~~~~~~^~~~
sorting.cpp:96:1: warning: control reaches end of non-void function [-Wreturn-type]
   96 | }
      | ^

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 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 344 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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 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 344 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 1 ms 344 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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 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 344 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 1 ms 344 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 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 3 ms 604 KB Output is correct
22 Correct 3 ms 452 KB Output is correct
23 Correct 3 ms 604 KB Output is correct
24 Correct 2 ms 572 KB Output is correct
25 Correct 1 ms 600 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 2 ms 604 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 584 KB Output is correct
2 Correct 35 ms 592 KB Output is correct
3 Correct 31 ms 516 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 3 ms 348 KB Output is correct
7 Correct 10 ms 588 KB Output is correct
8 Correct 33 ms 592 KB Output is correct
9 Correct 34 ms 592 KB Output is correct
10 Correct 34 ms 596 KB Output is correct
11 Correct 27 ms 592 KB Output is correct
12 Correct 10 ms 604 KB Output is correct
13 Correct 24 ms 592 KB Output is correct
14 Correct 1 ms 344 KB Output is correct

Subtask #6
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 584 KB Output is correct
2 Correct 35 ms 592 KB Output is correct
3 Correct 31 ms 516 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 3 ms 348 KB Output is correct
7 Correct 10 ms 588 KB Output is correct
8 Correct 33 ms 592 KB Output is correct
9 Correct 34 ms 592 KB Output is correct
10 Correct 34 ms 596 KB Output is correct
11 Correct 27 ms 592 KB Output is correct
12 Correct 10 ms 604 KB Output is correct
13 Correct 24 ms 592 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Execution timed out 1010 ms 17140 KB Time limit exceeded
16 Halted 0 ms 0 KB -