Submission #497021

# Submission time Handle Problem Language Result Execution time Memory
497021 2021-12-22T08:36:38 Z Ziel Maxcomp (info1cup18_maxcomp) C++17
0 / 100
9 ms 15252 KB
/**
 * LES GREATEABLES BRO TEAM
**/
 
#include <bits/stdc++.h>
 
using namespace std;
 
using ll = long long;
#define sz(x) (int)x.size()
const bool FLAG = false;
void setIO(const string &f = "");
 
string to_string(const string s) {
	return '"' + s + '"';
}
string to_string(const char c) {
 	return char(39) + string(1, c) + char(39);
}
string to_string(const char* s) {
 	return to_string(string(s));
}
string to_string(bool f) {
	return (f ? "true" : "false");
}
template<class A, class B>
string to_string(const pair<A, B> x) {
	return "(" + to_string(x.first) + ", " + to_string(x.second) + ")";
}
template<class A, class B, class C>
string to_string(const tuple<A, B, C> x) {
	return "(" + to_string(get<0>(x)) + ", " + to_string(get<1>(x)) + ", " + to_string(get<2>(x)) + ")";
}
template<class A, class B, class C, class D>
string to_string(const tuple<A, B, C, D> x) {
	return "(" + to_string(get<0>(x)) + ", " + to_string(get<1>(x)) + ", " + to_string(get<2>(x)) + ", " + to_string(get<3>(x)) + ")";
}
template<class T>
string to_string(const T v) {
	string res = "{"; bool f = true;
	for (auto x: v)
		res += (f ? to_string(x) : ", " + to_string(x)), f = false;
	return res + "}";
}
void debug_args() { cerr << "]\n"; }
template<class H, class... T>
void debug_args(H x, T... y) {
	cerr << to_string(x);
	if (sizeof... (y))
	cerr << ", ";
	debug_args(y...);
}
 
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: [", debug_args(__VA_ARGS__);
#else
#define debug(...) 47
#endif
 
#define int ll
 
ll dp[105][55][55], mx[105][55][55], mn[105][55][55], a[55][55];
set<pair<int, int>> was[105][55][55];
 
void solve() {
    int n, m;
    cin >> n >> m;
   	for (int i = 1; i <= n; i++)
   		for (int j = 1; j <= m; j++)
   			cin >> a[i][j];
   	
   	auto relax_min = [](int &x, int y) {
   		if (x > y) {
   			x = y;
   			return true;
   		}
   		return false;
   	};
   	auto relax_max = [](int &x, int y) {
   		if (x < y) {
   			x = y;
   			return true;
   		}
   		return false;
   	};
   	int ans = -1;
   	for (int u = 1; u <= n; u++) {
   		for (int l = 1; l <= m; l++) {
   			for (int d = u; d <= n; d++) {
   				int mn = 1e12 + 12, mx = -1;
   				int pni = -1, pnj = -1, pxi = -1, pxj = -1;
   				for (int r = l; r <= m; r++) {
   					if (relax_min(mn, a[d][r])) {
   						pni = d;
   						pnj = r;
   					}
   					if (relax_max(mx, a[d][r])) {
   						pxi = d;
   						pxj = r;
   					}
					ans = max(ans, mx - mn - (pxi - pni + pxj - pnj + 1));
   				}
   			}
   		}
   	}
   	cout << ans;
}
 
signed main() {
    setIO();
    
    int tt = 1;
    if (FLAG) {
    	cin >> tt;
    }
    while (tt--) {
    	solve();
    }
    
    return 0;
}
 
void setIO(const string &f) {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    if (fopen((f + ".in").c_str(), "r")) {
        freopen((f + ".in").c_str(), "r", stdin);
        freopen((f + ".out").c_str(), "w", stdout);
    }
}

Compilation message

maxcomp.cpp: In function 'void setIO(const string&)':
maxcomp.cpp:127:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  127 |         freopen((f + ".in").c_str(), "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
maxcomp.cpp:128:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  128 |         freopen((f + ".out").c_str(), "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 8 ms 15180 KB Output is correct
2 Incorrect 8 ms 15180 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 9 ms 15252 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 8 ms 15180 KB Output is correct
2 Incorrect 8 ms 15180 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 8 ms 15180 KB Output is correct
2 Incorrect 8 ms 15180 KB Output isn't correct
3 Halted 0 ms 0 KB -