oj.uz

Submission #210212

# Submission time Handle Problem Language Result Execution time Memory
210212 2020-03-16T20:27:15 Z Nucleist Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 1422 ms 44504 KB 
#include <bits/stdc++.h> 
using namespace std; 
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#define flash ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define debug(x) cerr << " - " << #x << ": " << x << endl;
#define debugs(x, y) cerr << " - " << #x << ": " << x << " " << #y << ": " << y << endl;
#define all(x) (x).begin(),(x).end()
#define sz(x) (ll)x.size()
#define ll long long
#define INF 1000000000000000000
#define MOD 1000000007
#define pb push_back
#define ve vector<ll>
#define dos pair<ll,ll>
#define vedos vector<dos>
#define rand mt19937 rng(chrono::steady_clock::now().time_since_epoch().count())
struct greateri
{
    template<class T>
    bool operator()(T const &a, T const &b) const { return a > b; }
};
vector<pair<ll,ll>>graph[100001];
ll dist[100001],dist1[100001];
ll ans[100001][3];
ll par[100001][3];
map<dos,ll>weights;
ll tempi;
dos ki(ll u,ll v)
{
    return {min(u,v),max(u,v)};
}
bool edgy(ll u,ll v)
{
    if(dist[u]+weights[ki(u,v)]+dist1[v] == tempi)return true;
    if(dist[v]+weights[ki(u,v)]+dist1[u] == tempi)return true;
    return false;
}
bool edgy1(ll u,ll v,int lev)
{
    if(dist[par[u][lev]]+weights[ki(par[u][lev],u)]+weights[ki(u,v)]+dist1[v] == tempi)return true;
    if(dist[v]+weights[ki(par[u][lev],u)]+weights[ki(u,v)]+dist1[par[u][lev]] == tempi)return true;
    return false;
}
int main()
{
  //flash;
  ll n,m,s,t,u,v;
  cin>>n>>m>>s>>t>>u>>v;
  s--,t--,u--,v--;
  for (ll i = 0; i < m; ++i)
  {
    ll x,y,z;
    cin>>x>>y>>z;
    x--,y--;
    graph[x].pb({y,z});
    graph[y].pb({x,z});
    weights[ki(x,y)]=z;
  }
  for (ll i = 0; i < n; ++i)
  {
      dist[i]=INF;
  }
  priority_queue<dos,vedos,greater<dos>>hi;
  hi.push({0,s});
  dist[s]=0;
  while(!hi.empty())
  {
    auto u=hi.top();
    hi.pop();
    if(dist[u.second]<u.first)continue;
    for(auto it:graph[u.second])
    {
        if(u.first+it.second<dist[it.first])
        {
            dist[it.first]=u.first+it.second;
            hi.push({dist[it.first],it.first});
        }
    }
  }
  tempi=dist[t];
  fill(dist1,dist1+n,INF);
  hi.push({0,t});
  dist1[t]=0;
  while(!hi.empty())
  {
    auto u=hi.top();
    hi.pop();
    if(dist1[u.second]<u.first)continue;
    for(auto it:graph[u.second])
    {
        if(u.first+it.second<dist1[it.first])
        {
            dist1[it.first]=u.first+it.second;
            hi.push({dist1[it.first],it.first});
        }
    }
  }
  for (ll i = 0; i < n; ++i)
  {
      ans[i][0]=ans[i][1]=ans[i][2]=INF;
  }
  priority_queue<pair<ll,dos>,vector<pair<ll,dos>>,greater<pair<ll,dos>>>hey;
  ans[u][0]=0;
  hey.push({0,{u,0}});
  while(!hey.empty())
  {
    auto u=hey.top();
    hey.pop();
    auto node=u.second.first;
    auto lev=u.second.second;
    auto far=u.first;
    if(ans[node][lev]<far)continue;
    for(auto it:graph[node])
    {
        if(lev==0)
        {
            if(far+it.second<ans[it.first][0])
            {
                ans[it.first][0]=far+it.second;
                hey.push({ans[it.first][0],{it.first,0}});
                par[it.first][0]=node;
            }
            if(edgy(node,it.first) && far<ans[it.first][1])
            {
                ans[it.first][1]=far;
                hey.push({ans[it.first][1],{it.first,1}});
                par[it.first][1]=node;
            }
        }
        else if(lev==1)
        {
            if(edgy1(node,it.first,lev) && far<ans[it.first][1])
            {
                ans[it.first][1]=far;
                hey.push({ans[it.first][1],{it.first,1}});
                par[it.first][1]=node;
            }
            if(far+it.second<ans[it.first][2])
            {
                ans[it.first][2]=far+it.second;
                hey.push({ans[it.first][2],{it.first,2}});
                par[it.first][2]=node;
            }
        }
        else
        {
           if(far+it.second<ans[it.first][2])
            {
                ans[it.first][2]=far+it.second;
                hey.push({ans[it.first][2],{it.first,2}});
                par[it.first][2]=node;
            } 
        }
    }
  }
  cout<<min(ans[v][0],min(ans[v][1],ans[v][2]));
  return 0;
}
//code the AC sol !
// BS/queue/map

Compilation message

commuter_pass.cpp:4:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization ("O3")
 
commuter_pass.cpp:5:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization ("unroll-loops")

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1126 ms 40796 KB Output is correct
2 Correct 1186 ms 36816 KB Output is correct
3 Correct 1381 ms 40672 KB Output is correct
4 Correct 1145 ms 36716 KB Output is correct
5 Correct 1291 ms 39688 KB Output is correct
6 Correct 1154 ms 40800 KB Output is correct
7 Correct 1279 ms 39796 KB Output is correct
8 Correct 1326 ms 39900 KB Output is correct
9 Correct 1154 ms 36580 KB Output is correct
10 Correct 1050 ms 36460 KB Output is correct
11 Correct 571 ms 22124 KB Output is correct
12 Correct 1281 ms 36716 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1346 ms 36968 KB Output is correct
2 Correct 1363 ms 36856 KB Output is correct
3 Correct 1288 ms 39932 KB Output is correct
4 Correct 1310 ms 36832 KB Output is correct
5 Correct 1307 ms 39984 KB Output is correct
6 Correct 1373 ms 43492 KB Output is correct
7 Correct 1389 ms 43112 KB Output is correct
8 Correct 1300 ms 40128 KB Output is correct
9 Correct 1322 ms 40044 KB Output is correct
10 Correct 1312 ms 40036 KB Output is correct
11 Correct 611 ms 25620 KB Output is correct
12 Correct 1396 ms 43536 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 67 ms 5868 KB Output is correct
2 Correct 7 ms 2808 KB Output is correct
3 Correct 8 ms 2808 KB Output is correct
4 Correct 119 ms 8748 KB Output is correct
5 Correct 55 ms 5752 KB Output is correct
6 Correct 10 ms 2936 KB Output is correct
7 Correct 13 ms 3064 KB Output is correct
8 Correct 14 ms 3192 KB Output is correct
9 Correct 12 ms 2936 KB Output is correct
10 Correct 61 ms 5724 KB Output is correct
11 Correct 8 ms 2808 KB Output is correct
12 Correct 7 ms 2808 KB Output is correct
13 Correct 7 ms 2808 KB Output is correct
14 Correct 9 ms 2808 KB Output is correct
15 Correct 8 ms 2808 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 1126 ms 40796 KB Output is correct
2 Correct 1186 ms 36816 KB Output is correct
3 Correct 1381 ms 40672 KB Output is correct
4 Correct 1145 ms 36716 KB Output is correct
5 Correct 1291 ms 39688 KB Output is correct
6 Correct 1154 ms 40800 KB Output is correct
7 Correct 1279 ms 39796 KB Output is correct
8 Correct 1326 ms 39900 KB Output is correct
9 Correct 1154 ms 36580 KB Output is correct
10 Correct 1050 ms 36460 KB Output is correct
11 Correct 571 ms 22124 KB Output is correct
12 Correct 1281 ms 36716 KB Output is correct
13 Correct 1346 ms 36968 KB Output is correct
14 Correct 1363 ms 36856 KB Output is correct
15 Correct 1288 ms 39932 KB Output is correct
16 Correct 1310 ms 36832 KB Output is correct
17 Correct 1307 ms 39984 KB Output is correct
18 Correct 1373 ms 43492 KB Output is correct
19 Correct 1389 ms 43112 KB Output is correct
20 Correct 1300 ms 40128 KB Output is correct
21 Correct 1322 ms 40044 KB Output is correct
22 Correct 1312 ms 40036 KB Output is correct
23 Correct 611 ms 25620 KB Output is correct
24 Correct 1396 ms 43536 KB Output is correct
25 Correct 67 ms 5868 KB Output is correct
26 Correct 7 ms 2808 KB Output is correct
27 Correct 8 ms 2808 KB Output is correct
28 Correct 119 ms 8748 KB Output is correct
29 Correct 55 ms 5752 KB Output is correct
30 Correct 10 ms 2936 KB Output is correct
31 Correct 13 ms 3064 KB Output is correct
32 Correct 14 ms 3192 KB Output is correct
33 Correct 12 ms 2936 KB Output is correct
34 Correct 61 ms 5724 KB Output is correct
35 Correct 8 ms 2808 KB Output is correct
36 Correct 7 ms 2808 KB Output is correct
37 Correct 7 ms 2808 KB Output is correct
38 Correct 9 ms 2808 KB Output is correct
39 Correct 8 ms 2808 KB Output is correct
40 Correct 1371 ms 44504 KB Output is correct
41 Correct 1162 ms 39228 KB Output is correct
42 Correct 1146 ms 39280 KB Output is correct
43 Correct 624 ms 25708 KB Output is correct
44 Correct 624 ms 25732 KB Output is correct
45 Correct 1413 ms 42720 KB Output is correct
46 Correct 1422 ms 42464 KB Output is correct
47 Correct 1137 ms 41192 KB Output is correct
48 Correct 630 ms 25196 KB Output is correct
49 Correct 1159 ms 44120 KB Output is correct
50 Correct 1371 ms 42848 KB Output is correct
51 Correct 1372 ms 42728 KB Output is correct