oj.uz

답안 #252297

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
252297 2020-07-25T07:30:45 Z Hehehe 정렬하기 (IOI15_sorting) C++14
100 / 100
 515 ms 21948 KB 
#include<bits/stdc++.h> //:3
using namespace std;
typedef long long ll;
#define all(a) (a).begin(), (a).end()
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define rc(s) return cout<<s,0
#define pi pair <int, int>
#define sz(x) (int)((x).size())
#include "sorting.h"

const int dx[] = {0, 1, 0, -1};
const int dy[] = {1, 0, -1, 0};

const ll H = 1e6 + 11;

//ifstream in(".in");
//ofstream out(".out");

int pos[H], n, m;
pi query[H], ans[H], a[H];

bool check(int t, int S[]){

    int in[n + 11], out[n + 11];

    for(int i = 0; i < n; i++){
        in[i] = out[i] = S[i];
    }

    for(int i = 0; i < t; i++){
        swap(out[query[i].ff], out[query[i].ss]);
    }

    bool viz[n + 11];
    memset(viz, 0, sizeof(viz));

    int k = 0;
    for(int i = 0; i < n; i++){

        if(viz[i])continue;

        vector<int>cur;

        int v = out[i];
        while(v != i){
            cur.push_back(v);
            v = out[v];
        }
        cur.push_back(v);

        for(int j = sz(cur) - 1; j > 0; j--){
            a[k++] = {cur[0], cur[j]};
        }

        for(auto it : cur)viz[it] = 1;
    }

    if(k > t)return 0;

    for (int i = 0; i < n; ++i){
        pos[in[i]] = i;
    }

    for(int i = 0; i < k; i++){

        //His move
        int x = query[i].ff, y = query[i].ss;
        swap(in[x], in[y]);
        pos[in[x]] = x;
        pos[in[y]] = y;

        //My move
        x = pos[a[i].ff], y = pos[a[i].ss];
        swap(in[x], in[y]);
        pos[in[x]] = x;
        pos[in[y]] = y;

        ans[i] = {x, y};
    }

    while(k < t)ans[k++] = {0, 0};

    return 1;

} 


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 < m; i++){
        query[i].ff = X[i];
        query[i].ss = Y[i];
    }
    
    int l = -1, r = M;
    while (r - l > 1) {
        int m = (l + r) >> 1;
        if (check(m, S)) {
            r = m;
        } else {
            l = m;
        }
    }
    check(r, S);


    for(int i = 0; i < r; i++){
        P[i] = ans[i].ff;
        Q[i] = ans[i].ss;
    }

    return r;
}

Compilation message

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:102:13: warning: declaration of 'm' shadows a global declaration [-Wshadow]
         int m = (l + r) >> 1;
             ^
sorting.cpp:22:16: note: shadowed declaration is here
 int pos[H], n, m;
                ^

Subtask #1
8.0 / 8.0

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

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct

Subtask #3
16.0 / 16.0

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

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 0 ms 384 KB Output is correct
17 Correct 0 ms 384 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 0 ms 384 KB Output is correct
21 Correct 2 ms 640 KB Output is correct
22 Correct 2 ms 640 KB Output is correct
23 Correct 2 ms 640 KB Output is correct
24 Correct 1 ms 640 KB Output is correct
25 Correct 1 ms 640 KB Output is correct
26 Correct 2 ms 640 KB Output is correct
27 Correct 1 ms 640 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 512 KB Output is correct
2 Correct 2 ms 512 KB Output is correct
3 Correct 2 ms 512 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 3 ms 512 KB Output is correct
7 Correct 3 ms 512 KB Output is correct
8 Correct 2 ms 512 KB Output is correct
9 Correct 2 ms 512 KB Output is correct
10 Correct 2 ms 512 KB Output is correct
11 Correct 2 ms 512 KB Output is correct
12 Correct 3 ms 512 KB Output is correct
13 Correct 2 ms 512 KB Output is correct
14 Correct 2 ms 512 KB Output is correct

Subtask #6
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 512 KB Output is correct
2 Correct 2 ms 512 KB Output is correct
3 Correct 2 ms 512 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 3 ms 512 KB Output is correct
7 Correct 3 ms 512 KB Output is correct
8 Correct 2 ms 512 KB Output is correct
9 Correct 2 ms 512 KB Output is correct
10 Correct 2 ms 512 KB Output is correct
11 Correct 2 ms 512 KB Output is correct
12 Correct 3 ms 512 KB Output is correct
13 Correct 2 ms 512 KB Output is correct
14 Correct 2 ms 512 KB Output is correct
15 Correct 273 ms 19576 KB Output is correct
16 Correct 318 ms 19316 KB Output is correct
17 Correct 327 ms 21260 KB Output is correct
18 Correct 229 ms 16344 KB Output is correct
19 Correct 515 ms 19264 KB Output is correct
20 Correct 359 ms 19384 KB Output is correct
21 Correct 320 ms 19568 KB Output is correct
22 Correct 272 ms 20824 KB Output is correct
23 Correct 303 ms 21948 KB Output is correct
24 Correct 371 ms 21748 KB Output is correct
25 Correct 361 ms 21272 KB Output is correct
26 Correct 330 ms 18552 KB Output is correct
27 Correct 374 ms 17656 KB Output is correct
28 Correct 361 ms 20376 KB Output is correct
29 Correct 381 ms 19704 KB Output is correct
30 Correct 289 ms 16760 KB Output is correct
31 Correct 401 ms 20088 KB Output is correct
32 Correct 341 ms 20912 KB Output is correct
33 Correct 352 ms 21456 KB Output is correct
34 Correct 330 ms 20600 KB Output is correct
35 Correct 328 ms 18428 KB Output is correct
36 Correct 207 ms 15352 KB Output is correct
37 Correct 346 ms 21376 KB Output is correct
38 Correct 330 ms 20520 KB Output is correct
39 Correct 346 ms 20528 KB Output is correct