QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#528372#7281. How to Avoid Disqualification in 75 Easy Stepsskittles141285.000001 216ms26752kbC++178.8kb2024-08-23 13:21:262024-08-23 13:21:27

Judging History

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

  • [2024-08-23 13:21:27]
  • 评测
  • 测评结果:85.000001
  • 用时:216ms
  • 内存:26752kb
  • [2024-08-23 13:21:26]
  • 提交

answer

// cf bits/extc++.h nonsense
#ifdef ONLINE_JUDGE
#define _EXT_CODECVT_SPECIALIZATIONS_H 1
#define _EXT_ENC_FILEBUF_H 1
#endif
#include "bits/extc++.h"

using namespace std;

template <typename T, typename... U>
void dbgh(const T& t, const U&... u) {
    cerr << t;
    ((cerr << " | " << u), ...);
    cerr << endl;
}

#ifdef DEBUG
#define dbg(...)                                              \
    cerr << "L" << __LINE__ << " [" << #__VA_ARGS__ << "]: "; \
    dbgh(__VA_ARGS__)
#else
#define dbg(...)
#define cerr   \
    if (false) \
    cerr
#endif

using ll = long long;

#define endl "\n"
#define long int64_t
#define sz(x) int(std::size(x))

inline void init_io() {
    cin.tie(nullptr);
    cin.exceptions(ios::failbit);
    ios_base::sync_with_stdio(false);
}

template <typename T>
ostream& operator<<(ostream& out, const vector<T>& arr) {
    out << "[";
    for (int i = 0; i < sz(arr); i++) {
        if (i) {
            out << ", ";
        }
        out << arr[i];
    }
    return out << "]";
}

template <typename T>
struct PSA {
    int n;
    vector<T> psum;

    template <typename U>
    PSA(const vector<U>& arr) : n(sz(arr)), psum(n + 1) {
        for (int i = 0; i < n; i++) {
            psum[i + 1] = psum[i] + arr[i];
        }
    }

    T query(int l, int r) const {
        return psum[r] - psum[l];
    }
};

template <typename T>
bool on(T mask, int bit) {
    return (mask >> bit) & 1;
}

string to_base_64(vector<bool> bits) {
    while (sz(bits) % 6) {
        bits.push_back(false);
    }

    string ans;
    for (int ql = 0; ql < sz(bits); ql += 6) {
        int cv = 0;
        for (int i = 0; i < 6; i++) {
            cv |= bits[ql + i] << i;
        }
        ans += char(' ' + cv);
    }

    return ans;
}

vector<bool> from_base_64(string s) {
    vector<bool> ans;

    for (auto& c : s) {
        int cv = c - ' ';
        for (int i = 0; i < 6; i++) {
            ans.push_back(on(cv, i));
        }
    }

    return ans;
}

vector<bool> to_bits(const vector<int>& arr) {
    vector<bool> ans;

    for (auto& a : arr) {
        for (int i = 0; i < 30; i++) {
            ans.push_back(on(a, i));
        }
    }

    return ans;
}

vector<int> from_bits(const vector<bool>& arr) {
    vector<int> ans;

    for (int ql = 0; ql < sz(arr); ql += 30) {
        int cx = 0;
        for (int i = 0; i < 30; i++) {
            cx |= arr[ql + i] << i;
        }
        ans.push_back(cx);
    }

    return ans;
}


void send(vector<int>);
vector<int> wait();

void verify(const vector<int>& arr) {
    int n = sz(arr);
    assert(n == 1000);

    set<int> cx;
    for (int i = 0; i < n; i++) {
        for (int j = i; j < n; j++) {
            int cv = arr[i] | arr[j];
            assert(!cx.count(cv));
            cx.insert(cv);
        }
    }
}

constexpr int n = 1000, m = 28;
vector<int> c_data;

void gen_data() {
    string cs =
        R"14121412(6 #P( "DQ)8&BB  4*%%3*"# 0F2"$%,@&!A UP 0IY  %,)4 !P88"4R@# T"(2!P3!0"/,0$ 0# F#8"(9$+,* " ,1H&A%%$$="D ()*"!&@P@)*),(9 00PD&0BLA 0()1, 80$/ 1D1,,0$4* H0I& H)!'%P@T 4"0*&0D,I T+(0 P\$0 1 G& % 4L"I$ -(YH(" (B18(<P0"$!2H5 )(I($@(!E,R(8!$0! N)2$D,(,B$@*%:4( <""H$@(N"$@ XN !%%Q 9' 8 $U"(( 0Z2$1H00#-A@((3 8)"B@&1!B0E@(PH!A!E&!A  "4Q&@*(F!J &()!%H2!$Q($,B"!"+0P"9$$%#%!XD%" H"&)!(%$,&2U(" $%%+ 4@32 4)6 $@$0/!N H# 6H@"((D*I  4BF!2$$Q!*BC@ 2K!0 "A(7 @P",&S$$ &@V$@$-0)@!@"Q)$&$07 X #: (4U (,E" %,*"4!$(^ (R"!R $J4"(!T!4$2(#D"DSD  A1@)(#03$"V&H  \"$%  52B(3!((&!R- ( 2+&(L J% "!D+!K@ )("S E "Q<@ $#$+$ #A$-I(B"!" '"'0&2E A K"(48D!!@.#""$:"#"& $Z$2(H$,Z# !$5 *P!"!58"E""%"0J","#40", 8E +'9,  @!A,%5 2#!!L(0*$"1A*6@ C!#X : (AAF !1HD(("T4"!(; &&:P" #@!H,40!R(BH,) 182& +H"@$:HB0 ,L,0  @%<%E @1#"6!0*$H7 "A&: (%#,$",0S0 *"Q *"$!6))$I!!P* 1%D4 #) ''@(@ R&&"D("+A(@"+0!DQ!0X$P!9AA0 $L#$($@HD*808%$@0XH"(#@C$!$4-!1! A-!$$4.9 H#$"H"Q(. %< #@$ /$@DC$0@3L " I+(9" 2)3T#  #@&*(0*E"$K!$ #)442 "$J"&U%$! 0\ *"Q$2P C$8A 3!!"* #BE!$HA -,L!8 AH+@ C F #)&#P DD!,!@9*& (X 1*4 1&& ,@X% :CD Q@(L D2A0"- > $%10*$ M!B(2HP"$0!23("!2P#"(*,)C$R0  =@A"0('"*"%0D&88% ,M 0D!:@1($'(!C !DI* (RA@$"&P2"0+22 #2@ +R) 1"*0A1".($%(@8%0#. 8@%@,$P,#8P!"((DE!H00%,100H)(2HH" )-!*  O$)!J!(% #1'(R0H$"$124! @T%)8$@1*0C0!#04:8 L0,% (A4#!BDT "H8D((,@&"#)*(2"B!1D(V@@8 J$$: 0%D4$-9A  D0. ,+!2($# ,D,(2 G(0P %.!2 S!40A*"$X :!8A ('HP($*$80Y 6!($)* .!&1 $U((' +(($SH I@#!$'0!!,,R#" X"!8!"$3*(A"., $N0$"$0R@)@1 Z!!8!*)VH1   X2!%LT ((*' &!"9 &,*11!(09"(%@ 09'"N&! K >  00A$+E)$0"6D") ": '!J"(0) ATR (09P"4  :-("$F&08@6! !<"+ -BD$A0(6$;08 !HDAD 8P*D C  C% #@/$* H6! (0R.(P&()+1 0,$&JP L$C !;H$ !*(!B%4 #.$@!+)!((U %"(D2),! 2' $Y6 @&20&4( A+$@HL!AQ1 !&## * F5 *$>!0! 6'# I$"B"@@E8"<(1P B8&D L$T! 2*(A$P"L!"$0P5"P &%)I4$!! F%B!@R$0*88("%"3A1 J1@8 @4)P(0, L#Y!0, E0("#B "] 2!!0'!DH!, 1P8#">@@$($Z$(8 $:# (P'&!"-@%$4E %2"0".B4"$*B&$T @-00%"X T"*%)H  +,*"!X8A DF'   ()<# 0K 'A'(% $8,P"%)14 T(00)AP"2(%!$@+(,(@-0",4%%&D!!-@(@&40H,(8:!% LH !%$ =B(-) H(!,11( F0*#0!6H(Y)0! R"-$ C*#( 14*@(D*C$ D$X* J((0% "RP*@ F&*(E%0(MB ""D!?  ,(P8!1!)H!%1" .0D*@%(1\ $@ BL,!+'0 @R!I 6!0,"0#1H$()(5$',("$3 0@'& ) /1 H&&$C,8 0BK "T! 8%8%@@&@I%H  E1,$"@$3*#"$A#L@,"( A"H-0*)J $@01+ @C0.$$B4*Q T %61 2!?B(  *0(D)R, (%&"0T( E2!)8"$,#B0<4 A AI$ !#R*)8B$"<2$* BC0* Q0$1$ 8Q1(A:0 #\ 2((1, F!D ),,0D!R"2( ).$"H<$H( <*@  [&!8"C$TLP  (Z ,$# 7!$P !3* "*X,()2A( )C!,19% ")C00$$)(H&+$(,!H&(H$(\ %!@ 6:(54 H"F 1F #A90 !E09 2#B0!P@(R$&,B!$D#@,""!FH$@%4P"%BQ ()P0' D I1$&Q$$!!0D#&H(/ "PP1!"!5(A!8"1 -"@1K 2$-@$H: @*(0DP#&!*I (9"2(57 $ !&2. ).""$2,0$*EB 4$*"0P#&0(X!"5$A(.!"P!<:" (810*!!1!F$$"X!)*8K  ,$A'  *,R((,%0&&L0"!&$""-,HB($!H%$)(+!2$400G 04#!,"72! 1A*$$@ 5%%0%!A*#@B5 %B)"$6D 0, C,@)+"H %!!2$+2)@8$0&$N L$!(&$ &Q#(T$$, <(2& %&1%#B@B$$":' DR *"(J $+K0P$  "CY 880*"0=) ( @$N,@!LH!H)$3 ()"8&% A&*"A N"4 L"#DIA!  +(T(+A$, #'!$!400P%0 ^($@S((!(F@!# X*@, Q!5!*0@I$1 P1)DL$ #\$@$$@J)# 1,",(##D"" MA *03%"!5@%"("'' ".20A  ,8:!031$$AQ P$(P@&,(4E("@)J *@G"D 1$(+!$ '-$*302 %P** B(4&! 1'*$=,$ " 0L9!8)@()B$!-"R!,P #1$1"F5! !&K @!B,$#(!ET$ #&6 ! CD0%3%4 (B"(/ 8@I% :@(H!<%(% 5 A)(1D 8, L&,!  >R"  +:%!#81(#@@)%&V(! 8D*1 !2& '(U )!$-0$)( XI!H6"!(W,  (P $J#GA"@ #0H8(0.+! "F<0 "(D4&0 .9!R0A* "**0*F"AH (.8B H2* %6 )< (0))%!#H)!:*("(0"7(!"X!!) D85"&PA$$8QD( @+ && "HA.)D 2&A*D% !B(5!%"* -H D5$(8@T$$DR!"@ &F%*@$Q$H5( )(5&"!:( <!P ;"",Q* "%P&$("@RD!#HD(" @J2#J@ 6" EH",R 49 C!I! &.!) 8 Z"!)!-@(C2 ,!A %,* A B/!*2)!$05#$H 2B,D@< &! &3, C [ $;!($!8&X AF! )0!M$"Q* A" <\ ")&)$"J@% %"@*Z %(:H !$E< 4E0@! *2D)X@"0)1&(B"A&5( =)"0 0!AL(@Z8 ( G(0&B4 R"$*'@"$!E0##"$:(R*04 !8A$,V"D !H: + !6 P#-$A@(  <X)A%"0,PP#"$F'"0 J@*, B"#1$, G* A@21"@ .7 $D54 ! KE "6#@!B!#J P#4"$' (5"%(@)&*)'! ,!I4 *@0"'AH!4"8-H" H/ $( C@&*0I0&$#) %)$A0X$%0B%$&"$8#0!NB L4)" @50,!.4%@ C3$ $!D,D"D !J)($)*#)0B!) $@[(B"T$(*D@()$N 3 @A24(DB"H!!Q6! ##*2 !(*<$$"!5& : <)%$)!&#PJ@ :@ &)PA!- DX!& X( K <$@$)!()D*008B*45""$**4* (400-$+"%$8X2@ PAF "P6@$(,T P$I,0 ,.J( $*4"Q 0JR (@(\@!)!PA"T!$4("F$+ #("('$!Q)! :$*%H!14!@@!:,"*1)$"/ 1!E,,( 6 D)" 30X(2"#%!$350  L)D!$9 A,&@A@#(@,T("2(4,"*I0!&!AP$2F H(86$!$@@-!)%3(!$E@I !$ .$'!B<& #@8") 2$I,$% >") .J )$(F(,!L * 3BP$ %DD)(#L2 A!(<!&(%0%S" *$((-Q J 1#"%$<# 1)P$")BE! D!0B&:-" ! QC, "5*(" H&V CI0 $%"C("N0 4!"B*!%"<%& )(6 #!*@X(1I,(  C8"%!Q(&!$P:!$10#@&X!00&!$3"%@092!24&4 4H(D$A#) ,@L@< 902 , 88)#<C! !D(5* )5 !&7 60 $@$/"@@D*%X %)"!!<2$ ,"9* @:+(+(22 9"P* ^($@  \$#$DH0%(," #+#)0F  @/P$0*F0"B$90$#PQ" %!#1"!F$",QP $#" UH!" A8-,!1D$#D,($141# )!!,#2@X((::  # 4$H',04&!$&(), $6@+)H9 !0 U2(.#)" %*"B(!#[   49!*IH H!$&"B&& @'%:410 R@0$,4@9$!'$3@ 3@ 4&8/ A X4$$"X@P!$!A4@%#B X!4$*&"R40 ) "0\%1AB"(E@@+  8+3 8! 6,0*@$'8$#&(@5#@$1(F!(AR(!"&%.$ "T1@$-2,0 D!4)(# Y@(,$F@$<0"A!A2B"$(, G$ 0'U *"J$"0!*1&" -C"P#R( D1@"%!"P('H1@@,20")#A '8!,&1* $FB$!8D@P!#$BD" [email protected](J!" !V< 4A(A(HIP (:B@$$4#. !22Q !T2 $&06@"%2- T !@1D# #)0+1 +(*)@D: (+$X *@X!"@1"8*)!"%%,$!))Q(.0 !((I)*I0@"X0*0"P.@"!0R!)( (30-%2%$!"Q )&60&@"0&09(1@"!'#NH  D& !'T0&) Q$H("8$1D!&@J!( V) #L*H "Y0 @%Q"" +(Q!2" -,A$0$B#)31 I S(!% H$H 'L "&# P!X)41+! )14121412";
    c_data = from_bits(from_base_64(cs));
    verify(c_data);
}

pair<int, int> bsearch1() {
    for (int i = 0; i < 10; i++) {
        vector<int> cv;
        for (int j = 1; j <= 1000; j++) {
            if (on(j, i)) {
                cv.push_back(j);
            }
        }

        send(cv);
    }

    auto res = wait();
    int ans = 0;
    for (int i = 0; i < sz(res); i++) {
        ans |= res[i] << i;
    }

    return {ans, ans};
}

pair<int, int> scout(int r, int h) {
    if (r == 10 && h == 1) {
        return bsearch1();
    }
    gen_data();
    for (int i = 0; i < m; i++) {
        vector<int> cv;

        for (int j = 0; j < n; j++) {
            if (on(c_data[j], i)) {
                cv.push_back(j + 1);
            }
        }

        send(cv);
    }

    long cans = 0;
    {
        auto res = wait();
        for (int i = 0; i < sz(res); i++) {
            cans |= res[i] << i;
        }
    }

    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if ((c_data[i] | c_data[j]) == cans) {
                return {i + 1, j + 1};
            }
        }
    }

    assert(false);
}

Details

Tip: Click on the bar to expand more detailed information

Subtask #1:

score: 10
Accepted

Test #1:

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

input:



output:


result:

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

Test #2:

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

input:



output:


result:

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

Test #3:

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

input:



output:


result:

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

Test #4:

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

input:



output:


result:

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

Test #5:

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

input:



output:


result:

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

Test #6:

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

input:



output:


result:

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

Test #7:

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

input:



output:


result:

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

Test #8:

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

input:



output:


result:

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

Test #9:

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

input:



output:


result:

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

Test #10:

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

input:



output:


result:

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

Subtask #2:

score: 0
Wrong Answer

Test #11:

score: 0
Wrong Answer
time: 194ms
memory: 26708kb

input:

\x14

output:


result:

wrong answer Not correct

Subtask #3:

score: 10
Accepted

Test #66:

score: 10
Accepted
time: 173ms
memory: 26576kb

input:

\x1e

output:


result:

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

Test #67:

score: 10
Accepted
time: 182ms
memory: 26704kb

input:

\x1e

output:


result:

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

Test #68:

score: 10
Accepted
time: 195ms
memory: 26584kb

input:

\x1e

output:


result:

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

Test #69:

score: 10
Accepted
time: 184ms
memory: 26744kb

input:

\x1e

output:


result:

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

Test #70:

score: 10
Accepted
time: 179ms
memory: 26580kb

input:

\x1e

output:


result:

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

Test #71:

score: 10
Accepted
time: 168ms
memory: 26704kb

input:

\x1e

output:


result:

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

Test #72:

score: 10
Accepted
time: 163ms
memory: 26628kb

input:

\x1e

output:


result:

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

Test #73:

score: 10
Accepted
time: 169ms
memory: 26552kb

input:

\x1e

output:


result:

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

Test #74:

score: 10
Accepted
time: 173ms
memory: 26476kb

input:

\x1e

output:


result:

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

Test #75:

score: 10
Accepted
time: 194ms
memory: 26608kb

input:

\x1e

output:


result:

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

Test #76:

score: 10
Accepted
time: 179ms
memory: 26548kb

input:

\x1e

output:


result:

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

Test #77:

score: 10
Accepted
time: 178ms
memory: 26552kb

input:

\x1e

output:


result:

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

Test #78:

score: 10
Accepted
time: 173ms
memory: 26704kb

input:

\x1e

output:


result:

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

Test #79:

score: 10
Accepted
time: 176ms
memory: 26744kb

input:

\x1e

output:


result:

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

Test #80:

score: 10
Accepted
time: 183ms
memory: 26704kb

input:

\x1e

output:


result:

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

Test #81:

score: 10
Accepted
time: 183ms
memory: 26712kb

input:

\x1e

output:


result:

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

Test #82:

score: 10
Accepted
time: 172ms
memory: 26628kb

input:

\x1e

output:


result:

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

Test #83:

score: 10
Accepted
time: 178ms
memory: 26540kb

input:

\x1e

output:


result:

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

Test #84:

score: 10
Accepted
time: 178ms
memory: 26536kb

input:

\x1e

output:


result:

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

Test #85:

score: 10
Accepted
time: 179ms
memory: 26544kb

input:

\x1e

output:


result:

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

Test #86:

score: 10
Accepted
time: 185ms
memory: 26600kb

input:

\x1e

output:


result:

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

Test #87:

score: 10
Accepted
time: 183ms
memory: 26556kb

input:

\x1e

output:


result:

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

Test #88:

score: 10
Accepted
time: 177ms
memory: 26592kb

input:

\x1e

output:


result:

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

Test #89:

score: 10
Accepted
time: 188ms
memory: 26548kb

input:

\x1e

output:


result:

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

Test #90:

score: 10
Accepted
time: 181ms
memory: 26536kb

input:

\x1e

output:


result:

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

Test #91:

score: 10
Accepted
time: 195ms
memory: 26620kb

input:

\x1e

output:


result:

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

Test #92:

score: 10
Accepted
time: 180ms
memory: 26636kb

input:

\x1e

output:


result:

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

Test #93:

score: 10
Accepted
time: 171ms
memory: 26580kb

input:

\x1e

output:


result:

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

Test #94:

score: 10
Accepted
time: 183ms
memory: 26536kb

input:

\x1e

output:


result:

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

Test #95:

score: 10
Accepted
time: 182ms
memory: 26628kb

input:

\x1e

output:


result:

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

Test #96:

score: 10
Accepted
time: 170ms
memory: 26748kb

input:

\x1e

output:


result:

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

Test #97:

score: 10
Accepted
time: 193ms
memory: 26580kb

input:

\x1e

output:


result:

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

Test #98:

score: 10
Accepted
time: 175ms
memory: 26712kb

input:

\x1e

output:


result:

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

Test #99:

score: 10
Accepted
time: 174ms
memory: 26752kb

input:

\x1e

output:


result:

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

Test #100:

score: 10
Accepted
time: 174ms
memory: 26620kb

input:

\x1e

output:


result:

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

Test #101:

score: 10
Accepted
time: 173ms
memory: 26552kb

input:

\x1e

output:


result:

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

Test #102:

score: 10
Accepted
time: 198ms
memory: 26536kb

input:

\x1e

output:


result:

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

Test #103:

score: 10
Accepted
time: 177ms
memory: 26632kb

input:

\x1e

output:


result:

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

Test #104:

score: 10
Accepted
time: 189ms
memory: 26548kb

input:

\x1e

output:


result:

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

Test #105:

score: 10
Accepted
time: 188ms
memory: 26548kb

input:

\x1e

output:


result:

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

Test #106:

score: 10
Accepted
time: 184ms
memory: 26548kb

input:

\x1e

output:


result:

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

Test #107:

score: 10
Accepted
time: 180ms
memory: 26708kb

input:

\x1e

output:


result:

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

Test #108:

score: 10
Accepted
time: 184ms
memory: 26580kb

input:

\x1e

output:


result:

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

Test #109:

score: 10
Accepted
time: 179ms
memory: 26700kb

input:

\x1e

output:


result:

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

Test #110:

score: 10
Accepted
time: 195ms
memory: 26632kb

input:

\x1e

output:


result:

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

Test #111:

score: 10
Accepted
time: 188ms
memory: 26612kb

input:

\x1e

output:


result:

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

Test #112:

score: 10
Accepted
time: 216ms
memory: 26708kb

input:

\x1e

output:


result:

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

Test #113:

score: 10
Accepted
time: 177ms
memory: 26700kb

input:

\x1e

output:


result:

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

Test #114:

score: 10
Accepted
time: 197ms
memory: 26548kb

input:

\x1e

output:


result:

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

Test #115:

score: 10
Accepted
time: 195ms
memory: 26580kb

input:

\x1e

output:


result:

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

Test #116:

score: 10
Accepted
time: 192ms
memory: 26476kb

input:

\x1e

output:


result:

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

Test #117:

score: 10
Accepted
time: 184ms
memory: 26752kb

input:

\x1e

output:


result:

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

Test #118:

score: 10
Accepted
time: 186ms
memory: 26576kb

input:

\x1e

output:


result:

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

Test #119:

score: 10
Accepted
time: 189ms
memory: 26704kb

input:

\x1e

output:


result:

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

Subtask #4:

score: 65
Acceptable Answer

Test #120:

score: 65
Acceptable Answer
time: 183ms
memory: 26536kb

input:

K

output:


result:

points 0.86666667460 points  0.86666667460 Correct: 28 robot(s) used, 1 hour(s) passed

Test #121:

score: 65
Acceptable Answer
time: 197ms
memory: 26708kb

input:

K

output:


result:

points 0.86666667460 points  0.86666667460 Correct: 28 robot(s) used, 1 hour(s) passed

Test #122:

score: 65
Acceptable Answer
time: 172ms
memory: 26716kb

input:

K

output:


result:

points 0.86666667460 points  0.86666667460 Correct: 28 robot(s) used, 1 hour(s) passed

Test #123:

score: 65
Acceptable Answer
time: 204ms
memory: 26480kb

input:

K

output:


result:

points 0.86666667460 points  0.86666667460 Correct: 28 robot(s) used, 1 hour(s) passed

Test #124:

score: 65
Acceptable Answer
time: 178ms
memory: 26708kb

input:

K

output:


result:

points 0.86666667460 points  0.86666667460 Correct: 28 robot(s) used, 1 hour(s) passed

Test #125:

score: 65
Acceptable Answer
time: 164ms
memory: 26596kb

input:

K

output:


result:

points 0.86666667460 points  0.86666667460 Correct: 28 robot(s) used, 1 hour(s) passed

Test #126:

score: 65
Acceptable Answer
time: 196ms
memory: 26612kb

input:

K

output:


result:

points 0.86666667460 points  0.86666667460 Correct: 28 robot(s) used, 1 hour(s) passed

Test #127:

score: 65
Acceptable Answer
time: 205ms
memory: 26540kb

input:

K

output:


result:

points 0.86666667460 points  0.86666667460 Correct: 28 robot(s) used, 1 hour(s) passed

Test #128:

score: 65
Acceptable Answer
time: 181ms
memory: 26596kb

input:

K

output:


result:

points 0.86666667460 points  0.86666667460 Correct: 28 robot(s) used, 1 hour(s) passed

Test #129:

score: 65
Acceptable Answer
time: 172ms
memory: 26580kb

input:

K

output:


result:

points 0.86666667460 points  0.86666667460 Correct: 28 robot(s) used, 1 hour(s) passed

Test #130:

score: 65
Acceptable Answer
time: 191ms
memory: 26636kb

input:

K

output:


result:

points 0.86666667460 points  0.86666667460 Correct: 28 robot(s) used, 1 hour(s) passed

Test #131:

score: 65
Acceptable Answer
time: 197ms
memory: 26624kb

input:

K

output:


result:

points 0.86666667460 points  0.86666667460 Correct: 28 robot(s) used, 1 hour(s) passed

Test #132:

score: 65
Acceptable Answer
time: 181ms
memory: 26484kb

input:

K

output:


result:

points 0.86666667460 points  0.86666667460 Correct: 28 robot(s) used, 1 hour(s) passed

Test #133:

score: 65
Acceptable Answer
time: 185ms
memory: 26752kb

input:

K

output:


result:

points 0.86666667460 points  0.86666667460 Correct: 28 robot(s) used, 1 hour(s) passed

Test #134:

score: 65
Acceptable Answer
time: 184ms
memory: 26616kb

input:

K

output:


result:

points 0.86666667460 points  0.86666667460 Correct: 28 robot(s) used, 1 hour(s) passed