oj.uz

Submission #1073530

# Submission time Handle Problem Language Result Execution time Memory
1073530 2024-08-24T15:46:03 Z XJP12 Mini tetris (IOI16_tetris) C++14
100 / 100
 3 ms 604 KB 
#include <bits/stdc++.h>
#include "tetris.h"
using namespace std;
typedef vector<int> vi;
int blocks;
void init(int n){
    blocks=n;
}
int position;
int rotation;
int state=0;
void new_figure(int figure_type) {
    if(figure_type==1){
        position=0;
        rotation=0;
        return;
    }
    if(figure_type==2){
        switch(state){
            case 0:
                position=0;
                rotation=0;  
                state = 3;
                break;
            case 1: 
                position=1;
                rotation=0;
                state = 3;
                break;
            case 2:
                position=0;
                rotation=0;
                state = 4;
                break;
             case 3:
                position=0;
                rotation=0;
                state = 5;
                break;
             case 4:
                position=1;
                rotation=0;
                state = 7;
                break;
             case 5:
                position=2;
                rotation=1;
                state = 0;
                break;
             case 6:
                position=2;
                rotation=1;
                state = 2;
                break;
            case 7:
                position=0;
                rotation=1;
                state = 0;
                break;
            case 8:
                position=0;
                rotation=1;
                state = 1;
                break;
        }
    }else{
        switch(state){
            case 0:
                position=0;
                rotation=0;  
                state = 1;
                break;
            case 1: 
                position=1;
                rotation=2;
                state = 0;
                break;
            case 2:
                position=0;
                rotation=3;
                state = 0;
                break;
             case 3:
                position=1;
                rotation=2;
                state = 4;
                break;
             case 4:
                position=0;
                rotation=3;
                state = 3;
                break;
             case 5:
                position=1;
                rotation=2;
                state = 8;
                break;
             case 6:
                position=1;
                rotation=2;
                state = 7;
                break;
            case 7:
                position=0;
                rotation=3;
                state = 6;
                break;
            case 8:
                position=0;
                rotation=3;
                state = 5;
                break;
        }
    }
}
int get_position() {
	return position;
}

int get_rotation() {
	return rotation;
}

Subtask #1
7.0 / 7.0

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

Subtask #2
8.0 / 8.0

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

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 360 KB Win!
2 Correct 0 ms 348 KB Win!
3 Correct 0 ms 348 KB Win!
4 Correct 0 ms 348 KB Win!
5 Correct 0 ms 348 KB Win!
6 Correct 0 ms 348 KB Win!
7 Correct 1 ms 348 KB Win!
8 Correct 3 ms 348 KB Win!
9 Correct 0 ms 348 KB Win!
10 Correct 0 ms 348 KB Win!
11 Correct 0 ms 348 KB Win!
12 Correct 0 ms 348 KB Win!
13 Correct 1 ms 384 KB Win!
14 Correct 1 ms 348 KB Win!
15 Correct 1 ms 348 KB Win!
16 Correct 1 ms 348 KB Win!
17 Correct 0 ms 344 KB Win!
18 Correct 0 ms 344 KB Win!
19 Correct 0 ms 348 KB Win!
20 Correct 0 ms 348 KB Win!
21 Correct 0 ms 348 KB Win!
22 Correct 0 ms 348 KB Win!
23 Correct 1 ms 348 KB Win!
24 Correct 1 ms 348 KB Win!
25 Correct 1 ms 348 KB Win!
26 Correct 1 ms 348 KB Win!

Subtask #4
21.0 / 21.0

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

Subtask #5
54.0 / 54.0

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