QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#623476#8784. Dwarfs' Bedtimerns_phn#AC ✓12ms3840kbC++148.0kb2024-10-09 12:16:222024-10-09 12:22:35

Judging History

你现在查看的是最新测评结果

  • [2024-10-09 12:22:35]
  • 评测
  • 测评结果:AC
  • 用时:12ms
  • 内存:3840kb
  • [2024-10-09 12:16:22]
  • 提交

answer

#include <bits/stdc++.h>

using namespace std;

#define int long long
// Don't forget to set the value of MOD!!!
const int MOD = 1440;
int MPow(int a, int b) {
    int res = 1;
    while (b) {
        if (b & 1) res = (res * a) % MOD;
        b /= 2;
        a = (a * a) % MOD;
    }

    return res;
}
using i64 = long long;
namespace Modular_Integer {
template <class T>
constexpr T Pow(T a, i64 b) {
    T res = 1;
    for (; b; b /= 2, a *= a)
        if (b % 2) res *= a;
    return res;
}
constexpr i64 Mul(i64 a, i64 b, i64 p) {
    i64 res = a * b - i64(1.L * a * b / p) * p;
    res %= p;
    if (res < 0) res += p;
    return res;
}
template <i64 P>
struct MLong {
    i64 x;
    constexpr MLong() : x{} {}
    constexpr MLong(i64 x) : x{norm(x % getMod())} {}
    static i64 Mod;
    constexpr static i64 getMod() {
        if (P > 0)
            return P;
        else
            return Mod;
    }
    constexpr static void setMod(i64 Mod_) {
        Mod = Mod_;
    }
    constexpr i64 norm(i64 x) const {
        if (x < 0) x += getMod();
        if (x >= getMod()) x -= getMod();
        return x;
    }
    constexpr i64 val() const {
        return x;
    }
    explicit constexpr operator i64() const {
        return x;
    }
    constexpr MLong operator-() const {
        MLong res;
        res.x = norm(getMod() - x);
        return res;
    }
    constexpr MLong inv() const {
        assert(x != 0);
        return Pow(*this, getMod() - 2);
    }
    constexpr MLong &operator*=(MLong rhs) & {
        x = Mul(x, rhs.x, getMod());
        return *this;
    }
    constexpr MLong &operator+=(MLong rhs) & {
        x = norm(x + rhs.x);
        return *this;
    }
    constexpr MLong &operator-=(MLong rhs) & {
        x = norm(x - rhs.x);
        return *this;
    }
    constexpr MLong &operator/=(MLong rhs) & {
        return *this *= rhs.inv();
    }
    friend constexpr MLong operator*(MLong lhs, MLong rhs) {
        MLong res = lhs;
        res *= rhs;
        return res;
    }
    friend constexpr MLong operator+(MLong lhs, MLong rhs) {
        MLong res = lhs;
        res += rhs;
        return res;
    }
    friend constexpr MLong operator-(MLong lhs, MLong rhs) {
        MLong res = lhs;
        res -= rhs;
        return res;
    }
    friend constexpr MLong operator/(MLong lhs, MLong rhs) {
        MLong res = lhs;
        res /= rhs;
        return res;
    }
    friend constexpr istream &operator>>(istream &is, MLong &a) {
        i64 v;
        is >> v;
        a = MLong(v);
        return is;
    }
    friend constexpr ostream &operator<<(ostream &os, const MLong &a) {
        return os << a.val();
    }
    friend constexpr bool operator==(MLong lhs, MLong rhs) {
        return lhs.val() == rhs.val();
    }
    friend constexpr bool operator!=(MLong lhs, MLong rhs) {
        return lhs.val() != rhs.val();
    }
};
template <int P>
struct MInt {
    int x;
    constexpr MInt() : x{} {}
    constexpr MInt(i64 x) : x{norm(x % getMod())} {}
    static int Mod;
    constexpr static int getMod() {
        if (P > 0)
            return P;
        else
            return Mod;
    }
    constexpr static void setMod(int Mod_) {
        Mod = Mod_;
    }
    constexpr int norm(int x) const {
        if (x < 0) x += getMod();
        if (x >= getMod()) x -= getMod();
        return x;
    }
    constexpr int val() const {
        return x;
    }
    explicit constexpr operator int() const {
        return x;
    }
    constexpr MInt operator-() const {
        MInt res;
        res.x = norm(getMod() - x);
        return res;
    }
    constexpr MInt inv() const {
        assert(x != 0);
        return Pow(*this, getMod() - 2);
    }
    constexpr MInt &operator*=(MInt rhs) & {
        x = 1LL * x * rhs.x % getMod();
        return *this;
    }
    constexpr MInt &operator+=(MInt rhs) & {
        x = norm(x + rhs.x);
        return *this;
    }
    constexpr MInt &operator-=(MInt rhs) & {
        x = norm(x - rhs.x);
        return *this;
    }
    constexpr MInt &operator/=(MInt rhs) & {
        return *this *= rhs.inv();
    }
    friend constexpr MInt operator*(MInt lhs, MInt rhs) {
        MInt res = lhs;
        res *= rhs;
        return res;
    }
    friend constexpr MInt operator+(MInt lhs, MInt rhs) {
        MInt res = lhs;
        res += rhs;
        return res;
    }
    friend constexpr MInt operator-(MInt lhs, MInt rhs) {
        MInt res = lhs;
        res -= rhs;
        return res;
    }
    friend constexpr MInt operator/(MInt lhs, MInt rhs) {
        MInt res = lhs;
        res /= rhs;
        return res;
    }
    friend constexpr istream &operator>>(istream &is, MInt &a) {
        i64 v;
        is >> v;
        a = MInt(v);
        return is;
    }
    friend constexpr ostream &operator<<(ostream &os, const MInt &a) {
        return os << a.val();
    }
    friend constexpr bool operator==(MInt lhs, MInt rhs) {
        return lhs.val() == rhs.val();
    }
    friend constexpr bool operator!=(MInt lhs, MInt rhs) {
        return lhs.val() != rhs.val();
    }
};
template <>
i64 MLong<0LL>::Mod = i64(1E18) + 9;
template <>
int MInt<0>::Mod = 998244353;
template <int V, int P>
constexpr MInt<P> CInv = MInt<P>(V).inv();
constexpr int P = 1000000007;
using Z = MInt<0>;
} // namespace Modular_Integer
using namespace Modular_Integer;

void print_minute(int minutes) {
    minutes %= 1440;
    int hour = minutes / 60;
    minutes %= 60;
    if (hour < 10)
        cout << "0" << hour;
    else
        cout << hour;
    cout << ":";
    if (minutes < 10)
        cout << "0" << minutes;
    else
        cout << minutes;
}

void check(int dwarf, int minutes) {
    cout << "at ";
    print_minute(minutes);
    cout << " check ";
    cout << dwarf << endl;
    cout.flush();
}

signed main() {
    Z::Mod = MOD;
    int n;
    cin >> n;
    vector<int> ans(n + 1, -1);
    vector<tuple<bool, int, int>> dp(n + 1, make_tuple(false, 0, 0));
    for (int i = 1; i <= n; i++) {
        auto &[_, st, en] = dp[i];
        string x1;
        check(i, 0);
        cin >> x1;
        if (x1 == "asleep")
            st = 721, en = 1440;
        else if (x1 == "awake")
            st = 1, en = 720;
    }
    int p = 0;
    for (int len = 48; len >= 31; len--) {
        p += len;
        for (int i = 1; i <= n; i++) {
            auto &[chk, st, en] = dp[i];
            if (chk) continue;
            string x1;
            check(i, p);
            cin >> x1;
            if (x1 == "asleep") {
                if (st > 720) st = max(st, Z(p - 720 + 1).val());
                if (en <= 720) en = min(en, p);
            } else if (x1 == "awake") {
                if (st <= 720) st = max(st, p + 1);
                if (en > 720) en = min(en, Z(p + 720).val());
            }
            int t_len = (en - st) + 1;
            if (t_len <= len) chk = true;
        }
    }
    for (p = 720; p <= 1440; p++) {

        for (int i = 1; i <= n; i++) {
            if (ans[i] != -1) continue;
            auto &[chk, st, en] = dp[i];
            if (p == st || p == st + 720) {
                if (p < 1440) {
                    string x1;
                    check(i, p);
                    cin >> x1;

                    if (p <= en) {

                        if (x1 == "asleep")
                            ans[i] = st;
                        else
                            st++;
                    } else if (p > en) {
                        if (x1 == "awake")
                            ans[i] = st;
                        else
                            st++;
                    }
                } else {
                    ans[i] = st;
                }
            } else
                continue;
        }
    }
    cout << "answer" << endl;
    for (int i = 1; i <= n; i++) {
        if (ans[i] == -1) ans[i] = 0;
        print_minute(ans[i]);
        cout << endl;
        cout.flush();
    }
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 1ms
memory: 3480kb

input:

2
asleep
awake
asleep
awake
asleep
awake
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
awake
asleep
asleep
asleep
asleep
asleep
awake
awake
awake
awake
awake
awake
awake
asleep

output:

at 00:00 check 1
at 00:00 check 2
at 00:48 check 1
at 00:48 check 2
at 01:35 check 1
at 01:35 check 2
at 02:21 check 1
at 02:21 check 2
at 03:06 check 1
at 03:50 check 1
at 04:33 check 1
at 05:15 check 1
at 05:56 check 1
at 06:36 check 1
at 07:15 check 1
at 07:53 check 1
at 08:30 check 1
at 13:36 ch...

result:

ok n = 2, total = 30, max = 20

Test #2:

score: 0
Accepted
time: 1ms
memory: 3756kb

input:

1
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
awake
awake
awake
awake
awake
awake
awake
awake

output:

at 00:00 check 1
at 00:48 check 1
at 01:35 check 1
at 02:21 check 1
at 03:06 check 1
at 03:50 check 1
at 04:33 check 1
at 05:15 check 1
at 05:56 check 1
at 06:36 check 1
at 07:15 check 1
at 07:53 check 1
at 08:30 check 1
at 09:06 check 1
at 09:41 check 1
at 10:15 check 1
at 10:48 check 1
at 11:20 ch...

result:

ok n = 1, total = 27, max = 27

Test #3:

score: 0
Accepted
time: 0ms
memory: 3624kb

input:

3
awake
awake
asleep
awake
awake
asleep
awake
awake
asleep
awake
awake
asleep
awake
awake
asleep
awake
awake
asleep
awake
awake
asleep
awake
awake
asleep
awake
awake
asleep
awake
awake
asleep
awake
awake
asleep
awake
awake
asleep
awake
awake
asleep
awake
awake
asleep
awake
awake
asleep
awake
awake
a...

output:

at 00:00 check 1
at 00:00 check 2
at 00:00 check 3
at 00:48 check 1
at 00:48 check 2
at 00:48 check 3
at 01:35 check 1
at 01:35 check 2
at 01:35 check 3
at 02:21 check 1
at 02:21 check 2
at 02:21 check 3
at 03:06 check 1
at 03:06 check 2
at 03:06 check 3
at 03:50 check 1
at 03:50 check 2
at 03:50 ch...

result:

ok n = 3, total = 81, max = 27

Test #4:

score: 0
Accepted
time: 2ms
memory: 3796kb

input:

24
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awak...

output:

at 00:00 check 1
at 00:00 check 2
at 00:00 check 3
at 00:00 check 4
at 00:00 check 5
at 00:00 check 6
at 00:00 check 7
at 00:00 check 8
at 00:00 check 9
at 00:00 check 10
at 00:00 check 11
at 00:00 check 12
at 00:00 check 13
at 00:00 check 14
at 00:00 check 15
at 00:00 check 16
at 00:00 check 17
at ...

result:

ok n = 24, total = 690, max = 44

Test #5:

score: 0
Accepted
time: 0ms
memory: 3600kb

input:

24
awake
asleep
asleep
asleep
awake
asleep
asleep
awake
asleep
awake
awake
awake
asleep
asleep
awake
awake
awake
asleep
asleep
asleep
awake
awake
asleep
awake
awake
asleep
asleep
asleep
awake
asleep
asleep
awake
asleep
awake
awake
awake
asleep
asleep
awake
awake
awake
asleep
asleep
asleep
awake
awak...

output:

at 00:00 check 1
at 00:00 check 2
at 00:00 check 3
at 00:00 check 4
at 00:00 check 5
at 00:00 check 6
at 00:00 check 7
at 00:00 check 8
at 00:00 check 9
at 00:00 check 10
at 00:00 check 11
at 00:00 check 12
at 00:00 check 13
at 00:00 check 14
at 00:00 check 15
at 00:00 check 16
at 00:00 check 17
at ...

result:

ok n = 24, total = 668, max = 43

Test #6:

score: 0
Accepted
time: 5ms
memory: 3764kb

input:

100
asleep
awake
awake
asleep
asleep
awake
asleep
asleep
asleep
asleep
asleep
awake
awake
awake
asleep
awake
asleep
asleep
asleep
asleep
awake
asleep
awake
asleep
asleep
awake
asleep
awake
asleep
awake
asleep
asleep
asleep
awake
awake
asleep
asleep
asleep
awake
awake
awake
asleep
awake
awake
awake
a...

output:

at 00:00 check 1
at 00:00 check 2
at 00:00 check 3
at 00:00 check 4
at 00:00 check 5
at 00:00 check 6
at 00:00 check 7
at 00:00 check 8
at 00:00 check 9
at 00:00 check 10
at 00:00 check 11
at 00:00 check 12
at 00:00 check 13
at 00:00 check 14
at 00:00 check 15
at 00:00 check 16
at 00:00 check 17
at ...

result:

ok n = 100, total = 3062, max = 49

Test #7:

score: 0
Accepted
time: 0ms
memory: 3568kb

input:

100
asleep
asleep
asleep
awake
awake
asleep
awake
asleep
awake
asleep
asleep
asleep
awake
asleep
asleep
awake
awake
asleep
awake
asleep
asleep
awake
awake
asleep
asleep
awake
awake
awake
asleep
awake
asleep
awake
asleep
asleep
awake
awake
awake
asleep
awake
awake
awake
asleep
awake
awake
awake
awake...

output:

at 00:00 check 1
at 00:00 check 2
at 00:00 check 3
at 00:00 check 4
at 00:00 check 5
at 00:00 check 6
at 00:00 check 7
at 00:00 check 8
at 00:00 check 9
at 00:00 check 10
at 00:00 check 11
at 00:00 check 12
at 00:00 check 13
at 00:00 check 14
at 00:00 check 15
at 00:00 check 16
at 00:00 check 17
at ...

result:

ok n = 100, total = 3019, max = 50

Test #8:

score: 0
Accepted
time: 5ms
memory: 3592kb

input:

100
awake
awake
awake
asleep
asleep
awake
awake
asleep
asleep
awake
awake
asleep
awake
asleep
asleep
awake
asleep
asleep
asleep
asleep
awake
asleep
asleep
asleep
asleep
awake
asleep
asleep
asleep
asleep
asleep
asleep
asleep
awake
asleep
awake
awake
asleep
awake
asleep
awake
awake
awake
asleep
awake
...

output:

at 00:00 check 1
at 00:00 check 2
at 00:00 check 3
at 00:00 check 4
at 00:00 check 5
at 00:00 check 6
at 00:00 check 7
at 00:00 check 8
at 00:00 check 9
at 00:00 check 10
at 00:00 check 11
at 00:00 check 12
at 00:00 check 13
at 00:00 check 14
at 00:00 check 15
at 00:00 check 16
at 00:00 check 17
at ...

result:

ok n = 100, total = 3127, max = 50

Test #9:

score: 0
Accepted
time: 0ms
memory: 3592kb

input:

100
awake
awake
asleep
awake
asleep
awake
asleep
awake
asleep
awake
awake
asleep
awake
awake
asleep
awake
asleep
awake
awake
awake
awake
asleep
awake
awake
awake
awake
awake
asleep
asleep
asleep
awake
asleep
asleep
awake
asleep
awake
asleep
asleep
awake
asleep
awake
awake
asleep
awake
awake
awake
as...

output:

at 00:00 check 1
at 00:00 check 2
at 00:00 check 3
at 00:00 check 4
at 00:00 check 5
at 00:00 check 6
at 00:00 check 7
at 00:00 check 8
at 00:00 check 9
at 00:00 check 10
at 00:00 check 11
at 00:00 check 12
at 00:00 check 13
at 00:00 check 14
at 00:00 check 15
at 00:00 check 16
at 00:00 check 17
at ...

result:

ok n = 100, total = 3067, max = 50

Test #10:

score: 0
Accepted
time: 4ms
memory: 3564kb

input:

100
awake
awake
awake
awake
awake
asleep
awake
awake
asleep
asleep
awake
awake
awake
asleep
awake
awake
awake
asleep
asleep
awake
asleep
asleep
asleep
awake
awake
awake
asleep
asleep
awake
asleep
asleep
asleep
awake
awake
asleep
awake
asleep
awake
awake
awake
asleep
awake
asleep
asleep
asleep
awake
...

output:

at 00:00 check 1
at 00:00 check 2
at 00:00 check 3
at 00:00 check 4
at 00:00 check 5
at 00:00 check 6
at 00:00 check 7
at 00:00 check 8
at 00:00 check 9
at 00:00 check 10
at 00:00 check 11
at 00:00 check 12
at 00:00 check 13
at 00:00 check 14
at 00:00 check 15
at 00:00 check 16
at 00:00 check 17
at ...

result:

ok n = 100, total = 2825, max = 50

Test #11:

score: 0
Accepted
time: 9ms
memory: 3788kb

input:

100
asleep
awake
awake
awake
asleep
asleep
awake
awake
awake
awake
awake
asleep
awake
awake
asleep
asleep
awake
awake
awake
awake
asleep
asleep
asleep
awake
asleep
asleep
asleep
awake
asleep
asleep
asleep
asleep
asleep
asleep
awake
asleep
asleep
awake
asleep
awake
asleep
awake
awake
asleep
awake
asl...

output:

at 00:00 check 1
at 00:00 check 2
at 00:00 check 3
at 00:00 check 4
at 00:00 check 5
at 00:00 check 6
at 00:00 check 7
at 00:00 check 8
at 00:00 check 9
at 00:00 check 10
at 00:00 check 11
at 00:00 check 12
at 00:00 check 13
at 00:00 check 14
at 00:00 check 15
at 00:00 check 16
at 00:00 check 17
at ...

result:

ok n = 100, total = 2713, max = 50

Test #12:

score: 0
Accepted
time: 2ms
memory: 3824kb

input:

100
awake
awake
awake
asleep
asleep
awake
asleep
awake
asleep
awake
awake
awake
asleep
asleep
asleep
awake
awake
awake
asleep
awake
awake
asleep
awake
awake
awake
awake
asleep
awake
asleep
awake
asleep
asleep
awake
awake
asleep
awake
asleep
asleep
asleep
awake
asleep
awake
awake
awake
awake
awake
as...

output:

at 00:00 check 1
at 00:00 check 2
at 00:00 check 3
at 00:00 check 4
at 00:00 check 5
at 00:00 check 6
at 00:00 check 7
at 00:00 check 8
at 00:00 check 9
at 00:00 check 10
at 00:00 check 11
at 00:00 check 12
at 00:00 check 13
at 00:00 check 14
at 00:00 check 15
at 00:00 check 16
at 00:00 check 17
at ...

result:

ok n = 100, total = 3271, max = 50

Test #13:

score: 0
Accepted
time: 0ms
memory: 3588kb

input:

100
asleep
awake
awake
awake
asleep
awake
awake
asleep
asleep
awake
awake
asleep
awake
awake
awake
awake
asleep
asleep
asleep
awake
asleep
awake
awake
awake
asleep
asleep
awake
asleep
awake
asleep
asleep
asleep
awake
asleep
awake
asleep
asleep
awake
asleep
awake
awake
asleep
awake
awake
asleep
aslee...

output:

at 00:00 check 1
at 00:00 check 2
at 00:00 check 3
at 00:00 check 4
at 00:00 check 5
at 00:00 check 6
at 00:00 check 7
at 00:00 check 8
at 00:00 check 9
at 00:00 check 10
at 00:00 check 11
at 00:00 check 12
at 00:00 check 13
at 00:00 check 14
at 00:00 check 15
at 00:00 check 16
at 00:00 check 17
at ...

result:

ok n = 100, total = 2994, max = 49

Test #14:

score: 0
Accepted
time: 5ms
memory: 3824kb

input:

100
awake
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
awake
asleep
asleep
asleep
awake
asleep
asleep
asleep
asleep
asleep
asleep
awake
asleep
asleep
awake
asleep
awake
awake
asleep
asleep
awake
awake
awake
asleep
awake
awake
awake
awake
awake
asleep
asleep
awake
asleep
awake
asleep
aslee...

output:

at 00:00 check 1
at 00:00 check 2
at 00:00 check 3
at 00:00 check 4
at 00:00 check 5
at 00:00 check 6
at 00:00 check 7
at 00:00 check 8
at 00:00 check 9
at 00:00 check 10
at 00:00 check 11
at 00:00 check 12
at 00:00 check 13
at 00:00 check 14
at 00:00 check 15
at 00:00 check 16
at 00:00 check 17
at ...

result:

ok n = 100, total = 2985, max = 50

Test #15:

score: 0
Accepted
time: 9ms
memory: 3528kb

input:

100
awake
awake
awake
asleep
awake
asleep
awake
asleep
asleep
awake
asleep
awake
awake
asleep
awake
asleep
awake
awake
asleep
awake
awake
asleep
asleep
asleep
asleep
awake
asleep
awake
asleep
awake
awake
awake
asleep
asleep
awake
asleep
asleep
awake
awake
asleep
awake
awake
awake
awake
awake
awake
a...

output:

at 00:00 check 1
at 00:00 check 2
at 00:00 check 3
at 00:00 check 4
at 00:00 check 5
at 00:00 check 6
at 00:00 check 7
at 00:00 check 8
at 00:00 check 9
at 00:00 check 10
at 00:00 check 11
at 00:00 check 12
at 00:00 check 13
at 00:00 check 14
at 00:00 check 15
at 00:00 check 16
at 00:00 check 17
at ...

result:

ok n = 100, total = 2812, max = 50

Test #16:

score: 0
Accepted
time: 3ms
memory: 3480kb

input:

100
awake
asleep
awake
asleep
awake
awake
awake
awake
awake
asleep
asleep
awake
asleep
awake
asleep
awake
awake
asleep
asleep
asleep
asleep
awake
awake
awake
asleep
awake
awake
asleep
asleep
asleep
awake
asleep
asleep
asleep
awake
asleep
asleep
asleep
awake
awake
awake
awake
asleep
asleep
asleep
awa...

output:

at 00:00 check 1
at 00:00 check 2
at 00:00 check 3
at 00:00 check 4
at 00:00 check 5
at 00:00 check 6
at 00:00 check 7
at 00:00 check 8
at 00:00 check 9
at 00:00 check 10
at 00:00 check 11
at 00:00 check 12
at 00:00 check 13
at 00:00 check 14
at 00:00 check 15
at 00:00 check 16
at 00:00 check 17
at ...

result:

ok n = 100, total = 3024, max = 50

Test #17:

score: 0
Accepted
time: 5ms
memory: 3596kb

input:

100
asleep
asleep
asleep
awake
awake
awake
awake
asleep
awake
asleep
awake
asleep
asleep
asleep
awake
asleep
awake
awake
awake
asleep
asleep
asleep
asleep
asleep
awake
asleep
asleep
asleep
awake
awake
awake
asleep
asleep
asleep
asleep
asleep
awake
awake
awake
awake
asleep
awake
awake
awake
awake
asl...

output:

at 00:00 check 1
at 00:00 check 2
at 00:00 check 3
at 00:00 check 4
at 00:00 check 5
at 00:00 check 6
at 00:00 check 7
at 00:00 check 8
at 00:00 check 9
at 00:00 check 10
at 00:00 check 11
at 00:00 check 12
at 00:00 check 13
at 00:00 check 14
at 00:00 check 15
at 00:00 check 16
at 00:00 check 17
at ...

result:

ok n = 100, total = 3166, max = 50

Test #18:

score: 0
Accepted
time: 4ms
memory: 3596kb

input:

100
awake
asleep
asleep
awake
awake
asleep
asleep
asleep
asleep
asleep
awake
asleep
awake
asleep
awake
asleep
asleep
asleep
awake
awake
asleep
asleep
asleep
awake
awake
awake
asleep
asleep
awake
asleep
asleep
awake
awake
asleep
asleep
awake
awake
asleep
asleep
asleep
awake
asleep
asleep
awake
asleep...

output:

at 00:00 check 1
at 00:00 check 2
at 00:00 check 3
at 00:00 check 4
at 00:00 check 5
at 00:00 check 6
at 00:00 check 7
at 00:00 check 8
at 00:00 check 9
at 00:00 check 10
at 00:00 check 11
at 00:00 check 12
at 00:00 check 13
at 00:00 check 14
at 00:00 check 15
at 00:00 check 16
at 00:00 check 17
at ...

result:

ok n = 100, total = 2971, max = 50

Test #19:

score: 0
Accepted
time: 9ms
memory: 3520kb

input:

100
asleep
awake
awake
asleep
awake
awake
awake
asleep
asleep
asleep
awake
awake
asleep
awake
asleep
asleep
awake
asleep
awake
awake
asleep
awake
asleep
awake
awake
awake
asleep
asleep
asleep
awake
awake
asleep
awake
asleep
asleep
awake
asleep
awake
awake
awake
asleep
asleep
asleep
awake
awake
awake...

output:

at 00:00 check 1
at 00:00 check 2
at 00:00 check 3
at 00:00 check 4
at 00:00 check 5
at 00:00 check 6
at 00:00 check 7
at 00:00 check 8
at 00:00 check 9
at 00:00 check 10
at 00:00 check 11
at 00:00 check 12
at 00:00 check 13
at 00:00 check 14
at 00:00 check 15
at 00:00 check 16
at 00:00 check 17
at ...

result:

ok n = 100, total = 2862, max = 50

Test #20:

score: 0
Accepted
time: 5ms
memory: 3488kb

input:

100
awake
awake
awake
asleep
asleep
awake
asleep
awake
asleep
awake
awake
awake
asleep
asleep
asleep
awake
awake
asleep
awake
awake
asleep
asleep
awake
asleep
asleep
asleep
asleep
awake
asleep
awake
asleep
asleep
asleep
asleep
asleep
awake
asleep
asleep
asleep
asleep
asleep
awake
awake
asleep
awake
...

output:

at 00:00 check 1
at 00:00 check 2
at 00:00 check 3
at 00:00 check 4
at 00:00 check 5
at 00:00 check 6
at 00:00 check 7
at 00:00 check 8
at 00:00 check 9
at 00:00 check 10
at 00:00 check 11
at 00:00 check 12
at 00:00 check 13
at 00:00 check 14
at 00:00 check 15
at 00:00 check 16
at 00:00 check 17
at ...

result:

ok n = 100, total = 3172, max = 49

Test #21:

score: 0
Accepted
time: 0ms
memory: 3588kb

input:

98
asleep
asleep
awake
asleep
awake
awake
asleep
awake
awake
awake
awake
awake
asleep
awake
awake
asleep
awake
asleep
asleep
awake
awake
awake
awake
asleep
asleep
awake
asleep
asleep
asleep
asleep
awake
awake
asleep
asleep
awake
awake
asleep
awake
asleep
awake
asleep
awake
asleep
asleep
awake
asleep...

output:

at 00:00 check 1
at 00:00 check 2
at 00:00 check 3
at 00:00 check 4
at 00:00 check 5
at 00:00 check 6
at 00:00 check 7
at 00:00 check 8
at 00:00 check 9
at 00:00 check 10
at 00:00 check 11
at 00:00 check 12
at 00:00 check 13
at 00:00 check 14
at 00:00 check 15
at 00:00 check 16
at 00:00 check 17
at ...

result:

ok n = 98, total = 2769, max = 50

Test #22:

score: 0
Accepted
time: 4ms
memory: 3536kb

input:

99
asleep
asleep
asleep
awake
awake
awake
awake
awake
asleep
awake
asleep
asleep
awake
asleep
asleep
asleep
asleep
awake
awake
awake
asleep
asleep
asleep
asleep
asleep
asleep
asleep
awake
asleep
awake
asleep
awake
asleep
asleep
asleep
asleep
asleep
asleep
awake
asleep
asleep
asleep
asleep
awake
awak...

output:

at 00:00 check 1
at 00:00 check 2
at 00:00 check 3
at 00:00 check 4
at 00:00 check 5
at 00:00 check 6
at 00:00 check 7
at 00:00 check 8
at 00:00 check 9
at 00:00 check 10
at 00:00 check 11
at 00:00 check 12
at 00:00 check 13
at 00:00 check 14
at 00:00 check 15
at 00:00 check 16
at 00:00 check 17
at ...

result:

ok n = 99, total = 2812, max = 50

Test #23:

score: 0
Accepted
time: 5ms
memory: 3828kb

input:

95
asleep
awake
awake
awake
asleep
asleep
asleep
awake
awake
awake
asleep
awake
asleep
awake
asleep
asleep
awake
asleep
awake
asleep
asleep
awake
awake
asleep
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
asleep
awake
asleep
awake
asleep
asleep
awake
awake
asleep
awake
asleep
asl...

output:

at 00:00 check 1
at 00:00 check 2
at 00:00 check 3
at 00:00 check 4
at 00:00 check 5
at 00:00 check 6
at 00:00 check 7
at 00:00 check 8
at 00:00 check 9
at 00:00 check 10
at 00:00 check 11
at 00:00 check 12
at 00:00 check 13
at 00:00 check 14
at 00:00 check 15
at 00:00 check 16
at 00:00 check 17
at ...

result:

ok n = 95, total = 2975, max = 50

Test #24:

score: 0
Accepted
time: 4ms
memory: 3592kb

input:

93
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awa...

output:

at 00:00 check 1
at 00:00 check 2
at 00:00 check 3
at 00:00 check 4
at 00:00 check 5
at 00:00 check 6
at 00:00 check 7
at 00:00 check 8
at 00:00 check 9
at 00:00 check 10
at 00:00 check 11
at 00:00 check 12
at 00:00 check 13
at 00:00 check 14
at 00:00 check 15
at 00:00 check 16
at 00:00 check 17
at ...

result:

ok n = 93, total = 2934, max = 50

Test #25:

score: 0
Accepted
time: 12ms
memory: 3756kb

input:

93
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awa...

output:

at 00:00 check 1
at 00:00 check 2
at 00:00 check 3
at 00:00 check 4
at 00:00 check 5
at 00:00 check 6
at 00:00 check 7
at 00:00 check 8
at 00:00 check 9
at 00:00 check 10
at 00:00 check 11
at 00:00 check 12
at 00:00 check 13
at 00:00 check 14
at 00:00 check 15
at 00:00 check 16
at 00:00 check 17
at ...

result:

ok n = 93, total = 3108, max = 50

Test #26:

score: 0
Accepted
time: 5ms
memory: 3600kb

input:

97
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awa...

output:

at 00:00 check 1
at 00:00 check 2
at 00:00 check 3
at 00:00 check 4
at 00:00 check 5
at 00:00 check 6
at 00:00 check 7
at 00:00 check 8
at 00:00 check 9
at 00:00 check 10
at 00:00 check 11
at 00:00 check 12
at 00:00 check 13
at 00:00 check 14
at 00:00 check 15
at 00:00 check 16
at 00:00 check 17
at ...

result:

ok n = 97, total = 2551, max = 50

Test #27:

score: 0
Accepted
time: 0ms
memory: 3756kb

input:

95
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asl...

output:

at 00:00 check 1
at 00:00 check 2
at 00:00 check 3
at 00:00 check 4
at 00:00 check 5
at 00:00 check 6
at 00:00 check 7
at 00:00 check 8
at 00:00 check 9
at 00:00 check 10
at 00:00 check 11
at 00:00 check 12
at 00:00 check 13
at 00:00 check 14
at 00:00 check 15
at 00:00 check 16
at 00:00 check 17
at ...

result:

ok n = 95, total = 2963, max = 50

Test #28:

score: 0
Accepted
time: 4ms
memory: 3596kb

input:

97
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asl...

output:

at 00:00 check 1
at 00:00 check 2
at 00:00 check 3
at 00:00 check 4
at 00:00 check 5
at 00:00 check 6
at 00:00 check 7
at 00:00 check 8
at 00:00 check 9
at 00:00 check 10
at 00:00 check 11
at 00:00 check 12
at 00:00 check 13
at 00:00 check 14
at 00:00 check 15
at 00:00 check 16
at 00:00 check 17
at ...

result:

ok n = 97, total = 2964, max = 50

Test #29:

score: 0
Accepted
time: 2ms
memory: 3760kb

input:

96
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asl...

output:

at 00:00 check 1
at 00:00 check 2
at 00:00 check 3
at 00:00 check 4
at 00:00 check 5
at 00:00 check 6
at 00:00 check 7
at 00:00 check 8
at 00:00 check 9
at 00:00 check 10
at 00:00 check 11
at 00:00 check 12
at 00:00 check 13
at 00:00 check 14
at 00:00 check 15
at 00:00 check 16
at 00:00 check 17
at ...

result:

ok n = 96, total = 3007, max = 49

Test #30:

score: 0
Accepted
time: 0ms
memory: 3540kb

input:

92
awake
awake
awake
awake
awake
awake
asleep
awake
awake
asleep
awake
awake
awake
asleep
asleep
awake
asleep
awake
awake
awake
asleep
awake
asleep
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
asleep
awake
awake
awake
a...

output:

at 00:00 check 1
at 00:00 check 2
at 00:00 check 3
at 00:00 check 4
at 00:00 check 5
at 00:00 check 6
at 00:00 check 7
at 00:00 check 8
at 00:00 check 9
at 00:00 check 10
at 00:00 check 11
at 00:00 check 12
at 00:00 check 13
at 00:00 check 14
at 00:00 check 15
at 00:00 check 16
at 00:00 check 17
at ...

result:

ok n = 92, total = 2731, max = 49

Test #31:

score: 0
Accepted
time: 8ms
memory: 3588kb

input:

95
awake
asleep
asleep
awake
awake
awake
asleep
awake
awake
awake
asleep
asleep
asleep
asleep
asleep
awake
awake
awake
awake
awake
awake
awake
asleep
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
asleep
awake
awake...

output:

at 00:00 check 1
at 00:00 check 2
at 00:00 check 3
at 00:00 check 4
at 00:00 check 5
at 00:00 check 6
at 00:00 check 7
at 00:00 check 8
at 00:00 check 9
at 00:00 check 10
at 00:00 check 11
at 00:00 check 12
at 00:00 check 13
at 00:00 check 14
at 00:00 check 15
at 00:00 check 16
at 00:00 check 17
at ...

result:

ok n = 95, total = 2620, max = 50

Test #32:

score: 0
Accepted
time: 10ms
memory: 3624kb

input:

99
awake
asleep
awake
awake
awake
awake
asleep
awake
awake
awake
awake
awake
awake
awake
awake
awake
asleep
awake
awake
awake
awake
awake
awake
asleep
awake
awake
awake
awake
asleep
awake
asleep
asleep
asleep
awake
awake
awake
awake
awake
asleep
awake
awake
asleep
awake
awake
asleep
awake
asleep
awa...

output:

at 00:00 check 1
at 00:00 check 2
at 00:00 check 3
at 00:00 check 4
at 00:00 check 5
at 00:00 check 6
at 00:00 check 7
at 00:00 check 8
at 00:00 check 9
at 00:00 check 10
at 00:00 check 11
at 00:00 check 12
at 00:00 check 13
at 00:00 check 14
at 00:00 check 15
at 00:00 check 16
at 00:00 check 17
at ...

result:

ok n = 99, total = 2786, max = 50

Test #33:

score: 0
Accepted
time: 0ms
memory: 3592kb

input:

96
asleep
awake
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
awake
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
awake
asleep
asleep
awake
awake
asleep
asleep
asleep
asleep
asleep
asleep
awake
asleep
asleep
asleep
awake
asleep
awake
asleep
asleep
asle...

output:

at 00:00 check 1
at 00:00 check 2
at 00:00 check 3
at 00:00 check 4
at 00:00 check 5
at 00:00 check 6
at 00:00 check 7
at 00:00 check 8
at 00:00 check 9
at 00:00 check 10
at 00:00 check 11
at 00:00 check 12
at 00:00 check 13
at 00:00 check 14
at 00:00 check 15
at 00:00 check 16
at 00:00 check 17
at ...

result:

ok n = 96, total = 3427, max = 50

Test #34:

score: 0
Accepted
time: 0ms
memory: 3840kb

input:

97
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
awake
asleep
asleep
asleep
asleep
asleep
asleep
asleep
awake
asleep
asleep
asleep
asleep
awake
awake
asleep
asleep
asleep
awake
asleep
asleep
asleep
asleep
awake
awake
asleep
asleep
asleep
asleep
awake
asle...

output:

at 00:00 check 1
at 00:00 check 2
at 00:00 check 3
at 00:00 check 4
at 00:00 check 5
at 00:00 check 6
at 00:00 check 7
at 00:00 check 8
at 00:00 check 9
at 00:00 check 10
at 00:00 check 11
at 00:00 check 12
at 00:00 check 13
at 00:00 check 14
at 00:00 check 15
at 00:00 check 16
at 00:00 check 17
at ...

result:

ok n = 97, total = 2936, max = 50

Test #35:

score: 0
Accepted
time: 5ms
memory: 3804kb

input:

98
asleep
asleep
asleep
asleep
awake
asleep
awake
asleep
asleep
awake
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
awake
asleep
awake
asleep
asleep
awake
awake
asleep
asleep
asleep
asleep
asleep
asleep
awake
asleep
asleep
awake
asleep
awake
asleep
asleep
asleep
asleep
asleep...

output:

at 00:00 check 1
at 00:00 check 2
at 00:00 check 3
at 00:00 check 4
at 00:00 check 5
at 00:00 check 6
at 00:00 check 7
at 00:00 check 8
at 00:00 check 9
at 00:00 check 10
at 00:00 check 11
at 00:00 check 12
at 00:00 check 13
at 00:00 check 14
at 00:00 check 15
at 00:00 check 16
at 00:00 check 17
at ...

result:

ok n = 98, total = 3034, max = 49

Extra Test:

score: 0
Extra Test Passed