結果

問題 No.2366 登校
ユーザー deuteridayodeuteridayo
提出日時 2023-06-30 22:40:18
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 3,870 bytes
コンパイル時間 3,829 ms
コンパイル使用メモリ 273,296 KB
実行使用メモリ 815,020 KB
最終ジャッジ日時 2024-07-07 22:00:10
合計ジャッジ時間 8,046 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 1 ms
5,376 KB
testcase_02 AC 1 ms
5,376 KB
testcase_03 AC 2 ms
5,376 KB
testcase_04 AC 2 ms
5,376 KB
testcase_05 AC 1 ms
5,376 KB
testcase_06 AC 1 ms
5,376 KB
testcase_07 AC 2 ms
5,376 KB
testcase_08 AC 2 ms
5,376 KB
testcase_09 AC 1 ms
5,376 KB
testcase_10 AC 2 ms
5,376 KB
testcase_11 AC 1 ms
5,376 KB
testcase_12 AC 2 ms
5,376 KB
testcase_13 AC 2 ms
5,376 KB
testcase_14 AC 2 ms
5,376 KB
testcase_15 AC 2 ms
5,376 KB
testcase_16 AC 2 ms
5,376 KB
testcase_17 WA -
testcase_18 AC 2 ms
5,376 KB
testcase_19 AC 2 ms
5,376 KB
testcase_20 AC 2 ms
5,376 KB
testcase_21 AC 2 ms
5,376 KB
testcase_22 AC 1 ms
5,376 KB
testcase_23 AC 7 ms
5,376 KB
testcase_24 MLE -
testcase_25 -- -
testcase_26 -- -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
using lint = long long;
using ulint = unsigned long long;
#define endl '\n'
int const INF = 1<<30;
lint const INF64 = 1LL<<61;
// lint const mod = 1e9+7;
// using mint = modint1000000007;
long const mod = 998244353;
using mint = modint998244353;
lint ceilDiv(lint x, lint y){if(x >= 0){return (x+y-1)/y;}else{return x/y;}}
lint floorDiv(lint x, lint y){if(x >= 0){return x/y;}else{return (x-y+1)/y;}}
lint Sqrt(lint x){lint upper = 1e9;lint lower = 0;while(upper - lower > 0){lint mid = (1+upper + lower)/2;if(mid * mid > x){upper = mid-1;}else{lower = mid;}}return upper;}
lint gcd(lint a,lint b){if(a<b)swap(a,b);if(a%b==0)return b;else return gcd(b,a%b);}
lint lcm(lint a,lint b){return (a / gcd(a,b)) * b;}
lint chmin(vector<lint>&v){lint ans = INF64;for(lint i:v){ans = min(ans, i);}return ans;}
lint chmax(vector<lint>&v){lint ans = -INF64;for(lint i:v){ans = max(ans, i);}return ans;}
double dist(double x1, double y1, double x2, double y2){return sqrt(pow(x1-x2, 2) + pow(y1-y2,2));}
string toString(lint n){string ans = "";if(n == 0){ans += "0";}else{while(n > 0){int a = n%10;char b = '0' + a;string c = "";c += b;n /= 10;ans = c + ans;}}return ans;}
string toString(lint n, lint k){string ans = toString(n);string tmp = "";while(ans.length() + tmp.length() < k){tmp += "0";}return tmp + ans;}
vector<lint>prime;void makePrime(lint n){prime.push_back(2);for(lint i=3;i<=n;i+=2){bool chk = true;for(lint j=0;j<prime.size() && prime[j]*prime[j] <= i;j++){if(i % prime[j]==0){chk=false;break;}}if(chk)prime.push_back(i);}}
lint Kai[20000001]; bool firstCallnCr = true; 
lint ncrmodp(lint n,lint r,lint p){ if(firstCallnCr){ Kai[0] = 1; for(int i=1;i<=20000000;i++){ Kai[i] = Kai[i-1] * i; Kai[i] %= mod;} firstCallnCr = false;} if(n<0)return 0;
if(n < r)return 0;if(n==0)return 1;lint ans = Kai[n];lint tmp = (Kai[r] * Kai[n-r]) % p;for(lint i=1;i<=p-2;i*=2){if(i & p-2){ans *= tmp;ans %= p;}tmp *= tmp;tmp %= p;}return ans;}
#define rep(i, n) for(int i = 0; i < n; i++)
#define repp(i, x, y) for(int i = x; i < y; i++)
#define vec vector
#define pb push_back
#define se second
#define fi first
#define all(x) x.begin(),x.end()

struct edge{
    int to;
};
using graph = vector<vector<edge>>;
int main(){
    lint n,m,k,t;
    cin >> n >> m >> k >> t;
    lint a[k], b[k], c[k], d[k];
    bool chk = false;
    rep(i, k) {
        cin >> a[i] >> b[i] >> c[i] >> d[i];
    }
    if(n + m - 2 <= t) {
        cout << 0 << endl;
        return 0;
    }
    lint upper = INF64;
    lint lower = 0;
    while(upper > lower) {
        lint mid = (upper + lower ) / 2;
        priority_queue<vec<lint>>que;
        que.push({-0, mid, 1, 1});
        chk = false;
        while(!que.empty()) {

            if(chk) break;
            auto q = que.top();
            que.pop();
            lint x = q[2], y = q[3];
            lint time = -q[0];
            lint power = q[1];
            if(time  + n+m - x - y <= t) {
                chk = true;
                break;
            }
            rep(i, k) {
                if(c[i] > 0 && power >= d[i]) {
                    lint tt = (lint)(c[i]-1) * (power / d[i]);
                    if(a[i] == n && b[i] == m) {
                        if(time+abs((lint)(x+y-a[i]-b[i])) - 1 <= t) {
                            chk = true;
                            break;
                        }
                    }
                    que.push({-time+tt-abs((lint)(x+y-a[i]-b[i])), power%d[i],a[i], b[i]});
                }
            }
        }
        if(chk) {
            upper = mid;
        } else {
            lower = mid + 1;
        }
    }
    string ans = "";
    while(upper > 0) {
        ans += (upper % 10) + '0';
        upper /= 10;
    }
    reverse(all(ans));
    if(ans == "") ans = "0";
    cout << ans;
}
0