// Om Namah Shivaya
// GM in 93 days
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define endl '\n'
#define pb push_back
#define conts continue
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "YES" << endl
#define no cout << "NO" << endl
#define ff first
#define ss second
#define ceil2(x,y) ((x+y-1) / (y))
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#ifndef ONLINE_JUDGE
#define debug(x) cout << #x <<" = "; print(x); cout << endl
#else
#define debug(x)
#endif
#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)
bool iseven(ll n) {if ((n & 1) == 0) return true; return false;}
void print(ll t) {cout << t;}
void print(int t) {cout << t;}
void print(string t) {cout << t;}
void print(char t) {cout << t;}
void print(double t) {cout << t;}
void print(ld t) {cout << t;}
template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(pair <T, V> p) {cout << "{"; print(p.ff); cout << ","; print(p.ss); cout << "}";}
template <class T> void print(vector <T> v) {cout << "[ "; for (T i : v) {print(i); cout << " ";} cout << "]";}
template <class T> void print(set <T> v) {cout << "[ "; for (T i : v) {print(i); cout << " ";} cout << "]";}
template <class T> void print(multiset <T> v) {cout << "[ "; for (T i : v) {print(i); cout << " ";} cout << "]";}
template <class T, class V> void print(map <T, V> v) {cout << "[ "; for (auto i : v) {print(i); cout << " ";} cout << "]";}
template<typename T> void amin(T &a, T b) { a = min(a, b); }
template<typename T> void amax(T &a, T b) { a = max(a, b); }
void usaco(string filename) {
freopen((filename + ".in").c_str(), "r", stdin);
freopen((filename + ".out").c_str(), "w", stdout);
}
const int MOD = 1e9 + 7;
const int maxn = 1e5 + 5;
const int inf1 = 1e9 + 5;
const ll inf2 = ll(1e18) + 5;
vector<int> dx = { -1, 1, 0, 0};
vector<int> dy = {0, 0, -1, 1};
bool vis[15][15];
vector<vector<char>> a(15, vector<char>(15, '#'));
ll cnt[15];
ll mxleft, mxright, mxup, mxdown;
void dfs(ll i, ll j) {
amin(mxleft, j);
amax(mxright, j);
amin(mxup, i);
amax(mxdown, i);
vis[i][j] = 1;
rep(x, 4) {
ll i2 = i + dx[x], j2 = j + dy[x];
if (vis[i2][j2]) conts;
if (a[i2][j2] != a[i][j]) conts;
dfs(i2, j2);
}
}
void solve(int test_case)
{
ll n, m; cin >> n >> m;
rep1(i, n) rep1(j, m) cin >> a[i][j];
auto equal = [&](char ch1, char ch2, char ch3) {
return ch1 == ch2 and ch1 == ch3;
};
rep1(i, n) {
rep1(j, m) {
if (vis[i][j]) conts;
if (a[i][j] == '.') conts;
mxleft = inf2, mxright = -inf2, mxup = inf2, mxdown = -inf2;
dfs(i, j);
ll horiz = mxright - mxleft + 1;
ll vert = mxdown - mxup + 1;
ll type = 0;
if (horiz == 2 and vert == 2) {
type = 1;
}
else if ((horiz == 1 and vert == 4) or (horiz == 4 and vert == 1)) {
type = 2;
}
else {
if (vert > horiz) {
if (a[i + 2][j] == a[i][j]) {
type = 5;
}
else if (j == mxleft) {
type = 3;
}
else {
type = 4;
}
}
else {
if (equal(a[i + 1][j - 1], a[i + 1][j], a[i + 1][j + 1]) or equal(a[i][j], a[i][j + 1], a[i][j + 2])) {
type = 5;
}
else {
if (j == mxleft) {
type = 4;
}
else {
type = 3;
}
}
}
}
cnt[type]++;
}
}
rep1(i, 5) cout << cnt[i] << endl;
}
int main()
{
chrono::steady_clock::time_point begin = chrono::steady_clock::now();
fastio;
int t = 1;
// cin >> t;
rep1(i, t) {
solve(i);
}
chrono::steady_clock::time_point end = chrono::steady_clock::now();
cerr << "[Finished in " << chrono::duration_cast<chrono::microseconds>(end - begin).count() / 1000 << "ms]" << endl;
return 0;
}
Compilation message
tetris.cpp: In function 'void usaco(std::string)':
tetris.cpp:64:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
64 | freopen((filename + ".in").c_str(), "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
tetris.cpp:65:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
65 | freopen((filename + ".out").c_str(), "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Correct |
0 ms |
212 KB |
Output is correct |
| 3 |
Correct |
0 ms |
212 KB |
Output is correct |
| 4 |
Correct |
0 ms |
212 KB |
Output is correct |
| 5 |
Correct |
0 ms |
212 KB |
Output is correct |
| 6 |
Correct |
0 ms |
212 KB |
Output is correct |
| 7 |
Correct |
0 ms |
212 KB |
Output is correct |
| 8 |
Correct |
0 ms |
212 KB |
Output is correct |
| 9 |
Correct |
0 ms |
212 KB |
Output is correct |
| 10 |
Correct |
0 ms |
212 KB |
Output is correct |
