oj.uz

Submission #802900

# Submission time Handle Problem Language Result Execution time Memory
802900 2023-08-02T15:43:29 Z tlnk07 Zemljište (COCI22_zemljiste) C++17
30 / 70
 622 ms 2276 KB 
#include<bits/stdc++.h>
using namespace std;
 
long long n, m, x, a, b, pre[501][501], mini = INT_MAX;
 
int main()
{
	ios_base::sync_with_stdio(0);
    cin.tie(0);	cout.tie(0);
	cin >> n >> m >> a >> b;
	if(a > b)	swap(a, b);
	pre[0][0] = 0;
	for(int i = 1; i <= n; ++i)
	{
		for(int j = 1; j <= m; ++j)
		{
			cin >> x;
			if(i == 1)	pre[i][j] = pre[i][j - 1] + x;
			else if(j == 1)	pre[i][j] = pre[i - 1][j] + x;
			else	pre[i][j] = pre[i][j - 1] + pre[i - 1][j] - pre[i - 1][j - 1] + x;
		}
	}
	for(int i = 1; i <= n; ++i)
	{
		for(int j = 1; j <= m; ++j)
		{
			int jj = 0;
			for(int ii = 1; ii <= n; ++ii)
			{
				long long temp = pre[i][j] - pre[i][jj - 1] - pre[ii - 1][j] + pre[ii - 1][jj - 1];
				while(jj < j && temp >= a)
				{
					++jj;
					temp = pre[i][j] - pre[i][jj - 1] - pre[ii - 1][j] + pre[ii - 1][jj - 1];
				}
				mini = min(mini, abs(temp - a) + abs(temp - b));
				--jj;
				temp = pre[i][j] - pre[i][jj - 1] - pre[ii - 1][j] + pre[ii - 1][jj - 1];
				if(jj > 0)	mini = min(mini, abs(temp - a) + abs(temp - b));
			}
		}
	}
	cout << mini;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 3 ms 596 KB Output is correct
11 Correct 7 ms 596 KB Output is correct
12 Correct 12 ms 596 KB Output is correct
13 Correct 8 ms 720 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 11 ms 716 KB Output is correct
16 Correct 9 ms 596 KB Output is correct
17 Correct 7 ms 720 KB Output is correct
18 Correct 4 ms 596 KB Output is correct
19 Correct 4 ms 596 KB Output is correct
20 Correct 4 ms 596 KB Output is correct
21 Correct 5 ms 596 KB Output is correct
22 Correct 4 ms 724 KB Output is correct

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 3 ms 596 KB Output is correct
11 Correct 7 ms 596 KB Output is correct
12 Correct 12 ms 596 KB Output is correct
13 Correct 8 ms 720 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 11 ms 716 KB Output is correct
16 Correct 9 ms 596 KB Output is correct
17 Correct 7 ms 720 KB Output is correct
18 Correct 4 ms 596 KB Output is correct
19 Correct 4 ms 596 KB Output is correct
20 Correct 4 ms 596 KB Output is correct
21 Correct 5 ms 596 KB Output is correct
22 Correct 4 ms 724 KB Output is correct
23 Correct 582 ms 2276 KB Output is correct
24 Correct 619 ms 2264 KB Output is correct
25 Correct 614 ms 2260 KB Output is correct
26 Correct 618 ms 2264 KB Output is correct
27 Correct 539 ms 2260 KB Output is correct
28 Correct 603 ms 2264 KB Output is correct
29 Correct 578 ms 2264 KB Output is correct
30 Correct 622 ms 2276 KB Output is correct
31 Correct 96 ms 2072 KB Output is correct
32 Incorrect 622 ms 2260 KB Output isn't correct
33 Halted 0 ms 0 KB -