oj.uz

Submission #249421

# Submission time Handle Problem Language Result Execution time Memory
249421 2020-07-14T23:18:15 Z Geothermal Mini tetris (IOI16_tetris) C++17
100 / 100
 3 ms 384 KB 
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
 
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
 
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
 
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;
 
#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)
#define trav(a,x) for (auto& a : x)
 
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
#define ins insert

template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
 
const int MOD = 1000000007;
const char nl = '\n';
const int MX = 100001; //check the limits, dummy
 
pi res;
int state = 0;

void init(int n) {
    return;
}

void new_figure(int F) {
    if (F == 1) {
        res = {0, 0}; return;
    }
    if (state == 0) { //_ _ _
        if (F == 2) {
            res = {0, 0};
            state = 2; 
        } else {
            res = {0, 0};
            state = 1; 
        }
    } else if (state == 1) { // x _ _ / x x _
        if (F == 2) {
            res = {1, 0};
            state = 2;
        } else {
            res = {1, 2};
            state = 0;
        }
    } else if (state == 2) { //x x _
        if (F == 2) {
            res = {2, 1};
            state = 3; 
        } else {
            res = {1, 2}; 
            state = 4; //_ x x
        }
    } else if (state == 3) { //_ _ x
        if (F == 2) {
            res = {0, 0};
            state = 0;
        } else {
            res = {0, 0};
            state = 5; 
        }
    } else if (state == 4) { //_ x x
        if (F == 2) {
            res = {0, 1};
            state = 5;
        } else {
            res = {0, 3};
            state = 2;
        }
    } else if (state == 5) { //x _ _
        if (F == 2) {
            res = {1, 0};
            state = 0;
        } else {
            res = {1, 1};
            state = 6; 
        }
    } else if (state == 6) { //_ _ x
        if (F == 2) {
            res = {0, 0};
            state = 0;
        } else {
            res = {0, 0};
            state = 5;
        }
    }
}

int get_position() {
    return res.f;
}

int get_rotation() {
    return res.s;
}

/*int main() {

    vi pos = {1, 3, 2, 1, 2, 3, 2, 3};

    F0R(i, sz(pos)) {
        new_figure(pos[i]);
        cout << res.f << " " << res.s << nl;
    }

    return 0;
}*/
 
// read the question correctly (ll vs int)
// template by bqi343

Subtask #1
7.0 / 7.0

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

Subtask #2
8.0 / 8.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
21.0 / 21.0

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

Subtask #5
54.0 / 54.0

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