oj.uz

답안 #552874

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
552874 2022-04-24T08:47:54 Z elazarkoren 정렬하기 (IOI15_sorting) C++17
16 / 100
 14 ms 340 KB 
#include "sorting.h"
#include <bits/stdc++.h>
#define x first
#define y second
#define all(v) v.begin(), v.end()
#define chkmin(a, b) a = min(a, b)
#define chkmax(a, b) a = max(a, b)
//#define int ll
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
typedef vector<pii> vii;
typedef vector<bool> vb;

const int MAX_N = 2e5 + 5;

int x[MAX_N], y[MAX_N];
int n;

vi Compute(int i, vi s) {
    for (; i < n - 1; i++) swap(s[x[i]], s[y[i]]);
    return s;
}

int findSwapPairs(int N, int S[], int m, int X[], int Y[], int p[], int q[]) {
    n = N;
    vi s(n);
    for (int i = 0; i < n; i++) s[i] = S[i], x[i] = X[i], y[i] = Y[i];
    for (int i = 0; i < n - 1; i++) {
        swap(s[x[i]], s[y[i]]);
        vi s2 = Compute(i + 1, s);
        int v1, v2;
        for (int j = 0; j < n; j++) {
            if (s2[j] == i) {
                v1 = s2[i], v2 = s2[j];
            }
        }
        int ind1, ind2;
        for (ind1 = 0; s[ind1] != v1; ind1++);
        for (ind2 = 0; s[ind2] != v2; ind2++);
        p[i] = ind1, q[i] = ind2;
        swap(s[p[i]], s[q[i]]);
    }
//    for (int i = 0; i < n; i++) {
//        if (s[i] != i) cout << -1 << '\n';
//    }
    return n - 1;
}
//8
//3 5 6 2 1 7 0 4
//8
//0 1
//0 1
//0 1
//0 1
//0 1
//0 1
//0 1
//0 1

Compilation message

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:27:39: warning: unused parameter 'm' [-Wunused-parameter]
   27 | int findSwapPairs(int N, int S[], int m, int X[], int Y[], int p[], int q[]) {
      |                                   ~~~~^
sorting.cpp:42:32: warning: 'v2' may be used uninitialized in this function [-Wmaybe-uninitialized]
   42 |         for (ind2 = 0; s[ind2] != v2; ind2++);
sorting.cpp:41:32: warning: 'v1' may be used uninitialized in this function [-Wmaybe-uninitialized]
   41 |         for (ind1 = 0; s[ind1] != v1; ind1++);

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Incorrect 0 ms 212 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Incorrect 0 ms 212 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 212 KB Output is correct

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Incorrect 0 ms 212 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 14 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 14 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -