Submission #895303

---

Source Code Expand

#include <math.h>
#include <stdio.h>
#include <string.h>
#include <vector>
#include <string>
#include <queue>
#include <map>
#include <algorithm>
#include <cmath>
#include <iostream>
#include <sstream>
#include <set>
using namespace std;

int main()
{
  int n, m;
  cin >> n >> m;
  int Q;
  cin >> Q;

  int len = 0;
  vector<int> order(m, -1);
  vector<int> natural(m);
  vector<int> freq(m + 1);
  freq[0] = n;

  vector<int> ac(Q);
  for (int iter=0; iter<Q; iter++) {
    cin >> ac[Q-1-iter];
    ac[Q-1-iter] --;
  }

  for (int iter=0; iter<Q; iter++) {
    int a = ac[iter];
//    printf("%d %d\n", a, order[a]);

    if (order[a] == -1) {
      order[a] = len;
      natural[len] = a;
      freq[len] --;
      len ++;
      freq[len] ++;
      continue;
    }
    if (freq[order[a]] == 0) continue;
    freq[order[a]] --;
    freq[order[a]+1] ++;
  }

  for (int i=0; i<m; i++)
    if (order[i] == -1) {
      natural[len++] = i;
    }
  int first = 0;
  for (int i=0; i<=m; i++)
    if (freq[i]) {
      first = i;
      break;
    }
  for (int i=first; i+1<m; i++)
    if (natural[i] > natural[i+1]) {
      cout << "No" << endl;
      return 0;
    }

  cout << "Yes" << endl;
  return 0;
}

Submission Info

Judge Result