oj.uz

Submission #847672

# Submission time Handle Problem Language Result Execution time Memory
847672 2023-09-10T06:31:52 Z heavylightdecomp Choreography (IOI23_choreography) C++17
59 / 100
 69 ms 6368 KB 
#include<bits/stdc++.h>
using namespace std;
const long long maxn = 1e5+5;
long long N;
struct row {
    vector<int> ar;
    int ch, ech;
    friend void swap(row &a, row &b) {
        a.ar.swap(b.ar);
        swap(a.ch, b.ch);
        swap(a.ech, b.ech);
    }
};
row x,y;
void init(int n, vector<int> p) {
    N = n;
    x.ar = vector<int>(N);
    y.ar = vector<int>(N);
    for(int i = 0; i < N; i++) {
        x.ar[i] = p[i]; // x to y
        y.ar[p[i]] = i; // y to x
    }
}
int fix(long long c) {
    c += maxn * N;
    return c % N;

}
void move_right(int K) {
    x.ch += K;
}
void move_left(int K) {
    x.ch -= K;
}
void swap_places() {
    x.ech += (x.ech + x.ch % 2) ? -1 : 1;
}
void move_around() {
    swap(x,y);
}

int get_position(int D) {
    /*
    Careful! 
    x[i] represents p[i+s mod N]
    x[i-s mod N] represents p[i], the intended value
    same for y
    */
    int ce = fix(D - y.ch - y.ech);
    int co = fix(D - y.ch + y.ech);
    int yp = -1;
    if(ce % 2 == 0) {
        yp = ce;
    } else {
        yp = co;
    }
    return fix(y.ar[yp] + x.ch + ((y.ar[yp] % 2) ? -x.ech : x.ech));  
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 6352 KB Output is correct
2 Correct 68 ms 6348 KB Output is correct
3 Correct 67 ms 6352 KB Output is correct
4 Correct 69 ms 6264 KB Output is correct
5 Correct 42 ms 4552 KB Output is correct
6 Correct 42 ms 4548 KB Output is correct

Subtask #2
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB 37th lines differ - on the 1st token, expected: '17', found: '15'
2 Halted 0 ms 0 KB -

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 60 ms 6368 KB Output is correct
2 Correct 58 ms 6340 KB Output is correct
3 Correct 62 ms 6340 KB Output is correct
4 Correct 38 ms 4548 KB Output is correct
5 Correct 35 ms 4548 KB Output is correct
6 Correct 36 ms 4548 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 60 ms 6368 KB Output is correct
2 Correct 58 ms 6340 KB Output is correct
3 Correct 62 ms 6340 KB Output is correct
4 Correct 38 ms 4548 KB Output is correct
5 Correct 35 ms 4548 KB Output is correct
6 Correct 36 ms 4548 KB Output is correct
7 Correct 65 ms 6188 KB Output is correct
8 Correct 59 ms 6344 KB Output is correct
9 Correct 59 ms 6340 KB Output is correct
10 Correct 36 ms 4552 KB Output is correct
11 Correct 37 ms 4552 KB Output is correct
12 Correct 36 ms 4552 KB Output is correct

Subtask #5
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 6352 KB Output is correct
2 Correct 68 ms 6348 KB Output is correct
3 Correct 67 ms 6352 KB Output is correct
4 Correct 69 ms 6264 KB Output is correct
5 Correct 42 ms 4552 KB Output is correct
6 Correct 42 ms 4548 KB Output is correct
7 Correct 60 ms 6368 KB Output is correct
8 Correct 58 ms 6340 KB Output is correct
9 Correct 62 ms 6340 KB Output is correct
10 Correct 38 ms 4548 KB Output is correct
11 Correct 35 ms 4548 KB Output is correct
12 Correct 36 ms 4548 KB Output is correct
13 Correct 64 ms 6340 KB Output is correct
14 Correct 64 ms 6344 KB Output is correct
15 Correct 63 ms 6340 KB Output is correct
16 Correct 41 ms 4548 KB Output is correct
17 Correct 40 ms 4540 KB Output is correct
18 Correct 42 ms 4548 KB Output is correct

Subtask #6
0.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 6352 KB Output is correct
2 Correct 68 ms 6348 KB Output is correct
3 Correct 67 ms 6352 KB Output is correct
4 Correct 69 ms 6264 KB Output is correct
5 Correct 42 ms 4552 KB Output is correct
6 Correct 42 ms 4548 KB Output is correct
7 Incorrect 1 ms 344 KB 37th lines differ - on the 1st token, expected: '17', found: '15'
8 Halted 0 ms 0 KB -