oj.uz

답안 #842623

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
842623 2023-09-03T06:25:57 Z WLZ Choreography (IOI23_choreography) C++17
100 / 100
 97 ms 9300 KB 
#include "choreography.h"
#include <bits/stdc++.h>
using namespace std;

int n, cur;
vector< vector<int> > p, shift_p, add_p;
vector<int> add;

void init(int N, std::vector<int> P) {
    n = N; cur = 0;
    p = {P, vector<int>(n)};
    add = {0, 0};
    add_p = shift_p = {{0, 0}, {0, 0}};
    for (int i = 0; i < n; i++) p[1][p[0][i]] = i;
    return;
} 

void move_right(int K) {
    if (shift_p[cur][0] % 2 == 0) {
        shift_p[cur][0] = (shift_p[cur][0] + K) % n;
        shift_p[cur][1] = (shift_p[cur][1] + K) % n;    
    } else {
        int a = shift_p[cur][0], b = shift_p[cur][1];
        shift_p[cur][0] = (a + K) % n;
        shift_p[cur][1] = (b + K) % n;
    }
    
    //shift[cur] = (shift[cur] + K) % n;
    add[!cur] = (add[!cur] + K) % n;
    return;
}

void move_left(int K) {
    if (shift_p[cur][0] % 2 == 0) {
        shift_p[cur][0] = ((shift_p[cur][0] - K) % n + n) % n;
        shift_p[cur][1] = ((shift_p[cur][1] - K) % n + n) % n;
    } else {
        int a = shift_p[cur][0], b = shift_p[cur][1];
        shift_p[cur][0] = ((a - K) % n + n) % n;
        shift_p[cur][1] = ((b - K) % n + n) % n;
    }
    add[!cur] = ((add[!cur] - K) % n + n) % n;
    return;
}

void swap_places() {
    //int x = (shift_p[cur][0]) % n;
    if (shift_p[cur][0] % 2 == 0) {
        int a = shift_p[cur][0], b = shift_p[cur][1];
        shift_p[cur][0] = ((a + 1) % n + n) % n;
        shift_p[cur][1] = ((b - 1) % n + n) % n;
    } else {
        int a = shift_p[cur][0], b = shift_p[cur][1];
        shift_p[cur][0] = ((a - 1) % n + n) % n;
        shift_p[cur][1] = ((b + 1) % n + n) % n;
    }
    
    //if (shift_p[cur][0] % 2 == 0) {
        //shift_p[cur][0] = (shift_p[cur][0] + 1) % n;
        //shift_p[cur][1] = ((shift_p[cur][1] - 1) % n + n) % n;    
    //} else {
        //shift_p[cur][1] = (shift_p[cur][1] + 1) % n;
        //shift_p[cur][0] = ((shift_p[cur][0] - 1) % n + n) % n;
    //}
    int x = (add_p[!cur][0] + add[!cur]) % n;
    if (x % 2 == 0) {
        add_p[!cur][0] = (add_p[!cur][0] + 1) % n;
        add_p[!cur][1] = ((add_p[!cur][1] - 1) % n + n) % n;
    } else {
        add_p[!cur][1] = (add_p[!cur][1] + 1) % n;
        add_p[!cur][0] = ((add_p[!cur][0] - 1) % n + n) % n;
    }
    return;
}    

void move_around() {
    cur = !cur;
    return;
}

int get_position(int i) {
    if ((shift_p[!cur][i % 2]) % 2 == 0) {
        i = ((i - shift_p[!cur][i % 2]) % n + n) % n;
//        i = ((i - shift[!cur]) % n + n) % n;    
    } else {
        i = ((i - shift_p[!cur][1 - (i % 2)]) % n + n) % n;
        //i = ((i - shift[!cur]) % n + n) % n;    
    }
    int ans = p[!cur][i];
    ans = (ans + add_p[!cur][ans % 2]) % n;
    ans = (ans + add[!cur]) % n;
    return ans;
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 69 ms 9228 KB Output is correct
2 Correct 84 ms 9144 KB Output is correct
3 Correct 97 ms 9276 KB Output is correct
4 Correct 70 ms 9300 KB Output is correct
5 Correct 47 ms 6704 KB Output is correct
6 Correct 47 ms 6588 KB Output is correct

Subtask #2
12.0 / 12.0

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

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 65 ms 8752 KB Output is correct
2 Correct 60 ms 8752 KB Output is correct
3 Correct 58 ms 8592 KB Output is correct
4 Correct 40 ms 6076 KB Output is correct
5 Correct 40 ms 6164 KB Output is correct
6 Correct 38 ms 5996 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 65 ms 8752 KB Output is correct
2 Correct 60 ms 8752 KB Output is correct
3 Correct 58 ms 8592 KB Output is correct
4 Correct 40 ms 6076 KB Output is correct
5 Correct 40 ms 6164 KB Output is correct
6 Correct 38 ms 5996 KB Output is correct
7 Correct 63 ms 8628 KB Output is correct
8 Correct 72 ms 8584 KB Output is correct
9 Correct 62 ms 8652 KB Output is correct
10 Correct 37 ms 6076 KB Output is correct
11 Correct 37 ms 6076 KB Output is correct
12 Correct 38 ms 6080 KB Output is correct

Subtask #5
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 69 ms 9228 KB Output is correct
2 Correct 84 ms 9144 KB Output is correct
3 Correct 97 ms 9276 KB Output is correct
4 Correct 70 ms 9300 KB Output is correct
5 Correct 47 ms 6704 KB Output is correct
6 Correct 47 ms 6588 KB Output is correct
7 Correct 65 ms 8752 KB Output is correct
8 Correct 60 ms 8752 KB Output is correct
9 Correct 58 ms 8592 KB Output is correct
10 Correct 40 ms 6076 KB Output is correct
11 Correct 40 ms 6164 KB Output is correct
12 Correct 38 ms 5996 KB Output is correct
13 Correct 65 ms 9012 KB Output is correct
14 Correct 69 ms 9016 KB Output is correct
15 Correct 80 ms 8984 KB Output is correct
16 Correct 43 ms 6588 KB Output is correct
17 Correct 42 ms 6580 KB Output is correct
18 Correct 46 ms 6380 KB Output is correct

Subtask #6
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 69 ms 9228 KB Output is correct
2 Correct 84 ms 9144 KB Output is correct
3 Correct 97 ms 9276 KB Output is correct
4 Correct 70 ms 9300 KB Output is correct
5 Correct 47 ms 6704 KB Output is correct
6 Correct 47 ms 6588 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 3 ms 1116 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 3 ms 1116 KB Output is correct
13 Correct 65 ms 8752 KB Output is correct
14 Correct 60 ms 8752 KB Output is correct
15 Correct 58 ms 8592 KB Output is correct
16 Correct 40 ms 6076 KB Output is correct
17 Correct 40 ms 6164 KB Output is correct
18 Correct 38 ms 5996 KB Output is correct
19 Correct 63 ms 8628 KB Output is correct
20 Correct 72 ms 8584 KB Output is correct
21 Correct 62 ms 8652 KB Output is correct
22 Correct 37 ms 6076 KB Output is correct
23 Correct 37 ms 6076 KB Output is correct
24 Correct 38 ms 6080 KB Output is correct
25 Correct 65 ms 9012 KB Output is correct
26 Correct 69 ms 9016 KB Output is correct
27 Correct 80 ms 8984 KB Output is correct
28 Correct 43 ms 6588 KB Output is correct
29 Correct 42 ms 6580 KB Output is correct
30 Correct 46 ms 6380 KB Output is correct
31 Correct 80 ms 9012 KB Output is correct
32 Correct 70 ms 8880 KB Output is correct
33 Correct 67 ms 8856 KB Output is correct
34 Correct 42 ms 6312 KB Output is correct
35 Correct 45 ms 6264 KB Output is correct
36 Correct 43 ms 6276 KB Output is correct