제출 #1044184

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1044184		c2zi6	Text editor (CEOI24_editor)	C++14	5 / 100	2 ms	604 KiB

Main

#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define replr(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define reprl(i, a, b) for (int i = int(a); i >= int(b); --i)
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define mkp(a, b) make_pair(a, b)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VPI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<VPI> VVPI;
typedef pair<ll, ll> PLL;
typedef vector<ll> VL;
typedef vector<PLL> VPL;
typedef vector<VL> VVL;
typedef vector<VVL> VVVL;
typedef vector<VPL> VVPL;
template<class T> T setmax(T& a, T b) {if (a < b) return a = b; return a;}
template<class T> T setmin(T& a, T b) {if (a < b) return a; return a = b;}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<typename T>
using indset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
 
void solve() {
    int n;
    cin >> n;
    int r1, c1, r2, c2;
    cin >> r1 >> c1 >> r2 >> c2;
    r1--, c1--, r2--, c2--;
    VI a(n);
    for (int& x : a) cin >> x;
    priority_queue<pair<ll, PII>> pq;
    map<PII, int> vis;
    map<PII, ll> dist;
    pq.push({0, {r1, c1}});
    while (pq.size()) {
        PII u = pq.top().ss;
        pq.pop();
        if (vis[u]) continue;
        vis[u] = true;
        vector<pair<PII, ll>> harevan;
        if (true) {
            auto[r, c] = u;
            if (r) {
                harevan.pb({{r-1, min(c, a[r-1])}, 1});
                if (c == 0) harevan.pb({{r-1, a[r-1]}, 1});
            }
            if (r != n-1) {
                harevan.pb({{r+1, min(c, a[r+1])}, 1});
                if (c == a[r]) harevan.pb({{r+1, 0}, 1});
            }
            harevan.pb({{r, a[r]}, a[r]-c});
            harevan.pb({{r, 0}, c});
        }
        for (auto[v, w] : harevan) {
            if (!dist.count(v) || dist[u] + w < dist[v]) {
                dist[v] = dist[u] + w;
                pq.push({dist[v], v});
            }
        }
    }
    ll ans = 1e18;
    for (auto[u, d] : dist) {
        if (u.ff == r2) {
            /*cout << "Distance to (" << u.ff << ", " << u.ss << ") = " << d << endl;*/
            setmin(ans, 1ll * abs(u.ss - c2) + d);
        }
    }
    cout << ans << endl;
}
 
int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL), cout.tie(NULL);
	/*freopen("mincross.in", "r", stdin); */
	/*freopen("test.out", "w", stdout); */
	int t = 1;
	/*cin >> t; */
	while (t--) solve();
}
 
 

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

Main.cpp: In function 'void solve()':
Main.cpp:52:17: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   52 |             auto[r, c] = u;
      |                 ^
Main.cpp:64:18: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   64 |         for (auto[v, w] : harevan) {
      |                  ^
Main.cpp:72:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   72 |     for (auto[u, d] : dist) {
      |              ^

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