Submission #23406855

---

Source Code Expand

// #pragma GCC optimize ("O3")
#include <bits/stdc++.h>
using namespace std;

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

template <class T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

template <class key, class value, class cmp = std::less<key>>
using ordered_map = tree<key, value, cmp, rb_tree_tag, tree_order_statistics_node_update>;
// find_by_order(k)  returns iterator to kth element starting from 0;
// order_of_key(k) returns count of elements strictly smaller than k;

// Defines

#define pb push_back
#define ff first
#define ss second
#define quick                    \
    ios::sync_with_stdio(false); \
    cin.tie(0);
#define time cerr << (0.1 * clock()) / CLOCKS_PER_SEC << endl;
#define int long long
typedef pair<int, int> pl;
#define forn(n) for (int i = 0; i < n; i++)
#define endl "\n"
#define all(v) (v).begin(), (v).end()
#define ppc __builtin_popcount
#define ppcll __builtin_popcountll
int power(int a, int n, int md) {
    if (n == 0) {
        return 1;
    } else {
        int res = power(a, n / 2, md);
        res = (res * res) % md;
        if (n % 2 != 0) {
            res = (res * a) % md;
        }
        return res;
    }
}
random_device rndm;
mt19937 grndm(rndm());
void mix(int* a, int* b) { shuffle(a, b, grndm); }

// Constants

const int mod = 1000000007;

// Code begins

void solve() {
    int n;
    cin >> n;
    vector<int> v(n);
    forn(n) {
        cin >> v[i];
    }
    set<int> s;
    for(int i = 1; i <= n; ++i){
        s.insert(i);
    }
    for(auto i : v){
        s.erase(i);
    }
    cout << (s.empty() ? "Yes" : "No") << '\n';
}

signed main() {
    quick;
    solve();
    // int t;
    // cin >> t;
    // while (t--) {
    //     solve();
    // }
}

Submission Info

Judge Result