oj.uz

Submission #699116

# Submission time Handle Problem Language Result Execution time Memory
699116 2023-02-15T16:10:44 Z Filya Zemljište (COCI22_zemljiste) C++14
70 / 70
 1059 ms 5708 KB 
/////////////////////include/////////////////////
//#include <bits/stdc++.h>
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <cassert>
#include <set>
#include <map>
#include <unordered_map>
#include <vector>
#include <stack>
#include <queue>
#include <iomanip>
#include <bitset>
#include <stdio.h>
#include <climits>
#include <numeric>
using namespace std;
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
//template <typename T>
//using ordered_set = tree <T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
/////////////////////define/////////////////////
#define ci(x) if(x) cout << "YES" << '\n'; else cout << "NO" << '\n';
#define cii(x) if(check(x))
#define MOD 1000000007
#define MOD2 998244353
#define oo 1e9
#define ool 1e18L
#define pii pair<int, int>
#define pll pair<long long, long long>
#define mii map<int, int>
#define vi vector<int>
#define vpi vector<pair<int, int>>
#define vll vector <ll>
#define ff first
#define ss second
#define mp make_pair
#define ll long long
#define ld long double
#define pb push_back
#define eb emplace_back
#define pob pop_back
#define lb lower_bound
#define ub upper_bound
#define bs binary_search
#define sz(x) (int((x).size()))
#define all(x) (x).begin(), (x).end()
#define alll(x) (x), (x) + n
#define clr(x) (x).clear();
#define fri(x) for(int i = 0; i < x; ++i)
#define frj(x) for(int j = 0; j < x; ++j)
#define frp(x) for(int p = 0; p < x; ++p)
#define frr(a, b) for(int i = a; i < b; ++i)
#define frrj(a, b) for(int j = a; j < b; ++j)
#define fra(x) for(int i = 0; i < x; ++i) cin >> a[i];
#define frb(x) for(int i = 0; i < x; ++i) cin >> b[i];
#define frs(x) for(auto it = x.begin(); it != x.end(); ++it)
#define fr(x) for(auto it : x) //el
#define fastio ios_base::sync_with_stdio(false); cin.tie(0);
#define dbg(x) cerr << #x << ": " << x << endl;
#define ce(x) cout << x << endl;
#define uniq(x) x.resize(unique(all(x)) - x.begin()); //make all one after sorting
#define blt __builtin_popcount
/////////////////////print array, vector, deque, set, multiset, pair, map /////////////////////
void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(long double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } cerr << "]"; cout << endl;}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(stack <T> v) {cerr << "[ "; stack<T> s = v; while(s.size()) {T i = s.top(); print(i); s.pop(); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(queue <T> v) {cerr << "[ "; queue<T> s = v; while(s.size()) {T i = s.front(); print(i); s.pop(); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(deque <T> v) {cerr << "[ "; deque<T> s = v; while(s.size()) {T i = s.front(); print(i); s.pop_front(); cerr << " ";} cerr << "]"; cout << endl;}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T, class V> void print(unordered_map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
/////////////////////code/////////////////////
int n, m, c[505][505];
ll pref[505][505], a, b;
ll sum(int x1, int y1, int x2, int y2) {
    return pref[x2][y2] - pref[x1 - 1][y2] - pref[x2][y1 - 1] + pref[x1 - 1][y1 - 1];
}
int main() {
    fastio;
    cin >> n >> m >> a >> b;
    if(a > b) swap(a, b);
    fri(n) frj(m) cin >> c[i][j];
    for(int i = 1; i <= n; i++)
        for(int j = 1; j <= m; j++)
            pref[i][j] = c[i - 1][j - 1] + pref[i - 1][j] + pref[i][j - 1] - pref[i - 1][j - 1];
    ll answ = 1e18;
    for(int i = 1; i <= n; i++) {
        for(int j = 1; j <= m; j++) {
            for(int p = i; p <= n; p++) {
                int l = j, r = m, ans = -1, mid;
                while(l <= r) {
                    mid = (l + r) / 2;
                    if(sum(i, j, p, mid) <= a) {
                        l = mid + 1;
                        ans = mid;
                    }
                    else {
                        // dbg(sum(i, j, p, mid))
                        r = mid - 1;
                    }
                }
                if(ans != -1) {
                    ll x = sum(i, j, p, ans + 1);
                    // dbg(ans) dbg(x)
                    if(ans == m) {
                        ll y = sum(i, j, p, ans);
                        answ = min(answ, a + b - 2 * y);
                    }
                    else if(x <= b) //iranc aranqy tiv ka
                        answ = min(answ, b - a);
                    else {
                        ll y = sum(i, j, p, ans);
                        answ = min(answ, a + b - 2 * y);
                        answ = min(answ, 2 * x - (a + b));
                    }
                } else {
                    // dbg(answ)
                    // if(i == 1 && j == 1 && p == 2) dbg(a + b - 2 * y)
                    answ = min(answ, sum(i, j, p, j) - a + abs(sum(i, j, p, j) - b));
                }
                // dbg(answ)
            }
        }
    }
    cout << answ;
    return 0;
}

//	           ♥ ♥ ♥  ♥  ♥    ♥   ♥    ♥
//	           ♥      ♥  ♥     ♥ ♥    ♥ ♥
//	           ♥ ♥ ♥  ♥  ♥      ♥    ♥   ♥
//	           ♥      ♥  ♥      ♥   ♥ ♥ ♥ ♥
//	           ♥      ♥  ♥ ♥ ♥  ♥  ♥       ♥
//
//        God loves Fil, Fil accepts God's will

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 456 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 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 328 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 456 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 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 328 KB Output is correct
10 Correct 3 ms 724 KB Output is correct
11 Correct 7 ms 980 KB Output is correct
12 Correct 7 ms 984 KB Output is correct
13 Correct 6 ms 980 KB Output is correct
14 Correct 1 ms 464 KB Output is correct
15 Correct 6 ms 976 KB Output is correct
16 Correct 7 ms 1028 KB Output is correct
17 Correct 6 ms 980 KB Output is correct
18 Correct 8 ms 976 KB Output is correct
19 Correct 7 ms 980 KB Output is correct
20 Correct 7 ms 852 KB Output is correct
21 Correct 8 ms 852 KB Output is correct
22 Correct 7 ms 852 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 456 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 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 328 KB Output is correct
10 Correct 3 ms 724 KB Output is correct
11 Correct 7 ms 980 KB Output is correct
12 Correct 7 ms 984 KB Output is correct
13 Correct 6 ms 980 KB Output is correct
14 Correct 1 ms 464 KB Output is correct
15 Correct 6 ms 976 KB Output is correct
16 Correct 7 ms 1028 KB Output is correct
17 Correct 6 ms 980 KB Output is correct
18 Correct 8 ms 976 KB Output is correct
19 Correct 7 ms 980 KB Output is correct
20 Correct 7 ms 852 KB Output is correct
21 Correct 8 ms 852 KB Output is correct
22 Correct 7 ms 852 KB Output is correct
23 Correct 944 ms 5700 KB Output is correct
24 Correct 905 ms 5704 KB Output is correct
25 Correct 908 ms 5704 KB Output is correct
26 Correct 896 ms 5700 KB Output is correct
27 Correct 553 ms 4812 KB Output is correct
28 Correct 884 ms 5580 KB Output is correct
29 Correct 881 ms 5580 KB Output is correct
30 Correct 930 ms 5704 KB Output is correct
31 Correct 82 ms 3284 KB Output is correct
32 Correct 908 ms 5700 KB Output is correct
33 Correct 894 ms 5700 KB Output is correct
34 Correct 923 ms 5708 KB Output is correct
35 Correct 903 ms 5700 KB Output is correct
36 Correct 910 ms 5580 KB Output is correct
37 Correct 947 ms 5700 KB Output is correct
38 Correct 895 ms 5700 KB Output is correct
39 Correct 916 ms 5700 KB Output is correct
40 Correct 892 ms 5700 KB Output is correct
41 Correct 1041 ms 4444 KB Output is correct
42 Correct 1034 ms 4444 KB Output is correct
43 Correct 1038 ms 4436 KB Output is correct
44 Correct 1059 ms 4444 KB Output is correct