結果

問題 No.2366 登校
ユーザー siganaisiganai
提出日時 2023-06-30 22:50:00
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 928 ms / 4,000 ms
コード長 5,519 bytes
コンパイル時間 2,441 ms
コンパイル使用メモリ 224,720 KB
実行使用メモリ 56,764 KB
最終ジャッジ日時 2023-09-03 03:00:30
合計ジャッジ時間 8,879 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,376 KB
testcase_01 AC 2 ms
4,376 KB
testcase_02 AC 1 ms
4,380 KB
testcase_03 AC 2 ms
4,376 KB
testcase_04 AC 1 ms
4,380 KB
testcase_05 AC 1 ms
4,376 KB
testcase_06 AC 1 ms
4,376 KB
testcase_07 AC 4 ms
4,380 KB
testcase_08 AC 1 ms
4,380 KB
testcase_09 AC 2 ms
4,376 KB
testcase_10 AC 2 ms
4,376 KB
testcase_11 AC 1 ms
4,376 KB
testcase_12 AC 396 ms
25,000 KB
testcase_13 AC 378 ms
24,884 KB
testcase_14 AC 390 ms
24,956 KB
testcase_15 AC 357 ms
24,880 KB
testcase_16 AC 1 ms
4,376 KB
testcase_17 AC 386 ms
24,936 KB
testcase_18 AC 392 ms
24,900 KB
testcase_19 AC 387 ms
24,980 KB
testcase_20 AC 392 ms
24,884 KB
testcase_21 AC 402 ms
25,100 KB
testcase_22 AC 346 ms
24,876 KB
testcase_23 AC 3 ms
4,376 KB
testcase_24 AC 3 ms
4,376 KB
testcase_25 AC 928 ms
56,636 KB
testcase_26 AC 891 ms
56,764 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

//#pragma GCC target("avx")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#define debug(...) (static_cast<void>(0))
#endif
using namespace std;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using pii = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vpii = vector<pii>;
using vpll = vector<pll>;
using vs = vector<string>;
template<class T> using pq = priority_queue<T, vector<T>, greater<T>>;
#define overload4(_1, _2, _3, _4, name, ...) name
#define overload3(a,b,c,name,...) name
#define rep1(n) for (ll UNUSED_NUMBER = 0; UNUSED_NUMBER < (n); ++UNUSED_NUMBER)
#define rep2(i, n) for (ll i = 0; i < (n); ++i)
#define rep3(i, a, b) for (ll i = (a); i < (b); ++i)
#define rep4(i, a, b, c) for (ll i = (a); i < (b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep1(n) for(ll i = (n) - 1;i >= 0;i--)
#define rrep2(i,n) for(ll i = (n) - 1;i >= 0;i--)
#define rrep3(i,a,b) for(ll i = (b) - 1;i >= (a);i--)
#define rrep4(i,a,b,c) for(ll i = (a) + ((b)-(a)-1) / (c) * (c);i >= (a);i -= c)
#define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)
#define all1(i) begin(i) , end(i)
#define all2(i,a) begin(i) , begin(i) + a
#define all3(i,a,b) begin(i) + a , begin(i) + b
#define all(...) overload3(__VA_ARGS__, all3, all2, all1)(__VA_ARGS__)
#define sum(...) accumulate(all(__VA_ARGS__),0LL)
template<class T> bool chmin(T &a, const T &b){ if(a > b){ a = b; return 1; } else return 0; }
template<class T> bool chmax(T &a, const T &b){ if(a < b){ a = b; return 1; } else return 0; }
template<class T> auto min(const T& a){return *min_element(all(a));}
template<class T> auto max(const T& a){return *max_element(all(a));}
template<class... Ts> void in(Ts&... t);
#define INT(...) int __VA_ARGS__; in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__; in(__VA_ARGS__)
#define STR(...) string __VA_ARGS__; in(__VA_ARGS__)
#define CHR(...) char __VA_ARGS__; in(__VA_ARGS__)
#define DBL(...) double __VA_ARGS__; in(__VA_ARGS__)
#define LD(...) ld __VA_ARGS__; in(__VA_ARGS__)
#define VEC(type, name, size) vector<type> name(size); in(name)
#define VV(type, name, h, w) vector<vector<type>> name(h, vector<type>(w)); in(name)
ll intpow(ll a, ll b){ ll ans = 1; while(b){if(b & 1) ans *= a; a *= a; b /= 2;} return ans;}
ll modpow(ll a, ll b, ll p){ ll ans = 1; a %= p;if(a < 0) a += p;while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }
ll GCD(ll a,ll b) { if(a == 0 || b == 0) return 0; if(a % b == 0) return b; else return GCD(b,a%b);}
ll LCM(ll a,ll b) { if(a == 0) return b; if(b == 0) return a;return a / GCD(a,b) * b;}
namespace IO{
#define VOID(a) decltype(void(a))
struct setting{ setting(){cin.tie(nullptr); ios::sync_with_stdio(false);fixed(cout); cout.precision(12);}} setting;
template<int I> struct P : P<I-1>{};
template<> struct P<0>{};
template<class T> void i(T& t){ i(t, P<3>{}); }
void i(vector<bool>::reference t, P<3>){ int a; i(a); t = a; }
template<class T> auto i(T& t, P<2>) -> VOID(cin >> t){ cin >> t; }
template<class T> auto i(T& t, P<1>) -> VOID(begin(t)){ for(auto&& x : t) i(x); }
template<class T, size_t... idx> void ituple(T& t, index_sequence<idx...>){
    in(get<idx>(t)...);}
template<class T> auto i(T& t, P<0>) -> VOID(tuple_size<T>{}){
    ituple(t, make_index_sequence<tuple_size<T>::value>{});}
#undef VOID
}
#define unpack(a) (void)initializer_list<int>{(a, 0)...}
template<class... Ts> void in(Ts&... t){ unpack(IO :: i(t)); }
#undef unpack
static const double PI = 3.1415926535897932;
template <class F> struct REC {
    F f;
    REC(F &&f_) : f(forward<F>(f_)) {}
    template <class... Args> auto operator()(Args &&...args) const { return f(*this, forward<Args>(args)...); }};
constexpr int mod = 1000000007;
//constexpr int mod = 998244353;

int dx[] = {1,-1,0,0};
int dy[] = {0,0,1,-1};

int main() {
    INT(n,m,k,t);
    vi a(k),b(k),c(k),d(k);
    rep(i,k) cin >> a[i] >> b[i] >> c[i] >> d[i];
    vvi pos(n,vi(m,-1));
    rep(i,k) {
        a[i]--,b[i]--;
        c[i]--;
        pos[a[i]][b[i]] = i;
    }
    if(n + m - 2 <= t) {
        cout << 0 << '\n';
        return 0;
    }
    int f = 0;
    rep(i,k) {
        if(c[i] > 0) f = 1;
    }
    if(!f) {
        cout << -1 << '\n';
        return 0;
    }
    
    vvvl dp(1001,vvl(n,vl(m,1e18)));
    dp[n+m-2-t][0][0] = 0;
    pq<tuple<ll,int,int,int>> q;
    q.emplace(0,n+m-2-t,0,0);
    
    while(!q.empty()) {
        auto [cost,need,x,y] = q.top();
        q.pop();
        if(dp[need][x][y] != cost) continue;
        if(pos[x][y] != -1) {
            if(chmin(dp[max(need - c[pos[x][y]],0)][x][y],cost + d[pos[x][y]])) {
                q.emplace(cost + d[pos[x][y]],max(need - c[pos[x][y]],0),x,y);
            }
        }
        if(need < 1000) {
            if(chmin(dp[need + 1][x][y],cost)) {
                q.emplace(cost,need + 1,x,y);
            }
        }
        
        rep(i,4) {
            int nx = dx[i] + x,ny = dy[i] + y;
            if(0 <= nx && nx < n && 0 <= ny && ny < m && need + (i & 1) <= 1000) {
                if(chmin(dp[need + (i & 1)][nx][ny],cost)) q.emplace(cost,need + (i & 1),nx,ny);
            }
        }
        
    }
    cout << dp[0][n-1][m-1] << '\n';
    
}
0