제출 #1069519

#제출 시각아이디문제언어결과실행 시간메모리
1069519Faisal_Saqib봉쇄 시간 (IOI23_closing)C++17
8 / 100
66 ms25680 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long #define pll pair<ll,ll> #define vpl vector<pll> const int N=2e5+10; vpl ma[N]; ll paid[N]; bool vis[N]; int max_score(int n, int x, int y, long long k, std::vector<int> U,std::vector<int> V, std::vector<int> W) { for(int i=0;i<=n;i++) { ma[i].clear(); paid[i]=0; } int m=U.size(); for(int i=0;i<m;i++) { ma[U[i]].push_back({W[i],V[i]}); ma[V[i]].push_back({W[i],U[i]}); } int mx=0; { for(int i=0;i<=n;i++)vis[i]=0; priority_queue<pll,vpl,greater<pll>> pq; pq.push({0,x}); ll cur=0; ll tlp=0; int total=0; while(pq.size()>0) { pll it=pq.top(); pq.pop(); int u=it.second; ll c=it.first; if((cur+c)>k) break; vis[u]=1; cur+=c; paid[u]+=c; total++; for(auto [w,v]:ma[u]) { if(!vis[v]) { pq.push({c+w,v}); vis[v]=1; } } } mx=max(mx,total); } { for(int i=0;i<=n;i++)vis[i]=0; priority_queue<pll,vpl,greater<pll>> pq; pq.push({0,y}); pq.push({0,x}); ll cur=0; ll tlp=0; int total=0; while(pq.size()>0) { pll it=pq.top(); pq.pop(); int u=it.second; ll c=it.first; if((cur+c)>k) break; vis[u]=1; cur+=c; paid[u]+=c; total++; for(auto [w,v]:ma[u]) { if(!vis[v]) { pq.push({c+w,v}); vis[v]=1; } } } mx=max(mx,total); } return mx; }

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

closing.cpp: In function 'int max_score(int, int, int, long long int, std::vector<int>, std::vector<int>, std::vector<int>)':
closing.cpp:29:12: warning: unused variable 'tlp' [-Wunused-variable]
   29 |         ll tlp=0;
      |            ^~~
closing.cpp:60:12: warning: unused variable 'tlp' [-Wunused-variable]
   60 |         ll tlp=0;
      |            ^~~
#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...
#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...