oj.uz

Submission #612550

# Submission time Handle Problem Language Result Execution time Memory
612550 2022-07-29T17:22:08 Z okkuu Mini tetris (IOI16_tetris) C++17
100 / 100
 4 ms 340 KB 
#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];
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 300 KB Win!
2 Correct 1 ms 296 KB Win!
3 Correct 1 ms 212 KB Win!
4 Correct 1 ms 212 KB Win!
5 Correct 1 ms 212 KB Win!
6 Correct 1 ms 212 KB Win!
7 Correct 3 ms 212 KB Win!
8 Correct 2 ms 212 KB Win!

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Win!
2 Correct 1 ms 212 KB Win!
3 Correct 1 ms 300 KB Win!
4 Correct 1 ms 212 KB Win!
5 Correct 0 ms 308 KB Win!
6 Correct 1 ms 212 KB Win!
7 Correct 1 ms 212 KB Win!
8 Correct 3 ms 212 KB Win!

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 300 KB Win!
2 Correct 1 ms 296 KB Win!
3 Correct 1 ms 212 KB Win!
4 Correct 1 ms 212 KB Win!
5 Correct 1 ms 212 KB Win!
6 Correct 1 ms 212 KB Win!
7 Correct 3 ms 212 KB Win!
8 Correct 2 ms 212 KB Win!
9 Correct 1 ms 212 KB Win!
10 Correct 1 ms 212 KB Win!
11 Correct 1 ms 300 KB Win!
12 Correct 1 ms 212 KB Win!
13 Correct 0 ms 308 KB Win!
14 Correct 1 ms 212 KB Win!
15 Correct 1 ms 212 KB Win!
16 Correct 3 ms 212 KB Win!
17 Correct 1 ms 300 KB Win!
18 Correct 1 ms 212 KB Win!
19 Correct 1 ms 300 KB Win!
20 Correct 1 ms 212 KB Win!
21 Correct 1 ms 212 KB Win!
22 Correct 2 ms 212 KB Win!
23 Correct 1 ms 212 KB Win!
24 Correct 2 ms 212 KB Win!
25 Correct 3 ms 304 KB Win!
26 Correct 3 ms 340 KB Win!

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 296 KB Win!
2 Correct 1 ms 212 KB Win!
3 Correct 1 ms 212 KB Win!
4 Correct 1 ms 212 KB Win!
5 Correct 1 ms 300 KB Win!
6 Correct 2 ms 212 KB Win!
7 Correct 2 ms 296 KB Win!
8 Correct 4 ms 212 KB Win!

Subtask #5
54.0 / 54.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 300 KB Win!
2 Correct 1 ms 296 KB Win!
3 Correct 1 ms 212 KB Win!
4 Correct 1 ms 212 KB Win!
5 Correct 1 ms 212 KB Win!
6 Correct 1 ms 212 KB Win!
7 Correct 3 ms 212 KB Win!
8 Correct 2 ms 212 KB Win!
9 Correct 1 ms 212 KB Win!
10 Correct 1 ms 212 KB Win!
11 Correct 1 ms 300 KB Win!
12 Correct 1 ms 212 KB Win!
13 Correct 0 ms 308 KB Win!
14 Correct 1 ms 212 KB Win!
15 Correct 1 ms 212 KB Win!
16 Correct 3 ms 212 KB Win!
17 Correct 1 ms 300 KB Win!
18 Correct 1 ms 212 KB Win!
19 Correct 1 ms 300 KB Win!
20 Correct 1 ms 212 KB Win!
21 Correct 1 ms 212 KB Win!
22 Correct 2 ms 212 KB Win!
23 Correct 1 ms 212 KB Win!
24 Correct 2 ms 212 KB Win!
25 Correct 3 ms 304 KB Win!
26 Correct 3 ms 340 KB Win!
27 Correct 1 ms 296 KB Win!
28 Correct 1 ms 212 KB Win!
29 Correct 1 ms 212 KB Win!
30 Correct 1 ms 212 KB Win!
31 Correct 1 ms 300 KB Win!
32 Correct 2 ms 212 KB Win!
33 Correct 2 ms 296 KB Win!
34 Correct 4 ms 212 KB Win!
35 Correct 1 ms 212 KB Win!
36 Correct 1 ms 300 KB Win!
37 Correct 1 ms 212 KB Win!
38 Correct 1 ms 212 KB Win!
39 Correct 1 ms 304 KB Win!
40 Correct 1 ms 212 KB Win!
41 Correct 2 ms 212 KB Win!
42 Correct 3 ms 296 KB Win!
43 Correct 3 ms 212 KB Win!
44 Correct 2 ms 212 KB Win!
45 Correct 2 ms 212 KB Win!