Submission #1294295

#TimeUsernameProblemLanguageResultExecution timeMemory
1294295chaitanyamehtaAirplane (NOI23_airplane)C++20
0 / 100
131 ms19172 KiB
#include<bits/stdc++.h> using namespace std; #define int long long vector<vector<pair<int ,int>>> g; signed main(){ int n ,m; cin>>n>>m; vector<int> a(n + 1); for(int i =1;i<=n;i++)cin>>a[i]; g.resize(n+1); vector<pair<int , int>> edge(m); int ans=0; for(int i =0;i<m;i++){ int u,v , c; cin>>u>>v; c = max(1LL , abs(a[u] - a[v])); g[u].push_back({v , c}); g[v].push_back({u , c}); edge[i] = {u , v}; } sort(edge.begin() , edge.end()); for(int i = 0 ; i < m;i++){ int u = edge[i].first , v = edge[i].second; int c = max(1LL , abs(a[u] - a[v])); // cout << u << " " << v << " " << c << "\n"; ans += c; } cout<<ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...