結果

問題 No.2366 登校
ユーザー woodywoodywoodywoody
提出日時 2023-06-30 23:51:57
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 869 ms / 4,000 ms
コード長 5,606 bytes
コンパイル時間 3,723 ms
コンパイル使用メモリ 249,684 KB
実行使用メモリ 348,920 KB
最終ジャッジ日時 2024-06-12 07:54:59
合計ジャッジ時間 8,947 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,816 KB
testcase_01 AC 1 ms
6,940 KB
testcase_02 AC 2 ms
6,940 KB
testcase_03 AC 2 ms
6,940 KB
testcase_04 AC 1 ms
6,940 KB
testcase_05 AC 2 ms
6,940 KB
testcase_06 AC 2 ms
6,940 KB
testcase_07 AC 2 ms
6,940 KB
testcase_08 AC 1 ms
6,944 KB
testcase_09 AC 2 ms
6,940 KB
testcase_10 AC 1 ms
6,944 KB
testcase_11 AC 2 ms
6,944 KB
testcase_12 AC 154 ms
58,596 KB
testcase_13 AC 156 ms
58,616 KB
testcase_14 AC 157 ms
58,736 KB
testcase_15 AC 149 ms
58,660 KB
testcase_16 AC 150 ms
58,560 KB
testcase_17 AC 154 ms
58,796 KB
testcase_18 AC 150 ms
58,668 KB
testcase_19 AC 152 ms
58,588 KB
testcase_20 AC 161 ms
58,668 KB
testcase_21 AC 160 ms
58,548 KB
testcase_22 AC 129 ms
57,864 KB
testcase_23 AC 869 ms
348,920 KB
testcase_24 AC 861 ms
348,904 KB
testcase_25 AC 545 ms
226,964 KB
testcase_26 AC 545 ms
226,840 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,b) for(int i=0;i<b;i++)
#define rrep(i,b) for(int i=b-1;i>=0;i--)
#define rep1(i,b) for(int i=1;i<b;i++)
#define repx(i,x,b) for(int i=x;i<b;i++)
#define rrepx(i,x,b) for(int i=b-1;i>=x;i--)
#define fore(i,a) for(auto& i:a)
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define pb push_back
#define fi first
#define se second
#define pcnt __builtin_popcountll

using namespace std;
using namespace atcoder;

using ll = long long;
using ld = long double;
template<typename T> using mpq = priority_queue<T, vector<T>, greater<T>>;
template<typename T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<typename T> bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<typename T> ll sumv(const vector<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}
bool yn(bool a) { if(a) {cout << "Yes" << endl; return true;} else {cout << "No" << endl; return false;}}
#define retval(x) {cout << #x << endl; return;}
#define cout2(x,y) cout << x << " " << y << endl;
#define coutp(p) cout << p.fi << " " << p.se << endl;
#define out cout << ans << endl;
#define outd cout << fixed << setprecision(20) << ans << endl;
#define outm cout << ans.val() << endl;
#define outv fore(yans , ans) cout << yans << "\n";
#define outdv fore(yans , ans) cout << yans.val() << "\n";
#define coutv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;}
#define coutv2(v) fore(vy , v) cout << vy << "\n";
#define coutvm(v) {fore(vy , v) {cout << vy.val() << " ";} cout << endl;}
#define coutvm2(v) fore(vy , v) cout << vy.val() << "\n";
using pll = pair<ll,ll>;using pil = pair<int,ll>;using pli = pair<ll,int>;using pii = pair<int,int>;using pdd = pair<ld,ld>;
using vi = vector<int>;using vd = vector<ld>;using vl = vector<ll>;using vs = vector<string>;using vb = vector<bool>;
using vpii = vector<pii>;using vpli = vector<pli>;using vpll = vector<pll>;using vpil = vector<pil>;
using vvi = vector<vector<int>>;using vvl = vector<vector<ll>>;using vvs = vector<vector<string>>;using vvb = vector<vector<bool>>;
using vvpii = vector<vector<pii>>;using vvpli = vector<vector<pli>>;using vvpll = vector<vpll>;using vvpil = vector<vpil>;
using mint = modint998244353;
//using mint = modint1000000007;
//using mint = dynamic_modint<0>;
using vm = vector<mint>;
using vvm = vector<vector<mint>>;
vector<int> dx={1,0,-1,0,1,1,-1,-1},dy={0,1,0,-1,1,-1,1,-1};
ll gcd(ll a, ll b) { return a?gcd(b%a,a):b;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
#define yes {cout <<"Yes"<<endl;}
#define no {cout <<"No"<<endl;}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#ifdef MY_LOCAL_DEBUG
#define show(x) cerr<<#x<<" = "<<x<<endl
#define showp(p) cerr<<#p<<" = "<<p.fi<<" : "<<p.se<<endl
#define show2(x,y) cerr<<#x<<" = "<<x<<" : "<<#y<<" = "<<y<<endl
#define show3(x,y,z) cerr<<#x<<" = "<<x<<" : "<<#y<<" = "<<y<<" : "<<#z<<" = "<<z<<endl
#define show4(x,y,z,x2) cerr<<#x<<" = "<<x<<" : "<<#y<<" = "<<y<<" : "<<#z<<" = "<<z<<" : "<<#x2<<" = "<<x2<<endl
#define test(x) cout << "test" << x << endl
#define showv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;}
#define showv2(v) fore(vy , v) cout << vy << "\n";
#define showvm(v) {fore(vy , v) {cout << vy.val() << " ";} cout << endl;}
#define showvm2(v) fore(vy , v) cout << vy.val() << "\n";
#else
#define show(x)
#define showp(p)
#define show2(x,y)
#define show3(x,y,z)
#define show4(x,y,z,x2)
#define test(x)
#define showv(v)
#define showv2(v)
#define showvm(v)
#define showvm2(v)
#endif

struct edge{
	int from,to;
	ll cost;

	edge(int from_=0,int to_=0,ll cost_=0) : from(from_),to(to_),cost(cost_) {}
};

void solve(){
	int n,m,k,t; cin>>n>>m>>k>>t;
	vl a(k),b(k),c(k),d(k);
	map<pii,int> mp;
	rep(i,k){
		cin>>a[i]>>b[i];
		a[i]--; b[i]--;
		cin>>c[i]>>d[i];
		pii p = {a[i],b[i]};
		mp[p] = i;
	}
	if (n+m<=t){
		retval(0);
	}
	auto trans3to1 = [&](int i,int j,int k)->int{
		int ret = k*n*m + i*m + j;
		return ret;
	};
	using tp = tuple<int,int,int>;
	auto trans1to3 = [&](int ed)->tp{
		int tmp = ed%(n*m);
		tp ret = make_tuple(ed/(n*m) , (tmp/m) , (tmp%m));
		return ret;
	};
	int mxt = (n+m)*2;
	int en = mxt*n*m;
	vector<vector<edge>> e(en);
	rep(k,mxt) rep(i,n) rep(j,m){
		int ed = trans3to1(i,j,k);
		rep(kk,4){
			int x,y;
			x = i + dx[kk];
			y = j + dy[kk];
			if (x <= n-1 && x >= 0 && y <= m-1 && y >= 0){
				if (k<mxt-1){
					int nxt = trans3to1(x,y,k+1);
					e[ed].pb(edge(ed,nxt,0));
				}
			}
		}
		pii p = {i,j};
		if (mp.count(p)){
			int idx = mp[p];
			int nk = k-c[idx]+1;
			int nxt;
			if (nk<0){
				nxt = trans3to1(n-1,m-1,0);
			}else{
				nxt = trans3to1(i,j,nk);
			}
			e[ed].pb(edge(ed,nxt,d[idx]));
		}
	} 
	vector<ll> dist(en,LINF);
	mpq<pli> q;
	
	int st = trans3to1(0,0,(n+m)-t);
	t = (n+m);
	dist[st] = 0;
	q.push({dist[st] , st});
	
	while(!q.empty()){
		pli p = q.top();
		q.pop();
		ll dist_dum = p.first;
		int from = p.second;
		tp pt = trans1to3(from);
		int ft = get<0>(pt);
		int i = get<1>(pt);
		int j = get<2>(pt);
		show3(i,j,ft);
		show2(from,dist_dum);
	
		if (dist[from] < dist_dum) continue;
	
		fore(ey , e[from]){
			int to = ey.to;
			ll cost = ey.cost;
	
			if (chmin(dist[to] , dist_dum + cost)){
				q.push({dist[to] , to});
			}
		}
	}
	ll ans = LINF;
	rep(i,(n+m)+1){
		int idx = trans3to1(n-1,m-1,i);
		chmin(ans,dist[idx]);
	}
	if (ans == LINF) ans = -1;
	out;

	return;
}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);

	int t = 1;
	//cin>>t;

	rep(i,t){
		solve();
	}

	return 0;
}
0