#966988 (C++17) No.2712 Play more!

提出ソース

結果

問題	No.2712 Play more!
ユーザー	👑 Nachia
提出日時	2024-03-31 14:18:03
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	46 ms / 2,000 ms
コード長	8,119 bytes
コンパイル時間	1,326 ms
コンパイル使用メモリ	112,608 KB
実行使用メモリ	5,248 KB
最終ジャッジ日時	2024-09-30 23:46:13
合計ジャッジ時間	2,482 ms
ジャッジサーバーID （参考情報）	judge1 / judge2

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 5,248 KB
testcase_01	AC	1 ms 5,248 KB
testcase_02	AC	1 ms 5,248 KB
testcase_03	AC	2 ms 5,248 KB
testcase_04	AC	2 ms 5,248 KB
testcase_05	AC	2 ms 5,248 KB
testcase_06	AC	1 ms 5,248 KB
testcase_07	AC	14 ms 5,248 KB
testcase_08	AC	14 ms 5,248 KB
testcase_09	AC	13 ms 5,248 KB
testcase_10	AC	2 ms 5,248 KB
testcase_11	AC	15 ms 5,248 KB
testcase_12	AC	12 ms 5,248 KB
testcase_13	AC	12 ms 5,248 KB
testcase_14	AC	19 ms 5,248 KB
testcase_15	AC	46 ms 5,248 KB
testcase_16	AC	7 ms 5,248 KB
testcase_17	AC	3 ms 5,248 KB
testcase_18	AC	6 ms 5,248 KB
testcase_19	AC	2 ms 5,248 KB
testcase_20	AC	20 ms 5,248 KB
testcase_21	AC	11 ms 5,248 KB
testcase_22	AC	23 ms 5,248 KB
testcase_23	AC	5 ms 5,248 KB
testcase_24	AC	9 ms 5,248 KB
testcase_25	AC	3 ms 5,248 KB
testcase_26	AC	5 ms 5,248 KB
testcase_27	AC	7 ms 5,248 KB
testcase_28	AC	3 ms 5,248 KB
testcase_29	AC	8 ms 5,248 KB
testcase_30	AC	36 ms 5,248 KB
testcase_31	AC	3 ms 5,248 KB
testcase_32	AC	3 ms 5,248 KB
testcase_33	AC	1 ms 5,248 KB
testcase_34	AC	2 ms 5,248 KB
testcase_35	AC	2 ms 5,248 KB

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

コンパイルメッセージ

main.cpp: In function 'void testcase()':
main.cpp:203:21: warning: overflow in conversion from 'long long int' to '__gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type' {aka 'int'} changes value from '-1001001001001001001' to '-1551474729' [-Woverflow]
  203 |         else C[i] = -INF;
      |                     ^~~~

ソースコード

raw source code

#ifdef NACHIA
#define _GLIBCXX_DEBUG
#else
#define NDEBUG
#endif
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <queue>
#include <array>
#include <cmath>
#include <atcoder/modint>
using i64 = long long;
using u64 = unsigned long long;
#define rep(i,n) for(int i=0; i<int(n); i++)
#define repr(i,n) for(int i=int(n)-1; i>=0; i--)
const i64 INF = 1001001001001001001;
const char* yn(bool x){ return x ? "Yes" : "No"; }
template<typename A> void chmin(A& l, const A& r){ if(r < l) l = r; }
template<typename A> void chmax(A& l, const A& r){ if(l < r) l = r; }
template<typename A> using nega_queue = std::priority_queue<A,std::vector<A>,std::greater<A>>;
using Modint = atcoder::static_modint<998244353>;
//#include "nachia/vec.hpp"
#include <cassert>

namespace nachia{

template<class Elem>
class CsrArray{
public:
    struct ListRange{
        using iterator = typename std::vector<Elem>::iterator;
        iterator begi, endi;
        iterator begin() const { return begi; }
        iterator end() const { return endi; }
        int size() const { return (int)std::distance(begi, endi); }
        Elem& operator[](int i) const { return begi[i]; }
    };
    struct ConstListRange{
        using iterator = typename std::vector<Elem>::const_iterator;
        iterator begi, endi;
        iterator begin() const { return begi; }
        iterator end() const { return endi; }
        int size() const { return (int)std::distance(begi, endi); }
        const Elem& operator[](int i) const { return begi[i]; }
    };
private:
    int m_n;
    std::vector<Elem> m_list;
    std::vector<int> m_pos;
public:
    CsrArray() : m_n(0), m_list(), m_pos() {}
    static CsrArray Construct(int n, std::vector<std::pair<int, Elem>> items){
        CsrArray res;
        res.m_n = n;
        std::vector<int> buf(n+1, 0);
        for(auto& [u,v] : items){ ++buf[u]; }
        for(int i=1; i<=n; i++) buf[i] += buf[i-1];
        res.m_list.resize(buf[n]);
        for(int i=(int)items.size()-1; i>=0; i--){
            res.m_list[--buf[items[i].first]] = std::move(items[i].second);
        }
        res.m_pos = std::move(buf);
        return res;
    }
    static CsrArray FromRaw(std::vector<Elem> list, std::vector<int> pos){
        CsrArray res;
        res.m_n = pos.size() - 1;
        res.m_list = std::move(list);
        res.m_pos = std::move(pos);
        return res;
    }
    ListRange operator[](int u) { return ListRange{ m_list.begin() + m_pos[u], m_list.begin() + m_pos[u+1] }; }
    ConstListRange operator[](int u) const { return ConstListRange{ m_list.begin() + m_pos[u], m_list.begin() + m_pos[u+1] }; }
    int size() const { return m_n; }
    int fullSize() const { return (int)m_list.size(); }
};

} // namespace nachia

namespace nachia{


struct Graph {
public:
    struct Edge{
        int from, to;
        void reverse(){ std::swap(from, to); }
        int xorval() const { return from ^ to; }
    };
    Graph(int n = 0, bool undirected = false, int m = 0) : m_n(n), m_e(m), m_isUndir(undirected) {}
    Graph(int n, const std::vector<std::pair<int, int>>& edges, bool undirected = false) : m_n(n), m_isUndir(undirected){
        m_e.resize(edges.size());
        for(std::size_t i=0; i<edges.size(); i++) m_e[i] = { edges[i].first, edges[i].second };
    }
    template<class Cin>
    static Graph Input(Cin& cin, int n, bool undirected, int m, bool offset = 0){
        Graph res(n, undirected, m);
        for(int i=0; i<m; i++){
            int u, v; cin >> u >> v;
            res[i].from = u - offset;
            res[i].to = v - offset;
        }
        return res;
    }
    int numVertices() const noexcept { return m_n; }
    int numEdges() const noexcept { return int(m_e.size()); }
    int addNode() noexcept { return m_n++; }
    int addEdge(int from, int to){ m_e.push_back({ from, to }); return numEdges() - 1; }
    Edge& operator[](int ei) noexcept { return m_e[ei]; }
    const Edge& operator[](int ei) const noexcept { return m_e[ei]; }
    Edge& at(int ei) { return m_e.at(ei); }
    const Edge& at(int ei) const { return m_e.at(ei); }
    auto begin(){ return m_e.begin(); }
    auto end(){ return m_e.end(); }
    auto begin() const { return m_e.begin(); }
    auto end() const { return m_e.end(); }
    bool isUndirected() const noexcept { return m_isUndir; }
    void reverseEdges() noexcept { for(auto& e : m_e) e.reverse(); }
    void contract(int newV, const std::vector<int>& mapping){
        assert(numVertices() == int(mapping.size()));
        for(int i=0; i<numVertices(); i++) assert(0 <= mapping[i] && mapping[i] < newV);
        for(auto& e : m_e){ e.from = mapping[e.from]; e.to = mapping[e.to]; }
        m_n = newV;
    }
    std::vector<Graph> induce(int num, const std::vector<int>& mapping) const {
        int n = numVertices();
        assert(n == int(mapping.size()));
        for(int i=0; i<n; i++) assert(-1 <= mapping[i] && mapping[i] < num);
        std::vector<int> indexV(n), newV(num);
        for(int i=0; i<n; i++) if(mapping[i] >= 0) indexV[i] = newV[mapping[i]]++;
        std::vector<Graph> res; res.reserve(num);
        for(int i=0; i<num; i++) res.emplace_back(newV[i], isUndirected());
        for(auto e : m_e) if(mapping[e.from] == mapping[e.to] && mapping[e.to] >= 0) res[mapping[e.to]].addEdge(indexV[e.from], indexV[e.to]);
        return res;
    }
    CsrArray<int> getEdgeIndexArray(bool undirected) const {
        std::vector<std::pair<int, int>> src;
        src.reserve(numEdges() * (undirected ? 2 : 1));
        for(int i=0; i<numEdges(); i++){
            auto e = operator[](i);
            src.emplace_back(e.from, i);
            if(undirected) src.emplace_back(e.to, i);
        }
        return CsrArray<int>::Construct(numVertices(), src);
    }
    CsrArray<int> getEdgeIndexArray() const { return getEdgeIndexArray(isUndirected()); }
    CsrArray<int> getAdjacencyArray(bool undirected) const {
        std::vector<std::pair<int, int>> src;
        src.reserve(numEdges() * (undirected ? 2 : 1));
        for(auto e : m_e){
            src.emplace_back(e.from, e.to);
            if(undirected) src.emplace_back(e.to, e.from);
        }
        return CsrArray<int>::Construct(numVertices(), src);
    }
    CsrArray<int> getAdjacencyArray() const { return getAdjacencyArray(isUndirected()); }
private:
    int m_n;
    std::vector<Edge> m_e;
    bool m_isUndir;
};

} // namespace nachia

namespace nachia{
    
std::vector<int> BfsDistance(const nachia::CsrArray<int>& adj, const std::vector<int>& start){
    std::vector<int> dist(adj.size(), -1), bfs(adj.size());
    int p1 = 0;
    for(int s : start) if(dist[s] == -1){
        dist[s] = 0;
        bfs[p1++] = s;
    }
    for(int i=0; i<p1; i++){
        int p = bfs[i];
        for(int nx : adj[p]) if(dist[nx] == -1){
            dist[nx] = dist[p] + 1;
            bfs[p1++] = nx;
        }
    }
    return dist;
}

} // namespace nachia
using namespace std;

void testcase(){
    int N, M; cin >> N >> M;
    vector<int> A(N); rep(i,N) cin >> A[i];
    auto graph = nachia::Graph(N, false);
    vector<int> C(M);
    rep(i,M){ int u,v; cin >> u >> v >> C[i]; u--; v--; graph.addEdge(u,v); }
    auto revg = graph; revg.reverseEdges();
    auto goodNode = nachia::BfsDistance(revg.getAdjacencyArray(), {N-1});
    rep(i,N) goodNode[i] = (goodNode[i] >= 0 ? 1 : 0);
    vector<i64> dist(N, -INF);
    dist[0] = A[0];
    rep(i,M){
        if(goodNode[graph[i].to]) C[i] = A[graph[i].to] - C[i];
        else C[i] = -INF;
    }
    rep(i,N+1){
        bool upd = false;
        rep(j,M){
            auto [u,v] = graph[j];
            if(goodNode[v] == 0) continue;
            if(dist[v] < dist[u] + C[j]){
                dist[v] = dist[u] + C[j];
                upd = true;
            }
        }
        if(!upd) break;
        if(i == N){ cout << "inf\n"; return; }
    }
    cout << dist[N-1] << '\n';
}

int main(){
    ios::sync_with_stdio(false); cin.tie(nullptr);
    #ifdef NACHIA
    int T; cin >> T; for(int t=0; t<T; T!=++t?(cout<<'\n'),0:0)
    #endif
    testcase();
    return 0;
}

yukicoder

結果

テストケース

コンパイルメッセージ

ソースコード