oj.uz

답안 #1108743

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1108743 2024-11-04T22:44:31 Z Mher777 The Kingdom of JOIOI (JOI17_joioi) C++17
100 / 100
 576 ms 55028 KB 
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <iomanip>
#include <array>
#include <string>
#include <algorithm>
#include <cmath>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <list>
#include <iterator>
#include <numeric>
#include <complex>
#include <utility>
#include <random>
#include <cassert>
#include <fstream>
using namespace std;
mt19937 rnd(time(nullptr));

/* -------------------- Typedefs -------------------- */

typedef int itn;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef float fl;
typedef long double ld;

/* -------------------- Usings -------------------- */

using vi = vector<int>;
using vll = vector<ll>;
using mii = map<int, int>;
using mll = map<ll, ll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

/* -------------------- Defines -------------------- */

#define ff first
#define ss second
#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define mpr make_pair
#define yes cout<<"Yes\n"
#define no cout<<"No\n"
#define all(x) (x).begin(), (x).end()
#define USACO freopen("feast.in", "r", stdin); freopen("feast.out", "w", stdout);

/* -------------------- Constants -------------------- */

const int dx[8] = { -1, 0, 1, 0, -1, -1, 1, 1 };
const int dy[8] = { 0, -1, 0, 1, -1, 1, -1, 1 };
const int MAX = int(1e9 + 5);
const ll MAXL = ll(1e18) + 5ll;
const ll MOD = ll(1000000007);
const ll MOD2 = ll(998244353);

/* -------------------- Functions -------------------- */

void fastio() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
}

void precision(int x) {
    cout.setf(ios::fixed | ios::showpoint);
    cout.precision(x);
}

ll gcd(ll a, ll b) {
    if (a == 0 || b == 0) return(max(a, b));
    while (b) {
        a %= b;
        swap(a, b);
    }
    return a;
}

ll lcm(ll a, ll b) {
    return a / gcd(a, b) * b;
}

ll range_sum(ll a, ll b) {
    if (a > b) return 0ll;
    ll dif = a - 1, cnt = b - a + 1;
    ll ans = ((b - a + 1) * (b - a + 2)) / 2;
    ans += ((b - a + 1) * dif);
    return ans;
}

string dec_to_bin(ll a) {
    string s = "";
    for (ll i = a; i > 0; ) {
        ll k = i % 2;
        i /= 2;
        char c = k + 48;
        s += c;
    }
    if (a == 0) {
        s = "0";
    }
    reverse(all(s));
    return s;
}

ll bin_to_dec(string s) {
    ll num = 0;
    for (int i = 0; i < s.size(); i++) {
        num *= 2ll;
        num += (s[i] - '0');
    }
    return num;
}

ll factorial_by_mod(ll n, ll mod) {
    ll ans = 1;
    ll num;
    for (ll i = 1; i <= n; ++i) {
        num = i % mod;
        ans *= num;
        ans %= mod;
    }
    return ans;
}

bool isPrime(ll a) {
    if (a == 1) return false;
    for (ll i = 2; i * i <= a; i++) {
        if (a % i == 0) return false;
    }
    return true;
}

ll binpow(ll a, ll b) {
    if (!a) return 0;
    ll ans = 1;
    while (b) {
        if (b & 1) {
            ans *= a;
        }
        b >>= 1;
        a *= a;
    }
    return ans;
}

ll binpow_by_mod(ll a, ll b, ll mod) {
    if (!a) return 0;
    ll ans = 1;
    while (b) {
        if (b & 1) {
            ans *= a;
            ans %= mod;
        }
        b >>= 1;
        a *= a;
        a %= mod;
    }
    return ans;
}

/* -------------------- Solution -------------------- */

const int N = 2005;
int a[N][N];
int n, m, mx = 0, mn = MAX;

int check(int dif) {
    int check1 = 2, mx1 = 0, mn1 = MAX, cur_m = m;
    bool f = false;
    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= cur_m; ++j) {
            if (a[i][j] == mx) {
                f = true;
            }
            if (mx - a[i][j] > dif) {
                cur_m = j - 1;
                break;
            }
        }
        for (int j = cur_m + 1; j <= m; ++j) {
            mx1 = max(mx1, a[i][j]);
            mn1 = min(mn1, a[i][j]);
        }
    }
    if (f && mx1 - mn1 <= dif) {
        return true;
    }
    check1 = 2;
    mx1 = 0, mn1 = MAX;
    cur_m = m;
    f = false;
    for (int i = n; i >= 1; --i) {
        for (int j = 1; j <= cur_m; ++j) {
            if (a[i][j] == mx) {
                f = true;
            }
            if (mx - a[i][j] > dif) {
                cur_m = j - 1;
                break;
            }
        }
        for (int j = cur_m + 1; j <= m; ++j) {
            mx1 = max(mx1, a[i][j]);
            mn1 = min(mn1, a[i][j]);
        }
    }
    if (f && mx1 - mn1 <= dif) {
        return true;
    }
    check1 = 2;
    mx1 = 0, mn1 = MAX;
    cur_m = 1;
    f = false;
    for (int i = 1; i <= n; ++i) {
        for (int j = m; j >= cur_m; --j) {
            if (a[i][j] == mx) {
                f = true;
            }
            if (mx - a[i][j] > dif) {
                cur_m = j + 1;
                break;
            }
        }
        for (int j = cur_m - 1; j >= 1; --j) {
            mx1 = max(mx1, a[i][j]);
            mn1 = min(mn1, a[i][j]);
        }
    }
    if (f && mx1 - mn1 <= dif) {
        return true;
    }
    check1 = 2;
    mx1 = 0, mn1 = MAX;
    cur_m = 1;
    f = false;
    for (int i = n; i >= 1; --i) {
        for (int j = m; j >= cur_m; --j) {
            if (a[i][j] == mx) {
                f = true;
            }
            if (mx - a[i][j] > dif) {
                cur_m = j + 1;
                break;
            }
        }
        for (int j = cur_m - 1; j >= 1; --j) {
            mx1 = max(mx1, a[i][j]);
            mn1 = min(mn1, a[i][j]);
        }
    }
    if (f && mx1 - mn1 <= dif) {
        return true;
    }
    return false;
}

void slv() {
    cin >> n >> m;
    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= m; ++j) {
            cin >> a[i][j];
            mx = max(mx, a[i][j]);
            mn = min(mn, a[i][j]);
        }
    }
    int l = 0, r = mx - mn, mid, ans = mx - mn;
    while (l <= r) {
        mid = (l + r) / 2;
        if (check(mid)) {
            ans = mid;
            r = mid - 1;
        }
        else {
            l = mid + 1;
        }
    }
    cout << ans;
}

void cs() {
    int tstc = 1;
    //cin >> tstc;
    while (tstc--) {
        slv();
    }
}

void precalc() {
    return;
}

int main() {
    fastio();
    precalc();
    //precision(0);
    cs();
    return 0;
}

Compilation message

joioi.cpp: In function 'll range_sum(ll, ll)':
joioi.cpp:97:21: warning: unused variable 'cnt' [-Wunused-variable]
   97 |     ll dif = a - 1, cnt = b - a + 1;
      |                     ^~~
joioi.cpp: In function 'll bin_to_dec(std::string)':
joioi.cpp:120:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  120 |     for (int i = 0; i < s.size(); i++) {
      |                     ~~^~~~~~~~~~
joioi.cpp: In function 'int check(int)':
joioi.cpp:181:9: warning: variable 'check1' set but not used [-Wunused-but-set-variable]
  181 |     int check1 = 2, mx1 = 0, mn1 = MAX, cur_m = m;
      |         ^~~~~~

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 476 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct

Subtask #2
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 476 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 2 ms 2640 KB Output is correct
17 Correct 5 ms 2896 KB Output is correct
18 Correct 5 ms 2896 KB Output is correct
19 Correct 5 ms 2896 KB Output is correct
20 Correct 5 ms 2640 KB Output is correct
21 Correct 6 ms 3020 KB Output is correct
22 Correct 10 ms 2908 KB Output is correct
23 Correct 7 ms 2896 KB Output is correct
24 Correct 7 ms 2896 KB Output is correct
25 Correct 6 ms 2896 KB Output is correct
26 Correct 7 ms 2896 KB Output is correct
27 Correct 7 ms 2896 KB Output is correct
28 Correct 7 ms 2896 KB Output is correct

Subtask #3
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 476 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 2 ms 2640 KB Output is correct
17 Correct 5 ms 2896 KB Output is correct
18 Correct 5 ms 2896 KB Output is correct
19 Correct 5 ms 2896 KB Output is correct
20 Correct 5 ms 2640 KB Output is correct
21 Correct 6 ms 3020 KB Output is correct
22 Correct 10 ms 2908 KB Output is correct
23 Correct 7 ms 2896 KB Output is correct
24 Correct 7 ms 2896 KB Output is correct
25 Correct 6 ms 2896 KB Output is correct
26 Correct 7 ms 2896 KB Output is correct
27 Correct 7 ms 2896 KB Output is correct
28 Correct 7 ms 2896 KB Output is correct
29 Correct 382 ms 37448 KB Output is correct
30 Correct 312 ms 37448 KB Output is correct
31 Correct 374 ms 39160 KB Output is correct
32 Correct 377 ms 39020 KB Output is correct
33 Correct 338 ms 34888 KB Output is correct
34 Correct 352 ms 39160 KB Output is correct
35 Correct 576 ms 54868 KB Output is correct
36 Correct 442 ms 49532 KB Output is correct
37 Correct 500 ms 55028 KB Output is correct