#886369 (C++17) No.2366 登校

提出ソース

結果

問題	No.2366 登校
ユーザー	dyktr_06
提出日時	2023-06-30 23:49:10
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	595 ms / 4,000 ms
コード長	6,211 bytes
コンパイル時間	6,004 ms
コンパイル使用メモリ	312,988 KB
実行使用メモリ	345,284 KB
最終ジャッジ日時	2024-06-12 07:53:07
合計ジャッジ時間	10,057 ms
ジャッジサーバーID （参考情報）	judge4 / judge5

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	1 ms 6,812 KB
testcase_01	AC	2 ms 6,816 KB
testcase_02	AC	1 ms 6,940 KB
testcase_03	AC	1 ms 6,944 KB
testcase_04	AC	2 ms 6,944 KB
testcase_05	AC	2 ms 6,944 KB
testcase_06	AC	2 ms 6,940 KB
testcase_07	AC	1 ms 6,944 KB
testcase_08	AC	2 ms 6,940 KB
testcase_09	AC	2 ms 6,940 KB
testcase_10	AC	2 ms 6,940 KB
testcase_11	AC	1 ms 6,940 KB
testcase_12	AC	158 ms 57,580 KB
testcase_13	AC	154 ms 57,616 KB
testcase_14	AC	160 ms 57,616 KB
testcase_15	AC	163 ms 57,616 KB
testcase_16	AC	2 ms 6,940 KB
testcase_17	AC	163 ms 57,552 KB
testcase_18	AC	155 ms 57,448 KB
testcase_19	AC	155 ms 57,528 KB
testcase_20	AC	160 ms 57,644 KB
testcase_21	AC	156 ms 57,476 KB
testcase_22	AC	130 ms 56,732 KB
testcase_23	AC	4 ms 6,940 KB
testcase_24	AC	595 ms 345,284 KB
testcase_25	AC	564 ms 224,164 KB
testcase_26	AC	566 ms 224,048 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#include <bits/stdc++.h>
#include <atcoder/all>

using namespace std;
using namespace atcoder;

#define overload4(_1, _2, _3, _4, name, ...) name
#define rep1(n) for(int i = 0; i < (int)(n); ++i)
#define rep2(i, n) for(int i = 0; i < (int)(n); ++i)
#define rep3(i, a, b) for(int i = (a); i < (int)(b); ++i)
#define rep4(i, a, b, c) for(int i = (a); i < (int)(b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)

#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; --i)
#define ALL(a) a.begin(), a.end()
#define Sort(a) sort(a.begin(), a.end())
#define RSort(a) sort(a.rbegin(), a.rend())

typedef long long int ll;
typedef unsigned long long ul;
typedef long double ld;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector<char> vc;
typedef vector<string> vst;
typedef vector<double> vd;
typedef vector<long double> vld;
typedef pair<long long, long long> P;

template<class T> long long sum(const T& a){ return accumulate(a.begin(), a.end(), 0LL); }
template<class T> auto min(const T& a){ return *min_element(a.begin(), a.end()); }
template<class T> auto max(const T& a){ return *max_element(a.begin(), a.end()); }

const long long MINF = 0x7fffffffffff;
const long long INF = 0x1fffffffffffffff;
const long long MOD = 998244353;
const long double EPS = 1e-9;
const long double PI = acos(-1);
 
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p){ is >> p.first >> p.second; return is; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){ os << "(" << p.first << ", " << p.second << ")"; return os; }
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for(T &in : v) is >> in; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &v){ for(int i = 0; i < (int) v.size(); ++i){ os << v[i] << (i + 1 != (int) v.size() ? " " : ""); } return os; }
template <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp){ for(auto &[key, val] : mp){ os << key << ":" << val << " "; } return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, queue<T> q){ while(q.size()){ os << q.front() << " "; q.pop(); } return os; }
template <typename T> ostream &operator<<(ostream &os, deque<T> q){ while(q.size()){ os << q.front() << " "; q.pop_front(); } return os; }
template <typename T> ostream &operator<<(ostream &os, stack<T> st){ while(st.size()){ os << st.top() << " "; st.pop(); } return os; }
template <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq){ while(pq.size()){ os << pq.top() << " "; pq.pop(); } return os; }

template<class T, class U> inline T vin(T& vec, U n) { vec.resize(n); for(int i = 0; i < (int) n; ++i) cin >> vec[i]; return vec; }
template<class T> inline void vout(T vec, string s = "\n"){ for(auto x : vec) cout << x << s; }
template<class... T> void in(T&... a){ (cin >> ... >> a); }
void out(){ cout << '\n'; }
template<class T, class... Ts> void out(const T& a, const Ts&... b){ cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; }
template<class T, class U> void inGraph(vector<vector<T>>& G, U n, U m, bool directed = false){ G.resize(n); for(int i = 0; i < m; ++i){ int a, b; cin >> a >> b; a--, b--; G[a].push_back(b); if(!directed) G[b].push_back(a); } }

template <typename T>
vector<long long> dijkstra(const vector<vector<array<long long, 2>>> &G, T x){
    const long long INF = 0x1fffffffffffffff;
    vector<long long> cost((int) G.size(), INF);
    using P = pair<long long, long long>;
    priority_queue<P, vector<P>, greater<>> q;
    cost[x] = 0;
    q.emplace(0, x);
    
    while(q.size()){
        auto [c, at] = q.top();
        q.pop();
        if(c > cost[at]) continue;
        for(auto& [to, t] : G[at]){
            if(cost[to] > c + t){
                cost[to] = c + t;
                q.emplace(cost[to], to);
            }
        }
    }
    return cost;
}

ll n, m, k, T;
vll a, b, c, d;

void input(){
    in(n, m, k, T);
    a.resize(k), b.resize(k), c.resize(k), d.resize(k);
    rep(i, k) in(a[i], b[i], c[i], d[i]);
}

ll id(ll t, ll i, ll j){
    t += (n + m - 2);
    return t * (n * m) + i * (m) + j;
}

vll dx = {0, 1};
vll dy = {1, 0};

void solve(){
    if(T >= n + m - 2){
        out(0);
        return;
    }
    rep(i, k) a[i]--, b[i]--;
    vector<vector<array<ll, 2>>> G(n * m * (n + m - 2) * 2);
    rep(t, -(n + m - 2), n + m - 2){
        rep(i, n) rep(j, m){
            rep(dir, 2){
                ll x = i + dx[dir], y = j + dy[dir];
                if(0 <= x && x < n && 0 <= y && y < m && t < n + m - 3){
                    G[id(t, i, j)].push_back({id(t + 1, x, y), 0});
                    G[id(t, x, y)].push_back({id(t + 1, i, j), 0});
                }
            }
        }
        rep(i, k){
            ll prev = max(-(n + m - 2), t - c[i] + 1);
            G[id(t, a[i], b[i])].push_back({id(prev, a[i], b[i]), d[i]});
        }
    }
    vll cost = dijkstra(G, id(0, 0, 0));
    ll ans = INF;
    rep(t, -(n + m - 2), n + m - 2){
        rep(i, n) rep(j, m){
            ll need = (n - i - 1) + (m - j - 1);
            if(need + t <= T){
                chmin(ans, cost[id(t, i, j)]);
            }
        }
    }
    if(ans == INF){
        out(-1);
    }else{
        out(ans);
    }
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(20);
    
    input();
    solve();
}

yukicoder

結果

テストケース

ソースコード