#894509 (C++14) No.2387 Yokan Factory

提出ソース

結果

問題	No.2387 Yokan Factory
ユーザー	mikam
提出日時	2023-07-22 11:54:47
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	420 ms / 5,000 ms
コード長	4,498 bytes
コンパイル時間	7,525 ms
コンパイル使用メモリ	409,560 KB
実行使用メモリ	13,180 KB
最終ジャッジ日時	2024-09-22 12:03:07
合計ジャッジ時間	11,846 ms
ジャッジサーバーID （参考情報）	judge4 / judge1

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,812 KB
testcase_01	AC	2 ms 6,816 KB
testcase_02	AC	2 ms 6,816 KB
testcase_03	AC	1 ms 6,812 KB
testcase_04	AC	2 ms 6,940 KB
testcase_05	AC	2 ms 6,944 KB
testcase_06	AC	2 ms 6,940 KB
testcase_07	AC	2 ms 6,944 KB
testcase_08	AC	2 ms 6,944 KB
testcase_09	AC	2 ms 6,940 KB
testcase_10	AC	2 ms 6,944 KB
testcase_11	AC	2 ms 6,940 KB
testcase_12	AC	2 ms 6,944 KB
testcase_13	AC	2 ms 6,940 KB
testcase_14	AC	2 ms 6,940 KB
testcase_15	AC	193 ms 13,180 KB
testcase_16	AC	117 ms 12,032 KB
testcase_17	AC	280 ms 12,128 KB
testcase_18	AC	308 ms 11,088 KB
testcase_19	AC	250 ms 8,948 KB
testcase_20	AC	202 ms 8,348 KB
testcase_21	AC	420 ms 10,736 KB
testcase_22	AC	182 ms 7,924 KB
testcase_23	AC	261 ms 8,764 KB
testcase_24	AC	115 ms 8,152 KB
testcase_25	AC	161 ms 6,940 KB
testcase_26	AC	326 ms 9,456 KB
testcase_27	AC	403 ms 10,284 KB
testcase_28	AC	3 ms 6,940 KB
testcase_29	AC	4 ms 6,944 KB
testcase_30	AC	3 ms 6,940 KB
testcase_31	AC	3 ms 6,940 KB
testcase_32	AC	3 ms 6,944 KB
testcase_33	AC	2 ms 6,940 KB
testcase_34	AC	4 ms 6,944 KB
testcase_35	AC	4 ms 6,944 KB
testcase_36	AC	3 ms 6,944 KB
testcase_37	AC	2 ms 6,940 KB

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

コンパイルメッセージ

main.cpp: In function 'void input(T& ...)':
main.cpp:32:56: warning: fold-expressions only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions]
   32 | template<class... T> void input(T&... a){(cin>> ... >> a);}
      |                                                        ^
main.cpp: In function 'll print(const T&, const Ts& ...)':
main.cpp:40:102: warning: fold-expressions only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions]
   40 | template<class T,class... Ts> int print(const T&a, const Ts&... b){cout << a;(cout<<...<<(cout<<' ',b));cout<<'\n';return 0;}
      |                                                                                                      ^
main.cpp: In lambda function:
main.cpp:84:18: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions]
   84 |             auto [td,u] = pq.top(); pq.pop();
      |                  ^
main.cpp:86:22: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions]
   86 |             for(auto [v,c,b]:G[u]){
      |                      ^

ソースコード

raw source code

#include <atcoder/all>
using namespace atcoder;
#include <bits/stdc++.h>
using namespace std;
#include <boost/multiprecision/cpp_int.hpp>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i,a,b) for (int i = (int)(a); i < (int)(b); i++)
#define all(v) v.begin(),v.end()
#define inc(x,l,r) ((l)<=(x)&&(x)<(r)) 
#define Unique(x) sort(all(x)), x.erase(unique(all(x)), x.end())
#define pcnt __builtin_popcountll
typedef long long ll;
#define int ll
using ld = long double;
using vi = vector<int>;
using vs = vector<string>;
using P = pair<int,int>;
using vp = vector<P>;
using Bint = boost::multiprecision::cpp_int;
template<typename T1,typename T2> bool chmax(T1 &a, const T2 b) {if (a < b) {a = b; return true;} else return false; }
template<typename T1,typename T2> bool chmin(T1 &a, const T2 b) {if (a > b) {a = b; return true;} else return false; }
template<typename T> using priority_queue_greater = priority_queue<T, vector<T>, greater<T>>;
template<typename T1,typename T2> ostream &operator<< (ostream &os, const pair<T1,T2> &p){os << p.first <<" "<<p.second;return os;}
ostream &operator<< (ostream &os, const modint1000000007 &m){os << m.val();return os;}
istream &operator>> (istream &is, modint1000000007 &m){ll in;is>>in;m=in;return is;}
ostream &operator<< (ostream &os, const modint998244353 &m){os << m.val();return os;}
istream &operator>> (istream &is, modint998244353 &m){ll in;is>>in;m=in;return is;}
template<typename T> istream &operator>>(istream& is,vector<T> &v){for(T &in:v)is>>in;return is;}
template<class... T> void input(T&... a){(cin>> ... >> a);}
#ifdef LOCAL
template<typename T> ostream &operator<<(ostream &os,const vector<T> &v){os<<"\x1b[32m";rep(i,v.size())os<<v[i]<<(i+1!=v.size()?" ":"");os<<"\x1b[0m";return os;}
template<class T> int print(T& a){cout << "\x1b[32m"<< a<< '\n' << "\x1b[0m";return 0;}
template<class T,class... Ts> int print(const T&a, const Ts&... b){cout << "\x1b[32m" << a;(cout<<...<<(cout<<' ',b));cout<<'\n' << "\x1b[0m";return 0;}
#else
template<typename T> ostream &operator<<(ostream &os,const vector<T> &v){rep(i,v.size())os<<v[i]<<(i+1!=v.size()?" ":"");return os;}
template<class T> int print(T& a){cout << a<< '\n';return 0;}
template<class T,class... Ts> int print(const T&a, const Ts&... b){cout << a;(cout<<...<<(cout<<' ',b));cout<<'\n';return 0;}
#endif
#define VI(v,n) vi v(n); input(v)
#define INT(...) int __VA_ARGS__; input(__VA_ARGS__)
#define STR(...) string __VA_ARGS__; input(__VA_ARGS__)
#define CHAR(...) char __VA_ARGS__; input(__VA_ARGS__)
int sign(ll x){return x>0?1:x<0?-1:0;}
ll ceil(ll x,ll y){assert(y!=0);if(sign(x)==sign(y))return (x+y-1)/y;return -((-x/y));}
ll floor(ll x,ll y){assert(y!=0);if(sign(x)==sign(y))return x/y;if(y<0)x*=-1,y*=-1;return x/y-(x%y<0);}
ll abs(ll x,ll y){return abs(x-y);}
ll bit(int n){return 1ll<<n;}
bool ins(string s,string t){return s.find(t)!=string::npos;}
P operator+ (const P &p, const P &q){ return P{p.first+q.first,p.second+q.second};}
P operator- (const P &p, const P &q){ return P{p.first-q.first,p.second-q.second};}
int yesno(bool ok,string y="Yes",string n="No"){ cout<<(ok?y:n)<<endl;return 0;}
int YESNO(bool ok,string y="YES",string n="NO"){ cout<<(ok?y:n)<<endl;return 0;}
int di[]={-1,0,1,0,-1,-1,1,1};
int dj[]={0,1,0,-1,-1,1,-1,1};
const ll INF = 1e18;
//using mint = modint1000000007;
//using mint = modint998244353;
//mint stom(const string &s,int b=10){mint res = 0;for(auto c:s)res *= b,res += c-'0';return res;}

signed main() {
    cin.tie(0);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);

    INT(n,m,x);
    vector<vector<array<int,3>>> G(n);
    rep(i,m){
        INT(u,v,a,b);
        --u;--v;
        G[u].push_back({v,a,b});
        G[v].push_back({u,a,b});
    }
    int ok = -1;
    int ng = 1e9+10;
    auto f = [&](int mid){
        vi d(n,INF);
        d[0] = 0;
        priority_queue_greater<P> pq;
        pq.push({0,0});
        while(!pq.empty()){
            auto [td,u] = pq.top(); pq.pop();
            if(d[u]<td)continue;
            for(auto [v,c,b]:G[u]){
                if(mid>b)continue;
                if(chmin(d[v],d[u]+c)){
                    pq.push({d[v],v});
                }
            }
        }
        return d[n-1]<=x;
    };
    while(abs(ng-ok)>1){
        int mid = ng+(ok-ng)/2;
        if(f(mid))ok=mid;
        else ng = mid;
    }
    print(ok);
    return 0;
}

yukicoder

結果

テストケース

コンパイルメッセージ

ソースコード