oj.uz

Submission #1033252

# Submission time Handle Problem Language Result Execution time Memory
1033252 2024-07-24T15:09:22 Z GrindMachine Choreography (IOI23_choreography) C++17
100 / 100
 63 ms 9404 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#endif

/*

already knew the key solution idea

*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

#include "choreography.h"

vector<array<int,2>> a;
int j;
int n;
vector<int> p,q;
int ip[2][2], fp[2][2];

void init(int n_, std::vector<int> p_) {
    n = n_;
    p = p_;
    q = vector<int>(n);
    rep(i,n) q[p[i]] = i;
    rep(i,n) a.pb({i,p[i]});
    j = 0;
} 

void move_right(int k) {
    rep(x,2){
        ip[j][x] += k;
        ip[j][x] %= n;
    }

    int ofp[2][2];
    rep(x,2) rep(y,2) ofp[x][y] = fp[x][y];

    rep(x,2){
        int prev_parity = (x-k);
        prev_parity &= 1;
        fp[j][x] = ofp[j][prev_parity]-k;
        fp[j][x] = (fp[j][x]%n+n)%n;
    }
}

void move_left(int k) {
    move_right(n-k);
}

void swap_places() {
    rep(x,2){
        if((x+ip[j][x])&1) ip[j][x]--;
        else ip[j][x]++;
        ip[j][x] = (ip[j][x]%n+n)%n;
    }

    int ofp[2][2];
    rep(x,2) rep(y,2) ofp[x][y] = fp[x][y];

    rep(x,2){
        int add = 1;
        if(x) add = -1;
        fp[j][x] = ofp[j][x^1]+add;
        fp[j][x] = (fp[j][x]%n+n)%n;
    }
}

void move_around() {
    j ^= 1;
}

int get_position(int d){
    int change = fp[j^1][d&1];
    d += change;
    d %= n;

    if(j^1){
        d = q[d];
    }

    int i = a[d][j];
    i += ip[j][i&1];
    i %= n;

    return i;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 60 ms 6588 KB Output is correct
2 Correct 56 ms 6636 KB Output is correct
3 Correct 55 ms 6784 KB Output is correct
4 Correct 63 ms 6608 KB Output is correct
5 Correct 37 ms 5448 KB Output is correct
6 Correct 37 ms 5376 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory 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 1240 KB Output is correct
5 Correct 1 ms 664 KB Output is correct
6 Correct 3 ms 1240 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 49 ms 6592 KB Output is correct
2 Correct 49 ms 6592 KB Output is correct
3 Correct 62 ms 6744 KB Output is correct
4 Correct 29 ms 5448 KB Output is correct
5 Correct 29 ms 5432 KB Output is correct
6 Correct 34 ms 5436 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 49 ms 6592 KB Output is correct
2 Correct 49 ms 6592 KB Output is correct
3 Correct 62 ms 6744 KB Output is correct
4 Correct 29 ms 5448 KB Output is correct
5 Correct 29 ms 5432 KB Output is correct
6 Correct 34 ms 5436 KB Output is correct
7 Correct 50 ms 6592 KB Output is correct
8 Correct 49 ms 9144 KB Output is correct
9 Correct 50 ms 9148 KB Output is correct
10 Correct 36 ms 6820 KB Output is correct
11 Correct 31 ms 6716 KB Output is correct
12 Correct 30 ms 6716 KB Output is correct

Subtask #5
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 60 ms 6588 KB Output is correct
2 Correct 56 ms 6636 KB Output is correct
3 Correct 55 ms 6784 KB Output is correct
4 Correct 63 ms 6608 KB Output is correct
5 Correct 37 ms 5448 KB Output is correct
6 Correct 37 ms 5376 KB Output is correct
7 Correct 49 ms 6592 KB Output is correct
8 Correct 49 ms 6592 KB Output is correct
9 Correct 62 ms 6744 KB Output is correct
10 Correct 29 ms 5448 KB Output is correct
11 Correct 29 ms 5432 KB Output is correct
12 Correct 34 ms 5436 KB Output is correct
13 Correct 53 ms 6604 KB Output is correct
14 Correct 53 ms 6600 KB Output is correct
15 Correct 53 ms 6612 KB Output is correct
16 Correct 37 ms 5436 KB Output is correct
17 Correct 34 ms 5448 KB Output is correct
18 Correct 35 ms 5448 KB Output is correct

Subtask #6
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 60 ms 6588 KB Output is correct
2 Correct 56 ms 6636 KB Output is correct
3 Correct 55 ms 6784 KB Output is correct
4 Correct 63 ms 6608 KB Output is correct
5 Correct 37 ms 5448 KB Output is correct
6 Correct 37 ms 5376 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 1240 KB Output is correct
11 Correct 1 ms 664 KB Output is correct
12 Correct 3 ms 1240 KB Output is correct
13 Correct 49 ms 6592 KB Output is correct
14 Correct 49 ms 6592 KB Output is correct
15 Correct 62 ms 6744 KB Output is correct
16 Correct 29 ms 5448 KB Output is correct
17 Correct 29 ms 5432 KB Output is correct
18 Correct 34 ms 5436 KB Output is correct
19 Correct 50 ms 6592 KB Output is correct
20 Correct 49 ms 9144 KB Output is correct
21 Correct 50 ms 9148 KB Output is correct
22 Correct 36 ms 6820 KB Output is correct
23 Correct 31 ms 6716 KB Output is correct
24 Correct 30 ms 6716 KB Output is correct
25 Correct 53 ms 6604 KB Output is correct
26 Correct 53 ms 6600 KB Output is correct
27 Correct 53 ms 6612 KB Output is correct
28 Correct 37 ms 5436 KB Output is correct
29 Correct 34 ms 5448 KB Output is correct
30 Correct 35 ms 5448 KB Output is correct
31 Correct 55 ms 9396 KB Output is correct
32 Correct 53 ms 9404 KB Output is correct
33 Correct 53 ms 9404 KB Output is correct
34 Correct 35 ms 7232 KB Output is correct
35 Correct 34 ms 6972 KB Output is correct
36 Correct 35 ms 7240 KB Output is correct