# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
704855 | PixelCat | Zemljište (COCI22_zemljiste) | C++14 | 453 ms | 2388 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define For(i, a, b) for(int i = a; i <= b; i++)
#define Forr(i, a, b) for(int i = a; i >= b; i--)
#define F first
#define S second
#define sz(x) ((int)x.size())
#define all(x) x.begin(), x.end()
#define eb emplace_back
#define int LL
using namespace std;
using LL = long long;
using pii = pair<int, int>;
const int MAXN = 510;
int s[MAXN][MAXN];
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(0);
// nya ><
int n, m, a, b; cin >> n >> m >> a >> b;
For(i, 1, n) For(j, 1, m) {
cin >> s[i][j];
s[i][j] += s[i - 1][j];
}
auto cost = [&](int k) {
return abs(k - a) + abs(k - b);
};
int mn = cost(s[1][1]);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |