oj.uz

Submission #570663

# Submission time Handle Problem Language Result Execution time Memory
570663 2022-05-31T02:32:41 Z balbit IOI Fever (JOI21_fever) C++14
100 / 100
 2699 ms 62316 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 operator - (pt &o) {
        return {x - o.x, y - o.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);
}

inline pt unrot(pt p, int d) {
    if (d == 0) return p;
    if (d == 1) return {p.y, -p.x};
    if (d == 2) return {-p.x, -p.y};
    if (d == 3) return {-p.y, p.x};
}

map<int, set<pair<int, int> > > MP[4][2];
map<int, set<pair<int, int> > > SMP[4]; // map for straight movements

//map<int, set<pair<int, int> > > DONE[4][2];
ll closest[maxn][3];

int run(int idir){
    bug(idir);
    dir[0] = idir;
    memset(done, 0, sizeof done);
    REP(i,4) REP(j,2) {
        MP[i][j].clear();
//        DONE[i][j].clear();
    }
    REP(i,4) SMP[i].clear();
    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]);

    }

    REP(i,n) {
        // build the maps
        {
            int nd = F4(dir[i] + 1);
            pt at = unrot(P[i], nd);
            MP[nd][0][at.x - at.y].insert({at.x, i});
        }
        {
            int nd = F4(dir[i] - 1);
            pt at = unrot(P[i], nd);
            MP[nd][1][at.x + at.y].insert({at.x, i});
        }
        {
            pt at = unrot(P[i], dir[i]);
            SMP[dir[i]][at.y].insert({at.x, i});
        }
    }

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

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

    auto UPD = [&](int u, int d, int branch) {
        MN(closest[u][branch], 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;

        int dr = dir[v];
        pt R = unrot(P[v], dr);

        auto gt0 = MP[dr][0][R.x-R.y].lower_bound({R.x + w,-1});
        if (gt0 != MP[dr][0][R.x-R.y].end()) {
            UPD(gt0->s, gt0->f - R.x, 1);
        }

        auto gt1 = MP[dr][1][R.x+R.y].lower_bound({R.x + w,-1});
        if (gt1 != MP[dr][1][R.x+R.y].end()) {
            UPD(gt1->s, gt1->f - R.x, 0);
        }
        {
            int dr2 = F4(dr + 2);
            pt R2 = unrot(R, 2);
            auto gts = SMP[dr2][R2.y].lower_bound({R2.x - w*2, 10000000});
            if (gts != SMP[dr2][R2.y].begin()) {
                --gts;
                UPD(gts->s, (R2.x - gts->f)/2, 2);
            }
        }

        {
            int nd = F4(dir[v] + 1);
            pt at = unrot(P[v], nd);
            auto clo1 = MP[nd][0][at.x - at.y].lower_bound({at.x+1, -1});
            // from my perspective, it is the 1-branch
            if (clo1 != MP[nd][0][at.x - at.y].end()) {
                UPD(clo1->s, closest[v][1] + (clo1->f) - at.x, 1);
            }

            MP[nd][0][at.x - at.y].erase({at.x, v});
        }
        {
            int nd = F4(dir[v] - 1);
            pt at = unrot(P[v], nd);
            auto clo0 = MP[nd][1][at.x + at.y].lower_bound({at.x+1, -1});
            // from my perspective, it is the 0-branch
            if (clo0 != MP[nd][1][at.x + at.y].end()) {
                UPD(clo0->s, closest[v][0] + (clo0->f) - at.x, 0);
            }

            MP[nd][1][at.x + at.y].erase({at.x, v});
        }

        {
            auto gt = SMP[dr][R.y].lower_bound({R.x, -1});
            if (gt != SMP[dr][R.y].begin()) {
                --gt;
                UPD(gt->s, closest[v][2] + (R.x - gt->f) / 2, 2);
            }

            SMP[dr][R.y].erase({R.x, v});
        }
    }
    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;
}

Compilation message

fever.cpp: In function 'pt unrot(pt, long long int)':
fever.cpp:91:1: warning: control reaches end of non-void function [-Wreturn-type]
   91 | }
      | ^

Subtask #1
5.0 / 5.0

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

Subtask #2
8.0 / 8.0

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

Subtask #3
6.0 / 6.0

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

Subtask #4
6.0 / 6.0

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

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3540 KB Output is correct
2 Correct 2 ms 3540 KB Output is correct
3 Correct 2 ms 3540 KB Output is correct
4 Correct 3 ms 3540 KB Output is correct
5 Correct 2 ms 3540 KB Output is correct
6 Correct 3 ms 3540 KB Output is correct
7 Correct 2 ms 3540 KB Output is correct
8 Correct 2 ms 3540 KB Output is correct
9 Correct 3 ms 3540 KB Output is correct
10 Correct 2 ms 3540 KB Output is correct
11 Correct 2 ms 3540 KB Output is correct
12 Correct 2 ms 3540 KB Output is correct
13 Correct 2 ms 3540 KB Output is correct
14 Correct 2 ms 3540 KB Output is correct
15 Correct 2 ms 3540 KB Output is correct
16 Correct 3 ms 3484 KB Output is correct
17 Correct 2 ms 3540 KB Output is correct
18 Correct 3 ms 3540 KB Output is correct
19 Correct 3 ms 3668 KB Output is correct
20 Correct 2 ms 3540 KB Output is correct
21 Correct 2 ms 3540 KB Output is correct
22 Correct 2 ms 3540 KB Output is correct
23 Correct 2 ms 3540 KB Output is correct
24 Correct 2 ms 3540 KB Output is correct
25 Correct 2 ms 3540 KB Output is correct
26 Correct 2 ms 3540 KB Output is correct
27 Correct 2 ms 3540 KB Output is correct
28 Correct 2 ms 3540 KB Output is correct
29 Correct 3 ms 3516 KB Output is correct
30 Correct 2 ms 3540 KB Output is correct
31 Correct 3 ms 3540 KB Output is correct
32 Correct 3 ms 3540 KB Output is correct
33 Correct 3 ms 3540 KB Output is correct
34 Correct 2 ms 3540 KB Output is correct
35 Correct 2 ms 3540 KB Output is correct
36 Correct 2 ms 3540 KB Output is correct
37 Correct 2 ms 3540 KB Output is correct
38 Correct 2 ms 3540 KB Output is correct
39 Correct 3 ms 3540 KB Output is correct
40 Correct 2 ms 3540 KB Output is correct
41 Correct 2 ms 3540 KB Output is correct
42 Correct 2 ms 3540 KB Output is correct
43 Correct 2 ms 3540 KB Output is correct
44 Correct 2 ms 3540 KB Output is correct
45 Correct 2 ms 3540 KB Output is correct
46 Correct 4 ms 3540 KB Output is correct
47 Correct 3 ms 3540 KB Output is correct
48 Correct 3 ms 3540 KB Output is correct
49 Correct 3 ms 3540 KB Output is correct
50 Correct 2 ms 3540 KB Output is correct
51 Correct 3 ms 3540 KB Output is correct
52 Correct 3 ms 3540 KB Output is correct
53 Correct 3 ms 3540 KB Output is correct
54 Correct 4 ms 3540 KB Output is correct
55 Correct 2 ms 3540 KB Output is correct
56 Correct 4 ms 3540 KB Output is correct
57 Correct 3 ms 3540 KB Output is correct
58 Correct 3 ms 3540 KB Output is correct
59 Correct 3 ms 3540 KB Output is correct
60 Correct 3 ms 3540 KB Output is correct
61 Correct 4 ms 3540 KB Output is correct
62 Correct 2 ms 3540 KB Output is correct
63 Correct 2 ms 3540 KB Output is correct
64 Correct 2 ms 3540 KB Output is correct
65 Correct 3 ms 3540 KB Output is correct
66 Correct 14 ms 4924 KB Output is correct
67 Correct 15 ms 4896 KB Output is correct
68 Correct 15 ms 5048 KB Output is correct
69 Correct 34 ms 4308 KB Output is correct
70 Correct 20 ms 4512 KB Output is correct
71 Correct 14 ms 4520 KB Output is correct
72 Correct 13 ms 4916 KB Output is correct
73 Correct 13 ms 5076 KB Output is correct
74 Correct 20 ms 5076 KB Output is correct
75 Correct 26 ms 4996 KB Output is correct
76 Correct 16 ms 5060 KB Output is correct
77 Correct 17 ms 4892 KB Output is correct
78 Correct 19 ms 5080 KB Output is correct
79 Correct 17 ms 5228 KB Output is correct
80 Correct 14 ms 5108 KB Output is correct
81 Correct 16 ms 5204 KB Output is correct
82 Correct 18 ms 5008 KB Output is correct
83 Correct 18 ms 5076 KB Output is correct
84 Correct 9 ms 4628 KB Output is correct
85 Correct 9 ms 4312 KB Output is correct
86 Correct 13 ms 4180 KB Output is correct
87 Correct 8 ms 4516 KB Output is correct
88 Correct 21 ms 5080 KB Output is correct
89 Correct 22 ms 5340 KB Output is correct
90 Correct 16 ms 5460 KB Output is correct

Subtask #6
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3540 KB Output is correct
2 Correct 2 ms 3540 KB Output is correct
3 Correct 2 ms 3540 KB Output is correct
4 Correct 3 ms 3540 KB Output is correct
5 Correct 2 ms 3540 KB Output is correct
6 Correct 3 ms 3540 KB Output is correct
7 Correct 2 ms 3540 KB Output is correct
8 Correct 2 ms 3540 KB Output is correct
9 Correct 3 ms 3540 KB Output is correct
10 Correct 2 ms 3540 KB Output is correct
11 Correct 2 ms 3540 KB Output is correct
12 Correct 2 ms 3540 KB Output is correct
13 Correct 2 ms 3540 KB Output is correct
14 Correct 2 ms 3540 KB Output is correct
15 Correct 2 ms 3540 KB Output is correct
16 Correct 3 ms 3484 KB Output is correct
17 Correct 2 ms 3540 KB Output is correct
18 Correct 3 ms 3540 KB Output is correct
19 Correct 3 ms 3668 KB Output is correct
20 Correct 2 ms 3540 KB Output is correct
21 Correct 2 ms 3540 KB Output is correct
22 Correct 2 ms 3540 KB Output is correct
23 Correct 2 ms 3540 KB Output is correct
24 Correct 2 ms 3540 KB Output is correct
25 Correct 2 ms 3540 KB Output is correct
26 Correct 2 ms 3540 KB Output is correct
27 Correct 2 ms 3540 KB Output is correct
28 Correct 2 ms 3540 KB Output is correct
29 Correct 3 ms 3516 KB Output is correct
30 Correct 2 ms 3540 KB Output is correct
31 Correct 3 ms 3540 KB Output is correct
32 Correct 3 ms 3540 KB Output is correct
33 Correct 3 ms 3540 KB Output is correct
34 Correct 2 ms 3540 KB Output is correct
35 Correct 2 ms 3540 KB Output is correct
36 Correct 2 ms 3540 KB Output is correct
37 Correct 2 ms 3540 KB Output is correct
38 Correct 2 ms 3540 KB Output is correct
39 Correct 3 ms 3540 KB Output is correct
40 Correct 2 ms 3540 KB Output is correct
41 Correct 2 ms 3540 KB Output is correct
42 Correct 2 ms 3540 KB Output is correct
43 Correct 2 ms 3540 KB Output is correct
44 Correct 2 ms 3540 KB Output is correct
45 Correct 2 ms 3540 KB Output is correct
46 Correct 4 ms 3540 KB Output is correct
47 Correct 3 ms 3540 KB Output is correct
48 Correct 3 ms 3540 KB Output is correct
49 Correct 3 ms 3540 KB Output is correct
50 Correct 2 ms 3540 KB Output is correct
51 Correct 3 ms 3540 KB Output is correct
52 Correct 3 ms 3540 KB Output is correct
53 Correct 3 ms 3540 KB Output is correct
54 Correct 4 ms 3540 KB Output is correct
55 Correct 2 ms 3540 KB Output is correct
56 Correct 4 ms 3540 KB Output is correct
57 Correct 3 ms 3540 KB Output is correct
58 Correct 3 ms 3540 KB Output is correct
59 Correct 3 ms 3540 KB Output is correct
60 Correct 3 ms 3540 KB Output is correct
61 Correct 4 ms 3540 KB Output is correct
62 Correct 2 ms 3540 KB Output is correct
63 Correct 2 ms 3540 KB Output is correct
64 Correct 2 ms 3540 KB Output is correct
65 Correct 3 ms 3540 KB Output is correct
66 Correct 1081 ms 40696 KB Output is correct
67 Correct 1453 ms 49256 KB Output is correct
68 Correct 1409 ms 52852 KB Output is correct
69 Correct 1673 ms 52940 KB Output is correct
70 Correct 2225 ms 52944 KB Output is correct
71 Correct 1476 ms 52860 KB Output is correct
72 Correct 1518 ms 52936 KB Output is correct
73 Correct 1557 ms 45276 KB Output is correct
74 Correct 1464 ms 52940 KB Output is correct
75 Correct 1494 ms 53648 KB Output is correct
76 Correct 1696 ms 52972 KB Output is correct
77 Correct 1575 ms 52860 KB Output is correct
78 Correct 1725 ms 62316 KB Output is correct
79 Correct 1713 ms 62204 KB Output is correct

Subtask #7
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3540 KB Output is correct
2 Correct 2 ms 3540 KB Output is correct
3 Correct 2 ms 3540 KB Output is correct
4 Correct 3 ms 3540 KB Output is correct
5 Correct 2 ms 3540 KB Output is correct
6 Correct 3 ms 3540 KB Output is correct
7 Correct 2 ms 3540 KB Output is correct
8 Correct 2 ms 3540 KB Output is correct
9 Correct 3 ms 3540 KB Output is correct
10 Correct 2 ms 3540 KB Output is correct
11 Correct 2 ms 3540 KB Output is correct
12 Correct 2 ms 3540 KB Output is correct
13 Correct 2 ms 3540 KB Output is correct
14 Correct 2 ms 3540 KB Output is correct
15 Correct 2 ms 3540 KB Output is correct
16 Correct 3 ms 3484 KB Output is correct
17 Correct 2 ms 3540 KB Output is correct
18 Correct 3 ms 3540 KB Output is correct
19 Correct 3 ms 3668 KB Output is correct
20 Correct 2 ms 3540 KB Output is correct
21 Correct 2 ms 3540 KB Output is correct
22 Correct 2 ms 3540 KB Output is correct
23 Correct 2 ms 3540 KB Output is correct
24 Correct 2 ms 3540 KB Output is correct
25 Correct 2 ms 3540 KB Output is correct
26 Correct 2 ms 3540 KB Output is correct
27 Correct 2 ms 3540 KB Output is correct
28 Correct 2 ms 3540 KB Output is correct
29 Correct 3 ms 3516 KB Output is correct
30 Correct 2 ms 3540 KB Output is correct
31 Correct 3 ms 3540 KB Output is correct
32 Correct 3 ms 3540 KB Output is correct
33 Correct 3 ms 3540 KB Output is correct
34 Correct 2 ms 3540 KB Output is correct
35 Correct 2 ms 3540 KB Output is correct
36 Correct 2 ms 3540 KB Output is correct
37 Correct 2 ms 3540 KB Output is correct
38 Correct 2 ms 3540 KB Output is correct
39 Correct 3 ms 3540 KB Output is correct
40 Correct 2 ms 3540 KB Output is correct
41 Correct 2 ms 3540 KB Output is correct
42 Correct 2 ms 3540 KB Output is correct
43 Correct 2 ms 3540 KB Output is correct
44 Correct 2 ms 3540 KB Output is correct
45 Correct 2 ms 3540 KB Output is correct
46 Correct 4 ms 3540 KB Output is correct
47 Correct 3 ms 3540 KB Output is correct
48 Correct 3 ms 3540 KB Output is correct
49 Correct 3 ms 3540 KB Output is correct
50 Correct 2 ms 3540 KB Output is correct
51 Correct 3 ms 3540 KB Output is correct
52 Correct 3 ms 3540 KB Output is correct
53 Correct 3 ms 3540 KB Output is correct
54 Correct 4 ms 3540 KB Output is correct
55 Correct 2 ms 3540 KB Output is correct
56 Correct 4 ms 3540 KB Output is correct
57 Correct 3 ms 3540 KB Output is correct
58 Correct 3 ms 3540 KB Output is correct
59 Correct 3 ms 3540 KB Output is correct
60 Correct 3 ms 3540 KB Output is correct
61 Correct 4 ms 3540 KB Output is correct
62 Correct 2 ms 3540 KB Output is correct
63 Correct 2 ms 3540 KB Output is correct
64 Correct 2 ms 3540 KB Output is correct
65 Correct 3 ms 3540 KB Output is correct
66 Correct 14 ms 4924 KB Output is correct
67 Correct 15 ms 4896 KB Output is correct
68 Correct 15 ms 5048 KB Output is correct
69 Correct 34 ms 4308 KB Output is correct
70 Correct 20 ms 4512 KB Output is correct
71 Correct 14 ms 4520 KB Output is correct
72 Correct 13 ms 4916 KB Output is correct
73 Correct 13 ms 5076 KB Output is correct
74 Correct 20 ms 5076 KB Output is correct
75 Correct 26 ms 4996 KB Output is correct
76 Correct 16 ms 5060 KB Output is correct
77 Correct 17 ms 4892 KB Output is correct
78 Correct 19 ms 5080 KB Output is correct
79 Correct 17 ms 5228 KB Output is correct
80 Correct 14 ms 5108 KB Output is correct
81 Correct 16 ms 5204 KB Output is correct
82 Correct 18 ms 5008 KB Output is correct
83 Correct 18 ms 5076 KB Output is correct
84 Correct 9 ms 4628 KB Output is correct
85 Correct 9 ms 4312 KB Output is correct
86 Correct 13 ms 4180 KB Output is correct
87 Correct 8 ms 4516 KB Output is correct
88 Correct 21 ms 5080 KB Output is correct
89 Correct 22 ms 5340 KB Output is correct
90 Correct 16 ms 5460 KB Output is correct
91 Correct 1081 ms 40696 KB Output is correct
92 Correct 1453 ms 49256 KB Output is correct
93 Correct 1409 ms 52852 KB Output is correct
94 Correct 1673 ms 52940 KB Output is correct
95 Correct 2225 ms 52944 KB Output is correct
96 Correct 1476 ms 52860 KB Output is correct
97 Correct 1518 ms 52936 KB Output is correct
98 Correct 1557 ms 45276 KB Output is correct
99 Correct 1464 ms 52940 KB Output is correct
100 Correct 1494 ms 53648 KB Output is correct
101 Correct 1696 ms 52972 KB Output is correct
102 Correct 1575 ms 52860 KB Output is correct
103 Correct 1725 ms 62316 KB Output is correct
104 Correct 1713 ms 62204 KB Output is correct
105 Correct 1501 ms 21428 KB Output is correct
106 Correct 2099 ms 26036 KB Output is correct
107 Correct 2335 ms 26500 KB Output is correct
108 Correct 2582 ms 27464 KB Output is correct
109 Correct 1216 ms 33152 KB Output is correct
110 Correct 1507 ms 48072 KB Output is correct
111 Correct 1592 ms 54732 KB Output is correct
112 Correct 1475 ms 53312 KB Output is correct
113 Correct 1502 ms 53400 KB Output is correct
114 Correct 2699 ms 41236 KB Output is correct
115 Correct 1500 ms 47768 KB Output is correct
116 Correct 1484 ms 53420 KB Output is correct
117 Correct 1536 ms 53992 KB Output is correct
118 Correct 2300 ms 45024 KB Output is correct
119 Correct 2036 ms 54908 KB Output is correct
120 Correct 1551 ms 53384 KB Output is correct
121 Correct 1605 ms 55980 KB Output is correct
122 Correct 1715 ms 56728 KB Output is correct
123 Correct 1758 ms 54396 KB Output is correct
124 Correct 1810 ms 54864 KB Output is correct
125 Correct 610 ms 40072 KB Output is correct
126 Correct 500 ms 28696 KB Output is correct
127 Correct 678 ms 26860 KB Output is correct
128 Correct 676 ms 27332 KB Output is correct
129 Correct 472 ms 35148 KB Output is correct