Submission #1434427
Source Code Expand
#pragma GCC optimize ("O3") #pragma GCC target ("avx") #include "bits/stdc++.h" // define macro "/D__MAI" using namespace std; typedef long long int ll; #define xprintf(fmt,...) fprintf(stderr,fmt,__VA_ARGS__) #define debugv(v) {printf("L%d %s => ",__LINE__,#v);for(auto e:v){cout<<e<<" ";}cout<<endl;} #define debugm(m) {printf("L%d %s is..\n",__LINE__,#m);for(auto v:m){for(auto e:v){cout<<e<<" ";}cout<<endl;}} #define debuga(m,w) {printf("L%d %s is => ",__LINE__,#m);for(int x=0;x<(w);x++){cout<<(m)[x]<<" ";}cout<<endl;} #define debugaa(m,w,h) {printf("L%d %s is..\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[x][y]<<" ";}cout<<endl;}} #define debugaar(m,w,h) {printf("L%d %s is..\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[y][x]<<" ";}cout<<endl;}} #define ALL(v) (v).begin(),(v).end() #define repeat(l) for(auto cnt=0;cnt<(l);++cnt) #define iterate(b,e) for(auto cnt=(b);cnt!=(e);++cnt) #define MD 1000000007ll #define PI 3.1415926535897932384626433832795 template<typename T1, typename T2> ostream& operator <<(ostream &o, const pair<T1, T2> p) { o << "(" << p.first << ":" << p.second << ")"; return o; } mt19937 mt(8901016); inline int rand_int(int l, int h) { return uniform_int_distribution<>(l, h)(mt); } #ifdef __MAI #define getchar_unlocked getchar #define putchar_unlocked putchar #endif #ifdef __VSCC #define getchar_unlocked _getchar_nolock #define putchar_unlocked _putchar_nolock #endif namespace { #define isvisiablechar(c) (0x21<=(c)&&(c)<=0x7E) class MaiScanner { public: template<typename T> void input_integer(T& var) { var = 0; T sign = 1; int cc = getchar_unlocked(); for (; cc<'0' || '9'<cc; cc = getchar_unlocked()) if (cc == '-') sign = -1; for (; '0' <= cc&&cc <= '9'; cc = getchar_unlocked()) var = (var << 3) + (var << 1) + cc - '0'; var = var*sign; } inline int c() { return getchar_unlocked(); } inline MaiScanner& operator>>(int& var) { input_integer<int>(var); return *this; } inline MaiScanner& operator>>(long long& var) { input_integer<long long>(var); return *this; } inline MaiScanner& operator>>(string& var) { int cc = getchar_unlocked(); for (; !isvisiablechar(cc); cc = getchar_unlocked()); for (; isvisiablechar(cc); cc = getchar_unlocked()) var.push_back(cc); } template<typename IT> void in(IT begin, IT end) { for (auto it = begin; it != end; ++it) *this >> *it; } }; } MaiScanner scanner; int height, width; int dp[110][110]; int main() { scanner >> height >> width; for (int y = 1; y <= height; ++y) { for (int x = 1; x <= width; ++x) { int a; scanner >> a; dp[y][x] = dp[y - 1][x] + dp[y][x - 1] - dp[y -1][x - 1] + a*(-((x & 1) ^ (y & 1)) * 2 + 1); } } for (int y = 1; y <= height; ++y) dp[y][width + 1] = dp[y - 1][width + 1] + dp[y][width]; for (int x = 1; x <= width + 1; ++x) dp[height + 1][x] = dp[height + 1][x - 1] + dp[height][x]; int best = 0; for (int y = 0; y < height; ++y) { for (int x = 0; x < width; ++x) { for (int v = y+1; v <= height; ++v) { for (int u = max(x+1,b/(v-y)+x); u <= width; ++u) { best = max(best, ((v - y) * (u - x))*!(dp[v][u] + dp[y][x] - dp[y][u] - dp[v][x])); } } } } cout << best << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - チョコレート |
User | m_buyoh |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 3783 Byte |
Status | CE |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:95:38: error: ‘b’ was not declared in this scope for (int u = max(x+1,b/(v-y)+x); u <= width; ++u) { ^