結果
問題 | No.179 塗り分け |
ユーザー | penguinman |
提出日時 | 2020-09-13 18:14:53 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 7,404 bytes |
コンパイル時間 | 2,092 ms |
コンパイル使用メモリ | 189,176 KB |
実行使用メモリ | 6,948 KB |
最終ジャッジ日時 | 2024-06-13 04:20:28 |
合計ジャッジ時間 | 4,275 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,812 KB |
testcase_01 | WA | - |
testcase_02 | AC | 2 ms
6,944 KB |
testcase_03 | WA | - |
testcase_04 | AC | 2 ms
6,940 KB |
testcase_05 | WA | - |
testcase_06 | AC | 3 ms
6,940 KB |
testcase_07 | WA | - |
testcase_08 | AC | 13 ms
6,940 KB |
testcase_09 | AC | 13 ms
6,940 KB |
testcase_10 | AC | 34 ms
6,940 KB |
testcase_11 | AC | 29 ms
6,944 KB |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | AC | 2 ms
6,944 KB |
testcase_17 | WA | - |
testcase_18 | AC | 25 ms
6,940 KB |
testcase_19 | AC | 23 ms
6,944 KB |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | AC | 24 ms
6,944 KB |
testcase_24 | WA | - |
testcase_25 | AC | 16 ms
6,944 KB |
testcase_26 | AC | 25 ms
6,944 KB |
testcase_27 | WA | - |
testcase_28 | AC | 50 ms
6,940 KB |
testcase_29 | WA | - |
testcase_30 | AC | 45 ms
6,940 KB |
testcase_31 | WA | - |
testcase_32 | AC | 47 ms
6,940 KB |
testcase_33 | WA | - |
testcase_34 | AC | 54 ms
6,944 KB |
testcase_35 | WA | - |
testcase_36 | WA | - |
testcase_37 | WA | - |
testcase_38 | WA | - |
testcase_39 | WA | - |
testcase_40 | WA | - |
testcase_41 | WA | - |
testcase_42 | WA | - |
testcase_43 | WA | - |
testcase_44 | WA | - |
testcase_45 | WA | - |
ソースコード
#include<bits/stdc++.h>//using namespace std;#pragma GCC target("avx")#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")#define rep(i,j,n) for(ll i=(ll)(j);i<(ll)(n);i++)#define REP(i,j,n) for(ll i=(ll)(j);i<=(ll)(n);i++)#define per(i,j,n) for(ll i=(ll)(j);(ll)(n)<=i;i--)#define ll long long#define all(a) (a).begin(),(a).end()#define disup(A,key) distance(A.begin(),upper_bound(ALL(A),(ll)(key)))#define dislow(A,key) distance(A.begin(),lower_bound(ALL(A),(ll)(key)))#define pb emplace_back#define mp std::make_pair//#define endl "\n"//using std::endl;using std::cin;using std::cout;using std::vector;using std::string;using std::upper_bound;using std::lower_bound;using vi=vector<ll>;using vii=vector<vi>;using pii=std::pair<ll,ll>;//constexpr ll MOD=1e9+7;//constexpr ll MOD=998244353;//constexpr ll MOD=10000000;//constexpr ll MOD=1e4;constexpr ll MAX=3e6;constexpr ll inf=(1ll<<60);template<class T>class prique :public std::priority_queue<T, std::vector<T>, std::greater<T>> {};template<typename T>struct Segment_tree{ll N;T mem;vector<T> node;Segment_tree(vector<T> &X,T m):mem(m){ll sz=X.size();N=1;while(N<sz) N*=2;node.resize(2*N-1,mem);rep(i,0,sz) node[N-1+i]=X[i];per(i,N-2,0){node[i]=Compare(node[i*2+1],node[i*2+2]);}}T Compare(T &A,T &B){return std::max(A,B);}void update(ll X,T val){X+=N-1;node[X]=val;while(X>0){X=(X-1)/2;node[X]=Compare(node[X*2+1],node[X*2+2]);}}T Query(ll a,ll b,ll now,ll l,ll r){ //[a,b),[l,r)if(r<0) r=N;if(r<=a||b<=l) return mem;if(a<=l&&r<=b) return node[now];auto vl=Query(a,b,now*2+1,l,(l+r)/2),vr=Query(a,b,now*2+2,(l+r)/2,r);return Compare(vl,vr);}};template<typename T>struct lazy_Segment_tree{int N;vector<T> node,lazy;T INF;lazy_Segment_tree(vector<T> X,T Y):INF(Y){N=1;while(X.size()>N) N*=2;node.resize(2*N-1,Y);lazy.resize(2*N-1);rep(i,0,X.size()) node[i+N-1]=X[i];per(i,N-2,0) node[i]=compare(node[i*2+1],node[i*2+2]);}T compare(T X,T Y){return std::max(X,Y);}T plus(T X,int l,int r){return X;}void eval(int now,int l,int r){if(lazy[now]==0) return;node[now]+=lazy[now];if(r-l>1){lazy[now*2+1]+=plus(lazy[now],l,r);lazy[now*2+2]+=plus(lazy[now],l,r);}lazy[now]=0;}void update(int a,int b,T add,int now=0,int l=0,int r=-1){if(r<0) r=N;eval(now,l,r);if(b<=l||r<=a) return;if(a<=l&&r<=b){lazy[now]+=add;eval(now,l,r);}else{update(a,b,add,now*2+1,l,(r+l)/2);update(a,b,add,now*2+2,(r+l)/2,r);node[now]=compare(node[now*2+1],node[now*2+2]);}}T Query(int a,int b,int now=0,int l=0,int r=-1){if(r<0) r=N;eval(now,l,r);if(b<=l||r<=a) return INF;if(a<=l&&r<=b) return node[now];return compare(Query(a,b,now*2+1,l,(r+l)/2),Query(a,b,now*2+2,(r+l)/2,r));}};struct Tree{int N;vii dp;vi dist;Tree(vii edge){N=edge.size();dp.resize(N);dist.resize(N,-1);for(int i=0;i<N;i++) dp[i].resize(30);dist[0]=dp[0][0]=0;std::queue<int> que;que.push(0);while(!que.empty()){int now=que.front(); que.pop();for(int i=0;i<edge[now].size();i++){int next=edge[now][i];if(dist[next]==-1){dist[next]=dist[now]+1;que.push(next);dp[next][0]=now;}}}for(int i=1;i<30;i++){for(int j=0;j<N;j++) dp[j][i]=dp[dp[j][i-1]][i-1];}}int LCA(int X,int Y){if(dist[X]<dist[Y]) std::swap(X,Y);{int Z=dist[X]-dist[Y];for(int i=0;i<30;i++){if(Z&(1<<i)){X=dp[X][i];}}}if(X==Y) return X;for(int i=29;i>=0;i--){if(dp[X][i]!=dp[Y][i]){X=dp[X][i];Y=dp[Y][i];}}return dp[X][0];}};struct Binary_indexed_tree{int N;vi bit;Binary_indexed_tree(int n):N(n){bit.resize(N+1,0);}void add(int x,ll a){for(x;x<=N;x+=(x&-x)) bit[x]+=a;}ll sum(int x){ll ret=0;for(x;x>0;x-=(x&-x)) ret+=bit[x];return ret;}ll lower_bound(ll X){if(sum(N)<X) return -1;ll ret=0,memo=1,sum=0;while(memo*2<=N) memo*=2;while(memo>0){if(memo+ret<=N&&sum+bit[memo+ret]<X){sum+=bit[memo+ret];ret+=memo;}memo/=2;}return ret+1;}};struct Union_Find{ll N;vi par;vi siz;Union_Find(int n):N(n){par.resize(N);siz.resize(N,1);rep(i,0,N) par[i]=i;}ll root(ll X){if(par[X]==X) return X;return par[X]=root(par[X]);}bool same(ll X,ll Y){return root(X)==root(Y);}void unite(ll X,ll Y){X=root(X);Y=root(Y);if(X==Y) return;par[X]=Y;siz[Y]+=siz[X];siz[X]=0;}ll size(ll X){return siz[root(X)];}};long long modpow(long long a, long long n, long long mod) {long long res = 1;while (n > 0) {if (n & 1) res = res * a % mod;a = a * a % mod;n >>= 1;}return res;}vi fac,finv,inv;void COMinit() {fac.resize(MAX);finv.resize(MAX);inv.resize(MAX);fac[0] = fac[1] = 1;finv[0] = finv[1] = 1;inv[1] = 1;for (int i = 2; i < MAX; i++){fac[i] = fac[i - 1] * i % MOD;inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;finv[i] = finv[i - 1] * inv[i] % MOD;}}ll COM(ll n,ll r){if(n<r||n<0||r<0) return 0;return fac[n]*finv[r]%MOD*finv[n-r]%MOD;}void comp(vi &A){std::map<ll,ll> memo;rep(i,0,A.size()) memo[A[i]]=0;ll cnt=1;for(auto &p:memo) p.second=cnt++;rep(i,0,A.size()) A[i]=memo[A[i]];}void dec(std::map<ll,ll> &mem,ll X){mem[X]--;if(mem[X]==0) mem.erase(X);}int main(){std::ios::sync_with_stdio(false);std::cin.tie(nullptr);ll h,w; cin>>h;cin>>w;vector<string> s(h);rep(i,0,h) cin>>s[i];string ans="NO";REP(i,0,h){REP(j,0,w){if(i==j&&i==0) continue;vii flag(h,vi(w,-1)); bool f=1;rep(k,0,h){rep(l,0,w){if(s[k][l]=='#'&&flag[k][l]==-1){ll x=k,y=l; ll cnt=0;while(x<h&&y<w){if(s[x][y]!='#') break; flag[x][y]=0; x+=i; y+=j; cnt++;}if(cnt&2) f=0;}}}if(f) ans="YES";}}cout<<ans<<endl;}