Submission #1943903
Source Code Expand
#include <algorithm> #include <climits> #include <cmath> #include <cstdio> #include <cstdlib> #include <ctime> #include <iostream> #include <sstream> #include <functional> #include <map> #include <string> #include <cstring> #include <vector> #include <queue> #include <stack> #include <deque> #include <set> #include <list> #include <numeric> using namespace std; typedef long long ll; typedef unsigned long long ull; typedef pair<ll,ll> P; const double PI = 3.14159265358979323846; const double EPS = 1e-12; const ll INF = 1LL<<29; const ll mod = 1e9+7; #define rep(i,n) for(int (i)=0;(i)<(ll)(n);++(i)) #define repd(i,n,d) for(ll (i)=0;(i)<(ll)(n);(i)+=(d)) #define all(v) (v).begin(), (v).end() #define pb(x) push_back(x) #define mp(x,y) make_pair((x),(y)) #define mset(m,v) memset((m),(v),sizeof(m)) #define chmin(x,y) (x=min(x,y)) #define chmax(x,y) (x=max(x,y)) #define fst first #define snd second #define UNIQUE(x) (x).erase(unique(all(x)),(x).end()) template<class T> ostream &operator<<(ostream &os, const vector<T> &v){int n=v.size();rep(i,n)os<<v[i]<<(i==n-1?"":" ");return os;} #define N 260 string s[N]; int h, w; bool check(int xl, int xr, int yl, int yr){ if(xl<0||xr>=h||yl<0||yr>=w) return false; rep(i, yr-yl+1) if(s[xl][yl+i]!=s[xr][yr-i]) return false; return true; } ll f(ll a, ll b){ return (b-a+1)/2; } int count(int xl, int xr, int yl, int yr){ if(!check(xl, xr, yl, yr)) return 0; if(xl==xr){ xl--; xr++; if(!check(xl, xr, yl, yr)) return 0; } ll res = 0; while(yl-1>=0&&yr+1<w){ if(s[xl][yl-1]==s[xr][yr+1]&&s[xr][yl-1]==s[xl][yr+1]){ yl--; yr++; } else break; } res += f(yl, yr); while(true){ xl--; xr++; if(xl<0||xr>h) return res; while(!((s[xl][yl]==s[xr][yr]&&s[xr][yl]==s[xl][yr]))){ yl++; yr--; if(yl>yr) return res; } res += f(yl, yr); } } int main(){ cin>>h>>w; rep(i, h) cin>>s[i]; ll res = 0; rep(i, h) rep(j, w){ res += count(i, i, j, j); res += count(i, i+1, j, j); res += count(i, i, j, j+1); res += count(i, i+1, j, j+1); } cout<<res<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | H - 模様替え |
User | Lepton |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 2151 Byte |
Status | WA |
Exec Time | 168 ms |
Memory | 384 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | Subtask3 | ||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 15 | 0 / 30 | 0 / 55 | ||||||||||||||
Status |
|
|
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0-sample-01.txt, subtask0-sample-02.txt |
Subtask1 | subtask0-sample-01.txt, subtask0-sample-02.txt, subtask1-01.txt, subtask1-02.txt, subtask1-03.txt, subtask1-04.txt, subtask1-05.txt, subtask1-06.txt, subtask1-07.txt, subtask1-08.txt, subtask1-09.txt, subtask1-10.txt, subtask1-11.txt, subtask1-12.txt, subtask1-13.txt, subtask1-14.txt, subtask1-15.txt, subtask1-16.txt, subtask1-17.txt, subtask1-18.txt, subtask1-19.txt, subtask1-20.txt |
Subtask2 | subtask0-sample-01.txt, subtask0-sample-02.txt, subtask1-01.txt, subtask1-02.txt, subtask1-03.txt, subtask1-04.txt, subtask1-05.txt, subtask1-06.txt, subtask1-07.txt, subtask1-08.txt, subtask1-09.txt, subtask1-10.txt, subtask1-11.txt, subtask1-12.txt, subtask1-13.txt, subtask1-14.txt, subtask1-15.txt, subtask1-16.txt, subtask1-17.txt, subtask1-18.txt, subtask1-19.txt, subtask1-20.txt, subtask2-01.txt, subtask2-02.txt, subtask2-03.txt, subtask2-04.txt, subtask2-05.txt, subtask2-06.txt, subtask2-07.txt, subtask2-08.txt, subtask2-09.txt, subtask2-10.txt, subtask2-11.txt, subtask2-12.txt, subtask2-13.txt, subtask2-14.txt, subtask2-15.txt |
Subtask3 | subtask0-sample-01.txt, subtask0-sample-02.txt, subtask1-01.txt, subtask1-02.txt, subtask1-03.txt, subtask1-04.txt, subtask1-05.txt, subtask1-06.txt, subtask1-07.txt, subtask1-08.txt, subtask1-09.txt, subtask1-10.txt, subtask1-11.txt, subtask1-12.txt, subtask1-13.txt, subtask1-14.txt, subtask1-15.txt, subtask1-16.txt, subtask1-17.txt, subtask1-18.txt, subtask1-19.txt, subtask1-20.txt, subtask2-01.txt, subtask2-02.txt, subtask2-03.txt, subtask2-04.txt, subtask2-05.txt, subtask2-06.txt, subtask2-07.txt, subtask2-08.txt, subtask2-09.txt, subtask2-10.txt, subtask2-11.txt, subtask2-12.txt, subtask2-13.txt, subtask2-14.txt, subtask2-15.txt, subtask3-01.txt, subtask3-02.txt, subtask3-03.txt, subtask3-04.txt, subtask3-05.txt, subtask3-06.txt, subtask3-07.txt, subtask3-08.txt, subtask3-09.txt, subtask3-10.txt, subtask3-11.txt, subtask3-12.txt, subtask3-13.txt, subtask3-14.txt, subtask3-15.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0-sample-01.txt | AC | 1 ms | 256 KB |
subtask0-sample-02.txt | AC | 1 ms | 256 KB |
subtask1-01.txt | AC | 1 ms | 256 KB |
subtask1-02.txt | WA | 1 ms | 256 KB |
subtask1-03.txt | WA | 1 ms | 256 KB |
subtask1-04.txt | AC | 1 ms | 256 KB |
subtask1-05.txt | AC | 1 ms | 256 KB |
subtask1-06.txt | WA | 1 ms | 256 KB |
subtask1-07.txt | AC | 1 ms | 256 KB |
subtask1-08.txt | WA | 1 ms | 256 KB |
subtask1-09.txt | WA | 1 ms | 256 KB |
subtask1-10.txt | AC | 1 ms | 256 KB |
subtask1-11.txt | WA | 1 ms | 256 KB |
subtask1-12.txt | WA | 1 ms | 256 KB |
subtask1-13.txt | WA | 1 ms | 256 KB |
subtask1-14.txt | WA | 1 ms | 256 KB |
subtask1-15.txt | WA | 1 ms | 256 KB |
subtask1-16.txt | WA | 1 ms | 256 KB |
subtask1-17.txt | WA | 1 ms | 256 KB |
subtask1-18.txt | WA | 1 ms | 256 KB |
subtask1-19.txt | WA | 1 ms | 256 KB |
subtask1-20.txt | WA | 1 ms | 256 KB |
subtask2-01.txt | WA | 2 ms | 256 KB |
subtask2-02.txt | WA | 2 ms | 256 KB |
subtask2-03.txt | WA | 3 ms | 256 KB |
subtask2-04.txt | WA | 3 ms | 256 KB |
subtask2-05.txt | WA | 2 ms | 256 KB |
subtask2-06.txt | WA | 13 ms | 256 KB |
subtask2-07.txt | WA | 3 ms | 256 KB |
subtask2-08.txt | WA | 3 ms | 256 KB |
subtask2-09.txt | WA | 3 ms | 256 KB |
subtask2-10.txt | WA | 13 ms | 256 KB |
subtask2-11.txt | AC | 13 ms | 256 KB |
subtask2-12.txt | WA | 3 ms | 256 KB |
subtask2-13.txt | WA | 13 ms | 256 KB |
subtask2-14.txt | WA | 2 ms | 256 KB |
subtask2-15.txt | WA | 3 ms | 256 KB |
subtask3-01.txt | WA | 3 ms | 256 KB |
subtask3-02.txt | WA | 4 ms | 256 KB |
subtask3-03.txt | WA | 3 ms | 256 KB |
subtask3-04.txt | WA | 3 ms | 256 KB |
subtask3-05.txt | WA | 4 ms | 256 KB |
subtask3-06.txt | WA | 168 ms | 256 KB |
subtask3-07.txt | WA | 59 ms | 384 KB |
subtask3-08.txt | WA | 10 ms | 256 KB |
subtask3-09.txt | WA | 7 ms | 256 KB |
subtask3-10.txt | WA | 10 ms | 384 KB |
subtask3-11.txt | WA | 7 ms | 384 KB |
subtask3-12.txt | WA | 10 ms | 256 KB |
subtask3-13.txt | WA | 168 ms | 256 KB |
subtask3-14.txt | WA | 10 ms | 256 KB |
subtask3-15.txt | WA | 9 ms | 256 KB |