oj.uz

답안 #552907

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
552907 2022-04-24T09:36:58 Z elazarkoren 정렬하기 (IOI15_sorting) C++17
74 / 100
 1000 ms 15672 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;

int cnt;

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

bool Ok(int N, int S[], int m, int X[], int Y[], int p[], int q[]) {
    cnt = m;
    vi s(n);
    for (int i = 0; i < n; i++) s[i] = S[i], x[i] = X[i], y[i] = Y[i];
    int index = 0;
    for (int i = 0; i < cnt; i++) {
        swap(s[x[i]], s[y[i]]);
        vi s2 = Compute(i + 1, s);
        int v1 = 0, v2 = 0;
        for (; index < n; index++) {
            if (s2[index] == index) continue;
            for (int j = index + 1; j < n; j++) {
                if (s2[j] == index) {
                    v1 = s2[index], v2 = s2[j];
                }
            }
            index++;
            break;
        }
        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]]);
    }
    return is_sorted(all(s));
}

int findSwapPairs(int N, int S[], int m, int X[], int Y[], int p[], int q[]) {
    n = N;
    int begin = 0, end = n - 1, mid;
    while (begin < end) {
        mid = (begin + end) >> 1;
        if (Ok(N, S, mid, X, Y, p, q)) {
            end = mid;
        } else begin = mid + 1;
    }
    Ok(N, S, end, X, Y, p, q);
    return end;
}
//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 'bool Ok(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:29:13: warning: unused parameter 'N' [-Wunused-parameter]
   29 | bool Ok(int N, int S[], int m, int X[], int Y[], int p[], int q[]) {
      |         ~~~~^
sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:57:39: warning: unused parameter 'm' [-Wunused-parameter]
   57 | int findSwapPairs(int N, int S[], int m, int X[], int Y[], int p[], int q[]) {
      |                                   ~~~~^

Subtask #1
8.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 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct

Subtask #2
12.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 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct

Subtask #3
16.0 / 16.0

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

Subtask #4
18.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 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 6 ms 340 KB Output is correct
22 Correct 7 ms 452 KB Output is correct
23 Correct 8 ms 340 KB Output is correct
24 Correct 6 ms 340 KB Output is correct
25 Correct 2 ms 340 KB Output is correct
26 Correct 4 ms 440 KB Output is correct
27 Correct 7 ms 444 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 102 ms 404 KB Output is correct
2 Correct 133 ms 468 KB Output is correct
3 Correct 113 ms 452 KB Output is correct
4 Correct 8 ms 464 KB Output is correct
5 Correct 9 ms 448 KB Output is correct
6 Correct 16 ms 448 KB Output is correct
7 Correct 53 ms 380 KB Output is correct
8 Correct 105 ms 464 KB Output is correct
9 Correct 106 ms 468 KB Output is correct
10 Correct 109 ms 444 KB Output is correct
11 Correct 96 ms 468 KB Output is correct
12 Correct 54 ms 468 KB Output is correct
13 Correct 109 ms 464 KB Output is correct
14 Correct 4 ms 468 KB Output is correct

Subtask #6
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 102 ms 404 KB Output is correct
2 Correct 133 ms 468 KB Output is correct
3 Correct 113 ms 452 KB Output is correct
4 Correct 8 ms 464 KB Output is correct
5 Correct 9 ms 448 KB Output is correct
6 Correct 16 ms 448 KB Output is correct
7 Correct 53 ms 380 KB Output is correct
8 Correct 105 ms 464 KB Output is correct
9 Correct 106 ms 468 KB Output is correct
10 Correct 109 ms 444 KB Output is correct
11 Correct 96 ms 468 KB Output is correct
12 Correct 54 ms 468 KB Output is correct
13 Correct 109 ms 464 KB Output is correct
14 Correct 4 ms 468 KB Output is correct
15 Execution timed out 1042 ms 15672 KB Time limit exceeded
16 Halted 0 ms 0 KB -