結果
問題 | No.2371 最大の試練それは起床 |
ユーザー | Ajayreddy17 |
提出日時 | 2023-07-08 03:31:20 |
言語 | C++23 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 4,110 bytes |
コンパイル時間 | 4,242 ms |
コンパイル使用メモリ | 357,352 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-07-21 23:31:47 |
合計ジャッジ時間 | 4,441 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,376 KB |
testcase_02 | AC | 2 ms
5,376 KB |
testcase_03 | AC | 2 ms
5,376 KB |
testcase_04 | AC | 2 ms
5,376 KB |
testcase_05 | AC | 2 ms
5,376 KB |
testcase_06 | AC | 2 ms
5,376 KB |
testcase_07 | AC | 2 ms
5,376 KB |
testcase_08 | AC | 2 ms
5,376 KB |
testcase_09 | AC | 2 ms
5,376 KB |
testcase_10 | AC | 2 ms
5,376 KB |
testcase_11 | AC | 2 ms
5,376 KB |
testcase_12 | AC | 2 ms
5,376 KB |
testcase_13 | AC | 2 ms
5,376 KB |
testcase_14 | AC | 2 ms
5,376 KB |
testcase_15 | AC | 2 ms
5,376 KB |
testcase_16 | AC | 2 ms
5,376 KB |
testcase_17 | AC | 2 ms
5,376 KB |
testcase_18 | AC | 2 ms
5,376 KB |
testcase_19 | AC | 2 ms
5,376 KB |
testcase_20 | AC | 2 ms
5,376 KB |
testcase_21 | AC | 2 ms
5,376 KB |
ソースコード
#include <x86intrin.h> #include <bits/stdc++.h> using namespace std; using str = string; using ll = long long; using ld = long double; using u64 = unsigned long long; template <class T> using pr = pair<T, T>; template <class T> using vt = vector<T>; template <class T> using vvt = vector<vt<T>>; #define ar array #define pb push_back #define fi first #define se second #define all(c) (c).begin(), (c).end() #define len(x) (int)(x).size() #define elif else if #define def function #define F_OR(i, a, b, s) for (int i=(a); (s)>0?i<(b):i>(b); i+=(s)) #define F_OR1(e) F_OR(i, 0, e, 1) #define F_OR2(i, e) F_OR(i, 0, e, 1) #define F_OR3(i, b, e) F_OR(i, b, e, 1) #define F_OR4(i, b, e, s) F_OR(i, b, e, s) #define GET5(a, b, c, d, e, ...) e #define F_ORC(...) GET5(__VA_ARGS__, F_OR4, F_OR3, F_OR2, F_OR1) #define rep(...) F_ORC(__VA_ARGS__)(__VA_ARGS__) #define each(x, a) for (auto& x: a) template <class T> constexpr T inf = 0; template <> constexpr int inf<int> = 1'000'000'005; template <> constexpr long long inf<long long> = (long long)(inf<int>) * inf<int> * 2; template <> constexpr unsigned int inf<unsigned int> = inf<int>; template <> constexpr unsigned long long inf<unsigned long long> = inf<long long>; template <> constexpr __int128 inf<__int128> = __int128(inf<long long>) * inf<long long>; template <> constexpr double inf<double> = inf<long long>; template <> constexpr long double inf<long double> = inf<long long>; template <class T, class S> inline bool ctmax(T &a, const S &b) { return (a < b ? a = b, 1 : 0); } template <class T, class S> inline bool ctmin(T &a, const S &b) { return (a > b ? a = b, 1 : 0); } template <typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &p) { os << p.first << " " << p.second; return os; } template <typename T, typename U> istream &operator>>(istream &is, pair<T, U> &p) { is >> p.first >> p.second; return is; } template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) { int s = (int)v.size(); for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i]; return os; } template <typename T> istream &operator>>(istream &is, vector<T> &v) { for (auto &x : v) is >> x; return is; } void read() {} template <typename T, class... U> void read(T &t, U &...u) { cin >> t; read(u...); } void print() { cout << "\n"; } template <typename T, class... U, char sep = ' '> void print(const T &t, const U &...u) { cout << t; if (sizeof...(u)) cout << sep; print(u...); } void write() { cout << " "; } template <typename T, class... U, char sep = ' '> void write(const T &t, const U &...u) { cout << t; if (sizeof...(u)) cout << sep; write(u...); } #define Int(...) \ int __VA_ARGS__; \ read(__VA_ARGS__) #define Ll(...) \ long long __VA_ARGS__; \ read(__VA_ARGS__) #define Str(...) \ string __VA_ARGS__; \ read(__VA_ARGS__) #define Vt(type, name, size) \ vector<type> name(size); \ read(name) #define Die(...) \ do { \ print(__VA_ARGS__); \ return 0; \ } while (0) __attribute__((target("popcnt"))) inline int popcnt(const u64 &a) { return _mm_popcnt_u64(a); } inline int lsb(const u64 &a) { return a ? __builtin_ctzll(a) : 64; } inline int ctz(const u64 &a) { return a ? __builtin_ctzll(a) : 64; } inline int msb(const u64 &a) { return a ? 63 - __builtin_clzll(a) : -1; } template <typename T> inline int gbit(const T &a, int i) { return (a >> i) & 1; } template <typename T> inline void sbit(T &a, int i, bool b) { if (gbit(a, i) != b) a ^= T(1) << i; } constexpr long long Pw(int n) { return 1LL << n; } constexpr long long Msk(int n) { return (1LL << n) - 1; } signed main(){ cin.tie(0)->sync_with_stdio(0); cin.exceptions(ios::badbit | ios::failbit); auto __solve_tc = [&](auto __tc_num)->int { Int(h, m); int min = h * 60 + m; if (min < 7 * 60 + 30) Die("Yes"); if (min >= 8 * 60 + 30) Die("No"); print("Late"); return 0; }; int __tc_cnt = 1; for(auto __tc_num = 0; __tc_num < __tc_cnt; ++ __tc_num){ __solve_tc(__tc_num); } }