結果
| 問題 |
No.2366 登校
|
| ユーザー |
 eQe
|
| 提出日時 | 2025-09-09 01:46:34 |
| 言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 5,886 bytes |
| コンパイル時間 | 4,468 ms |
| コンパイル使用メモリ | 308,920 KB |
| 実行使用メモリ | 19,840 KB |
| 最終ジャッジ日時 | 2025-09-09 01:46:43 |
| 合計ジャッジ時間 | 6,747 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 |
| other | AC * 24 WA * 2 |
ソースコード
#include<bits/stdc++.h>
#if __has_include(<atcoder/all>)
#endif
using namespace std;
#define done(...) return pp(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;lin(__VA_ARGS__)
#define RDVV(T,n,...) vec<T>__VA_ARGS__;fe(refs(__VA_ARGS__),e)e.get().resizes(n);vin(__VA_ARGS__)
#define VV(n,...) RDVV(ll,n,__VA_ARGS__)
#define fo(i,...) for(auto[i,i##stop,i##step]=for_range<ll>(0,__VA_ARGS__);i<i##stop;i+=i##step)
#define fe(a,e,...) for(auto&&__VA_OPT__([)e __VA_OPT__(,__VA_ARGS__]):a)
#define grid_right_down_fe(x,y,nx,ny,H,W) for(ll nx=x,ny=y+1;nx<=x+1;++nx,--ny)if(nx<H&&ny<W)
#define comp_iota(a,op) [&](auto i,auto j){return a[i] op a[j];}
#define defpp template<ostream&o=cout>void pp(const auto&...a){[[maybe_unused]]const char*c="";((o<<c<<a,c=" "),...);o<<'\n';}void epp(const auto&...a){pp<cerr>(a...);}
#define entry defpp void main();void main2();}int main(){my::io();my::main();}namespace my{
namespace my{
void io(){cin.tie(nullptr)->sync_with_stdio(0);cout<<fixed<<setprecision(15);}
using ll=long long;
constexpr auto refs(auto&...a){return array{ref(a)...};}
template<class T>constexpr auto for_range(T s,T b){T a=0;if(s)swap(a,b);return array{a-s,b,1-s*2};}
void lin(auto&...a){(cin>>...>>a);}
void vin(auto&...a){fo(i,(a.size()&...))(cin>>...>>a[i]);}
constexpr ll size10(auto x){x|=1;ll r=0;while(x>0)x/=10,++r;return r;}
template<class T>constexpr ll maxsize10(){return size10(numeric_limits<T>::max());}
bool amin(auto&a,const auto&b){return b<a?a=b,1:0;}
auto max(auto...a){return max(initializer_list<common_type_t<decltype(a)...>>{a...});}
template<class A,class B=A>struct pair{
A a;B b;
pair()=default;
pair(A aa,B bb):a(aa),b(bb){}
auto operator<=>(const pair&)const=default;
};
template<bool is_negative=false>struct infinity{
template<integral T>static constexpr T ones(size_t n){return n?ones<T>(n-1)*10+1:0;}
template<integral T>constexpr operator T()const{static constexpr T v=ones<T>(maxsize10<T>())*(1-is_negative*2);return v;}
};
constexpr infinity oo;
void dec(auto&...a){((--a),...);}
template<class...A>using pack_back_t=tuple_element_t<sizeof...(A)-1,tuple<A...>>;
auto pack_first(const auto&...a){return get<0>(tuple{a...});}
auto pack_back(const auto&...a){return get<sizeof...(a)-1>(tuple{a...});}
}
namespace my{
template<class V>concept vectorial=is_base_of_v<vector<typename remove_cvref_t<V>::value_type>,remove_cvref_t<V>>;
template<class V>constexpr int depth=0;
template<vectorial V>constexpr int depth<V> =depth<typename V::value_type>+1;
template<class T>struct core_t_helper{using type=T;};
template<vectorial V>struct core_t_helper<V>{using type=typename core_t_helper<typename V::value_type>::type;};
template<class T>using core_t=core_t_helper<T>::type;
template<class V>struct vec;
template<int D,class T>struct hvec_helper{using type=vec<typename hvec_helper<D-1,T>::type>;};
template<class T>struct hvec_helper<0,T>{using type=T;};
template<int D,class T>using hvec=hvec_helper<D,T>::type;
template<class V>struct vec:vector<V>{
static constexpr int D=depth<V>+1;
using C=core_t<V>;
using vector<V>::vector;
vec(const auto&...a)requires(sizeof...(a)>=3){resizes(a...);}
void resizes(const auto&...a){if constexpr(sizeof...(a)==D)*this=make(a...,C{});else*this=make(a...);}
static auto make(ll n,const auto&...a){
if constexpr(sizeof...(a)==1)return vec<C>(n,array{a...}[0]);
else return vec<decltype(make(a...))>(n,make(a...));
}
vec&operator--(){fe(*this,e)--e;return*this;}
ll size()const{return vector<V>::size();}
auto pop_back(){auto r=this->back();vector<V>::pop_back();return r;}
vec slice(ll l,ll r)const{return l<r?vec(this->begin()+l,this->begin()+r):vec{};}
auto fold(const auto&f)const{
pair<C,bool>r{};
fe(*this,e){
if constexpr(!vectorial<V>){
if(r.b)f(r.a,e);
else r={e,1};
}else { }
}
return r;
}
auto min()const{return fold([](auto&a,auto b){if(b<a)a=b;}).a;}
template<class F=less<>>auto sort(F f={})const{vec v=*this;ranges::sort(v,f);return v;}
vec reorder_from(vec<int>&o)const{vec res(size());fo(i,size())res[i]=(*this)[o[i]];return res;}
};
template<class...A>requires(sizeof...(A)>=2)vec(const A&...a)->vec<hvec<sizeof...(A)-2,pack_back_t<A...>>>;
template<class T=int>auto iota(ll l,ll r=0){if(l>r)swap(l,r);vec<T>v(r-l);std::iota(v.begin(),v.end(),l);return v;}
template<class T=int>auto iota_sort(ll n,const auto&f){return iota<T>(n).sort(f);}
auto sorts(auto&&...a){auto o=iota_sort(pack_first(a...).size(),pack_back(a...));([&o](auto&e){if constexpr(vectorial<decltype(e)>)e=e.reorder_from(o);}(a),...);return o;}
}
namespace my{
template<class T,class F>struct priority_queue:std::priority_queue<T,vector<T>,F>{
priority_queue(const initializer_list<T>&a={}){fe(a,e)this->emplace(e);}
ll size()const{return std::priority_queue<T,vector<T>,F>::size();}
T pop(){T r=this->top();std::priority_queue<T,vector<T>,F>::pop();return r;}
};
template<class T>using min_heap=priority_queue<T,greater<T>>;
}
namespace my{entry
void main(){
LL(N,M,K,T);
VV(K,a,b,c,d);dec(a,b);
amin(T,N+M);
sorts(a,b,c,d,comp_iota(c,>));
while(c.size()&&c.back()==1){ // 2秒以上戻らないと意味ない.
a.pop_back();
b.pop_back();
c.pop_back();
d.pop_back();
}
K=c.size();
if(K==0&&T<N-1+M-1)done(-1);
vec m(N,M,-1);
fo(i,K)m[a[i]][b[i]]=i;
ll B=N+M;
vec dp(N,M,B*2+1,ll(oo));
dp[0][0][B]=0;
min_heap<array<ll,4>>q;
q.emplace(array{0ll,0ll,0ll,B});
while(q.size()){
auto[dist,x,y,t]=q.pop();
if(dp[x][y][t]<dist)continue;
ll k=m[x][y];
if(t>0&&k>=0){
ll nt=max(t+1-c[k],0);
if(amin(dp[x][y][nt],dist+d[k]))q.emplace(array{dist+d[k],x,y,nt});
}
if(t==B*2)continue;
grid_right_down_fe(x,y,nx,ny,N,M){
if(amin(dp[nx][ny][t+1],dist))q.emplace(array{dist,nx,ny,t+1});
}
}
pp(dp[N-1][M-1].slice(0,B+T+1).min());
}}