oj.uz

답안 #251873

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
251873 2020-07-22T14:24:03 Z leaked Ceste (COCI17_ceste) C++14
160 / 160
 152 ms 32628 KB 
#include<bits/stdc++.h>
using namespace std;
//#include<ext/pb_ds/assoc_container.hpp>
//#include<ext/pb_ds/tree_policy.hpp>
//
//    #pragma GCC optimize("unroll-loops")
//    #pragma GCC optimize("Ofast")
//    #pragma GCC optimize("-O3")
//    #pragma GCC optimize("no-stack-protector")
//    #pragma GCC optimize("fast-math")
//#define LOCAL
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
  enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifndef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
  ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
  *this << "[";
  for (auto it = d.b; it != d.e; ++it)
	*this << ", " + 2 * (it == d.b) << *it;
  ris << "]";
}
#else
sim dor(const c&) { ris; }
#endif
};
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
#define fi first
#define f first
#define se second
#define s second
#define vi_a vector<int>a;
#define p_b push_back
////////////////////////////////???????????????CHECK THIS OUT???????????????//////////////////////////////
#define ll long long
typedef unsigned long long ull;
////////////////////////////////???????????????CHECK THIS OUT???????????????//////////////////////////////
#define ld long double
#define pll pair<ll,ll>
#define pii pair<int,int>
#define m_p make_pair
#define fast_io cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);
#define all(x) x.begin(),x.end()
#define getfiles    ifstream cin("input.txt");ofstream cout("output.txt");
#define pw(x) (1ll << x)
#define sz(x) (int)x.size()
#define endl "\n"
#define rall(x) x.rbegin(),x.rend()
#define len(a) (ll)a.size()
#define rep(x,l,r) for(ll x=l;x<r;x++)

//using namespace __gnu_pbds;
ld eps = (ld)1 / 1e6;
const ld pi=3.14159265359;
ll inf = 1e18,mod1=1e9+7;
ll sqr(ll a) { return a * a; }
ll qb(ll a) { return a * a * a; }
ll gcd(ll a, ll b) { return !a ? b : gcd(b % a, a); }
ll binpow(ll a, ll b, ll mod) { return b ? (b % 2 ? (a * (sqr(binpow(a, b / 2, mod)) % mod)) % mod : sqr(binpow(a, b / 2, mod)) % mod) : 1; }
ll binmult(ll a, ll b, ll mod) { return b ? (b % 2 ? (2 * binmult(a, b / 2, mod) + a) % mod : (2 * binmult(a, b / 2, mod)) % mod) : 0; }
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
const ll R=1e4;
const ll tx[4]={0,0,-1,1};
const ll ty[4]={-1,1,0,0};
const char rev_to[4]={'E','W','N','S'};
const int N=1e6+1e5;
const int M=1e9+7;
//typedef tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update> st;
auto rnd=bind(uniform_int_distribution<ll>(1,1e18),mt19937(time(0)));
struct stuff{
    ll id,time,val;
    bool operator< (const stuff &other)const{
        return val==other.val ? time>other.time : val>other.val;
    }
};
ll ans[N];
vector<stuff> adj[N];
ll done[N];
signed main()
{
    fast_io;
    ll n,m,k;
    cin>>n>>m;
    int a1,a2,a3,a4;
    for(int i=0;i<n;i++) done[i]=1e18,ans[i]=1e18;
    for(int i=0;i<m;i++){
        cin>>a1>>a2>>a3>>a4;
        --a1;--a2;
        adj[a1].p_b({a2,a3,a4});
        adj[a2].p_b({a1,a3,a4});
    }
    priority_queue<stuff>pq;
    pq.push({0,0,0});
    ans[0]=0;
    done[0]=0;
    ll mx=2000*2000;
    while(!pq.empty()){
        auto c=pq.top();
        pq.pop();
        if(done[c.id]<c.time){
            continue;
        }
        done[c.id]=c.time;
        ans[c.id]=min(ans[c.id],1ll*c.time*c.val);
//        debug()<<imie(c.id)<<imie(c.val)<<imie(c.time);
        for(auto &z : adj[c.id]){
            if(done[z.id]>z.time+c.time ){
                pq.push({z.id,(z.time+c.time),(c.val+z.val)});
            }
        }
    }
    for(int i=1;i<n;i++) cout<<(ans[i]==1e18 ? -1 : ans[i])<<endl;
    return 0;
}
/*
0 0 0
2 1 3
3 2 7
1 3 8
1 4 2
3 5 3

/
*/

Compilation message

ceste.cpp: In function 'int main()':
ceste.cpp:94:12: warning: unused variable 'k' [-Wunused-variable]
     ll n,m,k;
            ^
ceste.cpp:108:8: warning: unused variable 'mx' [-Wunused-variable]
     ll mx=2000*2000;
        ^~

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 26240 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 26240 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 26240 KB Output is correct

Subtask #4
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 26240 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 26328 KB Output is correct
2 Correct 17 ms 26368 KB Output is correct
3 Correct 17 ms 26368 KB Output is correct

Subtask #6
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 26752 KB Output is correct
2 Correct 29 ms 27132 KB Output is correct
3 Correct 31 ms 28028 KB Output is correct

Subtask #7
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 100 ms 28016 KB Output is correct
2 Correct 152 ms 32628 KB Output is correct
3 Correct 18 ms 26496 KB Output is correct

Subtask #8
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 26808 KB Output is correct
2 Correct 152 ms 32612 KB Output is correct
3 Correct 20 ms 26368 KB Output is correct

Subtask #9
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 100 ms 26680 KB Output is correct
2 Correct 132 ms 28024 KB Output is correct
3 Correct 113 ms 28016 KB Output is correct

Subtask #10
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 119 ms 28016 KB Output is correct
2 Correct 111 ms 28016 KB Output is correct
3 Correct 146 ms 28016 KB Output is correct