結果
問題 | No.866 レベルKの正方形 |
ユーザー |
![]() |
提出日時 | 2019-08-16 22:17:02 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 4,164 ms / 6,000 ms |
コード長 | 3,914 bytes |
コンパイル時間 | 2,269 ms |
コンパイル使用メモリ | 195,620 KB |
最終ジャッジ日時 | 2025-01-07 12:21:32 |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 22 |
ソースコード
#include<bits/stdc++.h>using namespace std;inline void rd(int &x){int k, m=0;x=0;for(;;){k = getchar_unlocked();if(k=='-'){m=1;break;}if('0'<=k&&k<='9'){x=k-'0';break;}}for(;;){k = getchar_unlocked();if(k<'0'||k>'9'){break;}x=x*10+k-'0';}if(m){x=-x;}}inline void rd(char &c){int i;for(;;){i = getchar_unlocked();if(i!=' '&&i!='\n'&&i!='\r'&&i!='\t'&&i!=EOF){break;}}c = i;}inline int rd(char c[]){int i, sz=0;for(;;){i = getchar_unlocked();if(i!=' '&&i!='\n'&&i!='\r'&&i!='\t'&&i!=EOF){break;}}c[sz++] = i;for(;;){i = getchar_unlocked();if(i==' '||i=='\n'||i=='\r'||i=='\t'||i==EOF){break;}c[sz++] = i;}c[sz]='\0';return sz;}inline void wt_L(char a){putchar_unlocked(a);}inline void wt_L(long long x){char f[20];int m=0, s=0;if(x<0){m=1;x=-x;}while(x){f[s++]=x%10;x/=10;}if(!s){f[s++]=0;}if(m){putchar_unlocked('-');}while(s--){putchar_unlocked(f[s]+'0');}}int X;int Y;int K;char C[2000][2002];long long g[13][2001][2001];inline long long getSum(int k, int i, int j, int v){int res=0;long long x=g[k][i+v][j+v] - g[k][i][j+v] - g[k][i+v][j] + g[k][i][j];if(x % (1LL<<32)){res++;}if(x / (1LL<<32)){res++;}return res;}inline long long getSum(int i, int j, int v){int k, res=0;for(k=0;k<(13);k++){res += getSum(k,i,j,v);}return res;}int main(){int i, ii, j, jj, k, loop, v;long long res=0;rd(X);rd(Y);rd(K);{int Lj4PdHRW;for(Lj4PdHRW=0;Lj4PdHRW<(X);Lj4PdHRW++){rd(C[Lj4PdHRW]);}}for(i=0;i<(X);i++){for(j=0;j<(Y);j++){C[i][j] -= 'a';}}for(k=0;k<(13);k++){for(i=0;i<(X);i++){for(j=0;j<(Y);j++){g[k][i+1][j+1] = g[k][i+1][j] + g[k][i][j+1] - g[k][i][j];if(C[i][j]==2*k){g[k][i+1][j+1]++;}if(C[i][j]==2*k+1){g[k][i+1][j+1] += (1LL<<32);}}}}for(loop=0;loop<(2);loop++){for(ii=0;ii<(X);ii++){for(jj=0;jj<(Y);jj++){if(ii==0 || jj==0){i = ii;j = jj;v = 1;for(;;){while( i+v+1 <= X && j+v+1 <= Y && getSum(i,j,v+1) <= K ){v++;}res += (1 - 2*loop) * v;i++;j++;v--;if(i==X || j==Y){break;}}}}}K--;if(K==0){break;}}wt_L(res);wt_L('\n');return 0;}// cLay varsion 20190810-2// --- original code ---// int X, Y, K;// char C[2000][2002];//// ll g[13][2001][2001];//// inline ll getSum(int k, int i, int j, int v){// int res = 0;// ll x = g[k][i+v][j+v] - g[k][i][j+v] - g[k][i+v][j] + g[k][i][j];// if(x % (1LL<<32)) res++;// if(x / (1LL<<32)) res++;// return res;// }//// inline ll getSum(int i, int j, int v){// int k, res = 0;// rep(k,13) res += getSum(k,i,j,v);// return res;// }//// {// int i, j, k;// int ii, jj, v;// ll res = 0;//// rd(X,Y,K,C(X));//// rep(i,X) rep(j,Y) C[i][j] -= 'a';//// rep(k,13) rep(i,X) rep(j,Y){// g[k][i+1][j+1] = g[k][i+1][j] + g[k][i][j+1] - g[k][i][j];// if(C[i][j]==2k) g[k][i+1][j+1]++;// if(C[i][j]==2k+1) g[k][i+1][j+1] += (1LL<<32);// }//// rep(loop,2){// rep(ii,X) rep(jj,Y) if(ii==0 || jj==0){// i = ii; j = jj; v = 1;// for(;;){// while( i+v+1 <= X && j+v+1 <= Y && getSum(i,j,v+1) <= K ) v++;// res += (1 - 2loop) * v;// i++; j++; v--;// if(i==X || j==Y) break;// }// }//// K--;// if(K==0) break;// }//// wt(res);// }