This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#define _USE_MATH_DEFINES
#include<iostream>
#include<vector>
#include<algorithm>
#include<cmath>
#include<string>
#include<iomanip>
#include<numeric>
#include<queue>
#include<deque>
#include<stack>
#include<set>
#include<map>
#include<random>
#include<bitset>
#include<cassert>
using namespace std;
typedef long long ll;
const int mod=998244353;
const int dx[]={1,0,0,-1},dy[]={0,1,-1,0};
#include"tetris.h"
int st,fig;
int nxt[6][3]={{0,1,2},{1,3,4},{2,1,0},{3,0,5},{4,5,1},{5,0,3}};
int pos[6][3]={{0,0,0},{0,2,1},{0,1,1},{0,0,0},{0,0,0},{0,1,1}};
int rot[6][3]={{0,0,0},{0,1,2},{0,0,2},{0,0,0},{0,1,3},{0,0,1}};
void init(int n){
st=-1;
}
void new_figure(int fig_){
if(st!=-1)
st=nxt[st][fig];
else
st=0;
fig=fig_-1;
}
int get_position(){
return pos[st][fig];
}
int get_rotation(){
return rot[st][fig];
}
# | 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... |