제출 #445869

#제출 시각아이디문제언어결과실행 시간메모리
445869cpp219Robot (JOI21_ho_t4)C++14
34 / 100
3066 ms53308 KiB
#pragma GCC optimization O2 #pragma GCC optimization "unroll-loop" #pragma target ("avx2") #include <bits/stdc++.h> #define ll long long #define ld long double #define fs first #define sc second using namespace std; typedef pair<ll,ll> LL; const ll N = 1e5 + 9; const ll Log2 = 20; const ll inf = 1e16 + 7; ll Trans(ll x,ll y){ return x * 200000 + y; } unordered_map<ll,ll> mp,All; vector<ll> d[N][2]; ll n,m,x,y,c,p,ans = inf; struct Edge{ ll to,c,p; }; vector<Edge> g[N]; struct Node{ ll val,i,change,prv; }; bool operator < (Node a,Node b){ return a.val > b.val; } priority_queue<Node> pq; int main(){ ios_base::sync_with_stdio(NULL); cin.tie(0); cout.tie(0); #define task "test" if (fopen(task".INP","r")){ freopen(task".INP","r",stdin); freopen(task".OUT","w",stdout); } cin>>n>>m; while(m--){ cin>>x>>y>>c>>p; mp[Trans(x,y)] = g[x].size(); mp[Trans(y,x)] = g[y].size(); g[x].push_back({y,c,p}); g[y].push_back({x,c,p}); } for (ll i = 1;i <= n;i++){ d[i][0].resize(g[i].size() + 3); d[i][1].resize(g[i].size() + 3); for (ll j = 0;j < d[i][0].size();j++){ d[i][0][j] = d[i][1][j] = inf; if (i == 1) d[i][0][j] = d[i][1][j] = 0; } for (auto j : g[i]) All[Trans(i,j.c)] += j.p; } pq.push({0,1,0,inf}); while(!pq.empty()){ //cout<<"?"; Node t = pq.top(); pq.pop(); ll u = t.i; if (u == n){ ans = min(ans,t.val); } for (ll i = 0;i < g[u].size();i++){ if (i == t.prv) continue; ll curC = g[u][i].c,v = g[u][i].to,L = g[u][i].p,change; ll cost = All[Trans(u,curC)] - L; if (t.prv != inf && g[u][i].c == g[u][t.prv].c && t.change) cost -= g[u][t.prv].p; //assert(t.change <= 1); //assert(cost >= 0); ll id = mp[Trans(v,u)]; if (d[v][0][id] > t.val + cost){ d[v][0][id] = t.val + cost; //cout<<d[5][1][0]; return 0; //cout<<v<<" "<<1<<" "<<id<<" "<<t.val + cost<<"\n"; pq.push({t.val + cost,v,0,id}); } if (d[v][1][id] > t.val + L){ d[v][1][id] = t.val + L; //cout<<d[5][1][0]; return 0; //cout<<v<<" "<<1<<" "<<id<<" "<<t.val + cost<<"\n"; pq.push({t.val + L,v,1,id}); } } } /// node change prv //cout<<g[2][1].to; return 0; //cout<<d[2][0][1]; return 0; if (ans != inf) cout<<ans; else cout<<-1; }

컴파일 시 표준 에러 (stderr) 메시지

Main.cpp:1: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    1 | #pragma GCC optimization O2
      | 
Main.cpp:2: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    2 | #pragma GCC optimization "unroll-loop"
      | 
Main.cpp:3: warning: ignoring '#pragma target ' [-Wunknown-pragmas]
    3 | #pragma target ("avx2")
      | 
Main.cpp: In function 'int main()':
Main.cpp:53:25: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   53 |         for (ll j = 0;j < d[i][0].size();j++){
      |                       ~~^~~~~~~~~~~~~~~~
Main.cpp:67:25: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<Edge>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   67 |         for (ll i = 0;i < g[u].size();i++){
      |                       ~~^~~~~~~~~~~~~
Main.cpp:69:62: warning: unused variable 'change' [-Wunused-variable]
   69 |             ll curC = g[u][i].c,v = g[u][i].to,L = g[u][i].p,change;
      |                                                              ^~~~~~
Main.cpp:42:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   42 |         freopen(task".INP","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
Main.cpp:43:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   43 |         freopen(task".OUT","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...