oj.uz

Submission #1036158

# Submission time Handle Problem Language Result Execution time Memory
1036158 2024-07-27T04:25:23 Z vjudge1 Zemljište (COCI22_zemljiste) C++17
30 / 70
 2000 ms 6768 KB 
#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

int main()
{
  ios::sync_with_stdio(false);
  cin.tie(0), cout.tie(0);
  
  ll n, m, a, b;
  cin >> n >> m >> a >> b;
  if(a > b) swap(a, b);
  ll c[n][m];
  for(int i = 0; i < n; i ++)
    for(int j = 0; j < m; j ++)
      cin >> c[i][j];

  ll ans = 1e18;
  ll pref[n + 1][m + 1];
  for(int i = 0; i <= n; i ++)
    for(int j = 0; j <= m; j ++)
      pref[i][j] = 0;

  for(int i = 0; i < n; i ++)
    for(int j = 0; j < m; j ++)
      pref[i + 1][j + 1] = pref[i][j + 1] + pref[i + 1][j] - pref[i][j] + c[i][j];

  for(int x1 = 1; x1 <= n && ans > b - a; x1++)
    {
      for(int x2 = 0; x2 < x1 && ans > b - a; x2++)
	{
	  set<ll> st;
	  st.insert({pref[x2][0] - pref[x1][0]});
	  ll mi = 1e18, mx = -1e18;
	  if(pref[x2][0] - pref[x1][0] >= 0) mi = min(mi, pref[x2][0] - pref[x1][0]);
	  if(pref[x2][0] - pref[x1][0] <= 0) mx = max(mx, pref[x2][0] - pref[x1][0]);
	  
	  for(int y1 = 1; y1 <= m && ans > b - a; y1++)
	    {
	      ll sm = pref[x1][y1] - pref[x2][y1]; // is this incrasing or not
	      // a <= b

	      // a <= fsm <= b // if I want this
	      if(sm < a || b < sm)
		{
		  while(st.size() > 1 && *(++st.rbegin()) >= a - sm) st.erase(--st.end());
		  auto it = st.end();
		  it--;
		  ll fsm = *it + sm;
		  ans = min(ans, abs(a - fsm) + abs(b - fsm));
		  if(it != st.begin()) it--;
		  fsm = *it + sm;
		  ans = min(ans, abs(a - fsm) + abs(b - fsm));
		}
	      else
		{
		  ll fsm = mi + sm;
		  ans = min(ans, abs(a - fsm) + abs(b - fsm));
		  
		  fsm = mx + sm;
		  ans = min(ans, abs(a - fsm) + abs(b - fsm));
		}
			      
	      st.insert({pref[x2][y1] - pref[x1][y1]});
	      if(pref[x2][y1] - pref[x1][y1] >= 0) mi = min(mi, pref[x2][y1] - pref[x1][y1]);
	      if(pref[x2][y1] - pref[x1][y1] <= 0) mx = max(mx, pref[x2][y1] - pref[x1][y1]);
	    }
	}
    }
  // assert(ans != 1e18);
  cout << ans << endl;
  return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 600 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 17 ms 608 KB Output is correct
16 Correct 18 ms 608 KB Output is correct
17 Correct 17 ms 604 KB Output is correct
18 Correct 16 ms 604 KB Output is correct
19 Correct 15 ms 600 KB Output is correct
20 Correct 16 ms 600 KB Output is correct
21 Correct 12 ms 600 KB Output is correct
22 Correct 12 ms 604 KB Output is correct

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 600 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 17 ms 608 KB Output is correct
16 Correct 18 ms 608 KB Output is correct
17 Correct 17 ms 604 KB Output is correct
18 Correct 16 ms 604 KB Output is correct
19 Correct 15 ms 600 KB Output is correct
20 Correct 16 ms 600 KB Output is correct
21 Correct 12 ms 600 KB Output is correct
22 Correct 12 ms 604 KB Output is correct
23 Correct 20 ms 4168 KB Output is correct
24 Correct 17 ms 4188 KB Output is correct
25 Correct 17 ms 4196 KB Output is correct
26 Correct 25 ms 4184 KB Output is correct
27 Correct 15 ms 2904 KB Output is correct
28 Correct 18 ms 4192 KB Output is correct
29 Correct 17 ms 4188 KB Output is correct
30 Correct 19 ms 4200 KB Output is correct
31 Correct 3 ms 860 KB Output is correct
32 Correct 1854 ms 4352 KB Output is correct
33 Correct 1844 ms 6744 KB Output is correct
34 Correct 1866 ms 6732 KB Output is correct
35 Correct 1962 ms 6768 KB Output is correct
36 Execution timed out 2065 ms 6748 KB Time limit exceeded
37 Halted 0 ms 0 KB -