이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include "tetris.h"
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
/*
1: ###
2: ##
3: #
##
*/
/*
0: ...
...
(0,0,1),(0,0,2)
1: ...
##.
(2,1,4),(1,2,3)
2: #..
##.
(1,0,1),(1,2,0)
3: ...
.##
(0,1,5),(0,3,1)
4: ...
..#
(0,0,0),(0,0,5)
5: ...
#..
(1,0,0),(1,1,4)
*/
vector<vector<array<ll,3>>> nx=
{
{{0,0,1},{0,0,2}},
{{2,1,4},{1,2,3}},
{{1,0,1},{1,2,0}},
{{0,1,5},{0,3,1}},
{{0,0,0},{0,0,5}},
{{1,0,0},{1,1,4}}
};
int place=0;
void init(int n) {
}
int position;
int rotation;
void new_figure(int figure_type) {
if(figure_type==1){
position=0;
rotation=0;
}
else{
position=nx[place][figure_type-2][0];
rotation=nx[place][figure_type-2][1];
place=nx[place][figure_type-2][2];
}
get_position();
get_rotation();
}
int get_position() {
return position;
}
int get_rotation() {
return rotation;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |