제출 #1075125

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1075125		ArthuroWich	Sorting (IOI15_sorting)	C++17	0 / 100	3 ms	1664 KiB

sorting

#include "sorting.h"
#include<bits/stdc++.h>
using namespace std;
int findSwapPairs(int n, int p[], int M, int X[], int Y[], int P[], int Q[]) {
    vector<pair<int, int>> ans;
    int d = 0;
    for (int i = n-1; i >= 0; i++) {
        if (p[i] == i) {
            continue;
        }
        while(p[i] != i) {
            int j = p[i];
            ans.push_back({i, j});
            swap(p[i], p[j]);
            if (is_sorted(p, p+n)) {
                break;
            }
            swap(X[d], Y[d]);
            d++;
        }
    }
    for (int i = 0; i < ans.size(); i++) {
        P[i] = ans[i].first;
        Q[i] = ans[i].second;
    }
    return ans.size();
}

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

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:22:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   22 |     for (int i = 0; i < ans.size(); i++) {
      |                     ~~^~~~~~~~~~~~
sorting.cpp:26:20: warning: conversion from 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} to 'int' may change value [-Wconversion]
   26 |     return ans.size();
      |            ~~~~~~~~^~
sorting.cpp:4:39: warning: unused parameter 'M' [-Wunused-parameter]
    4 | int findSwapPairs(int n, int p[], int M, int X[], int Y[], int P[], int Q[]) {
      |                                   ~~~~^

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