답안 #936023

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
936023	2024-03-01T01:56:09 Z	Regulus	Zemljište (COCI22_zemljiste)	C++17	30 / 70	2000 ms	6820 KB

Main

#include <bits/stdc++.h>
#define IO ios::sync_with_stdio(false);cin.tie(0);
#define debug(x) cerr << #x << " = " << (x) << ' '
#define bug(x) cerr << (x) << ' '
#define endl cerr << '\n'
#define all(v) (v).begin(), (v).end()
#define SZ(v) (ll)(v).size()
#define lowbit(x) (x)&-(x)
#define pb emplace_back
#define F first
#define S second
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
//#define TEST
const int N = 505;
const ll LLINF = 2e18;
ll a[N][N], sum[N], col[N][N];

int main(void)
{ IO
    ll n, i, m, L, R, ans = LLINF;

    cin >> n >> m >> L >> R;
    if (L > R) swap(L, R);
    for (i=1; i <= n; ++i)
        for (int j=1; j <= m; ++j)
            cin >> a[i][j], col[i][j] = col[i-1][j] + a[i][j];

    for (int lb=0; lb < n; ++lb)
    {
        for (int ub=lb+1; ub <= n; ++ub)
        {
            for (i=1; i <= m; ++i)
            {
                sum[i] = sum[i-1] + col[ub][i]-col[lb][i];

                for (int j=0; j < i; ++j)
                {
                    ll x = sum[i] - sum[j];
                    ans = min(ans, abs(L-x) + abs(R-x));
                }
            }
        }
    }
    
    cout << ans << '\n';

    return 0;
}

Subtask #1

10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2396 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	1 ms	2396 KB	Output is correct
4	Correct	0 ms	2396 KB	Output is correct
5	Correct	1 ms	2512 KB	Output is correct
6	Correct	1 ms	2648 KB	Output is correct
7	Correct	1 ms	2396 KB	Output is correct
8	Correct	1 ms	2396 KB	Output is correct
9	Correct	1 ms	2396 KB	Output is correct

Subtask #2

20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2396 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	1 ms	2396 KB	Output is correct
4	Correct	0 ms	2396 KB	Output is correct
5	Correct	1 ms	2512 KB	Output is correct
6	Correct	1 ms	2648 KB	Output is correct
7	Correct	1 ms	2396 KB	Output is correct
8	Correct	1 ms	2396 KB	Output is correct
9	Correct	1 ms	2396 KB	Output is correct
10	Correct	12 ms	2652 KB	Output is correct
11	Correct	42 ms	2908 KB	Output is correct
12	Correct	44 ms	3048 KB	Output is correct
13	Correct	50 ms	2908 KB	Output is correct
14	Correct	2 ms	2396 KB	Output is correct
15	Correct	42 ms	2908 KB	Output is correct
16	Correct	42 ms	2964 KB	Output is correct
17	Correct	42 ms	2908 KB	Output is correct
18	Correct	42 ms	2652 KB	Output is correct
19	Correct	42 ms	2904 KB	Output is correct
20	Correct	42 ms	2884 KB	Output is correct
21	Correct	49 ms	2652 KB	Output is correct
22	Correct	42 ms	2908 KB	Output is correct

Subtask #3

0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2396 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	1 ms	2396 KB	Output is correct
4	Correct	0 ms	2396 KB	Output is correct
5	Correct	1 ms	2512 KB	Output is correct
6	Correct	1 ms	2648 KB	Output is correct
7	Correct	1 ms	2396 KB	Output is correct
8	Correct	1 ms	2396 KB	Output is correct
9	Correct	1 ms	2396 KB	Output is correct
10	Correct	12 ms	2652 KB	Output is correct
11	Correct	42 ms	2908 KB	Output is correct
12	Correct	44 ms	3048 KB	Output is correct
13	Correct	50 ms	2908 KB	Output is correct
14	Correct	2 ms	2396 KB	Output is correct
15	Correct	42 ms	2908 KB	Output is correct
16	Correct	42 ms	2964 KB	Output is correct
17	Correct	42 ms	2908 KB	Output is correct
18	Correct	42 ms	2652 KB	Output is correct
19	Correct	42 ms	2904 KB	Output is correct
20	Correct	42 ms	2884 KB	Output is correct
21	Correct	49 ms	2652 KB	Output is correct
22	Correct	42 ms	2908 KB	Output is correct
23	Execution timed out	2040 ms	6820 KB	Time limit exceeded
24	Halted	0 ms	0 KB	-