제출 #1075166

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

sorting

#include "sorting.h"
#include<bits/stdc++.h>
using namespace std;
vector<pair<int, int>> ans, xy, swaps;
bool check(vector<int> p, int x, int n) {
    int s = 0;
    for (int i = 0; i < x; i++) {
        swap(p[xy[i].first], p[xy[i].second]);
    }
    for (int i = 0; i < n; i++) {
        if (p[i] == i) {
            continue;
        }
        while(p[i] != i) {
            int j = p[i];
            swaps.push_back({i, j});
            swap(p[i], p[j]);
            s++;
        }
    }
    return s <= x;
}
int findSwapPairs(int n, int A[], int M, int X[], int Y[], int P[], int Q[]) {
    vector<pair<int, int>> ans;
    vector<int> p(n);
    for (int i = 0; i < n; i++) {
        p[i] = A[i];
    }
    for (int i = 0; i < M; i++) {
        xy.push_back({X[i], Y[i]});
    }
    check(p, M, n);
    ans = swaps;
    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:24:28: warning: declaration of 'ans' shadows a global declaration [-Wshadow]
   24 |     vector<pair<int, int>> ans;
      |                            ^~~
sorting.cpp:4:24: note: shadowed declaration is here
    4 | vector<pair<int, int>> ans, xy, swaps;
      |                        ^~~
sorting.cpp:34: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]
   34 |     for (int i = 0; i < ans.size(); i++) {
      |                     ~~^~~~~~~~~~~~
sorting.cpp:38:20: warning: conversion from 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} to 'int' may change value [-Wconversion]
   38 |     return ans.size();
      |            ~~~~~~~~^~

• 서브태스크 1: 8 / 8
• 서브태스크 2: 12 / 12
• 서브태스크 3: 0 / 16
• 서브태스크 4: 0 / 18
• 서브태스크 5: 0 / 20
• 서브태스크 6: 0 / 26