oj.uz

Submission #839542

# Submission time Handle Problem Language Result Execution time Memory
839542 2023-08-30T08:58:41 Z model_code Choreography (IOI23_choreography) C++17
12 / 100
 500 ms 4244 KB 
// correct/solution-subtask2.cpp

#include "choreography.h"
#include <vector>
#include <iostream>

int n;
std::vector<int> p;

void init(int N, std::vector<int> P){
    n = N;
    p = P;
}

void move_right(int K){
    std::vector<int> p2(n);
    for(int i = 0; i < n; i++){
        p2[i] = p[((i - K) % n + n) % n];
    }
    std::swap(p, p2);
}

void move_left(int K){
    move_right(-K);
}

void swap_places(){
    for(int i = 0; i < n; i += 2){
        std::swap(p[i], p[i+1]);
    }
}

void move_around(){
    std::vector<int> inv(n);
    for(int i = 0; i < n; i++) {
        inv[p[i]] = i;
    }
    std::swap(inv, p);
}

int get_position(int D){
    int j = 0;
    while(p[j] != D) ++j;
    return j;
}

Subtask #1
0.0 / 7.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1084 ms 4216 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 320 KB Output is correct
2 Correct 4 ms 212 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 5 ms 648 KB Output is correct
5 Correct 4 ms 340 KB Output is correct
6 Correct 6 ms 540 KB Output is correct

Subtask #3
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1076 ms 4244 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 14.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1076 ms 4244 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 28.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1084 ms 4216 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0.0 / 29.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1084 ms 4216 KB Time limit exceeded
2 Halted 0 ms 0 KB -