oj.uz

Submission #167422

# Submission time Handle Problem Language Result Execution time Memory
167422 2019-12-08T13:57:35 Z cbertram Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 435 ms 26960 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long int ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<vpii> vvpii;
typedef vector<pll> vpll;
typedef vector<vpll> vvpll;
typedef vector<string> vs;
typedef vector<vb> vvb;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
#define all(x) x.begin(), x.end()
#define rep(i,a,b) for(int i = a; i < b; i++)

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);

  int N, M;
  cin >> N;
  cin >> M;
  int S, T;
  cin >> S;
  cin >> T;
  S--;
  T--;
  int U, V;
  cin >> U;
  cin >> V;
  U--;
  V--;

  vvpll conn(N, vpll(0));
  rep(m,0,M) {
    long a, b, c;
    cin >> a;
    cin >> b;
    cin >> c;
    a--;
    b--;
    conn[a].push_back(make_pair(b, c));
    conn[b].push_back(make_pair(a, c));
  }

  vll distU(N);
  vb vis(N);
  priority_queue<pll, vpll, greater<pll>> pq1;
  pq1.push(make_pair(0,U));
  while(!pq1.empty()) {
    ll n = pq1.top().second;
    ll d = pq1.top().first;
    pq1.pop();
    if(vis[n]) continue;
    vis[n] = true;
    distU[n] = d;
    rep(i,0,(int)conn[n].size())
      if(!vis[conn[n][i].first])
	pq1.push(make_pair(d+conn[n][i].second, conn[n][i].first));
  }
  vll distV(N);
  fill(all(vis), false);
  pq1.push(make_pair(0,V));
  while(!pq1.empty()) {
    ll n = pq1.top().second;
    ll d = pq1.top().first;
    pq1.pop();
    if(vis[n]) continue;
    vis[n] = true;
    distV[n] = d;
    rep(i,0,(int)conn[n].size())
      if(!vis[conn[n][i].first])
	pq1.push(make_pair(d+conn[n][i].second, conn[n][i].first));
  }
  //rep(n,0,N) cerr << distV[n] << ' ';
  //cerr << '\n';

  fill(all(vis), false);
  priority_queue<pair<pair<ll,pair<ll,pair<ll,ll>>>,ll>,
		 vector<pair<pair<ll,pair<ll,pair<ll,ll>>>,ll>>,
		 greater<pair<pair<ll,pair<ll,pair<ll,ll>>>,ll>>> pq;
  pq.push(make_pair(make_pair(0,make_pair(distU[S]+distV[S],make_pair(distU[S],distV[S]))),S));
  while(!pq.empty()) {
    ll dS = pq.top().first.first;
    ll dUV = pq.top().first.second.first;
    ll dU = pq.top().first.second.second.first;
    ll dV = pq.top().first.second.second.second;
    ll n = pq.top().second;
    pq.pop();
    //cerr << "n?: " << n << '\n';
    if(vis[n]) continue;
    vis[n] = true;
    //cerr << "n: " << n << '\n';
    if(n == T) {
      //cout << dUV << ", " << dU << ", " << dV << ", " << dS << '\n';
      cout << min(distU[V], dUV) << '\n';
      break;
    }
    rep(i,0,(int)conn[n].size())
      if(!vis[conn[n][i].first]) {
	ll nn = conn[n][i].first;
	ll ndS = dS+conn[n][i].second;
	ll ndU = min(dU, distU[nn]);
	ll ndV = min(dV, distV[nn]);
	ll ndUV = ndU+ndV;
	pq.push(make_pair(make_pair(ndS,make_pair(ndUV,make_pair(ndU,ndV))),nn));
      }
  }
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 374 ms 26960 KB Output is correct
2 Correct 350 ms 25960 KB Output is correct
3 Correct 403 ms 25884 KB Output is correct
4 Correct 396 ms 26508 KB Output is correct
5 Correct 359 ms 25700 KB Output is correct
6 Correct 361 ms 26852 KB Output is correct
7 Correct 369 ms 26140 KB Output is correct
8 Correct 353 ms 25828 KB Output is correct
9 Correct 330 ms 24304 KB Output is correct
10 Correct 366 ms 26900 KB Output is correct
11 Correct 147 ms 11732 KB Output is correct
12 Correct 417 ms 26880 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 352 ms 26352 KB Output is correct
2 Correct 339 ms 23288 KB Output is correct
3 Correct 345 ms 23200 KB Output is correct
4 Correct 362 ms 23152 KB Output is correct
5 Correct 381 ms 23352 KB Output is correct
6 Correct 395 ms 25980 KB Output is correct
7 Correct 371 ms 23164 KB Output is correct
8 Correct 371 ms 23272 KB Output is correct
9 Correct 372 ms 23292 KB Output is correct
10 Correct 359 ms 23248 KB Output is correct
11 Correct 158 ms 11640 KB Output is correct
12 Correct 414 ms 26000 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 3012 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 51 ms 5668 KB Output is correct
5 Correct 21 ms 3324 KB Output is correct
6 Correct 3 ms 504 KB Output is correct
7 Correct 5 ms 632 KB Output is correct
8 Correct 6 ms 760 KB Output is correct
9 Correct 5 ms 504 KB Output is correct
10 Correct 23 ms 3324 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 3 ms 376 KB Output is correct
14 Correct 3 ms 504 KB Output is correct
15 Correct 4 ms 504 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 374 ms 26960 KB Output is correct
2 Correct 350 ms 25960 KB Output is correct
3 Correct 403 ms 25884 KB Output is correct
4 Correct 396 ms 26508 KB Output is correct
5 Correct 359 ms 25700 KB Output is correct
6 Correct 361 ms 26852 KB Output is correct
7 Correct 369 ms 26140 KB Output is correct
8 Correct 353 ms 25828 KB Output is correct
9 Correct 330 ms 24304 KB Output is correct
10 Correct 366 ms 26900 KB Output is correct
11 Correct 147 ms 11732 KB Output is correct
12 Correct 417 ms 26880 KB Output is correct
13 Correct 352 ms 26352 KB Output is correct
14 Correct 339 ms 23288 KB Output is correct
15 Correct 345 ms 23200 KB Output is correct
16 Correct 362 ms 23152 KB Output is correct
17 Correct 381 ms 23352 KB Output is correct
18 Correct 395 ms 25980 KB Output is correct
19 Correct 371 ms 23164 KB Output is correct
20 Correct 371 ms 23272 KB Output is correct
21 Correct 372 ms 23292 KB Output is correct
22 Correct 359 ms 23248 KB Output is correct
23 Correct 158 ms 11640 KB Output is correct
24 Correct 414 ms 26000 KB Output is correct
25 Correct 24 ms 3012 KB Output is correct
26 Correct 3 ms 376 KB Output is correct
27 Correct 3 ms 376 KB Output is correct
28 Correct 51 ms 5668 KB Output is correct
29 Correct 21 ms 3324 KB Output is correct
30 Correct 3 ms 504 KB Output is correct
31 Correct 5 ms 632 KB Output is correct
32 Correct 6 ms 760 KB Output is correct
33 Correct 5 ms 504 KB Output is correct
34 Correct 23 ms 3324 KB Output is correct
35 Correct 2 ms 376 KB Output is correct
36 Correct 2 ms 376 KB Output is correct
37 Correct 3 ms 376 KB Output is correct
38 Correct 3 ms 504 KB Output is correct
39 Correct 4 ms 504 KB Output is correct
40 Correct 390 ms 26560 KB Output is correct
41 Correct 329 ms 21480 KB Output is correct
42 Correct 408 ms 26792 KB Output is correct
43 Correct 111 ms 11768 KB Output is correct
44 Correct 111 ms 11640 KB Output is correct
45 Correct 411 ms 22120 KB Output is correct
46 Correct 411 ms 21992 KB Output is correct
47 Correct 435 ms 26220 KB Output is correct
48 Correct 128 ms 11172 KB Output is correct
49 Correct 407 ms 25716 KB Output is correct
50 Correct 399 ms 22392 KB Output is correct
51 Correct 401 ms 22092 KB Output is correct