# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1169831 | nathan4690 | Airplane (NOI23_airplane) | C++20 | 183 ms | 35436 KiB |
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define f1(i,n) for(int i=1;i<=n;i++)
#define __file_name ""
#define pii pair<int,int>
using namespace std;
const ll maxn=1e6+5, inf=1e9;
int n, m, a[maxn], d1[maxn], d2[maxn], ans;
vector<int> G[maxn];
priority_queue<pii, vector<pii>, greater<pii>> pq;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
if(fopen(__file_name ".inp", "r")){
freopen(__file_name ".inp", "r", stdin);
freopen(__file_name ".out", "w", stdout);
}
// code here
cin >> n >> m;
f1(i,n) cin >> a[i];
f1(i,m){
int u, v; cin >> u >> v;
G[u].push_back(v);
G[v].push_back(u);
}
// if(n <= 2){
// cout << 0;
Compilation message (stderr)
# | 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... |