oj.uz

Submission #570560

# Submission time Handle Problem Language Result Execution time Memory
570560 2022-05-30T13:09:28 Z balbit IOI Fever (JOI21_fever) C++14
37 / 100
 5000 ms 5724 KB 
#include <bits/stdc++.h>
#define int ll
using namespace std;
#define ll long long
#define y1 zck_is_king
#define pii pair<ll, ll>
#define ull unsigned ll
#define f first
#define s second
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)x.size()
#define SQ(x) (x)*(x)
#define MN(a,b) a = min(a,(__typeof__(a))(b))
#define MX(a,b) a = max(a,(__typeof__(a))(b))
#define pb push_back
#define REP(i,n) for (int i = 0; i<n; ++i)
#define RREP(i,n) for (int i = n-1; i>=0; --i)
#define REP1(i,n) for (int i = 1; i<=n; ++i)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#ifdef BALBIT
#define IOS()
#define bug(...) fprintf(stderr,"#%d (%s) = ",__LINE__,#__VA_ARGS__),_do(__VA_ARGS__);
template<typename T> void _do(T &&x){cerr<<x<<endl;}
template<typename T, typename ...S> void _do(T &&x, S &&...y){cerr<<x<<", ";_do(y...);}
#else
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0);
#define endl '\n'
#define bug(...)
#endif

const int iinf = 1e9+10;
const ll inf = 0x3f3f3f3f3f3f3f3f;
const ll mod = 1e9+7 ;


void GG(){cout<<"0\n"; exit(0);}

ll mpow(ll a, ll n, ll mo = mod){ // a^n % mod
    ll re=1;
    while (n>0){
        if (n&1) re = re*a %mo;
        a = a*a %mo;
        n>>=1;
    }
    return re;
}

ll inv (ll b, ll mo = mod){
    if (b==1) return b;
    return (mo-mo/b) * inv(mo%b,mo) % mo;
}

const int maxn = 1e5+5;

int n;
struct pt{
    int x,y;
    void in(){
        cin>>x>>y;
        x*=2; y*=2;
    }
    int dist(pt &o) {
        return abs(o.x-x) + abs(o.y-y);
    }
};

pt P[maxn];
ll dst[maxn];
int dir[maxn];
bool done[maxn];

pii D4[4] = {{1,0}, {0,1}, {-1,0}, {0,-1}};
pii Dia4[4] = {{1,1},{-1,1},{-1,-1},{1,-1}};

inline int diagof(pii & p) {
    return find(Dia4, Dia4+4, p) - Dia4;
}

inline int F4(int x) {
    return x<0?x+4:(x>=4?x-4:x);
}

int run(int idir){
    bug(idir);
    dir[0] = idir;
    memset(done, 0, sizeof done);
    REP1(i,n-1) {
        int x = P[i].x, y = P[i].y;
        if (x == y || x == -y) {
            assert(x && y);
            pii tmp = {x/abs(x), y/abs(x)};
            int at = diagof(tmp);
            if (at == idir) {
                dir[i] = F4(idir-1);
            }else if (at == F4(idir-1)) {
                dir[i] = F4(idir+1);
            }else{
                dir[i] = idir;
            }
        }else{
            dir[i] = (y<x?vector<int>{1,2}:vector<int>{0,3})[y>-x];
        }
        bug(i, dir[i]);
    }

    priority_queue<pii, vector<pii>, greater<pii> > pq;
    pq.push({0,0});

    memset(dst, 0x3f, sizeof dst);
    dst[0] = 0;

    auto UPD = [&](int u, int d) {
        if (dst[u] > d) {
            dst[u] = d; pq.push({dst[u], u});
        }
    };

    while (!pq.empty())  {
        int v = pq.top().s; ll w = pq.top().f; pq.pop();
        if (done[v] || dst[v] != w) continue;
        done[v] = 1;
        REP(u,n) {
            if(!done[u]) {
                int todst = P[v].dist(P[u])/2;
                if (todst < dst[v]) {
                    continue; // touch too early to count
                }
                int mydir = dir[v];
                int x = P[u].x - P[v].x, y = P[u].y - P[v].y;
                if (x == y || x == -y) {
                    assert(x && y);
                    pii tmp = {x/abs(x), y/abs(x)};
                    int at = diagof(tmp);
                    if (at == mydir) {
                        if (dir[u] == F4(mydir-1)) {
                            UPD(u,todst);
                        }
                    }else if (at == F4(mydir-1)) {
                        if (dir[u] == F4(mydir+1)) {
                            UPD(u,todst);
                        }
                    }
                }
                if (x == 0 || y == 0) {
                    if (dir[u] == F4(mydir+2)) {
                        UPD(u, todst);
                    }
                }
            }
        }
    }
    int re = 0;
    REP(i,n) {
        if (dst[i] != inf) {
            bug(i, dst[i]);
            ++re;
        }
    }
    return re;
}

signed main(){
    IOS();
    cin>>n;

    REP(i,n) {
        P[i].in();
        if (i) {
            P[i].x -= P[0].x; P[i].y -= P[0].y;
        }
    }
    P[0] = {0,0};
    int re = 0;
    REP(idir, 4) {
        MX(re, run(idir));
    }
    cout<<re<<endl;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1092 KB Output is correct
2 Correct 2 ms 1108 KB Output is correct
3 Correct 1 ms 1108 KB Output is correct
4 Correct 1 ms 1108 KB Output is correct
5 Correct 1 ms 1108 KB Output is correct
6 Correct 1 ms 1092 KB Output is correct
7 Correct 1 ms 1096 KB Output is correct
8 Correct 1 ms 1108 KB Output is correct
9 Correct 1 ms 1108 KB Output is correct
10 Correct 1 ms 1108 KB Output is correct
11 Correct 1 ms 1108 KB Output is correct
12 Correct 1 ms 1108 KB Output is correct
13 Correct 1 ms 1108 KB Output is correct
14 Correct 1 ms 1108 KB Output is correct
15 Correct 1 ms 1108 KB Output is correct
16 Correct 2 ms 1108 KB Output is correct
17 Correct 1 ms 1108 KB Output is correct
18 Correct 2 ms 1108 KB Output is correct
19 Correct 2 ms 1092 KB Output is correct
20 Correct 1 ms 1096 KB Output is correct
21 Correct 1 ms 1108 KB Output is correct
22 Correct 1 ms 1108 KB Output is correct
23 Correct 1 ms 1096 KB Output is correct
24 Correct 1 ms 1108 KB Output is correct
25 Correct 1 ms 1092 KB Output is correct
26 Correct 1 ms 1108 KB Output is correct
27 Correct 1 ms 1108 KB Output is correct
28 Correct 1 ms 1108 KB Output is correct
29 Correct 1 ms 1108 KB Output is correct
30 Correct 1 ms 1108 KB Output is correct
31 Correct 1 ms 1092 KB Output is correct
32 Correct 1 ms 1108 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1092 KB Output is correct
2 Correct 2 ms 1108 KB Output is correct
3 Correct 1 ms 1108 KB Output is correct
4 Correct 1 ms 1108 KB Output is correct
5 Correct 1 ms 1108 KB Output is correct
6 Correct 1 ms 1092 KB Output is correct
7 Correct 1 ms 1096 KB Output is correct
8 Correct 1 ms 1108 KB Output is correct
9 Correct 1 ms 1108 KB Output is correct
10 Correct 1 ms 1108 KB Output is correct
11 Correct 1 ms 1108 KB Output is correct
12 Correct 1 ms 1108 KB Output is correct
13 Correct 1 ms 1108 KB Output is correct
14 Correct 1 ms 1108 KB Output is correct
15 Correct 1 ms 1108 KB Output is correct
16 Correct 2 ms 1108 KB Output is correct
17 Correct 1 ms 1108 KB Output is correct
18 Correct 2 ms 1108 KB Output is correct
19 Correct 2 ms 1092 KB Output is correct
20 Correct 1 ms 1096 KB Output is correct
21 Correct 1 ms 1108 KB Output is correct
22 Correct 1 ms 1108 KB Output is correct
23 Correct 1 ms 1096 KB Output is correct
24 Correct 1 ms 1108 KB Output is correct
25 Correct 1 ms 1092 KB Output is correct
26 Correct 1 ms 1108 KB Output is correct
27 Correct 1 ms 1108 KB Output is correct
28 Correct 1 ms 1108 KB Output is correct
29 Correct 1 ms 1108 KB Output is correct
30 Correct 1 ms 1108 KB Output is correct
31 Correct 1 ms 1092 KB Output is correct
32 Correct 1 ms 1108 KB Output is correct
33 Correct 1 ms 1108 KB Output is correct
34 Correct 1 ms 1108 KB Output is correct
35 Correct 1 ms 1108 KB Output is correct
36 Correct 1 ms 1092 KB Output is correct
37 Correct 1 ms 1092 KB Output is correct
38 Correct 1 ms 1108 KB Output is correct
39 Correct 1 ms 1108 KB Output is correct
40 Correct 1 ms 1096 KB Output is correct
41 Correct 1 ms 1092 KB Output is correct
42 Correct 1 ms 1108 KB Output is correct
43 Correct 1 ms 1096 KB Output is correct
44 Correct 1 ms 1108 KB Output is correct
45 Correct 2 ms 1100 KB Output is correct

Subtask #3
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1108 KB Output is correct
2 Correct 1 ms 1108 KB Output is correct
3 Correct 1 ms 1108 KB Output is correct
4 Correct 1 ms 1096 KB Output is correct
5 Correct 1 ms 1108 KB Output is correct
6 Correct 1 ms 1108 KB Output is correct
7 Correct 1 ms 1108 KB Output is correct
8 Correct 1 ms 1108 KB Output is correct

Subtask #4
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1092 KB Output is correct
2 Correct 2 ms 1108 KB Output is correct
3 Correct 1 ms 1108 KB Output is correct
4 Correct 1 ms 1108 KB Output is correct
5 Correct 1 ms 1108 KB Output is correct
6 Correct 1 ms 1092 KB Output is correct
7 Correct 1 ms 1096 KB Output is correct
8 Correct 1 ms 1108 KB Output is correct
9 Correct 1 ms 1108 KB Output is correct
10 Correct 1 ms 1108 KB Output is correct
11 Correct 1 ms 1108 KB Output is correct
12 Correct 1 ms 1108 KB Output is correct
13 Correct 1 ms 1108 KB Output is correct
14 Correct 1 ms 1108 KB Output is correct
15 Correct 1 ms 1108 KB Output is correct
16 Correct 2 ms 1108 KB Output is correct
17 Correct 1 ms 1108 KB Output is correct
18 Correct 2 ms 1108 KB Output is correct
19 Correct 2 ms 1092 KB Output is correct
20 Correct 1 ms 1096 KB Output is correct
21 Correct 1 ms 1108 KB Output is correct
22 Correct 1 ms 1108 KB Output is correct
23 Correct 1 ms 1096 KB Output is correct
24 Correct 1 ms 1108 KB Output is correct
25 Correct 1 ms 1092 KB Output is correct
26 Correct 1 ms 1108 KB Output is correct
27 Correct 1 ms 1108 KB Output is correct
28 Correct 1 ms 1108 KB Output is correct
29 Correct 1 ms 1108 KB Output is correct
30 Correct 1 ms 1108 KB Output is correct
31 Correct 1 ms 1092 KB Output is correct
32 Correct 1 ms 1108 KB Output is correct
33 Correct 1 ms 1108 KB Output is correct
34 Correct 1 ms 1108 KB Output is correct
35 Correct 1 ms 1108 KB Output is correct
36 Correct 1 ms 1092 KB Output is correct
37 Correct 1 ms 1092 KB Output is correct
38 Correct 1 ms 1108 KB Output is correct
39 Correct 1 ms 1108 KB Output is correct
40 Correct 1 ms 1096 KB Output is correct
41 Correct 1 ms 1092 KB Output is correct
42 Correct 1 ms 1108 KB Output is correct
43 Correct 1 ms 1096 KB Output is correct
44 Correct 1 ms 1108 KB Output is correct
45 Correct 2 ms 1100 KB Output is correct
46 Correct 1 ms 1108 KB Output is correct
47 Correct 1 ms 1108 KB Output is correct
48 Correct 1 ms 1108 KB Output is correct
49 Correct 1 ms 1096 KB Output is correct
50 Correct 1 ms 1108 KB Output is correct
51 Correct 1 ms 1108 KB Output is correct
52 Correct 1 ms 1108 KB Output is correct
53 Correct 1 ms 1108 KB Output is correct
54 Correct 1 ms 1108 KB Output is correct
55 Correct 1 ms 1108 KB Output is correct
56 Correct 1 ms 1092 KB Output is correct
57 Correct 1 ms 1108 KB Output is correct
58 Correct 1 ms 1096 KB Output is correct
59 Correct 1 ms 1108 KB Output is correct
60 Correct 2 ms 1108 KB Output is correct
61 Correct 1 ms 1092 KB Output is correct
62 Correct 1 ms 1108 KB Output is correct
63 Correct 1 ms 1096 KB Output is correct
64 Correct 2 ms 1096 KB Output is correct
65 Correct 1 ms 1108 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1092 KB Output is correct
2 Correct 2 ms 1108 KB Output is correct
3 Correct 1 ms 1108 KB Output is correct
4 Correct 1 ms 1108 KB Output is correct
5 Correct 1 ms 1108 KB Output is correct
6 Correct 1 ms 1092 KB Output is correct
7 Correct 1 ms 1096 KB Output is correct
8 Correct 1 ms 1108 KB Output is correct
9 Correct 1 ms 1108 KB Output is correct
10 Correct 1 ms 1108 KB Output is correct
11 Correct 1 ms 1108 KB Output is correct
12 Correct 1 ms 1108 KB Output is correct
13 Correct 1 ms 1108 KB Output is correct
14 Correct 1 ms 1108 KB Output is correct
15 Correct 1 ms 1108 KB Output is correct
16 Correct 2 ms 1108 KB Output is correct
17 Correct 1 ms 1108 KB Output is correct
18 Correct 2 ms 1108 KB Output is correct
19 Correct 2 ms 1092 KB Output is correct
20 Correct 1 ms 1096 KB Output is correct
21 Correct 1 ms 1108 KB Output is correct
22 Correct 1 ms 1108 KB Output is correct
23 Correct 1 ms 1096 KB Output is correct
24 Correct 1 ms 1108 KB Output is correct
25 Correct 1 ms 1092 KB Output is correct
26 Correct 1 ms 1108 KB Output is correct
27 Correct 1 ms 1108 KB Output is correct
28 Correct 1 ms 1108 KB Output is correct
29 Correct 1 ms 1108 KB Output is correct
30 Correct 1 ms 1108 KB Output is correct
31 Correct 1 ms 1092 KB Output is correct
32 Correct 1 ms 1108 KB Output is correct
33 Correct 1 ms 1108 KB Output is correct
34 Correct 1 ms 1108 KB Output is correct
35 Correct 1 ms 1108 KB Output is correct
36 Correct 1 ms 1092 KB Output is correct
37 Correct 1 ms 1092 KB Output is correct
38 Correct 1 ms 1108 KB Output is correct
39 Correct 1 ms 1108 KB Output is correct
40 Correct 1 ms 1096 KB Output is correct
41 Correct 1 ms 1092 KB Output is correct
42 Correct 1 ms 1108 KB Output is correct
43 Correct 1 ms 1096 KB Output is correct
44 Correct 1 ms 1108 KB Output is correct
45 Correct 2 ms 1100 KB Output is correct
46 Correct 1 ms 1108 KB Output is correct
47 Correct 1 ms 1108 KB Output is correct
48 Correct 1 ms 1108 KB Output is correct
49 Correct 1 ms 1096 KB Output is correct
50 Correct 1 ms 1108 KB Output is correct
51 Correct 1 ms 1108 KB Output is correct
52 Correct 1 ms 1108 KB Output is correct
53 Correct 1 ms 1108 KB Output is correct
54 Correct 1 ms 1108 KB Output is correct
55 Correct 1 ms 1108 KB Output is correct
56 Correct 1 ms 1092 KB Output is correct
57 Correct 1 ms 1108 KB Output is correct
58 Correct 1 ms 1096 KB Output is correct
59 Correct 1 ms 1108 KB Output is correct
60 Correct 2 ms 1108 KB Output is correct
61 Correct 1 ms 1092 KB Output is correct
62 Correct 1 ms 1108 KB Output is correct
63 Correct 1 ms 1096 KB Output is correct
64 Correct 2 ms 1096 KB Output is correct
65 Correct 1 ms 1108 KB Output is correct
66 Correct 3 ms 1236 KB Output is correct
67 Correct 2 ms 1236 KB Output is correct
68 Correct 2 ms 1236 KB Output is correct
69 Correct 188 ms 1412 KB Output is correct
70 Correct 67 ms 1312 KB Output is correct
71 Correct 26 ms 1236 KB Output is correct
72 Correct 2 ms 1236 KB Output is correct
73 Correct 2 ms 1236 KB Output is correct
74 Correct 81 ms 1532 KB Output is correct
75 Correct 166 ms 1440 KB Output is correct
76 Correct 26 ms 1316 KB Output is correct
77 Correct 17 ms 1240 KB Output is correct
78 Correct 19 ms 1236 KB Output is correct
79 Correct 23 ms 1236 KB Output is correct
80 Correct 6 ms 1232 KB Output is correct
81 Correct 25 ms 1236 KB Output is correct
82 Correct 57 ms 1432 KB Output is correct
83 Correct 59 ms 1436 KB Output is correct
84 Correct 13 ms 1272 KB Output is correct
85 Correct 6 ms 1236 KB Output is correct
86 Correct 17 ms 1348 KB Output is correct
87 Correct 8 ms 1360 KB Output is correct
88 Correct 63 ms 1360 KB Output is correct
89 Correct 43 ms 1236 KB Output is correct
90 Correct 44 ms 1236 KB Output is correct

Subtask #6
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1092 KB Output is correct
2 Correct 2 ms 1108 KB Output is correct
3 Correct 1 ms 1108 KB Output is correct
4 Correct 1 ms 1108 KB Output is correct
5 Correct 1 ms 1108 KB Output is correct
6 Correct 1 ms 1092 KB Output is correct
7 Correct 1 ms 1096 KB Output is correct
8 Correct 1 ms 1108 KB Output is correct
9 Correct 1 ms 1108 KB Output is correct
10 Correct 1 ms 1108 KB Output is correct
11 Correct 1 ms 1108 KB Output is correct
12 Correct 1 ms 1108 KB Output is correct
13 Correct 1 ms 1108 KB Output is correct
14 Correct 1 ms 1108 KB Output is correct
15 Correct 1 ms 1108 KB Output is correct
16 Correct 2 ms 1108 KB Output is correct
17 Correct 1 ms 1108 KB Output is correct
18 Correct 2 ms 1108 KB Output is correct
19 Correct 2 ms 1092 KB Output is correct
20 Correct 1 ms 1096 KB Output is correct
21 Correct 1 ms 1108 KB Output is correct
22 Correct 1 ms 1108 KB Output is correct
23 Correct 1 ms 1096 KB Output is correct
24 Correct 1 ms 1108 KB Output is correct
25 Correct 1 ms 1092 KB Output is correct
26 Correct 1 ms 1108 KB Output is correct
27 Correct 1 ms 1108 KB Output is correct
28 Correct 1 ms 1108 KB Output is correct
29 Correct 1 ms 1108 KB Output is correct
30 Correct 1 ms 1108 KB Output is correct
31 Correct 1 ms 1092 KB Output is correct
32 Correct 1 ms 1108 KB Output is correct
33 Correct 1 ms 1108 KB Output is correct
34 Correct 1 ms 1108 KB Output is correct
35 Correct 1 ms 1108 KB Output is correct
36 Correct 1 ms 1092 KB Output is correct
37 Correct 1 ms 1092 KB Output is correct
38 Correct 1 ms 1108 KB Output is correct
39 Correct 1 ms 1108 KB Output is correct
40 Correct 1 ms 1096 KB Output is correct
41 Correct 1 ms 1092 KB Output is correct
42 Correct 1 ms 1108 KB Output is correct
43 Correct 1 ms 1096 KB Output is correct
44 Correct 1 ms 1108 KB Output is correct
45 Correct 2 ms 1100 KB Output is correct
46 Correct 1 ms 1108 KB Output is correct
47 Correct 1 ms 1108 KB Output is correct
48 Correct 1 ms 1108 KB Output is correct
49 Correct 1 ms 1096 KB Output is correct
50 Correct 1 ms 1108 KB Output is correct
51 Correct 1 ms 1108 KB Output is correct
52 Correct 1 ms 1108 KB Output is correct
53 Correct 1 ms 1108 KB Output is correct
54 Correct 1 ms 1108 KB Output is correct
55 Correct 1 ms 1108 KB Output is correct
56 Correct 1 ms 1092 KB Output is correct
57 Correct 1 ms 1108 KB Output is correct
58 Correct 1 ms 1096 KB Output is correct
59 Correct 1 ms 1108 KB Output is correct
60 Correct 2 ms 1108 KB Output is correct
61 Correct 1 ms 1092 KB Output is correct
62 Correct 1 ms 1108 KB Output is correct
63 Correct 1 ms 1096 KB Output is correct
64 Correct 2 ms 1096 KB Output is correct
65 Correct 1 ms 1108 KB Output is correct
66 Correct 24 ms 3156 KB Output is correct
67 Correct 31 ms 3608 KB Output is correct
68 Correct 38 ms 3624 KB Output is correct
69 Execution timed out 5057 ms 5724 KB Time limit exceeded
70 Halted 0 ms 0 KB -

Subtask #7
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1092 KB Output is correct
2 Correct 2 ms 1108 KB Output is correct
3 Correct 1 ms 1108 KB Output is correct
4 Correct 1 ms 1108 KB Output is correct
5 Correct 1 ms 1108 KB Output is correct
6 Correct 1 ms 1092 KB Output is correct
7 Correct 1 ms 1096 KB Output is correct
8 Correct 1 ms 1108 KB Output is correct
9 Correct 1 ms 1108 KB Output is correct
10 Correct 1 ms 1108 KB Output is correct
11 Correct 1 ms 1108 KB Output is correct
12 Correct 1 ms 1108 KB Output is correct
13 Correct 1 ms 1108 KB Output is correct
14 Correct 1 ms 1108 KB Output is correct
15 Correct 1 ms 1108 KB Output is correct
16 Correct 2 ms 1108 KB Output is correct
17 Correct 1 ms 1108 KB Output is correct
18 Correct 2 ms 1108 KB Output is correct
19 Correct 2 ms 1092 KB Output is correct
20 Correct 1 ms 1096 KB Output is correct
21 Correct 1 ms 1108 KB Output is correct
22 Correct 1 ms 1108 KB Output is correct
23 Correct 1 ms 1096 KB Output is correct
24 Correct 1 ms 1108 KB Output is correct
25 Correct 1 ms 1092 KB Output is correct
26 Correct 1 ms 1108 KB Output is correct
27 Correct 1 ms 1108 KB Output is correct
28 Correct 1 ms 1108 KB Output is correct
29 Correct 1 ms 1108 KB Output is correct
30 Correct 1 ms 1108 KB Output is correct
31 Correct 1 ms 1092 KB Output is correct
32 Correct 1 ms 1108 KB Output is correct
33 Correct 1 ms 1108 KB Output is correct
34 Correct 1 ms 1108 KB Output is correct
35 Correct 1 ms 1108 KB Output is correct
36 Correct 1 ms 1092 KB Output is correct
37 Correct 1 ms 1092 KB Output is correct
38 Correct 1 ms 1108 KB Output is correct
39 Correct 1 ms 1108 KB Output is correct
40 Correct 1 ms 1096 KB Output is correct
41 Correct 1 ms 1092 KB Output is correct
42 Correct 1 ms 1108 KB Output is correct
43 Correct 1 ms 1096 KB Output is correct
44 Correct 1 ms 1108 KB Output is correct
45 Correct 2 ms 1100 KB Output is correct
46 Correct 1 ms 1108 KB Output is correct
47 Correct 1 ms 1108 KB Output is correct
48 Correct 1 ms 1108 KB Output is correct
49 Correct 1 ms 1096 KB Output is correct
50 Correct 1 ms 1108 KB Output is correct
51 Correct 1 ms 1108 KB Output is correct
52 Correct 1 ms 1108 KB Output is correct
53 Correct 1 ms 1108 KB Output is correct
54 Correct 1 ms 1108 KB Output is correct
55 Correct 1 ms 1108 KB Output is correct
56 Correct 1 ms 1092 KB Output is correct
57 Correct 1 ms 1108 KB Output is correct
58 Correct 1 ms 1096 KB Output is correct
59 Correct 1 ms 1108 KB Output is correct
60 Correct 2 ms 1108 KB Output is correct
61 Correct 1 ms 1092 KB Output is correct
62 Correct 1 ms 1108 KB Output is correct
63 Correct 1 ms 1096 KB Output is correct
64 Correct 2 ms 1096 KB Output is correct
65 Correct 1 ms 1108 KB Output is correct
66 Correct 3 ms 1236 KB Output is correct
67 Correct 2 ms 1236 KB Output is correct
68 Correct 2 ms 1236 KB Output is correct
69 Correct 188 ms 1412 KB Output is correct
70 Correct 67 ms 1312 KB Output is correct
71 Correct 26 ms 1236 KB Output is correct
72 Correct 2 ms 1236 KB Output is correct
73 Correct 2 ms 1236 KB Output is correct
74 Correct 81 ms 1532 KB Output is correct
75 Correct 166 ms 1440 KB Output is correct
76 Correct 26 ms 1316 KB Output is correct
77 Correct 17 ms 1240 KB Output is correct
78 Correct 19 ms 1236 KB Output is correct
79 Correct 23 ms 1236 KB Output is correct
80 Correct 6 ms 1232 KB Output is correct
81 Correct 25 ms 1236 KB Output is correct
82 Correct 57 ms 1432 KB Output is correct
83 Correct 59 ms 1436 KB Output is correct
84 Correct 13 ms 1272 KB Output is correct
85 Correct 6 ms 1236 KB Output is correct
86 Correct 17 ms 1348 KB Output is correct
87 Correct 8 ms 1360 KB Output is correct
88 Correct 63 ms 1360 KB Output is correct
89 Correct 43 ms 1236 KB Output is correct
90 Correct 44 ms 1236 KB Output is correct
91 Correct 24 ms 3156 KB Output is correct
92 Correct 31 ms 3608 KB Output is correct
93 Correct 38 ms 3624 KB Output is correct
94 Execution timed out 5057 ms 5724 KB Time limit exceeded
95 Halted 0 ms 0 KB -