結果

問題 No.2321 Continuous Flip
ユーザー woodywoodywoodywoody
提出日時 2023-05-30 00:54:40
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 240 ms / 2,000 ms
コード長 4,969 bytes
コンパイル時間 4,369 ms
コンパイル使用メモリ 238,008 KB
実行使用メモリ 34,776 KB
最終ジャッジ日時 2024-06-08 19:50:01
合計ジャッジ時間 12,991 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 AC 2 ms
5,376 KB
testcase_03 AC 3 ms
5,376 KB
testcase_04 AC 216 ms
32,568 KB
testcase_05 AC 200 ms
32,588 KB
testcase_06 AC 201 ms
32,592 KB
testcase_07 AC 204 ms
32,692 KB
testcase_08 AC 203 ms
32,588 KB
testcase_09 AC 215 ms
32,580 KB
testcase_10 AC 203 ms
32,704 KB
testcase_11 AC 199 ms
32,588 KB
testcase_12 AC 198 ms
32,716 KB
testcase_13 AC 240 ms
32,708 KB
testcase_14 AC 215 ms
32,700 KB
testcase_15 AC 207 ms
32,692 KB
testcase_16 AC 212 ms
32,712 KB
testcase_17 AC 211 ms
32,624 KB
testcase_18 AC 204 ms
32,700 KB
testcase_19 AC 214 ms
32,680 KB
testcase_20 AC 200 ms
32,712 KB
testcase_21 AC 206 ms
32,564 KB
testcase_22 AC 231 ms
32,700 KB
testcase_23 AC 195 ms
32,556 KB
testcase_24 AC 93 ms
25,984 KB
testcase_25 AC 1 ms
5,376 KB
testcase_26 AC 83 ms
26,020 KB
testcase_27 AC 86 ms
28,416 KB
testcase_28 AC 169 ms
34,604 KB
testcase_29 AC 177 ms
34,616 KB
testcase_30 AC 174 ms
34,616 KB
testcase_31 AC 171 ms
34,776 KB
testcase_32 AC 171 ms
34,640 KB
testcase_33 AC 178 ms
34,648 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 dame { cout << "No" << endl; return;}
#define dame1 { cout << -1 << 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 tp = tuple<int ,int ,int>;
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 yesr { cout <<"Yes"<<endl; return;}
#define no {cout <<"No"<<endl;}
#define nor { cout <<"No"<<endl; return;}
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,c; cin>>n>>m>>c;
    vector<vector<edge>> e(n+1);
    vi a(n);
    rep(i,n) cin>>a[i];
    rep(i,m){
        int l,r; cin>>l>>r;
        l--;
        e[l].pb(edge(l,r,c));
        e[r].pb(edge(r,l,c));
    }
    rep(i,n){
        e[i].pb(edge(i,i+1,a[i]));
        e[i+1].pb(edge(i+1,i,a[i]));
    }

    vector<ll> dist(n+1,LINF);
    mpq<pli> q;
    
    int st = 0;
    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;
    
        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 = sumv(a) - dist[n];
    out;
    

    return;
}

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

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

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

    return 0;
}
0