답안 #92139 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
92139	2019-01-01T16:13:50 Z	karma	Commuter Pass (JOI18_commuter_pass)	C++11	100 / 100	496 ms	26144 KB

commuter_pass

#include<bits/stdc++.h>
#define For(i, a, b)  for(int i = a, _b = b; i <= _b; ++i)
#define Ford(i, a, b) for(int i = a, _b = b; i >= _b; --i)
#define FileName      "test"
#define ll            long long
#define ld            long double
#define ull           unsigned long long
#define Print(x)      cerr << #x << "is " << x << '\n';
#define pb            push_back
#define X             first
#define Y             second
//#define Karma

using namespace std;

template<typename T> inline void Cin(T &x)
{
    char c;
    T sign = 1;
    x = 0;
    for (c = getchar(); c < '0' || c > '9'; c = getchar())
        if (c == '-') sign = -1;
    for (; c >= '0' && c <= '9'; c = getchar())
        x = x * 10 + c - '0';
    x *= sign;
}
template <typename T> inline void Out(T x) {if(x > 9) Out(x / 10); putchar(x % 10 + '0');}
template <typename T> inline void Cout(T x, char c) {if(x < 0) putchar('-'); x = abs(x); Out(x); putchar(c);}
template <typename T, typename... Args> inline void Cin(T& a, Args&... args) {Cin(a);Cin(args...);}
template <typename T, typename... Args> inline void Cout(T a, char c, Args... args) {Cout(a, c);Cout(args...);}

typedef pair<int, int> pii;
typedef pair<ll, int> plli;
const int N = 1e5 + 7;
const ll oo = (ll)1e18 + 7;

struct TEdge
{
    int u, v; ll w;
} _e[N * 2];
typedef TEdge* PEdge;
PEdge e;
ll res;
queue<int> q;
vector<ll> d[4], dis[4];
vector<int> g[N];
vector<PEdge> a[N];
int n, m, s, t, u, v, in[N];
priority_queue<plli, vector<plli>, greater<plli>> pq;

void Dijkstra(int s, vector<ll>& d)
{
    d.resize(n + 1);
    for(int i = 0; i <= n; ++i) d[i] = oo;
    pq.push({0, s});
    d[s] = 0;
    while(!pq.empty())
    {
        plli top = pq.top();
        pq.pop();
        if(d[top.Y] != top.X) continue;
        int u = top.Y;
        for(PEdge e: a[u])
        {
            int v = e -> u + e -> v - u;
            if(d[v] > d[u] + e -> w) d[v] = d[u] + e -> w, pq.push({d[v], v});
        }
    }
}

void Enter()
{
     Cin(n, m, s, t, u, v);
     e = _e;
     For(i, 1, m)
     {
         ++e;
         Cin(e -> u, e -> v, e -> w);
         a[e -> u].pb(e), a[e -> v].pb(e);
     }
     Dijkstra(s, d[0]), Dijkstra(t, d[1]);
     Dijkstra(u, d[2]), Dijkstra(v, d[3]);
     e = _e;
     For(i, 1, m)
     {
         ++e;
         if(d[0][e -> u] + e -> w + d[1][e -> v] == d[0][t])
            g[e -> v].pb(e -> u), ++in[e -> u];
         swap(e -> u, e -> v);
         if(d[0][e -> u] + e -> w + d[1][e -> v] == d[0][t])
            g[e -> v].pb(e -> u), ++in[e -> u];
     }
}

void Solve()
{
     dis[2] = d[2], dis[3] = d[3];
     res = d[2][v];
     q.push(t);
     while(!q.empty())
     {
         int x = q.front();
         q.pop();
         res = min(res, min(d[3][x] + dis[2][x], d[2][x] + dis[3][x]));
         for(int y: g[x])
         {
             dis[3][y] = min(dis[3][x], dis[3][y]);
             dis[2][y] = min(dis[2][y], dis[2][x]);
             --in[y];
             if(in[y] == 0) q.push(y);
         }
     }
     cout << res;
}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
#ifdef Karma
    freopen(FileName".inp", "r", stdin);
    freopen(FileName".out", "w", stdout);
#endif // Karma

    Enter();
    Solve();

    return 0;
}

Subtask #1
16.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	383 ms	21096 KB	Output is correct
2	Correct	415 ms	21672 KB	Output is correct
3	Correct	453 ms	23028 KB	Output is correct
4	Correct	302 ms	24172 KB	Output is correct
5	Correct	481 ms	25028 KB	Output is correct
6	Correct	361 ms	24224 KB	Output is correct
7	Correct	367 ms	25368 KB	Output is correct
8	Correct	332 ms	25300 KB	Output is correct
9	Correct	322 ms	24588 KB	Output is correct
10	Correct	337 ms	24432 KB	Output is correct
11	Correct	206 ms	18168 KB	Output is correct
12	Correct	308 ms	24304 KB	Output is correct

Subtask #2
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	408 ms	21532 KB	Output is correct
2	Correct	379 ms	24300 KB	Output is correct
3	Correct	376 ms	24240 KB	Output is correct
4	Correct	447 ms	24300 KB	Output is correct
5	Correct	407 ms	24564 KB	Output is correct
6	Correct	490 ms	25696 KB	Output is correct
7	Correct	427 ms	25596 KB	Output is correct
8	Correct	421 ms	24456 KB	Output is correct
9	Correct	496 ms	24448 KB	Output is correct
10	Correct	402 ms	24192 KB	Output is correct
11	Correct	170 ms	18936 KB	Output is correct
12	Correct	364 ms	25992 KB	Output is correct

Subtask #3
24.0 / 24.0

#	결과	실행 시간	메모리	Grader output
1	Correct	11 ms	6520 KB	Output is correct
2	Correct	5 ms	5116 KB	Output is correct
3	Correct	5 ms	5112 KB	Output is correct
4	Correct	15 ms	7800 KB	Output is correct
5	Correct	12 ms	6492 KB	Output is correct
6	Correct	5 ms	5112 KB	Output is correct
7	Correct	6 ms	5240 KB	Output is correct
8	Correct	6 ms	5240 KB	Output is correct
9	Correct	6 ms	5240 KB	Output is correct
10	Correct	11 ms	6392 KB	Output is correct
11	Correct	6 ms	5112 KB	Output is correct
12	Correct	6 ms	5112 KB	Output is correct
13	Correct	6 ms	5112 KB	Output is correct
14	Correct	6 ms	5112 KB	Output is correct
15	Correct	6 ms	5112 KB	Output is correct

Subtask #4
45.0 / 45.0

#	결과	실행 시간	메모리	Grader output
1	Correct	383 ms	21096 KB	Output is correct
2	Correct	415 ms	21672 KB	Output is correct
3	Correct	453 ms	23028 KB	Output is correct
4	Correct	302 ms	24172 KB	Output is correct
5	Correct	481 ms	25028 KB	Output is correct
6	Correct	361 ms	24224 KB	Output is correct
7	Correct	367 ms	25368 KB	Output is correct
8	Correct	332 ms	25300 KB	Output is correct
9	Correct	322 ms	24588 KB	Output is correct
10	Correct	337 ms	24432 KB	Output is correct
11	Correct	206 ms	18168 KB	Output is correct
12	Correct	308 ms	24304 KB	Output is correct
13	Correct	408 ms	21532 KB	Output is correct
14	Correct	379 ms	24300 KB	Output is correct
15	Correct	376 ms	24240 KB	Output is correct
16	Correct	447 ms	24300 KB	Output is correct
17	Correct	407 ms	24564 KB	Output is correct
18	Correct	490 ms	25696 KB	Output is correct
19	Correct	427 ms	25596 KB	Output is correct
20	Correct	421 ms	24456 KB	Output is correct
21	Correct	496 ms	24448 KB	Output is correct
22	Correct	402 ms	24192 KB	Output is correct
23	Correct	170 ms	18936 KB	Output is correct
24	Correct	364 ms	25992 KB	Output is correct
25	Correct	11 ms	6520 KB	Output is correct
26	Correct	5 ms	5116 KB	Output is correct
27	Correct	5 ms	5112 KB	Output is correct
28	Correct	15 ms	7800 KB	Output is correct
29	Correct	12 ms	6492 KB	Output is correct
30	Correct	5 ms	5112 KB	Output is correct
31	Correct	6 ms	5240 KB	Output is correct
32	Correct	6 ms	5240 KB	Output is correct
33	Correct	6 ms	5240 KB	Output is correct
34	Correct	11 ms	6392 KB	Output is correct
35	Correct	6 ms	5112 KB	Output is correct
36	Correct	6 ms	5112 KB	Output is correct
37	Correct	6 ms	5112 KB	Output is correct
38	Correct	6 ms	5112 KB	Output is correct
39	Correct	6 ms	5112 KB	Output is correct
40	Correct	435 ms	24500 KB	Output is correct
41	Correct	279 ms	24432 KB	Output is correct
42	Correct	351 ms	24556 KB	Output is correct
43	Correct	159 ms	20216 KB	Output is correct
44	Correct	179 ms	20156 KB	Output is correct
45	Correct	337 ms	26144 KB	Output is correct
46	Correct	397 ms	26092 KB	Output is correct
47	Correct	309 ms	24292 KB	Output is correct
48	Correct	139 ms	19576 KB	Output is correct
49	Correct	277 ms	24260 KB	Output is correct
50	Correct	383 ms	25708 KB	Output is correct
51	Correct	370 ms	26136 KB	Output is correct

답안 #92139

Compilation message

Subtask #1 16.0 / 16.0

Subtask #2 15.0 / 15.0

Subtask #3 24.0 / 24.0

Subtask #4 45.0 / 45.0

Subtask #1
16.0 / 16.0

Subtask #2
15.0 / 15.0

Subtask #3
24.0 / 24.0

Subtask #4
45.0 / 45.0