QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#466236#7281. How to Avoid Disqualification in 75 Easy StepsForested25 7ms3952kbC++175.9kb2024-07-07 17:06:472024-07-07 17:06:47

Judging History

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

  • [2024-07-07 17:06:47]
  • 评测
  • 测评结果：25
  • 用时：7ms
  • 内存：3952kb
查看
  • [2024-07-07 17:06:47]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;

using i32 = int;
using i64 = long long;
template <typename T>
using V = vector<T>;
template <typename T>
using VV = V<V<T>>;

#define OVERRIDE4(a, b, c, d, ...) d
#define REP2(i, n) for (i32 i = 0; i < (i32)(n); ++i)
#define REP3(i, l, r) for (i32 i = (i32)(l); i < (i32)(r); ++i)
#define REP(...) OVERRIDE4(__VA_ARGS__, REP3, REP2)(__VA_ARGS__)
#define PER2(i, n) for (i32 i = (i32)(n)-1; i >= 0; --i)
#define PER3(i, l, r) for (i32 i = (i32)(r)-1; i >= (i32)(l); --i)
#define PER(...) OVERRIDE4(__VA_ARGS__, PER3, PER2)(__VA_ARGS__)
#define ALL(x) begin(x), end(x)
#define LEN(x) (i32)(size(x))

template <typename T>
bool chmin(T &x, const T &y) {
    if (x > y) {
        x = y;
        return true;
    }
    return false;
}
template <typename T>
bool chmax(T &x, const T &y) {
    if (x < y) {
        x = y;
        return true;
    }
    return false;
}

#include "avoid.h"

constexpr i32 L = 1000;

pair<i32, i32> sub1() {
    REP(i, 10) {
        V<i32> p;
        REP(j, 1, L + 1) {
            if (j & (1 << i)) {
                p.push_back(j);
            }
        }
        send(p);
    }
    V<i32> ret = wait();
    i32 ans = 0;
    REP(i, 10) {
        if (ret[i]) {
            ans ^= 1 << i;
        }
    }
    return pair<i32, i32>(ans, ans);
}

pair<i32, i32> sub2() {
    i32 ok = L, ng = 0;
    while (ok - ng > 1) {
        i32 mid = (ok + ng) / 2;
        V<i32> p;
        REP(i, 1, mid + 1) { p.push_back(i); }
        send(p);
        if (wait()[0]) {
            ok = mid;
        } else {
            ng = mid;
        }
    }
    i32 a = ok;
    ok = L + 1, ng = a;
    while (ok - ng > 1) {
        i32 mid = (ok + ng) / 2;
        V<i32> p;
        REP(i, a + 1, mid + 1) { p.push_back(i); }
        send(p);
        if (wait()[0]) {
            ok = mid;
        } else {
            ng = mid;
        }
    }
    if (ok == L + 1) {
        return pair<i32, i32>(a, a);
    } else {
        return pair<i32, i32>(a, ok);
    }
}

pair<i32, i32> sub3() {
    REP(i, 10) {
        V<i32> a, b;
        REP(j, 1, 1001) {
            if (j & (1 << i)) {
                b.push_back(j);
            } else {
                a.push_back(j);
            }
        }
        send(a);
        send(b);
    }
    V<i32> res1 = wait();
    V<i32> ans(10, -1);
    REP(i, 10) {
        if (res1[2 * i] && res1[2 * i + 1]) {
            ans[i] = -1;
        } else if (res1[2 * i]) {
            ans[i] = 0;
        } else {
            ans[i] = 1;
        }
    }
    if (count(ALL(ans), -1) == 0) {
        i32 x = 0;
        REP(i, 10) {
            if (ans[i] == 1) {
                x ^= 1 << i;
            }
        }
        return pair<i32, i32>(x, x);
    }
    i32 d = 0;
    while (ans[d] != -1) {
        ++d;
    }
    REP(i, d + 1, 10) {
        if (ans[i] != -1) {
            continue;
        }
        V<i32> p;
        REP(j, 1, 1001) {
            bool ok = true;
            REP(k, 10) {
                i32 dk = (j >> k) & 1;
                if (k == i) {
                    if (dk == 0) {
                        ok = false;
                    }
                } else if (k == d) {
                    if (dk == 1) {
                        ok = false;
                    }
                } else if (ans[k] != -1) {
                    if (dk != ans[k]) {
                        ok = false;
                    }
                }
            }
            if (ok) {
                p.push_back(j);
            }
        }
        send(p);
    }
    V<i32> res2 = wait();
    i32 a = 0, b = 0;
    REP(i, 10) {
        if (ans[i] == 1) {
            a ^= 1 << i;
            b ^= 1 << i;
        }
    }
    b ^= 1 << d;
    REP(i, LEN(res2)) {
        ++d;
        while (ans[d] != -1) {
            ++d;
        }
        if (res2[i]) {
            a ^= 1 << d;
        } else {
            b ^= 1 << d;
        }
    }
    return pair<i32, i32>(a, b);
}

pair<i32, i32> sub4() {
    random_device rd;
    mt19937 mt(rd());
    V<i32> perm(1001);
    iota(ALL(perm), 0);
    shuffle(1 + ALL(perm), mt);
    V<i32> inv(1001);
    REP(i, 1001) {
        inv[perm[i]] = i;
    }
    VV<i32> hist;
    auto ask = [&](const V<i32> &p) -> void {
        V<i32> q;
        REP(i, LEN(p)) {
            if (p[i]) {
                q.push_back(perm[i]);
            }
        }
        send(q);
        hist.push_back(p);
    };
    /*REP(i, 10) {
        V<i32> p(1001, 0);
        REP(j, 1, 1001) {
            if (!(j & (1 << i))) {
                p[j] = 1;
            }
        }
        ask(p);
    }
    REP(i, 10) {
        V<i32> p(1001, 0);
        REP(j, 1, 1001) {
            if ((j & (1 << i))) {
                p[j] = 1;
            }
        }
        ask(p);
    }
    REP(i, 10) REP(j, i) {
        V<i32> p(1001, 0);
        REP(k, 1, 1001) {
            if (!(k & (1 << i)) && !(k & (1 << j))) {
                p[k] = 1;
            }
        }
        ask(p);
    }*/
    uniform_int_distribution<> dist(1, 1000);
    REP(i, 60) {
        V<i32> p(1001, 0);
        REP(j, 750) {
            p[dist(mt)] = 1;
        }
        ask(p);
    }
    V<i32> res = wait();
    REP(a, 1, 1001) REP(b, 1, 1001) {
        bool ok = true;
        REP(i, LEN(hist)) {
            i32 tmp = hist[i][a] || hist[i][b];
            if (tmp != res[i]) {
                ok = false;
                break;
            }
        }
        if (ok) {
            return pair<i32, i32>(perm[a], perm[b]);
        }
    }
    return pair<i32, i32>(249, 124);
}

pair<i32, i32> scout(i32 r, i32 h) {
    if (r == 10 && h == 1) {
        return sub1();
    }
    if (r == 20 && h == 20) {
        return sub2();
    }
    if (r == 30 && h == 2) {
        return sub3();
    }
    return sub4();
}
源文件, 语言: C++17

詳細信息

Subtask #1:

score: 10
Accepted

Test #1:

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

input:

output:

result:

ok Correct: 10 robot(s) used, 1 hour(s) passed

Test #2:

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

input:

output:

result:

ok Correct: 10 robot(s) used, 1 hour(s) passed

Test #3:

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

input:

output:

result:

ok Correct: 10 robot(s) used, 1 hour(s) passed

Test #4:

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

input:

output:

result:

ok Correct: 10 robot(s) used, 1 hour(s) passed

Test #5:

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

input:

output:

result:

ok Correct: 10 robot(s) used, 1 hour(s) passed

Test #6:

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

input:

output:

result:

ok Correct: 10 robot(s) used, 1 hour(s) passed

Test #7:

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

input:

output:

result:

ok Correct: 10 robot(s) used, 1 hour(s) passed

Test #8:

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

input:

output:

result:

ok Correct: 10 robot(s) used, 1 hour(s) passed

Test #9:

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

input:

output:

result:

ok Correct: 10 robot(s) used, 1 hour(s) passed

Test #10:

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

input:

output:

result:

ok Correct: 10 robot(s) used, 1 hour(s) passed

Subtask #2:

score: 5
Accepted

Test #11:

score: 5
Accepted
time: 1ms
memory: 3864kb

input:

\x14

output:

result:

ok Correct: 20 robot(s) used, 20 hour(s) passed

Test #12:

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

input:

\x14

output:

result:

ok Correct: 20 robot(s) used, 20 hour(s) passed

Test #13:

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

input:

\x14

output:

result:

ok Correct: 20 robot(s) used, 20 hour(s) passed

Test #14:

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

input:

\x14

output:

result:

ok Correct: 20 robot(s) used, 20 hour(s) passed

Test #15:

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

input:

\x14

output:

result:

ok Correct: 20 robot(s) used, 20 hour(s) passed

Test #16:

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

input:

\x14

output:

result:

ok Correct: 20 robot(s) used, 20 hour(s) passed

Test #17:

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

input:

\x14

output:

result:

ok Correct: 20 robot(s) used, 20 hour(s) passed

Test #18:

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

input:

\x14

output:

result:

ok Correct: 20 robot(s) used, 20 hour(s) passed

Test #19:

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

input:

\x14

output:

result:

ok Correct: 20 robot(s) used, 20 hour(s) passed

Test #20:

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

input:

\x14

output:

result:

ok Correct: 20 robot(s) used, 20 hour(s) passed

Test #21:

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

input:

\x14

output:

result:

ok Correct: 20 robot(s) used, 20 hour(s) passed

Test #22:

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

input:

\x14

output:

result:

ok Correct: 20 robot(s) used, 20 hour(s) passed

Test #23:

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

input:

\x14

output:

result:

ok Correct: 20 robot(s) used, 20 hour(s) passed

Test #24:

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

input:

\x14

output:

result:

ok Correct: 20 robot(s) used, 20 hour(s) passed

Test #25:

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

input:

\x14

output:

result:

ok Correct: 20 robot(s) used, 20 hour(s) passed

Test #26:

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

input:

\x14

output:

result:

ok Correct: 20 robot(s) used, 20 hour(s) passed

Test #27:

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

input:

\x14

output:

result:

ok Correct: 20 robot(s) used, 20 hour(s) passed

Test #28:

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

input:

\x14

output:

result:

ok Correct: 20 robot(s) used, 20 hour(s) passed

Test #29:

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

input:

\x14

output:

result:

ok Correct: 20 robot(s) used, 20 hour(s) passed

Test #30:

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

input:

\x14

output:

result:

ok Correct: 20 robot(s) used, 20 hour(s) passed

Test #31:

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

input:

\x14

output:

result:

ok Correct: 20 robot(s) used, 20 hour(s) passed

Test #32:

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

input:

\x14

output:

result:

ok Correct: 20 robot(s) used, 20 hour(s) passed

Test #33:

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

input:

\x14

output:

result:

ok Correct: 20 robot(s) used, 20 hour(s) passed

Test #34:

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

input:

\x14

output:

result:

ok Correct: 20 robot(s) used, 20 hour(s) passed

Test #35:

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

input:

\x14

output:

result:

ok Correct: 20 robot(s) used, 20 hour(s) passed

Test #36:

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

input:

\x14

output:

result:

ok Correct: 20 robot(s) used, 20 hour(s) passed

Test #37:

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

input:

\x14

output:

result:

ok Correct: 20 robot(s) used, 20 hour(s) passed

Test #38:

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

input:

\x14

output:

result:

ok Correct: 20 robot(s) used, 20 hour(s) passed

Test #39:

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

input:

\x14

output:

result:

ok Correct: 20 robot(s) used, 20 hour(s) passed

Test #40:

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

input:

\x14

output:

result:

ok Correct: 20 robot(s) used, 20 hour(s) passed

Test #41:

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

input:

\x14

output:

result:

ok Correct: 20 robot(s) used, 20 hour(s) passed

Test #42:

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

input:

\x14

output:

result:

ok Correct: 20 robot(s) used, 20 hour(s) passed

Test #43:

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

input:

\x14

output:

result:

ok Correct: 20 robot(s) used, 20 hour(s) passed

Test #44:

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

input:

\x14

output:

result:

ok Correct: 20 robot(s) used, 20 hour(s) passed

Test #45:

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

input:

\x14

output:

result:

ok Correct: 20 robot(s) used, 20 hour(s) passed

Test #46:

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

input:

\x14

output:

result:

ok Correct: 20 robot(s) used, 20 hour(s) passed

Test #47:

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

input:

\x14

output:

result:

ok Correct: 20 robot(s) used, 20 hour(s) passed

Test #48:

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

input:

\x14

output:

result:

ok Correct: 20 robot(s) used, 20 hour(s) passed

Test #49:

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

input:

\x14

output:

result:

ok Correct: 20 robot(s) used, 20 hour(s) passed

Test #50:

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

input:

\x14

output:

result:

ok Correct: 19 robot(s) used, 19 hour(s) passed

Test #51:

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

input:

\x14

output:

result:

ok Correct: 19 robot(s) used, 19 hour(s) passed

Test #52:

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

input:

\x14

output:

result:

ok Correct: 20 robot(s) used, 20 hour(s) passed

Test #53:

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

input:

\x14

output:

result:

ok Correct: 19 robot(s) used, 19 hour(s) passed

Test #54:

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

input:

\x14

output:

result:

ok Correct: 19 robot(s) used, 19 hour(s) passed

Test #55:

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

input:

\x14

output:

result:

ok Correct: 20 robot(s) used, 20 hour(s) passed

Test #56:

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

input:

\x14

output:

result:

ok Correct: 20 robot(s) used, 20 hour(s) passed

Test #57:

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

input:

\x14

output:

result:

ok Correct: 10 robot(s) used, 10 hour(s) passed

Test #58:

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

input:

\x14

output:

result:

ok Correct: 20 robot(s) used, 20 hour(s) passed

Test #59:

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

input:

\x14

output:

result:

ok Correct: 20 robot(s) used, 20 hour(s) passed

Test #60:

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

input:

\x14

output:

result:

ok Correct: 19 robot(s) used, 19 hour(s) passed

Test #61:

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

input:

\x14

output:

result:

ok Correct: 11 robot(s) used, 11 hour(s) passed

Test #62:

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

input:

\x14

output:

result:

ok Correct: 20 robot(s) used, 20 hour(s) passed

Test #63:

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

input:

\x14

output:

result:

ok Correct: 20 robot(s) used, 20 hour(s) passed

Test #64:

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

input:

\x14

output:

result:

ok Correct: 20 robot(s) used, 20 hour(s) passed

Test #65:

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

input:

\x14

output:

result:

ok Correct: 20 robot(s) used, 20 hour(s) passed

Subtask #3:

score: 10
Accepted

Test #66:

score: 10
Accepted
time: 1ms
memory: 3524kb

input:

\x1e

output:

result:

ok Correct: 29 robot(s) used, 2 hour(s) passed

Test #67:

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

input:

\x1e

output:

result:

ok Correct: 29 robot(s) used, 2 hour(s) passed

Test #68:

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

input:

\x1e

output:

result:

ok Correct: 29 robot(s) used, 2 hour(s) passed

Test #69:

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

input:

\x1e

output:

result:

ok Correct: 26 robot(s) used, 2 hour(s) passed

Test #70:

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

input:

\x1e

output:

result:

ok Correct: 26 robot(s) used, 2 hour(s) passed

Test #71:

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

input:

\x1e

output:

result:

ok Correct: 26 robot(s) used, 2 hour(s) passed

Test #72:

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

input:

\x1e

output:

result:

ok Correct: 22 robot(s) used, 2 hour(s) passed

Test #73:

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

input:

\x1e

output:

result:

ok Correct: 24 robot(s) used, 2 hour(s) passed

Test #74:

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

input:

\x1e

output:

result:

ok Correct: 21 robot(s) used, 2 hour(s) passed

Test #75:

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

input:

\x1e

output:

result:

ok Correct: 23 robot(s) used, 2 hour(s) passed

Test #76:

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

input:

\x1e

output:

result:

ok Correct: 20 robot(s) used, 2 hour(s) passed

Test #77:

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

input:

\x1e

output:

result:

ok Correct: 29 robot(s) used, 2 hour(s) passed

Test #78:

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

input:

\x1e

output:

result:

ok Correct: 21 robot(s) used, 2 hour(s) passed

Test #79:

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

input:

\x1e

output:

result:

ok Correct: 23 robot(s) used, 2 hour(s) passed

Test #80:

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

input:

\x1e

output:

result:

ok Correct: 22 robot(s) used, 2 hour(s) passed

Test #81:

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

input:

\x1e

output:

result:

ok Correct: 22 robot(s) used, 2 hour(s) passed

Test #82:

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

input:

\x1e

output:

result:

ok Correct: 24 robot(s) used, 2 hour(s) passed

Test #83:

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

input:

\x1e

output:

result:

ok Correct: 25 robot(s) used, 2 hour(s) passed

Test #84:

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

input:

\x1e

output:

result:

ok Correct: 21 robot(s) used, 2 hour(s) passed

Test #85:

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

input:

\x1e

output:

result:

ok Correct: 23 robot(s) used, 2 hour(s) passed

Test #86:

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

input:

\x1e

output:

result:

ok Correct: 22 robot(s) used, 2 hour(s) passed

Test #87:

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

input:

\x1e

output:

result:

ok Correct: 24 robot(s) used, 2 hour(s) passed

Test #88:

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

input:

\x1e

output:

result:

ok Correct: 29 robot(s) used, 2 hour(s) passed

Test #89:

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

input:

\x1e

output:

result:

ok Correct: 22 robot(s) used, 2 hour(s) passed

Test #90:

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

input:

\x1e

output:

result:

ok Correct: 22 robot(s) used, 2 hour(s) passed

Test #91:

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

input:

\x1e

output:

result:

ok Correct: 21 robot(s) used, 2 hour(s) passed

Test #92:

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

input:

\x1e

output:

result:

ok Correct: 20 robot(s) used, 2 hour(s) passed

Test #93:

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

input:

\x1e

output:

result:

ok Correct: 23 robot(s) used, 2 hour(s) passed

Test #94:

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

input:

\x1e

output:

result:

ok Correct: 21 robot(s) used, 2 hour(s) passed

Test #95:

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

input:

\x1e

output:

result:

ok Correct: 20 robot(s) used, 1 hour(s) passed

Test #96:

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

input:

\x1e

output:

result:

ok Correct: 20 robot(s) used, 1 hour(s) passed

Test #97:

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

input:

\x1e

output:

result:

ok Correct: 20 robot(s) used, 2 hour(s) passed

Test #98:

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

input:

\x1e

output:

result:

ok Correct: 22 robot(s) used, 2 hour(s) passed

Test #99:

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

input:

\x1e

output:

result:

ok Correct: 29 robot(s) used, 2 hour(s) passed

Test #100:

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

input:

\x1e

output:

result:

ok Correct: 24 robot(s) used, 2 hour(s) passed

Test #101:

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

input:

\x1e

output:

result:

ok Correct: 20 robot(s) used, 2 hour(s) passed

Test #102:

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

input:

\x1e

output:

result:

ok Correct: 22 robot(s) used, 2 hour(s) passed

Test #103:

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

input:

\x1e

output:

result:

ok Correct: 21 robot(s) used, 2 hour(s) passed

Test #104:

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

input:

\x1e

output:

result:

ok Correct: 21 robot(s) used, 2 hour(s) passed

Test #105:

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

input:

\x1e

output:

result:

ok Correct: 23 robot(s) used, 2 hour(s) passed

Test #106:

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

input:

\x1e

output:

result:

ok Correct: 22 robot(s) used, 2 hour(s) passed

Test #107:

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

input:

\x1e

output:

result:

ok Correct: 24 robot(s) used, 2 hour(s) passed

Test #108:

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

input:

\x1e

output:

result:

ok Correct: 21 robot(s) used, 2 hour(s) passed

Test #109:

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

input:

\x1e

output:

result:

ok Correct: 21 robot(s) used, 2 hour(s) passed

Test #110:

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

input:

\x1e

output:

result:

ok Correct: 29 robot(s) used, 2 hour(s) passed

Test #111:

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

input:

\x1e

output:

result:

ok Correct: 23 robot(s) used, 2 hour(s) passed

Test #112:

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

input:

\x1e

output:

result:

ok Correct: 24 robot(s) used, 2 hour(s) passed

Test #113:

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

input:

\x1e

output:

result:

ok Correct: 26 robot(s) used, 2 hour(s) passed

Test #114:

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

input:

\x1e

output:

result:

ok Correct: 22 robot(s) used, 2 hour(s) passed

Test #115:

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

input:

\x1e

output:

result:

ok Correct: 22 robot(s) used, 2 hour(s) passed

Test #116:

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

input:

\x1e

output:

result:

ok Correct: 29 robot(s) used, 2 hour(s) passed

Test #117:

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

input:

\x1e

output:

result:

ok Correct: 29 robot(s) used, 2 hour(s) passed

Test #118:

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

input:

\x1e

output:

result:

ok Correct: 29 robot(s) used, 2 hour(s) passed

Test #119:

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

input:

\x1e

output:

result:

ok Correct: 29 robot(s) used, 2 hour(s) passed

Subtask #4:

score: 0
Wrong Answer

Test #120:

score: 0
Wrong Answer
time: 7ms
memory: 3952kb

input:

K

output:

result:

wrong answer Not correct
English 繁體中文 简体中文

伺服器時間: 2024-12-12 00:43:13 | 開源專案