제출 #727404

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
727404		vjudge1	정렬하기 (IOI15_sorting)	C++11	100 / 100	366 ms	27520 KiB

sorting

#include "sorting.h"

#include <bits/stdc++.h>
using namespace std;

int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
        auto solve = [&](int lim) {
                vector<int> a(M), b(M);
                for (int i = 0; i < N; i++) a[i] = S[i];
                for (int i = 0; i < lim; i++) swap(a[X[i]], a[Y[i]]);
                for (int i = 0; i < N; i++) b[a[i]] = i;
                vector<pair<int, int>> changes;
                for (int i = 0; i < N; i++) {
                        if (a[i] != i) {
                                changes.emplace_back(i, a[i]);
                                int pos = b[i];
                                swap(b[a[i]], b[a[pos]]);
                                swap(a[i], a[pos]);
                        }
                }
                if (changes.size() > lim) return 0;
                for (int i = 0; i < N; i++) a[i] = S[i];
                for (int i = 0; i < N; i++) b[a[i]] = i;
                for (int i = 0; i < changes.size(); i++) {
                        swap(b[a[X[i]]], b[a[Y[i]]]);
                        swap(a[X[i]], a[Y[i]]);
                        P[i] = b[changes[i].first];
                        Q[i] = b[changes[i].second];
                        swap(b[a[P[i]]], b[a[Q[i]]]);
                        swap(a[P[i]], a[Q[i]]);
                }
                return 1;
        };
        int l = 0, r = M, res = -1;
        while (l <= r) {
                if (solve(l + r >> 1)) {
                        res = l + r >> 1;
                        r = (l + r >> 1) - 1;
                } else {
                        l = (l + r >> 1) + 1;
                }
        }
        for (int i = 0; i < M; i++) P[i] = Q[i] = 0;
        assert(solve(res));
        return res;
}

컴파일 시 표준 에러 (stderr) 메시지

sorting.cpp: In lambda function:
sorting.cpp:21:36: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   21 |                 if (changes.size() > lim) return 0;
      |                     ~~~~~~~~~~~~~~~^~~~~
sorting.cpp:24:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   24 |                 for (int i = 0; i < changes.size(); i++) {
      |                                 ~~^~~~~~~~~~~~~~~~
sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:36:29: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   36 |                 if (solve(l + r >> 1)) {
      |                           ~~^~~
sorting.cpp:37:33: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   37 |                         res = l + r >> 1;
      |                               ~~^~~
sorting.cpp:38:32: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   38 |                         r = (l + r >> 1) - 1;
      |                              ~~^~~
sorting.cpp:40:32: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   40 |                         l = (l + r >> 1) + 1;
      |                              ~~^~~

• Subtask 1: 8 / 8
• Subtask 2: 12 / 12
• Subtask 3: 16 / 16
• Subtask 4: 18 / 18
• Subtask 5: 20 / 20
• Subtask 6: 26 / 26