# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
319716 | gustason | Tetris (COCI17_tetris) | C++14 | 1 ms | 708 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int r, s;
char grid[11][11];
vector<string> shape1{"11",
"11"};
vector<string> shape2{"1111"};
vector<string> shape3{"011",
"110"};
vector<string> shape4{"110",
"011"};
vector<string> shape5{"010",
"111"};
const vector<vector<string>> shapes = {shape1, shape2, shape3, shape4, shape5};
const vector<int> rot = {1, 2, 2, 2, 4};
vector<string> rotate(vector<string> mat) {
int r = mat.size(), s = mat[0].size();
vector<string> ret;
ret.resize(s);
for (int i = 0; i < ret.size(); ++i)
ret[i].resize(r);
for (int i = 0; i < r; ++i)
for (int j = 0; j < s; ++j)
ret[j][r - 1 - i] = mat[i][j];
return ret;
}
int count(vector<string> shape) {
int rr = shape.size(), ss = shape[0].size();
int ret = 0;
for (int i = 0; i < r; ++i) {
for (int j = 0; j < s; ++j) {
if (i + rr > r || j + ss > s) continue;
set <char> S;
for (int _r = i; _r < i + rr; ++_r)
for (int _s = j; _s < j + ss; ++_s)
if (shape[_r - i][_s - j] == '1')
S.insert(grid[_r][_s]);
ret += (S.size() == 1 && *S.begin() != '.');
}
}
return ret;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cin >> r >> s;
for(int i = 0; i < r; i++) {
for(int j = 0; j < s; j++) {
cin >> grid[i][j];
}
}
for(int i = 0; i <= 4; i++) {
auto shape = shapes[i];
int cnt = 0;
for(int j = 0; j < rot[i]; j++) {
cnt += count(shape);
shape = rotate(shape);
}
cout << cnt << "\n";
}
return 0;
}
//~ check for overflows
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |