Submission #74771034

---

Source Code Expand

#include<bits/stdc++.h>
#include<atcoder/all>
using namespace atcoder;
using namespace std;
using ll = long long;
using ull = unsigned long long;
using mint = modint1000000007;
#define nl '\n'
#define all(a) (a).begin(), (a).end()
#define rep(i, n) for(ll i = 0; i < (ll)(n); ++i)
template<typename T> bool chmin(T& a, T b){if(a > b){a = b; return true;} return false;}
template<typename T> bool chmax(T& a, T b){if(a < b){a = b; return true;} return false;}
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
const ull BigPrime = (1LL << 61) - 1;
const ll INF = (1LL << 60);
//--------------------------------------------------------------------------------
//--------------------------------------------------------------------------------


void solve()
{
    int n, m; cin >> n >> m;
    vector<pair<int,int>> r(n);
    rep(i, n)
    {
        int R; cin >> R;
        r[i] = {R, i};
    }
    sort(all(r), greater<pair<int,int>>());
    vector<set<int>> st(n);
    rep(i, m)
    {
        int u, v; cin >> u >> v;
        u--, v--;
        st[u].insert(v);
        st[v].insert(u);
    }

    vector<int> ans(n, -1);
    rep(i, n)
    {
        auto [R, idx] = r[i];
        if(ans[idx] != -1) continue;
        for(int i:st[idx])
        {
            if(ans[i] == -1)
            {
                ans[i] = idx+1;
                ans[idx] = i+1;
                break;
            }
        }
    }

    cout << ans[0] << nl;
}

//--------------------------------------------------------------------------------

int main()
{
    //cout << fixed << setprecision(10); //Be careful!
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
    return 0;
}

Submission Info

Judge Result