#952625 (C++17) No.2640 traO Stamps

提出ソース

結果

問題	No.2640 traO Stamps
ユーザー	dyktr_06
提出日時	2024-02-19 21:45:00
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	97 ms / 2,000 ms
コード長	6,569 bytes
コンパイル時間	2,545 ms
コンパイル使用メモリ	212,424 KB
実行使用メモリ	9,664 KB
最終ジャッジ日時	2024-09-29 01:39:43
合計ジャッジ時間	7,302 ms
ジャッジサーバーID （参考情報）	judge3 / judge1

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,820 KB
testcase_01	AC	2 ms 6,816 KB
testcase_02	AC	2 ms 6,816 KB
testcase_03	AC	2 ms 6,820 KB
testcase_04	AC	2 ms 6,816 KB
testcase_05	AC	2 ms 6,820 KB
testcase_06	AC	80 ms 9,200 KB
testcase_07	AC	79 ms 8,784 KB
testcase_08	AC	88 ms 9,220 KB
testcase_09	AC	69 ms 6,816 KB
testcase_10	AC	85 ms 9,292 KB
testcase_11	AC	67 ms 6,816 KB
testcase_12	AC	80 ms 9,172 KB
testcase_13	AC	68 ms 6,820 KB
testcase_14	AC	88 ms 9,176 KB
testcase_15	AC	75 ms 6,816 KB
testcase_16	AC	75 ms 8,820 KB
testcase_17	AC	79 ms 8,984 KB
testcase_18	AC	76 ms 6,816 KB
testcase_19	AC	88 ms 9,340 KB
testcase_20	AC	87 ms 9,300 KB
testcase_21	AC	70 ms 6,816 KB
testcase_22	AC	88 ms 9,148 KB
testcase_23	AC	70 ms 6,820 KB
testcase_24	AC	76 ms 6,816 KB
testcase_25	AC	86 ms 9,512 KB
testcase_26	AC	70 ms 9,096 KB
testcase_27	AC	70 ms 9,216 KB
testcase_28	AC	68 ms 9,280 KB
testcase_29	AC	75 ms 9,160 KB
testcase_30	AC	97 ms 9,664 KB
testcase_31	AC	96 ms 9,472 KB
testcase_32	AC	88 ms 9,364 KB
testcase_33	AC	89 ms 9,272 KB

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

ソースコード

raw source code

#include <bits/stdc++.h>

using namespace std;

#define overload4(_1, _2, _3, _4, name, ...) name
#define rep1(n) for(int i = 0; i < (int)(n); ++i)
#define rep2(i, n) for(int i = 0; i < (int)(n); ++i)
#define rep3(i, a, b) for(int i = (a); i < (int)(b); ++i)
#define rep4(i, a, b, c) for(int i = (a); i < (int)(b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)

#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; --i)
#define ALL(a) (a).begin(), (a).end()
#define Sort(a) (sort((a).begin(), (a).end()))
#define RSort(a) (sort((a).rbegin(), (a).rend()))
#define UNIQUE(a) (a.erase(unique((a).begin(), (a).end()), (a).end()))

typedef long long int ll;
typedef unsigned long long ul;
typedef long double ld;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector<char> vc;
typedef vector<string> vst;
typedef vector<double> vd;
typedef vector<long double> vld;
typedef pair<long long, long long> P;

template<class T> long long sum(const T& a){ return accumulate(a.begin(), a.end(), 0LL); }
template<class T> auto min(const T& a){ return *min_element(a.begin(), a.end()); }
template<class T> auto max(const T& a){ return *max_element(a.begin(), a.end()); }

const long long MINF = 0x7fffffffffff;
const long long INF = 0x1fffffffffffffff;
const long long MOD = 998244353;
const long double EPS = 1e-9;
const long double PI = acos(-1);
 
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p){ is >> p.first >> p.second; return is; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){ os << "(" << p.first << ", " << p.second << ")"; return os; }
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for(T &in : v) is >> in; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &v){ for(int i = 0; i < (int) v.size(); ++i){ os << v[i] << (i + 1 != (int) v.size() ? " " : ""); } return os; }
template <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp){ for(auto &[key, val] : mp){ os << key << ":" << val << " "; } return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, queue<T> q){ while(q.size()){ os << q.front() << " "; q.pop(); } return os; }
template <typename T> ostream &operator<<(ostream &os, deque<T> q){ while(q.size()){ os << q.front() << " "; q.pop_front(); } return os; }
template <typename T> ostream &operator<<(ostream &os, stack<T> st){ while(st.size()){ os << st.top() << " "; st.pop(); } return os; }
template <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq){ while(pq.size()){ os << pq.top() << " "; pq.pop(); } return os; }

template<class T, class U> inline T vin(T& vec, U n) { vec.resize(n); for(int i = 0; i < (int) n; ++i) cin >> vec[i]; return vec; }
template<class T> inline void vout(T vec, string s = "\n"){ for(auto x : vec) cout << x << s; }
template<class... T> void in(T&... a){ (cin >> ... >> a); }
void out(){ cout << '\n'; }
template<class T, class... Ts> void out(const T& a, const Ts&... b){ cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; }
template<class T, class U> void inGraph(vector<vector<T>>& G, U n, U m, bool directed = false){ G.resize(n); for(int i = 0; i < m; ++i){ int a, b; cin >> a >> b; a--, b--; G[a].push_back(b); if(!directed) G[b].push_back(a); } }

template <typename X>
struct SegTree{
    using FX = function<X(X, X)>; // X•X -> X となる関数の型
    int n;
    FX fx;
    const X ex;
    vector<X> dat;

    SegTree(int n_, const FX &fx_, const X &ex_) : n(), fx(fx_), ex(ex_){
        int x = 1;
        while(n_ > x){
            x *= 2;
        }
        n = x;
        dat.assign(n * 2, ex);
    }

    X get(int i) const {
        return dat[i + n];
    }
    
    void set(int i, const X &x){ dat[i + n] = x; }

    void build(){
        for(int k = n - 1; k >= 1; k--) dat[k] = fx(dat[k * 2], dat[k * 2 + 1]);
    }

    void update(int i, const X &x){
        i += n;
        dat[i] = x;
        while(i > 0){
            i >>= 1;  // parent
            dat[i] = fx(dat[i * 2], dat[i * 2 + 1]);
        }
    }

    X query(int a, int b){
        X vl = ex;
        X vr = ex;
        int l = a + n;
        int r = b + n;
        while(l < r){
            if(l & 1) vl = fx(vl, dat[l++]);
            if(r & 1) vr = fx(dat[--r], vr);
            l >>= 1;
            r >>= 1;
        }
        return fx(vl, vr);
    }
    
    X operator [](int i) const {
        return dat[i + n];
    }
};

template <typename T>
void warshall_floyd(vector<vector<T>> &d, const T &INF) {
    int n = d.size();
    for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++){
            for(int k = 0; k < n; k++){
                if(d[j][i] == INF || d[i][k] == INF) continue;
                d[j][k] = min(d[j][k], d[j][i] + d[i][k]);
            }
        }
    }
}

ll n, m, k;
vll s;
vll a, b, c;

void input(){
    in(n, m, k);
    vin(s, k + 1);
    a.resize(m);
    b.resize(m);
    c.resize(m);
    rep(i, m){
        in(a[i], b[i], c[i]);
    }
}

void solve(){
    rep(i, k + 1) s[i]--;
    vector<vll> G(n, vll(n, INF));
    rep(i, n) G[i][i] = 0;
    rep(i, m){
        a[i]--, b[i]--;
        G[a[i]][b[i]] = c[i];
        G[b[i]][a[i]] = c[i];
    }
    warshall_floyd(G, INF);
    auto fx = [](ll a, ll b){
        return a + b;
    };
    SegTree<ll> seg(k, fx, 0);
    rep(i, k){
        seg.update(i, G[s[i]][s[i + 1]]);
    }
    ll q; in(q);
    while(q--){
        ll t, x, y; in(t, x, y);
        if(t == 1){
        	y--;
            s[x] = y;
            rep(i, max(0LL, x - 1), min(k, x + 1)){
                seg.update(i, G[s[i]][s[i + 1]]);
            }
        }else{
            out(seg.query(x, y));
        }
    }
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(20);
    
    input();
    solve();
}

yukicoder

結果

テストケース

ソースコード