제출 #288420

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
288420	2020-09-01 13:29:54	Kastanda	정렬하기 (IOI15_sorting)	C++11	100 / 100	206 ms	17832 KiB

sorting

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
// M
#include<bits/stdc++.h>
#include "sorting.h"
using namespace std;
const int N = 200005 * 3;
int n, m, S[N], X[N], Y[N];
int A[N], M[N], Rev[N];
inline bool Solve(int md)
{
        for (int i = 0; i < n; i ++)
                A[i] = S[i], M[i] = 0;
        for (int i = 0; i < md; i ++)
                swap(A[X[i]], A[Y[i]]);
        int Cnt = 0;
        for (int i = 0; i < n; i ++)
                if (!M[i])
                {
                        int nw = i;
                        while (!M[nw])
                                M[nw] = 1, nw = A[nw];
                        Cnt ++;
                }
        Cnt = n - Cnt;
        return Cnt <= md;
}
int findSwapPairs(int _n, int _S[], int _m, int _X[], int _Y[], int P[], int Q[])
{
        n = _n; m = _m;
        for (int i = 0; i < n; i ++)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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

In file included from /usr/include/c++/9/cassert:44,
                 from /usr/include/x86_64-linux-gnu/c++/9/bits/stdc++.h:33,
                 from sorting.cpp:2:
sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:77:25: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   77 |         assert(E.size() <= ri);
      |                ~~~~~~~~~^~~~~

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