oj.uz

Submission #496747

# Submission time Handle Problem Language Result Execution time Memory
496747 2021-12-22T03:54:31 Z mansur Maxcomp (info1cup18_maxcomp) C++17
15 / 100
 300 ms 332 KB 
#include<bits/stdc++.h>	
 
#pragma optimize ("g",on)
#pragma GCC optimize ("inline")
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize ("03")
#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,avx2,mmx,fma,avx,tune=native")
#pragma comment(linker, "/stack:200000000")
 
//01001101 01100001 01101011 01101000 01100001  01100111 01100001 01111001 
 
using namespace std;
 
#define all(a) a.begin(), a.end()                                                   
#define rall(a) a.rbegin(), a.rend()
#define ll long long
#define pb push_back
#define sz(a) a.size()
#define nl '\n'
#define popb pop_back()                                                                   
#define ld double
#define ull unsigned long long
#define ff first                                         
#define ss second  
#define fix fixed << setprecision
#define pii pair<int, int>                          
#define E exit (0)
#define int long long
 
const int inf = 1e15, N = 1e6 + 1, mod = 998244353;                    
 
vector<pii> dir = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
 
int was[21][21], n, m;

void dfs(int x, int y) {
	was[x][y] = 1;
	for (auto e: dir) {
		x += e.ff, y += e.ss;
		if (x && x <= n && y && y <= m &&!was[x][y]) dfs(x, y);
		x -= e.ff, y -= e.ss;
	}
}

main() {                                                         
	//freopen("cowrect.in", "r", stdin);                                                                                     
	//freopen("cowrect.out", "w", stdout);                                                                                     
	ios_base::sync_with_stdio(NULL);                                                                                        
	cin.tie(NULL);
	cin >> n >> m;
	int a[n + 1][m + 1], ans = -2;
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) cin >> a[i][j];
	}
	if (n * m <= 20) {
		for (int mask = 1; mask < (1 << (n * m)); mask++) {
			int cnt = 0, mx = 0, mn = inf, cur = 0;
			for (int i = 1; i <= n; i++) {
				for (int j = 1; j <= m; j++) {
					was[i][j] = 1;
					if (mask >> cnt & 1) {
						mx = max(mx, a[i][j]);
						mn = min(mn, a[i][j]);
						cur++;
						was[i][j] = 0;
					}
					cnt++;
				}
			}
			cnt = 0;
			for (int i = 1; i <= n; i++) {
				for (int j = 1; j <= m; j++) {
					if (!was[i][j]) {
						dfs(i, j);
						cnt++;	
					}
				}
			}
			if (cnt == 1) ans = max(ans, mx - mn - cur);
		}
		cout << ans;
	}else {
		int ans = -2;
		for (int i = 1; i <= m; i++) {
			int mx = 0, mn = inf;
			for (int j = i; j <= m; j++) {
				mx = max(mx, a[1][j]);
				mn = min(mn, a[1][j]);
				ans = max(ans, mx - mn + j - i + 1);
			}
		}
		cout << ans;
	}
}

Compilation message

maxcomp.cpp:3: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    3 | #pragma optimize ("g",on)
      | 
maxcomp.cpp:9: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
    9 | #pragma comment(linker, "/stack:200000000")
      | 
maxcomp.cpp:46:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   46 | main() {
      | ^~~~

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 227 ms 292 KB Output is correct
2 Correct 300 ms 292 KB Output is correct
3 Correct 252 ms 288 KB Output is correct
4 Correct 216 ms 204 KB Output is correct
5 Correct 268 ms 204 KB Output is correct
6 Correct 249 ms 204 KB Output is correct
7 Correct 256 ms 292 KB Output is correct
8 Correct 262 ms 296 KB Output is correct

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 227 ms 292 KB Output is correct
2 Correct 300 ms 292 KB Output is correct
3 Correct 252 ms 288 KB Output is correct
4 Correct 216 ms 204 KB Output is correct
5 Correct 268 ms 204 KB Output is correct
6 Correct 249 ms 204 KB Output is correct
7 Correct 256 ms 292 KB Output is correct
8 Correct 262 ms 296 KB Output is correct
9 Incorrect 1 ms 332 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 227 ms 292 KB Output is correct
2 Correct 300 ms 292 KB Output is correct
3 Correct 252 ms 288 KB Output is correct
4 Correct 216 ms 204 KB Output is correct
5 Correct 268 ms 204 KB Output is correct
6 Correct 249 ms 204 KB Output is correct
7 Correct 256 ms 292 KB Output is correct
8 Correct 262 ms 296 KB Output is correct
9 Incorrect 1 ms 204 KB Output isn't correct
10 Halted 0 ms 0 KB -