제출 #1073523

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1073523		XJP12	Mini tetris (IOI16_tetris)	C++14	29 / 100	3 ms	348 KiB

tetris

#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
• Subtask 2: 8 / 8
• Subtask 3: 0 / 10
• Subtask 4: 21 / 21
• Subtask 5: 0 / 54