oj.uz

답안 #58897

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
58897 2018-07-19T18:57:00 Z Benq 페리들 (NOI13_ferries) C++14
17 / 40
 396 ms 28808 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)

#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 100001;

int n,m, cur[MX];
vi radj[MX];
priority_queue<int> p[MX];
priority_queue<pi,vpi,greater<pi>> nex;

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> n >> m;
    F0R(i,m) {
        int a,b,c; cin >> a >> b >> c;
        p[a].push(c);
        radj[b].pb(a);
    }
    FOR(i,1,n+1) cur[i] = MOD;
    cur[n] = 0; nex.push({0,n}); 
    while (sz(nex)) {
        auto a = nex.top(); nex.pop();
        for (int x: radj[a.s]) {
            if (p[x].top()+a.f < cur[x]) nex.push({cur[x] = p[x].top()+a.f,x});
            p[x].pop();
        }
    }
    cout << cur[1];
}

/* Look for:
* the exact constraints (multiple sets are too slow for n=10^6 :( ) 
* special cases (n=1?)
* overflow (ll vs int?)
* array bounds
*/

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 5880 KB Output is correct
2 Correct 8 ms 6124 KB Output is correct
3 Correct 20 ms 7408 KB Output is correct
4 Correct 161 ms 18204 KB Output is correct
5 Correct 159 ms 21036 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 21036 KB Output is correct
2 Correct 8 ms 21036 KB Output is correct
3 Correct 22 ms 21036 KB Output is correct
4 Correct 73 ms 21036 KB Output is correct
5 Correct 222 ms 23184 KB Output is correct

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 28 ms 23184 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 396 ms 28808 KB Output isn't correct
2 Halted 0 ms 0 KB -