| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1294299 | chaitanyamehta | Airplane (NOI23_airplane) | C++20 | 127 ms | 18996 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] +1));
g[u].push_back({v , c});
g[v].push_back({u , c});
edge[i] = {u , v};
ans+=c;
}
cout<<ans;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
