제출 #317884

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
317884		wildturtle	정렬하기 (IOI15_sorting)	C++14	0 / 100	1 ms	640 KiB

sorting

#include <bits/stdc++.h>
#include "sorting.h"
using namespace std;
int le,ri,ans,mid;
vector <int> S1,A;
vector < pair < int , int > > v;
int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
    le=0; ri=M; ans=-1;
    while(le<=ri) {
        mid=(le+ri)/2;
        for(int i=0;i<N;i++)
        S1[i]=S[i];
        for(int i=0;i<mid;i++) {
            swap(S1[X[i]],S1[Y[i]]);
        }
        for(int i=0;i<N;i++) {
            A[S1[i]]=i;
        }
        v.clear();
        for(int i=0;i<N;i++) {
            if(S1[i]==i) continue;
            v.push_back({i,S1[i]});
        }
        if(v.size()<=mid) {
            for(int i=0;i<N;i++) {
                S1[i]=S[i];
                A[S1[i]]=i;
            }
            for(int i=0;i<M;i++) {
                swap(A[S1[X[i]]],A[S1[Y[i]]]);
                swap(S1[X[i]],S1[Y[i]]);
                if(i<v.size()) {
                    P[i]=A[v[i].first];
                    Q[i]=A[v[i].second];
                    swap(A[S1[P[i]]],A[S1[Q[i]]]);
                    swap(S1[P[i]],S1[Q[i]]);                    
                }
                else { P[i]=0; Q[i]=0; }
            }
            ri=mid-1;
            ans=mid;
        }
        else le=mid+1;
    }
    return ans;
}

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

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:24:20: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   24 |         if(v.size()<=mid) {
      |            ~~~~~~~~^~~~~
sorting.cpp:32:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   32 |                 if(i<v.size()) {
      |                    ~^~~~~~~~~

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