답안 #1036102

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1036102	2024-07-27T03:35:46 Z	vjudge1	Zemljište (COCI22_zemljiste)	C++17	30 / 70	2000 ms	4188 KB

Main

#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; x1++)
    {
      for(int x2 = 0; x2 < x1; x2++)
	{
	  set<ll> st;
	  st.insert({pref[x2][0] - pref[x1][0]});
	  for(int y1 = 1; y1 <= m; y1++)
	    {
	      ll sm = pref[x1][y1] - pref[x2][y1];
	      // a <= b

	      // a <= fsm <= b // if I want this
	      if(sm < a || b < sm)
		{
		  auto it = st.upper_bound(a - sm - 1);
		  if(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
		{
		  // a <= sm <= b
		  auto it = st.upper_bound(-1);
		  if(it != st.end())
		    {
		      ll fsm = *it + sm;
		      ans = min(ans, abs(a - fsm) + abs(b - fsm));
		    }
		  
		  if(it != st.begin())
		    {
		      it--;
		      ll fsm = *it + sm;
		      ans = min(ans, abs(a - fsm) + abs(b - fsm));
		    }  
		}
			      
	      st.insert({pref[x2][y1] - pref[x1][y1]});
	    }
	}
    }
  // assert(ans != 1e18);
  cout << ans << endl;
  return 0;
}

Subtask #1

10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	1 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

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	1 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	8 ms	344 KB	Output is correct
11	Correct	24 ms	600 KB	Output is correct
12	Correct	24 ms	604 KB	Output is correct
13	Correct	23 ms	600 KB	Output is correct
14	Correct	1 ms	344 KB	Output is correct
15	Correct	24 ms	604 KB	Output is correct
16	Correct	24 ms	604 KB	Output is correct
17	Correct	24 ms	604 KB	Output is correct
18	Correct	29 ms	604 KB	Output is correct
19	Correct	24 ms	604 KB	Output is correct
20	Correct	35 ms	348 KB	Output is correct
21	Correct	23 ms	604 KB	Output is correct
22	Correct	24 ms	608 KB	Output is correct

Subtask #3

0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	1 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	8 ms	344 KB	Output is correct
11	Correct	24 ms	600 KB	Output is correct
12	Correct	24 ms	604 KB	Output is correct
13	Correct	23 ms	600 KB	Output is correct
14	Correct	1 ms	344 KB	Output is correct
15	Correct	24 ms	604 KB	Output is correct
16	Correct	24 ms	604 KB	Output is correct
17	Correct	24 ms	604 KB	Output is correct
18	Correct	29 ms	604 KB	Output is correct
19	Correct	24 ms	604 KB	Output is correct
20	Correct	35 ms	348 KB	Output is correct
21	Correct	23 ms	604 KB	Output is correct
22	Correct	24 ms	608 KB	Output is correct
23	Execution timed out	2070 ms	4188 KB	Time limit exceeded
24	Halted	0 ms	0 KB	-