제출 #1135137

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1135137		mychecksedad	Security Guard (JOI23_guard)	C++20	37 / 100	176 ms	36024 KiB

guard

/* Author : Mychecksdead  */
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define MOD (1000000000+7)
#define MOD1 (998244353)
#define pb push_back
#define all(x) x.begin(), x.end()
#define en cout << '\n'
#define ff first
#define ss second
#define pii pair<int,int>
#define vi vector<int>
const int N = 1e6+100, M = 1e5+10, K = 52, MX = 30;


int n, m, q;
ll a[N], ans = 0;
vi g[N];
void solve(){
  cin >> n >> m >> q;
  int mx = 0, V = 0;
  for(int i = 1; i <= n; ++i){
    cin >> a[i];
    if(mx < a[i]){
      mx = a[i];
      V = i;
    }
  }
  for(int i = 1; i <= m; ++i){
    int u, v; cin >> u >> v;
    g[u].pb(v);
    g[v].pb(u);
  }
  for(int i = 1; i <= n; ++i){
    sort(all(g[i]), [&](const int &x, const int &y){
      return a[x] > a[y];
    });
  }
  priority_queue<pair<ll, int>> Q;
  Q.push({-a[V], V});
  vector<bool> vis(n + 1);
  vis[V] = 1;
  while(!Q.empty()){
    int v = Q.top().ss;
    ll w = Q.top().ff;
    Q.pop();
    // cout << v << ' ';
    if(g[v].empty()) continue;
    int u;
    do{
      u = g[v].back();
      g[v].pop_back();
    }
    while(vis[u] && g[v].size());
    if(vis[u]) continue;

    vis[u] = 1;

    if(!g[v].empty())
      Q.push({-a[v], v});
    Q.push({-a[u], u});
    ans += -w;
  }
  cout << ans;
}


int main(){
  cin.tie(0); ios::sync_with_stdio(0);
  int tt = 1, aa;
  // freopen("in.txt", "r", stdin);
  // freopen("out.txt", "w", stdout);
  while(tt--){
    solve();
    en;
  }
  cerr<<"time taken : "<<(float)clock()/CLOCKS_PER_SEC<<" seconds\n";
  return 0;
} 

• Subtask 1: 12 / 12
• Subtask 2: 13 / 13
• Subtask 3: 12 / 12
• Subtask 4: 0 / 13
• Subtask 5: 0 / 8
• Subtask 6: 0 / 18
• Subtask 7: 0 / 24