제출 #492369

#제출 시각아이디문제언어결과실행 시간메모리
492369NhatMinh0208Evacuation plan (IZhO18_plan)C++14
100 / 100
593 ms40144 KiB
#ifndef CPL_TEMPLATE #define CPL_TEMPLATE /* Normie's Template v2.5 Changes: Added warning against using pragmas on USACO. */ // Standard library in one include. #include <bits/stdc++.h> using namespace std; // ordered_set library. #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> using namespace __gnu_pbds; #define ordered_set(el) tree<el,null_type,less<el>,rb_tree_tag,tree_order_statistics_node_update> // AtCoder library. (Comment out these two lines if you're not submitting in AtCoder.) (Or if you want to use it in other judges, run expander.py first.) //#include <atcoder/all> //using namespace atcoder; //Pragmas (Comment out these three lines if you're submitting in szkopul or USACO.) #pragma comment(linker, "/stack:200000000") #pragma GCC optimize("Ofast,unroll-loops,tree-vectorize") #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native") //File I/O. #define FILE_IN "cseq.inp" #define FILE_OUT "cseq.out" #define ofile freopen(FILE_IN,"r",stdin);freopen(FILE_OUT,"w",stdout) //Fast I/O. #define fio ios::sync_with_stdio(0);cin.tie(0) #define nfio cin.tie(0) #define endl "\n" //Order checking. #define ord(a,b,c) ((a>=b)and(b>=c)) //min/max redefines, so i dont have to resolve annoying compile errors. #define min(a,b) (((a)<(b))?(a):(b)) #define max(a,b) (((a)>(b))?(a):(b)) // Fast min/max assigns to use with AVX. // Requires g++ 9.2.0. template<typename T> __attribute__((always_inline)) void chkmin(T& a, const T& b) { a=(a<b)?a:b; } template<typename T> __attribute__((always_inline)) void chkmax(T& a, const T& b) { a=(a>b)?a:b; } //Constants. #define MOD (ll(998244353)) #define MAX 300001 #define mag 320 const long double PI=3.14159265358979; //Pairs and 3-pairs. #define p1 first #define p2 second.first #define p3 second.second #define fi first #define se second #define pii(element_type) pair<element_type,element_type> #define piii(element_type) pair<element_type,pii(element_type)> //Quick power of 2. #define pow2(x) (ll(1)<<x) //Short for-loops. #define ff(i,__,___) for(int i=__;i<=___;i++) #define rr(i,__,___) for(int i=__;i>=___;i--) //Typedefs. #define bi BigInt typedef long long ll; typedef long double ld; typedef short sh; // Binpow and stuff ll BOW(ll a, ll x, ll p) { if (!x) return 1; ll res=BOW(a,x/2,p); res*=res; res%=p; if (x%2) res*=a; return res%p; } ll INV(ll a, ll p) { return BOW(a,p-2,p); } //---------END-------// #endif int rep[100001]; set<int> st[100001]; vector<int> ve[100001]; vector<pii(int)> gt[100001]; int n,m,i,j,k,t,t1,u,v,a,b; priority_queue<pii(int),vector<pii(int)>,greater<pii(int)>> pq; int dis[100001]; vector<int> ord; int qx[100001],qy[100001],qr[100001]; int on[100001]; int main() { fio; cin>>n>>m; for (i=1;i<=m;i++) { cin>>a>>b>>v; gt[a].push_back({v,b}); gt[b].push_back({v,a}); } for (i=1;i<=n;i++) { dis[i]=1e9; } cin>>k; for (i=1;i<=k;i++) { cin>>u; dis[u]=0; pq.push({0,u}); } while (pq.size()) { auto p = pq.top(); pq.pop(); if (dis[p.se]<p.fi) continue; for (auto g : gt[p.se]) { if (dis[g.se]>p.fi+g.fi) { dis[g.se]=p.fi+g.fi; pq.push({dis[g.se],g.se}); } } } for (i=1;i<=n;i++) ord.push_back(i); sort(ord.begin(), ord.end(), [](int a, int b){ return (dis[a]>dis[b]); }); for (i=1;i<=n;i++) { ve[i].push_back(i); rep[i]=i; } cin>>t; for (i=1;i<=t;i++) { cin>>qx[i]>>qy[i]; st[qx[i]].insert(i); st[qy[i]].insert(i); } for (auto g : ord) { on[g]=1; for (auto gg : gt[g]) if (on[gg.se]) { a=g; b=gg.se; a=rep[a]; b=rep[b]; if (a-b) { if (st[a].size()+ve[a].size()<st[b].size()+ve[b].size()) { for (auto h : ve[a]) { rep[h]=b; ve[b].push_back(h); } ve[a].clear(); for (auto h : st[a]) { auto it = st[b].find(h); if (it != st[b].end()) { qr[h]=dis[g]; st[b].erase(it); } else { st[b].insert(h); } } st[a].clear(); } else { for (auto h : ve[b]) { rep[h]=a; ve[a].push_back(h); } ve[b].clear(); for (auto h : st[b]) { auto it = st[a].find(h); if (it != st[a].end()) { qr[h]=dis[g]; st[a].erase(it); } else { st[a].insert(h); } } st[b].clear(); } } } } for (i=1;i<=t;i++) cout<<qr[i]<<endl; } /* 9 12 1 9 4 1 2 5 2 3 7 2 4 3 4 3 6 3 6 4 8 7 10 6 7 5 5 8 1 9 5 7 5 4 12 6 8 2 2 4 7 5 1 6 5 3 4 8 5 8 1 5 */

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

plan.cpp:23: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
   23 | #pragma comment(linker, "/stack:200000000")
      |
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...