oj.uz

답안 #552915

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
552915 2022-04-24T10:00:43 Z farhan132 Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 334 ms 24816 KB 
/***Farhan132***/
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
//#pragma GCC optimization ("unroll-loops")
//#pragma GCC optimize("Ofast,fast-math")
 
#include <bits/stdc++.h>
 
 
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
typedef double dd;
typedef vector<ll> vll;
typedef pair<ll , ll> ii;
typedef vector< ii > vii;
typedef pair < pair < ll , ll > , pair < ll , ll > > cm; 
typedef tuple < ll,  ll, ll > tp;
 
#define ff first
#define ss second
#define pb push_back
#define in insert
#define f0(b) for(int i=0;i<(b);i++)
#define f00(b) for(int j=0;j<(b);j++)
#define f1(b) for(int i=1;i<=(b);i++)
#define f11(b) for(int j=1;j<=(b);j++)
#define f2(a,b) for(int i=(a);i<=(b);i++)
#define f22(a,b) for(int j=(a);j<=(b);j++)
#define sf(a) scanf("%lld",&a)
#define sff(a,b) scanf("%lld %lld", &a , &b)
#define pf(a) printf("%lld\n",a)
#define pff(a,b) printf("%lld %lld\n", a , b)
#define bug printf("**!\n")
#define mem(a , b) memset(a, b ,sizeof(a))
#define front_zero(n) __builtin_clzll(n)
#define back_zero(n) __builtin_ctzll(n)
#define total_one(n) __builtin_popcount(n)
#define clean fflush(stdout)
 
//const ll mod =  (ll) 998244353;
const ll mod =  (ll) 1e9 + 7;
const ll maxn = (ll)1e8 + 5;
const int nnn = 1048590;
const int inf = numeric_limits<int>::max()-1;
//const ll INF = numeric_limits<ll>::max()-1;
const ll INF = (ll)1e18;
 
ll dx[]={0,1,0,-1};
ll dy[]={1,0,-1,0};
ll dxx[]={0,1,0,-1,1,1,-1,-1};
ll dyy[]={1,0,-1,0,1,-1,1,-1};
 
bool USACO = 0;
 
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
 
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
 
template <typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

const ll N = 1e5 + 5;

ll dis[4][N];
ll mn[2][N];
ll n; 
vector < ii > g[N];

void make(ll start, ll id){

  for(ll i = 1; i <= n; i++){
    if(id < 2) mn[id][i] = INF;
    dis[id][i] = INF; 
  }
  vector < bool > vis(n + 1, 0);
  priority_queue < ii , vector < ii > , greater < ii >  > p;
  dis[id][start] = 0;
  p.push({0, start});


  while(p.size()){
    auto [d , node] = p.top(); p.pop();
    if(vis[node]) continue;
    vis[node] = 1;
    if(id < 2) mn[id][node] = min(mn[id][node], dis[3][node]);

    for(auto [u , w] : g[node]){

        if(dis[id][u] > dis[id][node] + w){
            dis[id][u] = dis[id][node] + w;
            if(id < 2) mn[id][u] = mn[id][node];
            p.push({dis[id][u], u});
        }else if(dis[id][u] == dis[id][node] + w){
            if(id < 2) mn[id][u] = min(mn[id][node], mn[id][u]);
        }
    }

  }

  return;
}

void solve(){

  
  ll m;
  cin >> n >> m;
  ll s , t , u , v; cin >> s >> t >> u >> v;

  for(ll i = 1; i <= m; i++){
    ll x, y , w;
    cin >> x >> y >> w;
    g[x].pb({y, w});
    g[y].pb({x, w});
  }

  make(v, 3);
  make(u, 2);
  make(t, 1);
  make(s, 0);
  ll ans = dis[2][v];
  for(ll i = 1; i <= n; i++){
    if(dis[0][i] + dis[1][i] == dis[0][t]){

        ans = min({ans, dis[2][i] + mn[1][i] , mn[0][i] + dis[2][i]});
    }
  }
  cout << ans << '\n';

  
  return;
}
 
int main() {
    
    
    #ifdef LOCAL
        freopen("in", "r", stdin);
        freopen("out", "w", stdout);
        auto start_time = clock();
    #else 
       ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
    #endif
 
    //pre(N);
 
    ll T = 1, CT = 0;  //cin >> T; 
 
    while(T--){

        solve();
    }
    #ifdef LOCAL
        auto end_time = clock();
        cerr<< "Execution time: "<<(end_time - start_time)*(int)1e3/CLOCKS_PER_SEC<<" ms\n";
    #endif
 
    return 0;
}

Compilation message

commuter_pass.cpp: In function 'int main()':
commuter_pass.cpp:151:15: warning: unused variable 'CT' [-Wunused-variable]
  151 |     ll T = 1, CT = 0;  //cin >> T;
      |               ^~

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 329 ms 24740 KB Output is correct
2 Correct 270 ms 23228 KB Output is correct
3 Correct 272 ms 23024 KB Output is correct
4 Correct 292 ms 23524 KB Output is correct
5 Correct 261 ms 22852 KB Output is correct
6 Correct 312 ms 24816 KB Output is correct
7 Correct 304 ms 23028 KB Output is correct
8 Correct 277 ms 23140 KB Output is correct
9 Correct 303 ms 23884 KB Output is correct
10 Correct 234 ms 23844 KB Output is correct
11 Correct 138 ms 14628 KB Output is correct
12 Correct 306 ms 23736 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 299 ms 23456 KB Output is correct
2 Correct 334 ms 23248 KB Output is correct
3 Correct 305 ms 23060 KB Output is correct
4 Correct 309 ms 23072 KB Output is correct
5 Correct 322 ms 23120 KB Output is correct
6 Correct 266 ms 23156 KB Output is correct
7 Correct 326 ms 22940 KB Output is correct
8 Correct 289 ms 23304 KB Output is correct
9 Correct 296 ms 23192 KB Output is correct
10 Correct 330 ms 23232 KB Output is correct
11 Correct 107 ms 14688 KB Output is correct
12 Correct 294 ms 23112 KB Output is correct

Subtask #3
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 4436 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 15 ms 6228 KB Output is correct
5 Correct 10 ms 4444 KB Output is correct
6 Correct 3 ms 2772 KB Output is correct
7 Correct 3 ms 2900 KB Output is correct
8 Correct 3 ms 2900 KB Output is correct
9 Correct 3 ms 2772 KB Output is correct
10 Correct 11 ms 4432 KB Output is correct
11 Correct 2 ms 2772 KB Output is correct
12 Correct 2 ms 2644 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 2 ms 2772 KB Output is correct
15 Correct 2 ms 2772 KB Output is correct

Subtask #4
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 329 ms 24740 KB Output is correct
2 Correct 270 ms 23228 KB Output is correct
3 Correct 272 ms 23024 KB Output is correct
4 Correct 292 ms 23524 KB Output is correct
5 Correct 261 ms 22852 KB Output is correct
6 Correct 312 ms 24816 KB Output is correct
7 Correct 304 ms 23028 KB Output is correct
8 Correct 277 ms 23140 KB Output is correct
9 Correct 303 ms 23884 KB Output is correct
10 Correct 234 ms 23844 KB Output is correct
11 Correct 138 ms 14628 KB Output is correct
12 Correct 306 ms 23736 KB Output is correct
13 Correct 299 ms 23456 KB Output is correct
14 Correct 334 ms 23248 KB Output is correct
15 Correct 305 ms 23060 KB Output is correct
16 Correct 309 ms 23072 KB Output is correct
17 Correct 322 ms 23120 KB Output is correct
18 Correct 266 ms 23156 KB Output is correct
19 Correct 326 ms 22940 KB Output is correct
20 Correct 289 ms 23304 KB Output is correct
21 Correct 296 ms 23192 KB Output is correct
22 Correct 330 ms 23232 KB Output is correct
23 Correct 107 ms 14688 KB Output is correct
24 Correct 294 ms 23112 KB Output is correct
25 Correct 10 ms 4436 KB Output is correct
26 Correct 2 ms 2644 KB Output is correct
27 Correct 2 ms 2644 KB Output is correct
28 Correct 15 ms 6228 KB Output is correct
29 Correct 10 ms 4444 KB Output is correct
30 Correct 3 ms 2772 KB Output is correct
31 Correct 3 ms 2900 KB Output is correct
32 Correct 3 ms 2900 KB Output is correct
33 Correct 3 ms 2772 KB Output is correct
34 Correct 11 ms 4432 KB Output is correct
35 Correct 2 ms 2772 KB Output is correct
36 Correct 2 ms 2644 KB Output is correct
37 Correct 2 ms 2644 KB Output is correct
38 Correct 2 ms 2772 KB Output is correct
39 Correct 2 ms 2772 KB Output is correct
40 Correct 290 ms 24756 KB Output is correct
41 Correct 295 ms 24108 KB Output is correct
42 Correct 275 ms 23792 KB Output is correct
43 Correct 105 ms 14808 KB Output is correct
44 Correct 126 ms 14736 KB Output is correct
45 Correct 255 ms 22648 KB Output is correct
46 Correct 262 ms 22476 KB Output is correct
47 Correct 282 ms 23372 KB Output is correct
48 Correct 118 ms 14236 KB Output is correct
49 Correct 237 ms 24164 KB Output is correct
50 Correct 314 ms 22748 KB Output is correct
51 Correct 244 ms 22708 KB Output is correct