結果
問題 | No.866 レベルKの正方形 |
ユーザー |
![]() |
提出日時 | 2019-08-17 00:40:18 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
TLE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 4,396 bytes |
コンパイル時間 | 1,726 ms |
コンパイル使用メモリ | 177,380 KB |
実行使用メモリ | 414,364 KB |
最終ジャッジ日時 | 2024-09-23 06:19:27 |
合計ジャッジ時間 | 18,785 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 15 TLE * 7 |
ソースコード
#include <bits/stdc++.h>#pragma GCC optimize("O3", "unroll-loops")using namespace std;struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;#define ALL(x) (x).begin(), (x).end()#define SZ(x) ((lint)(x).size())#define POW2(n) (1LL << (n))#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)#define REP(i, n) FOR(i,0,n)#define IREP(i, n) IFOR(i,0,n)template<typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }template<typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...);}template<typename T> bool mmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }template<typename T> bool mmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }template<typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second+ r.second); }template<typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second- r.second); }template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }///// This part below is only for debug, not used /////template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }template<typename T> ostream &operator<<(ostream &os, const deque<T> &vec){ os << "deq["; for (auto v : vec) os << v << ","; os << "]"; return os; }template<typename T> ostream &operator<<(ostream &os, const set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }template<typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }template<typename T> ostream &operator<<(ostream &os, const multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }template<typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}";return os; }template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa){ os << "(" << pa.first << "," << pa.second << ")"; returnos; }template<typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }template<typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;///// END /////using lint = long long int;int dp[2001][2001][26];int H, W, K;int count_n(int i, int j, int L){int ret = 0;REP(d, 26){int tmp = dp[i + L][j + L][d] - dp[i][j + L][d] - dp[i + L][j][d] + dp[i][j][d];ret += (tmp > 0);}return ret;}int main(){cin >> H >> W >> K;vector<string> C(H);cin >> C;memset(dp, 0, sizeof(dp));REP(i, H) REP(j, W) dp[i + 1][j + 1][C[i][j] - 'a']++;REP(i, H + 1) REP(j, W) REP(d, 26){dp[i][j + 1][d] += dp[i][j][d];}REP(i, H) REP(j, W + 1) REP(d, 26){dp[i + 1][j][d] += dp[i][j][d];}lint ret = 0;REP(i, H) REP(j, W){int dmax = min(H - i, W - j);int cn = count_n(i, j, dmax);if (cn < K) continue;int l = 0, r = dmax;while (r - l > 1){int c = (l + r) / 2;if (count_n(i, j, c) < K) l = c;else r = c;}if (cn == K){ret += dmax - l;}else if (count_n(i, j, r) == K){int ll = r, rr = dmax + 1;while (rr - ll > 1){int c = (ll + rr) / 2;if (count_n(i, j, c) > K) rr = c;else ll = c;}ret += ll - l;}}cout << ret << endl;}