제출 #385074

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
385074		qpwoeirut	정렬하기 (IOI15_sorting)	C++17	20 / 100	2 ms	620 KiB

sorting

#include "sorting.h"
#include <algorithm>
#include <cassert>
#include <iostream>

using namespace std;

#define val first
#define idx second

typedef pair<int,int> pii;

const int MN = 200005;

pii A[MN];

int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
    //cin >> N; for (int i=0; i<N; ++i) cin >> S[i];

    if (is_sorted(S, S+N)) return 0;
    int K = 0;

    if (X[0] == 0 && Y[0] == 0) {
        for (int i=0; i<N; ++i) {
            int idx = min_element(S+i, S+N) - S;
            assert(i <= idx && idx < N);
            if (idx == i) continue;
            P[K] = i;
            Q[K] = idx;
            ++K;
            swap(S[i], S[idx]);
        }
    } else if (X[0] == 0 && Y[0] == 1) {
        for (int i=2; i<N; ++i) {
            int idx = min_element(S+i, S+N) - S;
            assert(i <= idx && idx < N);
            if (idx == i) continue;
            swap(S[0], S[1]);
            //for (int j=0; j<N; ++j) { cerr << S[j] << ' '; } cerr << endl;

            P[K] = i;
            Q[K] = idx;
            ++K;
            swap(S[i], S[idx]);
            //for (int j=0; j<N; ++j) { cerr << S[j] << ' '; } cerr << endl;
        }
        while (N > 2 && S[0] + S[1] > 1) {
            swap(S[0], S[1]);
            //for (int j=0; j<N; ++j) { cerr << S[j] << ' '; } cerr << endl;

            if (S[0] < S[1]) {
                P[K] = 1;
                swap(S[1], S[2]);
            } else {
                P[K] = 0;
                swap(S[0], S[2]);
            }
            Q[K] = 2;
            ++K;
            //for (int j=0; j<N; ++j) { cerr << S[j] << ' '; } cerr << endl;

            for (int i=2; i+1<N; ++i) {
                if (S[i] > S[i+1]) {
                    swap(S[0], S[1]);
                    //for (int j=0; j<N; ++j) { cerr << S[j] << ' '; } cerr << endl;

                    swap(S[i], S[i+1]);
                    P[K] = i;
                    Q[K] = i+1;
                    ++K;
                    //for (int j=0; j<N; ++j) { cerr << S[j] << ' '; } cerr << endl;
                } else break;
            }
        }

        if (S[0] == 1) {
            assert(S[1] == 0);
            swap(S[0], S[1]);
            //for (int j=0; j<N; ++j) { cerr << S[j] << ' '; } cerr << endl;

            P[K] = 0;
            Q[K] = 0;
            ++K;
            //for (int j=0; j<N; ++j) { cerr << S[j] << ' '; } cerr << endl;
        }
    } else assert(0);

    //for (int i=0; i<N; ++i) { cerr << S[i] << ' '; } cerr << endl;
    assert(is_sorted(S, S+N));

    assert(K <= M);
    //cout << K << endl; for (int i=0; i<K; ++i) { cout << P[i] << ' ' << Q[i] << '\n'; }
    return K;
}

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

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:25:45: warning: conversion from 'long int' to 'int' may change value [-Wconversion]
   25 |             int idx = min_element(S+i, S+N) - S;
      |                       ~~~~~~~~~~~~~~~~~~~~~~^~~
sorting.cpp:35:45: warning: conversion from 'long int' to 'int' may change value [-Wconversion]
   35 |             int idx = min_element(S+i, S+N) - S;
      |                       ~~~~~~~~~~~~~~~~~~~~~~^~~

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