제출 #314811

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

sorting

//#include "grader.cpp"
#include "sorting.h"
#include <bits/stdc++.h>
using namespace std;
#define pb(a) push_back(a)
const int N=2*1e5+5;
int n,s[N], x[N], y[N] ,pos[N], used[N];

vector<pair<int,int >> check(int m){
    vector<int> tmp(n);
    for(int i=0;i<n;i++) tmp[i]=s[i];
    for(int i=0;i<n;i++) swap(tmp[x[i]],tmp[y[i]]);
    for(int i=0;i<n;i++) pos[tmp[i]]=i;
    vector<pair<int,int>>swaps;
    for(int i=0;i<n;i++){
        if(tmp[i]==i) continue;
        swaps.push_back({tmp[i],i});
        swap(tmp[i],tmp[pos[i]]);
        swap(pos[tmp[i]], pos[tmp[pos[i]]]);
    }

    vector<pair<int,int>> ans;
    for(int i=0;i<n;i++) tmp[i] = s[i] ,pos[tmp[i]] = i;
    int i;

    for(i=0;i<swaps.size();i++){
        int a=pos[swaps[i].first], b=pos[swaps[i].second];
        ans.push_back({a,b});
        swap(tmp[x[i]],tmp[y[i]]);
        swap(pos[tmp[x[i]]], pos[tmp[y[i]]]);
        swap(tmp[a],tmp[b]);
        swap(pos[tmp[a]], pos[tmp[b]]);
    }
    for(; i<m;i++){
        ans.push_back({0, 0});
    }
    return ans;
}

int findSwapPairs(int N, int S[], int M, int X[], int Y[], int p[], int q[]) {
    n=N;
    for(int i=0;i<n;i++) s[i]=S[i];
    for(int i=0;i<M;i++) x[i]=X[i], y[i]= Y[i];

    int l=0,r=M;
    while(l<r) {
        int mid=(l+r)/2;
        if(check(mid).size() <= M) r=mid;
        else l=mid+1;
    }
    vector<pair<int,int>>ans = check(l);
    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 'std::vector<std::pair<int, int> > check(int)':
sorting.cpp:26:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 |     for(i=0;i<swaps.size();i++){
      |             ~^~~~~~~~~~~~~
sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:40:76: warning: declaration of 'N' shadows a global declaration [-Wshadow]
   40 | int findSwapPairs(int N, int S[], int M, int X[], int Y[], int p[], int q[]) {
      |                                                                            ^
sorting.cpp:6:11: note: shadowed declaration is here
    6 | const int N=2*1e5+5;
      |           ^
sorting.cpp:48:30: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   48 |         if(check(mid).size() <= M) r=mid;
      |            ~~~~~~~~~~~~~~~~~~^~~~
sorting.cpp:52:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   52 |     for(int i=0;i<ans.size();i++){
      |                 ~^~~~~~~~~~~
sorting.cpp:55:20: warning: conversion from 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} to 'int' may change value [-Wconversion]
   55 |     return ans.size();
      |            ~~~~~~~~^~

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