#include "choreography.h"
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <string>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> v2i;
typedef pair<int, int> pi;
typedef vector<pi> vp;
#define pb push_back
#define mp make_pair
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
vi p;
int n;
vp moves;
vi counts(4, 0);
vi pos;
void init(int N, vi P) {
p = P;
n = N;
pos.resize(N);
int i = 0;
for (auto d : P) {
pos[d] = i++;
}
}
void move_right(int K) {
moves.pb({ 1, K });
counts[0]++;
}
void move_left(int K) {
moves.pb({ 2, K });
counts[1]++;
}
void swap_places() {
moves.pb({ 3, 0 });
counts[2]++;
}
void move_around() {
moves.pb({ 4, 0 });
counts[3]++;
}
int get_position(int D){
int res = pos[D];
for (auto move : moves) {
if (move.first == 1) res += move.second;
else res -= move.second;
res = (res % n + n) % n;
}
return res;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
1006 ms |
7372 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
5 ms |
348 KB |
5th lines differ - on the 1st token, expected: '411', found: '410' |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
1070 ms |
6480 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
1070 ms |
6480 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
1006 ms |
7372 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
1006 ms |
7372 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |