Submission #291540

#	Time	Username	Problem	Language	Result	Execution time	Memory
291540		MarcoMeijer	정렬하기 (IOI15_sorting)	C++14	20 / 100	9 ms	452 KiB

sorting

#include <bits/stdc++.h>

using namespace std;

#include "sorting.h"

//macros
typedef long long ll;
typedef pair<int, int> ii;
typedef pair<ll, ll> lll;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
typedef vector<lll> vlll;
#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define RE(a,c) REP(a,0,c)
#define RE1(a,c) REP(a,1,c+1)
#define REI(a,b,c) REP(a,b,c+1)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define INF 1e9
#define pb push_back
#define fi first
#define se second
#define sz size()

const int MX = 2e5+100;

int a[MX], sa[MX];

void swapA(int x, int y) {
    swap(a[x], a[y]);
    sa[a[x]] = x;
    sa[a[y]] = y;
}

int findSwapPairs(int n, int S[], int m, int X[], int Y[], int P[], int Q[]) {
    RE(i,n) a[i]=sa[i]=i;
    RE(i,n) {
        swapA(sa[X[i]], sa[Y[i]]);
    }

    int R = 0;
    RE(i,n) {
        bool sorted = 1;
        RE(i,n) if(S[i] != i) sorted = 0;
        if(sorted) break;

        R++;
        swapA(X[i], Y[i]);
        swap(S[X[i]], S[Y[i]]);

        int x=0, y=0; i--;
        while(x == y) {
            i++;
            if(i == n) break;    
            RE(j,n) if(S[j] == i) x = j;
            RE(j,n) if(a[j] == i) y = j;
        }

        swap(S[x], S[y]);

        P[R-1] = x;
        Q[R-1] = y;
    }
    return R;
}

Compilation message (stderr)

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:47:12: warning: declaration of 'i' shadows a previous local [-Wshadow]
   47 |         RE(i,n) if(S[i] != i) sorted = 0;
      |            ^
sorting.cpp:17:28: note: in definition of macro 'REP'
   17 | #define REP(a,b,c) for(int a=int(b); a<int(c); a++)
      |                            ^
sorting.cpp:47:9: note: in expansion of macro 'RE'
   47 |         RE(i,n) if(S[i] != i) sorted = 0;
      |         ^~
sorting.cpp:45:8: note: shadowed declaration is here
   45 |     RE(i,n) {
      |        ^
sorting.cpp:17:28: note: in definition of macro 'REP'
   17 | #define REP(a,b,c) for(int a=int(b); a<int(c); a++)
      |                            ^
sorting.cpp:45:5: note: in expansion of macro 'RE'
   45 |     RE(i,n) {
      |     ^~
sorting.cpp:38:39: warning: unused parameter 'm' [-Wunused-parameter]
   38 | int findSwapPairs(int n, int S[], int m, int X[], int Y[], int P[], int Q[]) {
      |                                   ~~~~^

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