oj.uz

Submission #567907

# Submission time Handle Problem Language Result Execution time Memory
567907 2022-05-24T10:23:01 Z hoanghq2004 Sorting (IOI15_sorting) C++14
100 / 100
 189 ms 16100 KB 
#include <bits/stdc++.h>
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include "sorting.h"

using namespace __gnu_pbds;
using namespace std;

template <typename T>
using ordered_set = tree <T, null_type, less <T>, rb_tree_tag, tree_order_statistics_node_update>;


int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
    int L = 0, R = M;
    auto check = [&](int mid) {
        vector <int> p(N);
        for (int i = 0; i < N; ++i) p[i] = S[i];
        for (int i = 0; i < mid; ++i) swap(p[X[i]], p[Y[i]]);
        int comp = 0;
        vector <int> vis(N, 0);
        for (int u = 0; u < N; ++u) {
            if (vis[u]) continue;
            ++comp;
            int v = u;
            do {
                vis[v] = 1;
                v = p[v];
            } while (u != v);
        }
        return (N - comp <= mid);
    };
    while (L < R) {
        int mid = L + R >> 1;
        if (check(mid)) R = mid;
        else L = mid + 1;
    }

    vector <int> pos(N);
    for (int i = 0; i < L; ++i) swap(S[X[i]], S[Y[i]]);
    vector <int> vis(N, 0);
    vector <pair <int, int>> need;
    for (int u = 0; u < N; ++u) {
        if (vis[u]) continue;
        int v = u;
        do {
            if (S[v] != u) need.push_back({v, S[v]});
            vis[v] = 1;
            v = S[v];
        } while (u != v);
    }
    for (int i = L - 1; i >= 0; --i) swap(S[X[i]], S[Y[i]]);
    while (need.size() < L) need.push_back({0, 0});
    for (int i = 0; i < N; ++i) pos[S[i]] = i;
    for (int i = 0; i < L; ++i) {
        swap(pos[S[X[i]]], pos[S[Y[i]]]);
        swap(S[X[i]], S[Y[i]]);
        auto &[u, v] = need[i];
        u = pos[u], v = pos[v];
        P[i] = u, Q[i] = v;
        swap(pos[S[u]], pos[S[v]]);
        swap(S[u], S[v]);
    }
    return L;
}


//static char _buffer[1024];
//static int _currentChar = 0;
//static int _charsNumber = 0;
//static FILE *_inputFile, *_outputFile;
//
//static inline int _read() {
//    if (_charsNumber < 0) {
//        exit(1);
//    }
//    if (!_charsNumber || _currentChar == _charsNumber) {
//        _charsNumber = (int)fread(_buffer, sizeof(_buffer[0]), sizeof(_buffer), _inputFile);
//        _currentChar = 0;
//    }
//    if (_charsNumber <= 0) {
//        return -1;
//    }
//    return _buffer[_currentChar++];
//}
//
//static inline int _readInt() {
//    int c, x, s;
//    c = _read();
//    while (c <= 32) c = _read();
//    x = 0;
//    s = 1;
//    if (c == '-') {
//        s = -1;
//        c = _read();
//    }
//    while (c > 32) {
//        x *= 10;
//        x += c - '0';
//        c = _read();
//    }
//    if (s < 0) x = -x;
//    return x;
//}
//
//
//int main()
//{
//	_inputFile = fopen("sorting.in", "rb");
//	_outputFile = fopen("sorting.out", "w");
//	int N, M;
//	N = _readInt();
//	int *S = (int*)malloc(sizeof(int) * (unsigned int)N);
//	for (int i = 0; i < N; ++i)
//		S[i] = _readInt();
//	M = _readInt();
//	int *X = (int*)malloc(sizeof(int) * (unsigned int)M), *Y = (int*)malloc(sizeof(int) * (unsigned int)M);
//	for (int i = 0; i < M; ++i) {
//	    X[i] = _readInt();
//	    Y[i] = _readInt();
//	}
//	int *P = (int*)malloc(sizeof(int) * (unsigned int)M), *Q = (int*)malloc(sizeof(int) * (unsigned int)M);
//	int ans = findSwapPairs(N, S, M, X, Y, P, Q);
//	fprintf(_outputFile, "%d\n", ans);
//	for (int i = 0; i < ans; ++i)
//		fprintf(_outputFile, "%d %d\n", P[i], Q[i]);
//	return 0;
//}
//

Compilation message

sorting.cpp:2: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    2 | #pragma GCC optimization ("O3")
      | 
sorting.cpp:3: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    3 | #pragma GCC optimization ("unroll-loops")
      | 
sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:35:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   35 |         int mid = L + R >> 1;
      |                   ~~^~~
sorting.cpp:54:24: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   54 |     while (need.size() < L) need.push_back({0, 0});
      |            ~~~~~~~~~~~~^~~
sorting.cpp:59:15: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   59 |         auto &[u, v] = need[i];
      |               ^

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 300 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 304 KB Output is correct
7 Correct 1 ms 212 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 300 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 304 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 304 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 308 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 1 ms 304 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 300 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
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 300 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 304 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 304 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 308 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 304 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 300 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 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 2 ms 432 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 2 ms 468 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 1 ms 440 KB Output is correct
27 Correct 2 ms 440 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 440 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 440 KB Output is correct
4 Correct 1 ms 312 KB Output is correct
5 Correct 1 ms 376 KB Output is correct
6 Correct 1 ms 440 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 2 ms 468 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 2 ms 468 KB Output is correct
13 Correct 2 ms 468 KB Output is correct
14 Correct 1 ms 440 KB Output is correct

Subtask #6
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 440 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 440 KB Output is correct
4 Correct 1 ms 312 KB Output is correct
5 Correct 1 ms 376 KB Output is correct
6 Correct 1 ms 440 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 2 ms 468 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 2 ms 468 KB Output is correct
13 Correct 2 ms 468 KB Output is correct
14 Correct 1 ms 440 KB Output is correct
15 Correct 139 ms 13240 KB Output is correct
16 Correct 177 ms 15488 KB Output is correct
17 Correct 182 ms 15692 KB Output is correct
18 Correct 68 ms 10508 KB Output is correct
19 Correct 136 ms 13752 KB Output is correct
20 Correct 169 ms 14280 KB Output is correct
21 Correct 146 ms 14212 KB Output is correct
22 Correct 135 ms 15540 KB Output is correct
23 Correct 179 ms 16100 KB Output is correct
24 Correct 169 ms 15872 KB Output is correct
25 Correct 173 ms 15784 KB Output is correct
26 Correct 154 ms 14336 KB Output is correct
27 Correct 136 ms 13752 KB Output is correct
28 Correct 164 ms 15736 KB Output is correct
29 Correct 161 ms 15364 KB Output is correct
30 Correct 109 ms 12980 KB Output is correct
31 Correct 176 ms 15508 KB Output is correct
32 Correct 174 ms 15612 KB Output is correct
33 Correct 189 ms 15948 KB Output is correct
34 Correct 171 ms 15932 KB Output is correct
35 Correct 148 ms 13748 KB Output is correct
36 Correct 58 ms 11108 KB Output is correct
37 Correct 170 ms 15732 KB Output is correct
38 Correct 166 ms 15820 KB Output is correct
39 Correct 165 ms 15352 KB Output is correct