oj.uz

Submission #704872

# Submission time Handle Problem Language Result Execution time Memory
704872 2023-03-03T06:16:18 Z Cookie197 Zemljište (COCI22_zemljiste) C++17
30 / 70
 2000 ms 4496 KB 
#include<iostream>
#include<vector>
#include<algorithm>
#include<set>
#include<map>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define endl "\n"
#define mp make_pair
#define out(x) cout << #x << " = " << x << endl

int n,m;
ll arr[505][505],pre[505][505],a,b;
signed main(){
    ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    cin>>n>>m>>a>>b;
    for (int i=1;i<=n;i++){
        for (int j=1;j<=m;j++) cin>>arr[i][j], pre[i][j] = pre[i-1][j] + pre[i][j-1] - pre[i-1][j-1] + arr[i][j];
    }

    ll ans = 1e18;
    for (int i=1;i<=n;i++) for (int j=i;j<=n;j++){
        for (int k=1;k<=m;k++) for (int l=k;l<=m;l++){
            ll x = pre[j][l] - pre[j][k-1] - pre[i-1][l] + pre[i-1][k-1];
            ans = min(ans, abs(a-x) + abs(b-x));
        }
    }
    cout<<ans<<endl;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 456 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 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 456 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 16 ms 852 KB Output is correct
11 Correct 57 ms 1108 KB Output is correct
12 Correct 56 ms 1108 KB Output is correct
13 Correct 62 ms 1180 KB Output is correct
14 Correct 2 ms 460 KB Output is correct
15 Correct 58 ms 1100 KB Output is correct
16 Correct 56 ms 1180 KB Output is correct
17 Correct 55 ms 1188 KB Output is correct
18 Correct 58 ms 1108 KB Output is correct
19 Correct 55 ms 1108 KB Output is correct
20 Correct 60 ms 1040 KB Output is correct
21 Correct 55 ms 1148 KB Output is correct
22 Correct 54 ms 1152 KB Output is correct

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 456 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 16 ms 852 KB Output is correct
11 Correct 57 ms 1108 KB Output is correct
12 Correct 56 ms 1108 KB Output is correct
13 Correct 62 ms 1180 KB Output is correct
14 Correct 2 ms 460 KB Output is correct
15 Correct 58 ms 1100 KB Output is correct
16 Correct 56 ms 1180 KB Output is correct
17 Correct 55 ms 1188 KB Output is correct
18 Correct 58 ms 1108 KB Output is correct
19 Correct 55 ms 1108 KB Output is correct
20 Correct 60 ms 1040 KB Output is correct
21 Correct 55 ms 1148 KB Output is correct
22 Correct 54 ms 1152 KB Output is correct
23 Execution timed out 2041 ms 4496 KB Time limit exceeded
24 Halted 0 ms 0 KB -