제출 #1047423

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1047423		Mher777	Text editor (CEOI24_editor)	C++17	100 / 100	601 ms	378808 KiB

Main

#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_64 rnd(7069);

/* -------------------- 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 = 1000005;
int a[N], dp_up[N], dp_down[N], vert[N * 2][2], st[N][25], cnt[5005][5005];
ll dist[N * 2];
pii gag[N * 2];
vector<pair<int, ll>> g[N * 2];
int n, xs, ys, xe, ye, up_s, down_s, m, anss;

void bld() {
    int lg = log2(n);
    for (int l = 1; l <= lg; ++l) {
        for (int i = 1; (i + (1 << l) - 1) <= n; ++i) {
            st[i][l] = min(st[i][l - 1], st[i + (1 << (l - 1))][l - 1]);
        }
    }
}

int qry(int l, int r) {
    int lg = log2(r - l + 1);
    return min(st[l][lg], st[r - (1 << lg) + 1][lg]);
}

void dijkstra() {
    for (int i = 1; i <= m; ++i) {
        dist[i] = MAXL;
    }
    priority_queue<pair<int, ll>> pq;
    dist[vert[xs][0]] = ys - 1;
    pq.push({ vert[xs][0],-dist[vert[xs][0]] });
    //cout << gag[vert[xs][0]].ff << " " << gag[vert[xs][0]].ss << " " << dist[vert[xs][0]] << '\n';
    for (int i = up_s + 1; i <= down_s - 1; ++i) {
        dist[vert[i][1]] = abs(xs - gag[vert[i][1]].ff) + abs(ys - gag[vert[i][1]].ss);
        //cout << gag[vert[i][1]].ff << " " << gag[vert[i][1]].ss << " " << dist[vert[i][1]] << '\n';
        pq.push({ vert[i][1],-dist[vert[i][1]] });
    }
    if (up_s) {
        dist[vert[up_s][1]] = xs - up_s;
        pq.push({ vert[up_s][1],-dist[vert[up_s][1]] });
        //cout << gag[vert[up_s][1]].ff << " " << gag[vert[up_s][1]].ss << " " << dist[vert[up_s][1]] << '\n';
    }
    if (down_s != n + 1) {
        dist[vert[down_s][1]] = down_s - xs;
        pq.push({ vert[down_s][1],-dist[vert[down_s][1]] });
        //cout << gag[vert[down_s][1]].ff << " " << gag[vert[down_s][1]].ss << " " << dist[vert[down_s][1]] << '\n';
    }
    while (!pq.empty()) {
        int u = pq.top().ff;
        ll her = -pq.top().ss;
        pq.pop();
        if (her > dist[u]) continue;
        for (auto to : g[u]) {
            if (dist[to.ff] > dist[u] + to.ss) {
                dist[to.ff] = dist[u] + to.ss;
                pq.push({ to.ff,-dist[to.ff] });
            }
        }
    }
}


void bfs(int x, int y) {
    cout << "EXPECTED: ";
    queue<pii> q;
    q.push({ x,y });
    cnt[x][y] = 1;
    while (!q.empty()) {
        x = q.front().ff, y = q.front().ss;
        if (x == xe && y == ye) {
            anss = cnt[x][y] - 1;
            cout << anss;
            exit(0);
        }
        q.pop();
        int x1, y1;
        if (x > 1) {
            x1 = x - 1, y1 = min(y, a[x1]);
            if (!cnt[x1][y1]) {
                cnt[x1][y1] = cnt[x][y] + 1;
                q.push({ x1,y1 });
            }
        }
        if (x < n) {
            x1 = x + 1, y1 = min(y, a[x1]);
            if (!cnt[x1][y1]) {
                cnt[x1][y1] = cnt[x][y] + 1;
                q.push({ x1,y1 });
            }
        }
        x1 = x, y1 = y + 1;
        if (y1 > a[x1]) {
            ++x1, y1 = 1;
        }
        if (x1 != n + 1 && !cnt[x1][y1]) {
            cnt[x1][y1] = cnt[x][y] + 1;
            q.push({ x1,y1 });
        }
        x1 = x, y1 = y - 1;
        if (y1 <= 0) {
            --x1;
            if (x1 != 0) y1 = a[x1];
        }
        if (x1 != 0 && !cnt[x1][y1]) {
            cnt[x1][y1] = cnt[x][y] + 1;
            q.push({ x1,y1 });
        }
    }
}


void slv() {
    cin >> n >> xs >> ys >> xe >> ye;
    down_s = n + 1;
    for (int i = 1; i <= n; ++i) {
        cin >> a[i];
        ++a[i];
        st[i][0] = a[i];
        int ind = i - 1;
        while (ind) {
            if (a[ind] < a[i]) {
                break;
            }
            ind = dp_up[ind];
        }
        dp_up[i] = ind;
    }
    bld();
    for (int i = n; i >= 1; --i) {
        int ind = i + 1;
        while (ind <= n) {
            if (a[ind] < a[i]) {
                break;
            }
            ind = dp_down[ind];
        }
        dp_down[i] = ind;
    }
    for (int i = 1; i <= n; ++i) {
        vert[i][0] = ++m;
        gag[m] = { i, 1 };
        if (a[i] == 1) {
            vert[i][1] = m;
            continue;
        }
        vert[i][1] = ++m;
        gag[m] = { i,a[i] };
    }
    for (int i = 1; i <= n; ++i) {
        if (i < n) {
            g[vert[i][0]].pub({ vert[i + 1][0],1 });
            g[vert[i + 1][0]].pub({ vert[i][0],1 });
        }
        if (dp_up[i]) {
            //cout << vert[i][1] << " " << vert[dp_up[i]][1] << " " << i - dp_up[i] << '\n';
            g[vert[i][1]].pub({ vert[dp_up[i]][1], i - dp_up[i] });
        }
        if (dp_down[i] != n + 1) {
            //cout << vert[i][1] << " " << vert[dp_down[i]][1] << " " << dp_down[i] - i << '\n';
            g[vert[i][1]].pub({ vert[dp_down[i]][1], dp_down[i] - i });
        }
        if (i != n) {
            //cout << vert[i][1] << " " << vert[i + 1][0] << " " << 1 << '\n';
            g[vert[i][1]].pub({ vert[i + 1][0],1 });
        }
        if (i != 1) {
            //cout << vert[i][0] << " " << vert[i - 1][1] << " " << 1 << '\n';
            g[vert[i][0]].pub({ vert[i - 1][1],1 });
        }
    }
    gag[m + 1] = { xs,ys };
    for (int i = xs - 1; i >= 1; --i) {
        if (a[i] < ys) {
            up_s = i;
            break;
        }
    }
    for (int i = xs + 1; i <= n; ++i) {
        if (a[i] < ys) {
            down_s = i;
            break;
        }
    }
    dijkstra();
    ll ans = MAXL;
    for (int i = 1; i <= m + 1; ++i) {
        int x = gag[i].ff, y = gag[i].ss;
        if (x == xe) {
            ans = min(ans, dist[i] + abs(y - ye));
            continue;
        }
        if (qry(min(x, xe), max(x, xe)) >= min(y, ye)) {
            ans = min(ans, dist[i] + abs(x - xe) + abs(y - ye));
        }
    }
    //cout << "PROGRAM: ";
    cout << ans << '\n';
    //bfs(xs, ys);
}

/*
10
1 4
9 8
3 5 8 4 3 4 0 1 9 0
*/

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

void precalc() {
    return;
}

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

컴파일 시 표준 에러 (stderr) 메시지

Main.cpp: In function 'll range_sum(ll, ll)':
Main.cpp:97:21: warning: unused variable 'cnt' [-Wunused-variable]
   97 |     ll dif = a - 1, cnt = b - a + 1;
      |                     ^~~
Main.cpp: In function 'll bin_to_dec(std::string)':
Main.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++) {
      |                     ~~^~~~~~~~~~

• Subtask 0: 0 / 0
• Subtask 1: 5 / 5
• Subtask 2: 14 / 14
• Subtask 3: 26 / 26
• Subtask 4: 11 / 11
• Subtask 5: 44 / 44