Submission #18727202


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, T;
  cin >> n >> m >> T;
  int cur = n, t = 0;
  bool found = false;
  for (int i = 0; i < m; ++i) {
    int L, R;
    cin >> L >> R;
    cur -= L - t;
    trace(cur);
    if (cur <= 0) found = true;
    cur += R - L;
    cur = min(cur, n);
    t = R;
  }
  trace(cur, T - t);
  cur -= T - t;
  if (cur <= 0) found = true;
  cout << (found ? "No" : "Yes") << endl;
  return 0;
}

Submission Info

Submission Time
Task B - Smartphone Addiction
User cuiaoxiang
Language C++ (Clang 10.0.0)
Score 200
Code Size 2963 Byte
Status AC
Exec Time 11 ms
Memory 3136 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 200 / 200
Status
AC × 5
AC × 21
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, sample_05.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, sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, sample_05.txt
Case Name Status Exec Time Memory
handmade_00.txt AC 6 ms 3052 KB
handmade_01.txt AC 2 ms 3040 KB
random_00.txt AC 5 ms 2888 KB
random_01.txt AC 5 ms 2988 KB
random_02.txt AC 6 ms 3052 KB
random_03.txt AC 11 ms 3136 KB
random_04.txt AC 3 ms 3036 KB
random_05.txt AC 2 ms 2984 KB
random_06.txt AC 2 ms 2948 KB
random_07.txt AC 2 ms 3028 KB
random_08.txt AC 5 ms 3020 KB
random_09.txt AC 6 ms 2984 KB
random_10.txt AC 3 ms 3044 KB
random_11.txt AC 4 ms 2888 KB
random_12.txt AC 7 ms 3020 KB
random_13.txt AC 4 ms 3044 KB
sample_01.txt AC 2 ms 2896 KB
sample_02.txt AC 2 ms 2892 KB
sample_03.txt AC 2 ms 2988 KB
sample_04.txt AC 2 ms 3028 KB
sample_05.txt AC 2 ms 3136 KB