oj.uz

Submission #1073523

# Submission time Handle Problem Language Result Execution time Memory
1073523 2024-08-24T15:41:23 Z XJP12 Mini tetris (IOI16_tetris) C++14
29 / 100
 3 ms 348 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=1;
        rotation=0;
    }
    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
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Bad position for figure 1 : 1
2 Halted 0 ms 0 KB -

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 1 ms 348 KB Win!
4 Correct 1 ms 348 KB Win!
5 Correct 0 ms 348 KB Win!
6 Correct 1 ms 348 KB Win!
7 Correct 2 ms 348 KB Win!
8 Correct 2 ms 344 KB Win!

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Bad position for figure 1 : 1
2 Halted 0 ms 0 KB -

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Win!
2 Correct 1 ms 344 KB Win!
3 Correct 1 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 3 ms 348 KB Win!

Subtask #5
0 / 54.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Bad position for figure 1 : 1
2 Halted 0 ms 0 KB -