Submission #18733049


Source Code Expand

Copy
#define LOCAL
#define _USE_MATH_DEFINES
#include <array>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <iomanip>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <complex>
#include <cmath>
#include <numeric>
#include <bitset>
#include <functional>
#include <random>
#include <ctime>

using namespace std;

template <typename A, typename B>
ostream& operator <<(ostream& out, const pair<A, B>& a) {
  out << "(" << a.first << "," << a.second << ")";
  return out;
}
template <typename T, size_t N>
ostream& operator <<(ostream& out, const array<T, N>& a) {
  out << "["; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
  return out;
}
template <typename T>
ostream& operator <<(ostream& out, const vector<T>& a) {
  out << "["; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
  return out;
}
template <typename T, class Cmp>
ostream& operator <<(ostream& out, const set<T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "}";
  return out;
}
template <typename U, typename T, class Cmp>
ostream& operator <<(ostream& out, const map<U, T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& p : a) { out << (first ? "" : ", "); out << p.first << ":" << p.second; first = 0;} out << "}";
  return out;
}
#ifdef LOCAL
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
#else
#define trace(...) 42
#endif
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
  cerr << name << ": " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
  const char* comma = strchr(names + 1, ',');
  cerr.write(names, comma - names) << ": " << arg1 << " |";
  __f(comma + 1, args...);
}

typedef long long int64;
typedef pair<int, int> ii;
#define SZ(x) (int)((x).size())
template <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;
const int MOD = 1e9 + 7;
mt19937 mrand(random_device{}());
int rnd(int x) { return mrand() % x; }

struct fast_ios {
  fast_ios() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
  };
} fast_ios_;

int main() {
  int n, m;
  cin >> n >> m;
  vector<int> a(m);
  for (auto& x : a) cin >> x;
  sort(a.begin(), a.end());
  if (SZ(a) == 0) {
    cout << 1 << '\n';
    return 0;
  }
  vector<int> b;
  for (int i = 1; i < m; ++i) {
    int x = a[i] - a[i - 1] - 1;
    if (x > 0) b.push_back(a[i] - a[i - 1] - 1);
  }
  if (a[0] > 1) b.push_back(a[0] - 1);
  if (a[m - 1] < n) b.push_back(n - a[m - 1]);
  if (SZ(b) == 0) {
    cout << 0 << '\n';
    return 0;
  }
  int d = *min_element(b.begin(), b.end());
  int ret = 0;
  for (auto& x : b) ret += (x + d - 1) / d;
  cout << ret << '\n';
  return 0;
}

Submission Info

Submission Time
Task D - Stamp
User cuiaoxiang
Language C++ (Clang 10.0.0)
Score 400
Code Size 3165 Byte
Status AC
Exec Time 156 ms
Memory 4592 KB

Compile Error

./Main.cpp:78:42: warning: unused variable 'inf' [-Wunused-const-variable]
template <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;
                                         ^
./Main.cpp:79:11: warning: unused variable 'MOD' [-Wunused-const-variable]
const int MOD = 1e9 + 7;
          ^
2 warnings generated.

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 4
AC × 30
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt
All handmade_00.txt, handmade_01.txt, random_00.txt, random_01.txt, random_02.txt, random_03.txt, random_04.txt, random_05.txt, random_06.txt, random_07.txt, random_08.txt, random_09.txt, random_10.txt, random_11.txt, random_12.txt, random_13.txt, random_14.txt, random_15.txt, random_16.txt, random_17.txt, random_18.txt, random_19.txt, random_20.txt, random_21.txt, random_22.txt, random_23.txt, sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt
Case Name Status Exec Time Memory
handmade_00.txt AC 6 ms 3172 KB
handmade_01.txt AC 3 ms 3144 KB
random_00.txt AC 2 ms 3108 KB
random_01.txt AC 2 ms 3100 KB
random_02.txt AC 104 ms 3872 KB
random_03.txt AC 156 ms 4584 KB
random_04.txt AC 4 ms 3116 KB
random_05.txt AC 97 ms 3836 KB
random_06.txt AC 155 ms 4412 KB
random_07.txt AC 3 ms 3044 KB
random_08.txt AC 2 ms 3016 KB
random_09.txt AC 115 ms 3560 KB
random_10.txt AC 2 ms 3028 KB
random_11.txt AC 87 ms 3712 KB
random_12.txt AC 2 ms 3112 KB
random_13.txt AC 2 ms 3172 KB
random_14.txt AC 122 ms 4376 KB
random_15.txt AC 94 ms 3356 KB
random_16.txt AC 2 ms 3160 KB
random_17.txt AC 4 ms 3036 KB
random_18.txt AC 145 ms 4592 KB
random_19.txt AC 2 ms 3176 KB
random_20.txt AC 2 ms 3172 KB
random_21.txt AC 23 ms 3244 KB
random_22.txt AC 2 ms 3024 KB
random_23.txt AC 11 ms 3120 KB
sample_01.txt AC 2 ms 3040 KB
sample_02.txt AC 2 ms 3116 KB
sample_03.txt AC 2 ms 3024 KB
sample_04.txt AC 2 ms 3020 KB