QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #484830 | #7281. How to Avoid Disqualification in 75 Easy Steps | PCTprobability | 25 | 1ms | 3888kb | C++14 | 6.7kb | 2024-07-20 02:25:23 | 2024-07-20 02:25:23 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#include "avoid.h"
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
using ll = long long;
using ld = long double;
using ull = unsigned long long;
#define endl "\n"
typedef pair<int, int> Pii;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REP3(i, m, n) for (int i = (m); (i) < int(n); ++ (i))
#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define ALL(x) begin(x), end(x)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(s) (s).begin(),(s).end()
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)
#define rever(vec) reverse(vec.begin(), vec.end())
#define sor(vec) sort(vec.begin(), vec.end())
#define fi first
#define FOR_(n) for (ll _ = 0; (_) < (ll)(n); ++(_))
#define FOR(i, n) for (ll i = 0; (i) < (ll)(n); ++(i))
#define se second
#define pb push_back
#define P pair<ll,ll>
#define PQminll priority_queue<ll, vector<ll>, greater<ll>>
#define PQmaxll priority_queue<ll,vector<ll>,less<ll>>
#define PQminP priority_queue<P, vector<P>, greater<P>>
#define PQmaxP priority_queue<P,vector<P>,less<P>>
#define NP next_permutation
#define die(a) {cout<<a<<endl;return 0;}
#define dier(a) {return a;}
//const ll mod = 1000000009;
const ll mod = 998244353;
//const ll mod = 1000000007;
const ll inf = 4100000000000000000ll;
const ld eps = ld(0.00000000001);
static const long double pi = 3.141592653589793;
template<class T>void vcin(vector<T> &n){for(int i=0;i<int(n.size());i++) cin>>n[i];}
template<class T,class K>void vcin(vector<T> &n,vector<K> &m){for(int i=0;i<int(n.size());i++) cin>>n[i]>>m[i];}
template<class T>void vcout(vector<T> &n){for(int i=0;i<int(n.size());i++){cout<<n[i]<<" ";}cout<<endl;}
template<class T>void vcin(vector<vector<T>> &n){for(int i=0;i<int(n.size());i++){for(int j=0;j<int(n[i].size());j++){cin>>n[i][j];}}}
template<class T>void vcout(vector<vector<T>> &n){for(int i=0;i<int(n.size());i++){for(int j=0;j<int(n[i].size());j++){cout<<n[i][j]<<" ";}cout<<endl;}cout<<endl;}
void yes(bool a){cout<<(a?"yes":"no")<<endl;}
void YES(bool a){cout<<(a?"YES":"NO")<<endl;}
void Yes(bool a){cout<<(a?"Yes":"No")<<endl;}
void possible(bool a){ cout<<(a?"possible":"impossible")<<endl; }
void Possible(bool a){ cout<<(a?"Possible":"Impossible")<<endl; }
void POSSIBLE(bool a){ cout<<(a?"POSSIBLE":"IMPOSSIBLE")<<endl; }
#define FOR_R(i, n) for (ll i = (ll)(n)-1; (i) >= 0; --(i))
template<class T>auto min(const T& a){ return *min_element(all(a)); }
template<class T>auto max(const T& a){ return *max_element(all(a)); }
template<class T,class F>void print(pair<T,F> a){cout<<a.fi<<" "<<a.se<<endl;}
template<class T>bool chmax(T &a,const T b) { if (a<b) { a=b; return 1; } return 0;}
template<class T>bool chmin(T &a,const T b) { if (b<a) { a=b; return 1; } return 0;}
template<class T> void ifmin(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}}
template<class T> void ifmax(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}}
ll fastgcd(ll u,ll v){ll shl=0;while(u&&v&&u!=v){bool eu=!(u&1);bool ev=!(v&1);if(eu&&ev){++shl;u>>=1;v>>=1;}else if(eu&&!ev){u>>=1;}else if(!eu&&ev){v>>=1;}else if(u>=v){u=(u-v)>>1;}else{ll tmp=u;u=(v-u)>>1;v=tmp;}}return !u?v<<shl:u<<shl;}
ll modPow(ll a, ll n, ll mod) { if(mod==1) return 0;ll ret = 1; ll p = a % mod; while (n) { if (n & 1) ret = ret * p % mod; p = p * p % mod; n >>= 1; } return ret; }
vector<ll> divisor(ll x){ vector<ll> ans; for(ll i = 1; i * i <= x; i++){ if(x % i == 0) {ans.push_back(i); if(i*i!=x){ ans.push_back(x / ans[i]);}}}sor(ans); return ans; }
ll pop(ll x){return __builtin_popcountll(x);}
ll poplong(ll x){ll y=-1;while(x){x/=2;y++;}return y;}
P hyou(P a){ll x=fastgcd(abs(a.fi),abs(a.se));a.fi/=x;a.se/=x;if(a.se<0){a.fi*=-1;a.se*=-1;}return a;}
P Pplus(P a,P b){ return hyou({a.fi*b.se+b.fi*a.se,a.se*b.se});}
P Ptimes(P a,ll b){ return hyou({a.fi*b,a.se});}
P Ptimes(P a,P b){ return hyou({a.fi*b.fi,a.se*b.se});}
P Pminus(P a,P b){ return hyou({a.fi*b.se-b.fi*a.se,a.se*b.se});}
P Pgyaku(P a){ return hyou({a.se,a.fi});}
void cincout(){
ios::sync_with_stdio(false);
std::cin.tie(nullptr);
cout<< fixed << setprecision(15);
}
void sent(vector<int> p){
for(auto &e:p) e++;
send(p);
}
pair<int,int> scout(int r,int h){
if(r==10&&h==1){
for(int i=0;i<10;i++){
vector<int> p;
for(int j=0;j<1000;j++){
if((j>>i)&1) p.pb(j);
}
sent(p);
}
vector<int> f=wait();
int a=0;
for(int i=0;i<f.size();i++){
if(f[i]) a+=(1<<i);
}
return {a+1,a+1};
}
if(r==20&&h==20){
vector<vector<int>> c={{0,999,2}};
vector<int> q;
while(c.size()){
vector<int> d=c.back();
c.pop_back();
if(d[0]==d[1]){
for(int i=0;i<d[2];i++) q.pb(d[0]);
}
else{
if(d[2]==1){
int m=(d[0]+d[1])/2;
//d[0] から m 以下を全部
vector<int> p;
for(int j=d[0];j<=m;j++) p.pb(j);
sent(p);
vector<int> f=wait();
if(f[0]){
c.pb({d[0],m,1});
}
else{
c.pb({m+1,d[1],1});
}
}
else{
int m=(d[0]+d[1])/2;
vector<int> p,q;
for(int j=d[0];j<=m;j++) p.pb(j);
for(int j=m+1;j<=d[1];j++) q.pb(j);
sent(p);
sent(q);
vector<int> f=wait();
if(f[0]&&f[1]){
c.pb({d[0],m,1});
c.pb({m+1,d[1],1});
}
else if(f[0]){
c.pb({d[0],m,2});
}
else{
c.pb({m+1,d[1],2});
}
}
}
}
return {q[0]+1,q[1]+1};
}
if(r==30&&h==2){
for(int i=0;i<10;i++){
vector<int> p;
for(int j=0;j<1000;j++){
if((j>>i)&1) p.pb(j);
}
sent(p);
}
for(int i=0;i<10;i++){
vector<int> p;
for(int j=0;j<1000;j++){
if(!((j>>i)&1)) p.pb(j);
}
sent(p);
}
vector<int> f=wait();
int a=0,b=0;
vector<int> id;
for(int i=0;i<10;i++){
if(f[i]&&f[i+10]==0){
a^=(1<<i);
b^=(1<<i);
}
else if(f[i]&&f[i+10]){
id.pb(i);
}
}
if(id.size()){
a^=(1<<id[0]);
}
for(int i=1;i<id.size();i++){
vector<int> p;
for(int j=0;j<1000;j++){
if((j>>id[0])&1){
if((j>>id[i])&1){
p.pb(j);
}
}
}
sent(p);
}
f=wait();
for(int i=1;i<id.size();i++){
if(f[i-1]){
a^=(1<<id[i]);
}
else{
b^=(1<<id[i]);
}
}
return {a+1,b+1};
}
assert(false);
}
详细
Subtask #1:
score: 10
Accepted
Test #1:
score: 10
Accepted
time: 1ms
memory: 3876kb
input:
output:
result:
ok Correct: 10 robot(s) used, 1 hour(s) passed
Test #2:
score: 0
Accepted
time: 1ms
memory: 3684kb
input:
output:
result:
ok Correct: 10 robot(s) used, 1 hour(s) passed
Test #3:
score: 0
Accepted
time: 1ms
memory: 3588kb
input:
output:
result:
ok Correct: 10 robot(s) used, 1 hour(s) passed
Test #4:
score: 0
Accepted
time: 1ms
memory: 3612kb
input:
output:
result:
ok Correct: 10 robot(s) used, 1 hour(s) passed
Test #5:
score: 0
Accepted
time: 0ms
memory: 3844kb
input:
output:
result:
ok Correct: 10 robot(s) used, 1 hour(s) passed
Test #6:
score: 0
Accepted
time: 0ms
memory: 3644kb
input:
output:
result:
ok Correct: 10 robot(s) used, 1 hour(s) passed
Test #7:
score: 0
Accepted
time: 1ms
memory: 3820kb
input:
output:
result:
ok Correct: 10 robot(s) used, 1 hour(s) passed
Test #8:
score: 0
Accepted
time: 1ms
memory: 3532kb
input:
output:
result:
ok Correct: 10 robot(s) used, 1 hour(s) passed
Test #9:
score: 0
Accepted
time: 0ms
memory: 3876kb
input:
output:
result:
ok Correct: 10 robot(s) used, 1 hour(s) passed
Test #10:
score: 0
Accepted
time: 0ms
memory: 3648kb
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: 3844kb
input:
\x14
output:
result:
ok Correct: 20 robot(s) used, 19 hour(s) passed
Test #12:
score: 0
Accepted
time: 1ms
memory: 3812kb
input:
\x14
output:
result:
ok Correct: 20 robot(s) used, 19 hour(s) passed
Test #13:
score: 0
Accepted
time: 1ms
memory: 3652kb
input:
\x14
output:
result:
ok Correct: 20 robot(s) used, 19 hour(s) passed
Test #14:
score: 0
Accepted
time: 1ms
memory: 3876kb
input:
\x14
output:
result:
ok Correct: 20 robot(s) used, 19 hour(s) passed
Test #15:
score: 0
Accepted
time: 0ms
memory: 3848kb
input:
\x14
output:
result:
ok Correct: 20 robot(s) used, 19 hour(s) passed
Test #16:
score: 0
Accepted
time: 1ms
memory: 3824kb
input:
\x14
output:
result:
ok Correct: 20 robot(s) used, 19 hour(s) passed
Test #17:
score: 0
Accepted
time: 1ms
memory: 3580kb
input:
\x14
output:
result:
ok Correct: 20 robot(s) used, 19 hour(s) passed
Test #18:
score: 0
Accepted
time: 1ms
memory: 3640kb
input:
\x14
output:
result:
ok Correct: 20 robot(s) used, 19 hour(s) passed
Test #19:
score: 0
Accepted
time: 0ms
memory: 3656kb
input:
\x14
output:
result:
ok Correct: 20 robot(s) used, 19 hour(s) passed
Test #20:
score: 0
Accepted
time: 0ms
memory: 3880kb
input:
\x14
output:
result:
ok Correct: 20 robot(s) used, 19 hour(s) passed
Test #21:
score: 0
Accepted
time: 1ms
memory: 3648kb
input:
\x14
output:
result:
ok Correct: 20 robot(s) used, 19 hour(s) passed
Test #22:
score: 0
Accepted
time: 1ms
memory: 3620kb
input:
\x14
output:
result:
ok Correct: 20 robot(s) used, 19 hour(s) passed
Test #23:
score: 0
Accepted
time: 1ms
memory: 3584kb
input:
\x14
output:
result:
ok Correct: 20 robot(s) used, 19 hour(s) passed
Test #24:
score: 0
Accepted
time: 1ms
memory: 3600kb
input:
\x14
output:
result:
ok Correct: 20 robot(s) used, 19 hour(s) passed
Test #25:
score: 0
Accepted
time: 1ms
memory: 3680kb
input:
\x14
output:
result:
ok Correct: 20 robot(s) used, 19 hour(s) passed
Test #26:
score: 0
Accepted
time: 1ms
memory: 3640kb
input:
\x14
output:
result:
ok Correct: 20 robot(s) used, 19 hour(s) passed
Test #27:
score: 0
Accepted
time: 1ms
memory: 3596kb
input:
\x14
output:
result:
ok Correct: 20 robot(s) used, 19 hour(s) passed
Test #28:
score: 0
Accepted
time: 1ms
memory: 3880kb
input:
\x14
output:
result:
ok Correct: 20 robot(s) used, 19 hour(s) passed
Test #29:
score: 0
Accepted
time: 1ms
memory: 3616kb
input:
\x14
output:
result:
ok Correct: 20 robot(s) used, 19 hour(s) passed
Test #30:
score: 0
Accepted
time: 1ms
memory: 3644kb
input:
\x14
output:
result:
ok Correct: 20 robot(s) used, 19 hour(s) passed
Test #31:
score: 0
Accepted
time: 1ms
memory: 3684kb
input:
\x14
output:
result:
ok Correct: 20 robot(s) used, 19 hour(s) passed
Test #32:
score: 0
Accepted
time: 1ms
memory: 3528kb
input:
\x14
output:
result:
ok Correct: 20 robot(s) used, 19 hour(s) passed
Test #33:
score: 0
Accepted
time: 0ms
memory: 3884kb
input:
\x14
output:
result:
ok Correct: 20 robot(s) used, 19 hour(s) passed
Test #34:
score: 0
Accepted
time: 1ms
memory: 3684kb
input:
\x14
output:
result:
ok Correct: 20 robot(s) used, 19 hour(s) passed
Test #35:
score: 0
Accepted
time: 1ms
memory: 3536kb
input:
\x14
output:
result:
ok Correct: 20 robot(s) used, 19 hour(s) passed
Test #36:
score: 0
Accepted
time: 1ms
memory: 3816kb
input:
\x14
output:
result:
ok Correct: 20 robot(s) used, 19 hour(s) passed
Test #37:
score: 0
Accepted
time: 0ms
memory: 3812kb
input:
\x14
output:
result:
ok Correct: 20 robot(s) used, 19 hour(s) passed
Test #38:
score: 0
Accepted
time: 1ms
memory: 3688kb
input:
\x14
output:
result:
ok Correct: 20 robot(s) used, 19 hour(s) passed
Test #39:
score: 0
Accepted
time: 1ms
memory: 3540kb
input:
\x14
output:
result:
ok Correct: 20 robot(s) used, 19 hour(s) passed
Test #40:
score: 0
Accepted
time: 1ms
memory: 3852kb
input:
\x14
output:
result:
ok Correct: 20 robot(s) used, 19 hour(s) passed
Test #41:
score: 0
Accepted
time: 1ms
memory: 3592kb
input:
\x14
output:
result:
ok Correct: 20 robot(s) used, 19 hour(s) passed
Test #42:
score: 0
Accepted
time: 1ms
memory: 3640kb
input:
\x14
output:
result:
ok Correct: 20 robot(s) used, 19 hour(s) passed
Test #43:
score: 0
Accepted
time: 0ms
memory: 3584kb
input:
\x14
output:
result:
ok Correct: 20 robot(s) used, 19 hour(s) passed
Test #44:
score: 0
Accepted
time: 1ms
memory: 3876kb
input:
\x14
output:
result:
ok Correct: 20 robot(s) used, 19 hour(s) passed
Test #45:
score: 0
Accepted
time: 1ms
memory: 3648kb
input:
\x14
output:
result:
ok Correct: 20 robot(s) used, 19 hour(s) passed
Test #46:
score: 0
Accepted
time: 1ms
memory: 3880kb
input:
\x14
output:
result:
ok Correct: 20 robot(s) used, 19 hour(s) passed
Test #47:
score: 0
Accepted
time: 0ms
memory: 3680kb
input:
\x14
output:
result:
ok Correct: 20 robot(s) used, 19 hour(s) passed
Test #48:
score: 0
Accepted
time: 1ms
memory: 3884kb
input:
\x14
output:
result:
ok Correct: 20 robot(s) used, 19 hour(s) passed
Test #49:
score: 0
Accepted
time: 1ms
memory: 3880kb
input:
\x14
output:
result:
ok Correct: 20 robot(s) used, 19 hour(s) passed
Test #50:
score: 0
Accepted
time: 1ms
memory: 3536kb
input:
\x14
output:
result:
ok Correct: 20 robot(s) used, 10 hour(s) passed
Test #51:
score: 0
Accepted
time: 1ms
memory: 3808kb
input:
\x14
output:
result:
ok Correct: 19 robot(s) used, 18 hour(s) passed
Test #52:
score: 0
Accepted
time: 1ms
memory: 3632kb
input:
\x14
output:
result:
ok Correct: 19 robot(s) used, 18 hour(s) passed
Test #53:
score: 0
Accepted
time: 0ms
memory: 3852kb
input:
\x14
output:
result:
ok Correct: 20 robot(s) used, 19 hour(s) passed
Test #54:
score: 0
Accepted
time: 1ms
memory: 3596kb
input:
\x14
output:
result:
ok Correct: 20 robot(s) used, 11 hour(s) passed
Test #55:
score: 0
Accepted
time: 1ms
memory: 3656kb
input:
\x14
output:
result:
ok Correct: 20 robot(s) used, 19 hour(s) passed
Test #56:
score: 0
Accepted
time: 1ms
memory: 3824kb
input:
\x14
output:
result:
ok Correct: 20 robot(s) used, 10 hour(s) passed
Test #57:
score: 0
Accepted
time: 1ms
memory: 3844kb
input:
\x14
output:
result:
ok Correct: 18 robot(s) used, 9 hour(s) passed
Test #58:
score: 0
Accepted
time: 1ms
memory: 3648kb
input:
\x14
output:
result:
ok Correct: 20 robot(s) used, 10 hour(s) passed
Test #59:
score: 0
Accepted
time: 0ms
memory: 3684kb
input:
\x14
output:
result:
ok Correct: 20 robot(s) used, 19 hour(s) passed
Test #60:
score: 0
Accepted
time: 1ms
memory: 3584kb
input:
\x14
output:
result:
ok Correct: 20 robot(s) used, 19 hour(s) passed
Test #61:
score: 0
Accepted
time: 1ms
memory: 3584kb
input:
\x14
output:
result:
ok Correct: 20 robot(s) used, 10 hour(s) passed
Test #62:
score: 0
Accepted
time: 1ms
memory: 3540kb
input:
\x14
output:
result:
ok Correct: 20 robot(s) used, 19 hour(s) passed
Test #63:
score: 0
Accepted
time: 1ms
memory: 3888kb
input:
\x14
output:
result:
ok Correct: 20 robot(s) used, 19 hour(s) passed
Test #64:
score: 0
Accepted
time: 0ms
memory: 3520kb
input:
\x14
output:
result:
ok Correct: 20 robot(s) used, 19 hour(s) passed
Test #65:
score: 0
Accepted
time: 0ms
memory: 3644kb
input:
\x14
output:
result:
ok Correct: 20 robot(s) used, 19 hour(s) passed
Subtask #3:
score: 10
Accepted
Test #66:
score: 10
Accepted
time: 1ms
memory: 3880kb
input:
\x1e
output:
result:
ok Correct: 29 robot(s) used, 2 hour(s) passed
Test #67:
score: 0
Accepted
time: 1ms
memory: 3648kb
input:
\x1e
output:
result:
ok Correct: 29 robot(s) used, 2 hour(s) passed
Test #68:
score: 0
Accepted
time: 0ms
memory: 3648kb
input:
\x1e
output:
result:
ok Correct: 29 robot(s) used, 2 hour(s) passed
Test #69:
score: 0
Accepted
time: 1ms
memory: 3648kb
input:
\x1e
output:
result:
ok Correct: 26 robot(s) used, 2 hour(s) passed
Test #70:
score: 0
Accepted
time: 0ms
memory: 3812kb
input:
\x1e
output:
result:
ok Correct: 26 robot(s) used, 2 hour(s) passed
Test #71:
score: 0
Accepted
time: 0ms
memory: 3620kb
input:
\x1e
output:
result:
ok Correct: 26 robot(s) used, 2 hour(s) passed
Test #72:
score: 0
Accepted
time: 1ms
memory: 3884kb
input:
\x1e
output:
result:
ok Correct: 20 robot(s) used, 2 hour(s) passed
Test #73:
score: 0
Accepted
time: 1ms
memory: 3648kb
input:
\x1e
output:
result:
ok Correct: 21 robot(s) used, 2 hour(s) passed
Test #74:
score: 0
Accepted
time: 1ms
memory: 3520kb
input:
\x1e
output:
result:
ok Correct: 20 robot(s) used, 2 hour(s) passed
Test #75:
score: 0
Accepted
time: 1ms
memory: 3652kb
input:
\x1e
output:
result:
ok Correct: 22 robot(s) used, 2 hour(s) passed
Test #76:
score: 0
Accepted
time: 1ms
memory: 3588kb
input:
\x1e
output:
result:
ok Correct: 22 robot(s) used, 2 hour(s) passed
Test #77:
score: 0
Accepted
time: 1ms
memory: 3884kb
input:
\x1e
output:
result:
ok Correct: 29 robot(s) used, 2 hour(s) passed
Test #78:
score: 0
Accepted
time: 1ms
memory: 3588kb
input:
\x1e
output:
result:
ok Correct: 20 robot(s) used, 2 hour(s) passed
Test #79:
score: 0
Accepted
time: 1ms
memory: 3652kb
input:
\x1e
output:
result:
ok Correct: 26 robot(s) used, 2 hour(s) passed
Test #80:
score: 0
Accepted
time: 1ms
memory: 3588kb
input:
\x1e
output:
result:
ok Correct: 22 robot(s) used, 2 hour(s) passed
Test #81:
score: 0
Accepted
time: 1ms
memory: 3652kb
input:
\x1e
output:
result:
ok Correct: 21 robot(s) used, 2 hour(s) passed
Test #82:
score: 0
Accepted
time: 1ms
memory: 3812kb
input:
\x1e
output:
result:
ok Correct: 22 robot(s) used, 2 hour(s) passed
Test #83:
score: 0
Accepted
time: 1ms
memory: 3652kb
input:
\x1e
output:
result:
ok Correct: 26 robot(s) used, 2 hour(s) passed
Test #84:
score: 0
Accepted
time: 1ms
memory: 3652kb
input:
\x1e
output:
result:
ok Correct: 23 robot(s) used, 2 hour(s) passed
Test #85:
score: 0
Accepted
time: 1ms
memory: 3588kb
input:
\x1e
output:
result:
ok Correct: 23 robot(s) used, 2 hour(s) passed
Test #86:
score: 0
Accepted
time: 1ms
memory: 3844kb
input:
\x1e
output:
result:
ok Correct: 21 robot(s) used, 2 hour(s) passed
Test #87:
score: 0
Accepted
time: 1ms
memory: 3624kb
input:
\x1e
output:
result:
ok Correct: 22 robot(s) used, 2 hour(s) passed
Test #88:
score: 0
Accepted
time: 0ms
memory: 3584kb
input:
\x1e
output:
result:
ok Correct: 29 robot(s) used, 2 hour(s) passed
Test #89:
score: 0
Accepted
time: 1ms
memory: 3844kb
input:
\x1e
output:
result:
ok Correct: 24 robot(s) used, 2 hour(s) passed
Test #90:
score: 0
Accepted
time: 1ms
memory: 3648kb
input:
\x1e
output:
result:
ok Correct: 24 robot(s) used, 2 hour(s) passed
Test #91:
score: 0
Accepted
time: 1ms
memory: 3884kb
input:
\x1e
output:
result:
ok Correct: 24 robot(s) used, 2 hour(s) passed
Test #92:
score: 0
Accepted
time: 1ms
memory: 3684kb
input:
\x1e
output:
result:
ok Correct: 20 robot(s) used, 2 hour(s) passed
Test #93:
score: 0
Accepted
time: 0ms
memory: 3884kb
input:
\x1e
output:
result:
ok Correct: 21 robot(s) used, 2 hour(s) passed
Test #94:
score: 0
Accepted
time: 1ms
memory: 3648kb
input:
\x1e
output:
result:
ok Correct: 22 robot(s) used, 2 hour(s) passed
Test #95:
score: 0
Accepted
time: 1ms
memory: 3584kb
input:
\x1e
output:
result:
ok Correct: 24 robot(s) used, 2 hour(s) passed
Test #96:
score: 0
Accepted
time: 1ms
memory: 3652kb
input:
\x1e
output:
result:
ok Correct: 22 robot(s) used, 2 hour(s) passed
Test #97:
score: 0
Accepted
time: 0ms
memory: 3620kb
input:
\x1e
output:
result:
ok Correct: 22 robot(s) used, 2 hour(s) passed
Test #98:
score: 0
Accepted
time: 1ms
memory: 3648kb
input:
\x1e
output:
result:
ok Correct: 22 robot(s) used, 2 hour(s) passed
Test #99:
score: 0
Accepted
time: 0ms
memory: 3640kb
input:
\x1e
output:
result:
ok Correct: 29 robot(s) used, 2 hour(s) passed
Test #100:
score: 0
Accepted
time: 0ms
memory: 3880kb
input:
\x1e
output:
result:
ok Correct: 22 robot(s) used, 2 hour(s) passed
Test #101:
score: 0
Accepted
time: 1ms
memory: 3884kb
input:
\x1e
output:
result:
ok Correct: 21 robot(s) used, 2 hour(s) passed
Test #102:
score: 0
Accepted
time: 1ms
memory: 3600kb
input:
\x1e
output:
result:
ok Correct: 23 robot(s) used, 2 hour(s) passed
Test #103:
score: 0
Accepted
time: 1ms
memory: 3844kb
input:
\x1e
output:
result:
ok Correct: 24 robot(s) used, 2 hour(s) passed
Test #104:
score: 0
Accepted
time: 1ms
memory: 3540kb
input:
\x1e
output:
result:
ok Correct: 23 robot(s) used, 2 hour(s) passed
Test #105:
score: 0
Accepted
time: 1ms
memory: 3620kb
input:
\x1e
output:
result:
ok Correct: 25 robot(s) used, 2 hour(s) passed
Test #106:
score: 0
Accepted
time: 0ms
memory: 3812kb
input:
\x1e
output:
result:
ok Correct: 21 robot(s) used, 2 hour(s) passed
Test #107:
score: 0
Accepted
time: 0ms
memory: 3576kb
input:
\x1e
output:
result:
ok Correct: 20 robot(s) used, 2 hour(s) passed
Test #108:
score: 0
Accepted
time: 1ms
memory: 3584kb
input:
\x1e
output:
result:
ok Correct: 24 robot(s) used, 2 hour(s) passed
Test #109:
score: 0
Accepted
time: 1ms
memory: 3644kb
input:
\x1e
output:
result:
ok Correct: 21 robot(s) used, 2 hour(s) passed
Test #110:
score: 0
Accepted
time: 1ms
memory: 3620kb
input:
\x1e
output:
result:
ok Correct: 29 robot(s) used, 2 hour(s) passed
Test #111:
score: 0
Accepted
time: 1ms
memory: 3856kb
input:
\x1e
output:
result:
ok Correct: 23 robot(s) used, 2 hour(s) passed
Test #112:
score: 0
Accepted
time: 1ms
memory: 3684kb
input:
\x1e
output:
result:
ok Correct: 20 robot(s) used, 2 hour(s) passed
Test #113:
score: 0
Accepted
time: 0ms
memory: 3848kb
input:
\x1e
output:
result:
ok Correct: 24 robot(s) used, 2 hour(s) passed
Test #114:
score: 0
Accepted
time: 1ms
memory: 3596kb
input:
\x1e
output:
result:
ok Correct: 23 robot(s) used, 2 hour(s) passed
Test #115:
score: 0
Accepted
time: 1ms
memory: 3640kb
input:
\x1e
output:
result:
ok Correct: 21 robot(s) used, 2 hour(s) passed
Test #116:
score: 0
Accepted
time: 1ms
memory: 3584kb
input:
\x1e
output:
result:
ok Correct: 29 robot(s) used, 2 hour(s) passed
Test #117:
score: 0
Accepted
time: 0ms
memory: 3852kb
input:
\x1e
output:
result:
ok Correct: 29 robot(s) used, 2 hour(s) passed
Test #118:
score: 0
Accepted
time: 1ms
memory: 3848kb
input:
\x1e
output:
result:
ok Correct: 29 robot(s) used, 2 hour(s) passed
Test #119:
score: 0
Accepted
time: 1ms
memory: 3580kb
input:
\x1e
output:
result:
ok Correct: 29 robot(s) used, 2 hour(s) passed
Subtask #4:
score: 0
Runtime Error
Test #120:
score: 0
Runtime Error
input:
K