Submission #75069498

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
using pii = pair<int,int>;
#define endl '\n'

void solveA () {
 int l, r;
 cin >> l >> r;
 cout << r - l + 1 << endl;
}

void solveB () {
  int n, m;
  cin >> n >> m;
  unordered_map<int, int> ump;
  for (int i = 0, x; i < n; i ++) {
    cin >> x;
    ump[x] ++;
  }
  bool ok = 1;
  for (auto&[x, y] : ump) {
    if (y > 1) {
      cout << "No" << endl;
      ok = 0;
      break;
    } 
  }
  if (ok) cout << "Yes" << endl;
    if ((int)ump.size() == m) {
      cout << "Yes" << endl;
    } else {
      cout << "No" << endl;
    }
}

void solveC () {
  int n, m;
  cin >> n >> m;
  auto G = vector(n + 1, vector<int> ());
  for (int i = 0; i < m; i ++) {
    int u, v;
    cin >> u >> v;
    G[u].push_back(v);
  }
  vector<int> vis(n + 1);
  vis[1] = 1;
  auto dfs = [&] (auto&& self, int u) -> void {
    for (auto& v : G[u]) {
      if (vis[v]) continue;
      vis[v] = 1;
      self(self, v);
    }
  };
  dfs(dfs, 1);
  cout << accumulate(vis.begin(), vis.end(), 0) << endl;
}

int main () {
  cin.tie(0)->sync_with_stdio(0);
  solveB();
}

Submission Info

Judge Result