제출 #842623

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
842623	2023-09-03 06:25:57	WLZ	Choreography (IOI23_choreography)	C++17	100 / 100	97 ms	9300 KiB

choreography

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#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;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 7 / 7
• Subtask 2: 12 / 12
• Subtask 3: 10 / 10
• Subtask 4: 14 / 14
• Subtask 5: 28 / 28
• Subtask 6: 29 / 29