Submission #847133

#TimeUsernameProblemLanguageResultExecution timeMemory
847133errorgornSecurity Guard (JOI23_guard)C++17
0 / 100
57 ms15044 KiB
#include <bits/stdc++.h> using namespace std; #define int long long #define ll long long #define ii pair<int,int> #define iii tuple<int,int,int> #define fi first #define se second #define endl '\n' #define debug(x) cout << #x << ": " << x << endl #define pub push_back #define pob pop_back #define puf push_front #define pof pop_front #define lb lower_bound #define ub upper_bound #define rep(x,start,end) for(int x=(start)-((start)>(end));x!=(end)-((start)>(end));((start)<(end)?x++:x--)) #define all(x) (x).begin(),(x).end() #define sz(x) (int)(x).size() mt19937 rng(chrono::system_clock::now().time_since_epoch().count()); int n,m,k; int arr[200005]; vector<int> al[200005]; signed main(){ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin.exceptions(ios::badbit | ios::failbit); cin>>n>>m>>k; rep(x,1,n+1) cin>>arr[x]; int ans=0; rep(x,0,m){ int a,b; cin>>a>>b; al[a].pub(b); al[b].pub(a); ans+=min(arr[a],arr[b]); } vector<int> v; rep(x,1,n+1){ ii mn=ii(1e9,-1); for (auto it:al[x]){ mn=min(mn,ii(arr[it],it)); } if (ii(arr[x],x)<mn) ans+=mn.fi-arr[x]; else v.pub(arr[x]); } sort(all(v)); //for (auto it:v) cout<<it<<" "; cout<<endl; cout<<ans+(v.back()-v.front())<<endl; }
#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...