oj.uz

Submission #719695

# Submission time Handle Problem Language Result Execution time Memory
719695 2023-04-06T13:50:09 Z somethingnew Radio Towers (IOI22_towers) C++17
60 / 100
 4000 ms 133304 KB 
//  ↘ ⬇ ⬇ ⬇ ⬇ ⬇ ↙
//  ➡ @roadfromroi ⬅
//  ↗ ⬆ ⬆ ⬆ ⬆ ⬆ ↖
#include <iostream>
#include "vector"
#include "algorithm"
#include "numeric"
#include "climits"
#include "iomanip"
#include "bitset"
#include "cmath"
#include "map"
#include "deque"
#include "array"
#include "set"
#include "queue"
//#include "towers.h"
#define all(x) x.begin(), x.end()
using namespace std;

vector<int> h;
int dd;
struct node {
    int lval;
    int rval;
    int cnt;
    int lstenka;
    int rstenka;
    node() {}
    node(int x) {
        lval = rval = x;
        cnt = 1;
        lstenka = 0;
        rstenka = 0;
    }
};

void merge(node &a, node b) {
    if (a.rval <= b.lval) {
        if (max(a.rstenka, b.lstenka) - dd >= max(a.rval, b.lval)) {
            a.cnt = a.cnt + b.cnt;
            a.rstenka = b.rstenka;
            a.rval = b.rval;
            return;
        } else {
            a.cnt = a.cnt + b.cnt - 1;
            if (b.cnt != 1) {
                a.rstenka = b.rstenka;
                a.rval = b.rval;
            } else {
                //  cout << c.rstenka << ' ';
                a.rstenka = max(a.rstenka, max(b.rstenka, max(b.lstenka, b.rval)));
                //  cout << c.rstenka << '\n';
            }
            return;
        }
    } else {
        if (max(a.rstenka, b.lstenka) - dd >= max(a.rval, b.lval)) {
            b.cnt = a.cnt + b.cnt;
            b.lstenka = a.lstenka;
            b.lval = a.lval;
            swap(a, b);
            return;
        } else {
            b.cnt = a.cnt + b.cnt - 1;
            if (a.cnt != 1) {
                b.lstenka = a.lstenka;
                b.lval = a.lval;
            } else {
                //  cout << c.rstenka << ' ';
                b.lstenka = max(b.lstenka, max(a.lstenka, max(a.rstenka, a.lval)));
                //  cout << c.rstenka << '\n';
            }
            swap(a, b);
            return;
        }
    }
}
struct kornihunka{
    vector<int> elems;
    node nd;
    void push(int x) {
        elems.push_back(x);
    }
    node get(int l, int r) {
        r = min(r, (int)elems.size() - 1);
        node nres(elems[l]);
        for (int i = l + 1; i <= r; ++i) {
            merge(nres, node(elems[i]));
        }
        return nres;
    }
    int calc() {
        int incdd = -1;
        nd = node(elems[0]);
        int cc = 1;
        int pr3 = 2e9;
        for (int i = 1; i < elems.size(); ++i) {
            int pr = nd.rval, pr2 = nd.rstenka;
            merge(nd, elems[i]);
            if (nd.cnt != cc) {
                cc = nd.cnt;
                if (incdd == -1)
                    incdd = min(pr2 - dd - pr, pr3 - dd - pr);
                incdd = min(incdd, min(pr2 - dd - pr, pr3 - dd - pr));
                pr3 = pr2;
            }
        }
        incdd = min(incdd, pr3 - dd - nd.rval);
        if (nd.cnt == 1)
            return 0;
        return incdd + 1;
    }
    node getnode() {
        return nd;
    }
};
const int K = 340;
const int N = 100000;
vector<vector<kornihunka>> vecnode;
vector<vector<int>> detki;
int realdetki[N / K + 1][N];
vector<int> alex;
int calcedd = 0;
void init(int n, vector<int> hh) {
    h = hh;
    vecnode.assign((n + K - 1) / K, vector<kornihunka>(K));
    detki.assign((n + K - 1) / K, {});
    for (int i = 0; i < n; ++i) {
        vecnode[i/K][0].push(h[i]);
    }
    for (int i = 0; i < vecnode.size(); ++i) {
        int j = 0;
        int inc = 1;
        dd = 0;
        do {
            dd += inc;
            detki[i].push_back(dd);
            alex.push_back(dd);
            vecnode[i][j + 1] = vecnode[i][j];
            inc = vecnode[i][j].calc();
            j++;
        } while (inc != 0);
    }
    sort(all(alex));
    alex.erase(unique(all(alex)), alex.end());
    for (int i = 0; i < vecnode.size(); ++i) {
        int j = 0;
        for (int pvl = 0; pvl < alex.size(); ++pvl) {
            while (j + 1 != detki[i].size() and detki[i][j + 1] <= alex[pvl]) {
                j++;
            }
            realdetki[i][pvl] = j;
        }
    }
}
int max_towers(int L, int R, int D) {
    node res(2e9);
    dd = D;
    int dvl = upper_bound(all(alex), dd) - alex.begin()-1;
    if (L / K == R / K) {
        //cout << upper_bound(all(detki[L/K]), dd) - detki[L/K].begin()-1 << '\n';
        //     cout << res.rval << ' ' << res.rstenka << ' ' << res.cnt << '\n';
        merge(res, vecnode[L/K][realdetki[L/K][dvl]].get(L % K, R % K));
        return res.cnt;
    }
    if (L % K != 0) {
        //  cout << res.rval << ' ' << res.rstenka << ' ' << res.cnt << '\n';
        merge(res, vecnode[L/K][realdetki[L/K][dvl]].get(L % K, K - 1));
        L = L / K * K + K;
    }
    while (L + K <= R + 1) {
        //cout << "TT " << res.rval << ' ' << res.rstenka << ' ' << res.cnt << '\n';
        node res2 = vecnode[L/K][0].getnode();
        //cout << "TT2 " << res2.lval << ' ' << res2.lstenka << ' ' << res2.cnt << '\n';
        merge(res, vecnode[L/K][realdetki[L/K][dvl]].getnode());
        //cout << "TT3 " << res.rval << ' ' << res.rstenka << ' ' << res.cnt << '\n';

        L += K;
    }
    if (L <= R) {
        // cout << res.rval << ' ' << res.rstenka << ' ' << res.cnt << '\n';
        merge(res, vecnode[L/K][realdetki[L/K][dvl]].get(L % K, R % K));
    }
    // cout << res.rval << ' ' << res.rstenka << ' ' << res.cnt << '\n';
    return res.cnt;
}
/*
int main() {
    int n, m;
    cin >> n >> m;
    vector<int> a(n);
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
    }
    init(n, a);
    for (int i = 0; i < m; ++i) {
        int q1, q2, q3;
        cin >> q1 >> q2 >> q3;
        cout << max_towers(q1,q2,q3) << '\n';
    }
}*/
/*
7 1
10 20 60 40 50 30 70
0 6 17
 */

Compilation message

towers.cpp: In member function 'int kornihunka::calc()':
towers.cpp:98:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   98 |         for (int i = 1; i < elems.size(); ++i) {
      |                         ~~^~~~~~~~~~~~~~
towers.cpp: In function 'void init(int, std::vector<int>)':
towers.cpp:132:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<kornihunka> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  132 |     for (int i = 0; i < vecnode.size(); ++i) {
      |                     ~~^~~~~~~~~~~~~~~~
towers.cpp:147:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<kornihunka> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  147 |     for (int i = 0; i < vecnode.size(); ++i) {
      |                     ~~^~~~~~~~~~~~~~~~
towers.cpp:149:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  149 |         for (int pvl = 0; pvl < alex.size(); ++pvl) {
      |                           ~~~~^~~~~~~~~~~~~
towers.cpp:150:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  150 |             while (j + 1 != detki[i].size() and detki[i][j + 1] <= alex[pvl]) {
      |                    ~~~~~~^~~~~~~~~~~~~~~~~~
towers.cpp: In function 'int max_towers(int, int, int)':
towers.cpp:174:14: warning: variable 'res2' set but not used [-Wunused-but-set-variable]
  174 |         node res2 = vecnode[L/K][0].getnode();
      |              ^~~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 791 ms 5192 KB Output is correct
2 Correct 1567 ms 8500 KB Output is correct
3 Correct 1527 ms 8600 KB Output is correct
4 Correct 1580 ms 8612 KB Output is correct
5 Correct 2120 ms 8512 KB Output is correct
6 Correct 1446 ms 8496 KB Output is correct
7 Correct 1986 ms 8528 KB Output is correct
8 Correct 0 ms 336 KB Output is correct
9 Correct 1 ms 464 KB Output is correct
10 Correct 1 ms 464 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 464 KB Output is correct
2 Correct 6 ms 1360 KB Output is correct
3 Correct 6 ms 1232 KB Output is correct
4 Correct 9 ms 1700 KB Output is correct
5 Correct 9 ms 1808 KB Output is correct
6 Correct 8 ms 1744 KB Output is correct
7 Correct 9 ms 1744 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 464 KB Output is correct
10 Correct 1 ms 480 KB Output is correct
11 Correct 2 ms 464 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 480 KB Output is correct
14 Correct 1 ms 464 KB Output is correct
15 Correct 6 ms 1380 KB Output is correct
16 Correct 9 ms 1692 KB Output is correct
17 Correct 8 ms 1744 KB Output is correct
18 Correct 1 ms 464 KB Output is correct
19 Correct 1 ms 464 KB Output is correct
20 Correct 6 ms 1256 KB Output is correct
21 Correct 9 ms 1744 KB Output is correct
22 Correct 8 ms 1744 KB Output is correct
23 Correct 1 ms 464 KB Output is correct
24 Correct 1 ms 464 KB Output is correct
25 Correct 3 ms 720 KB Output is correct
26 Correct 6 ms 1372 KB Output is correct
27 Correct 8 ms 1288 KB Output is correct
28 Correct 8 ms 1744 KB Output is correct
29 Correct 9 ms 1744 KB Output is correct
30 Correct 8 ms 1744 KB Output is correct
31 Correct 8 ms 1744 KB Output is correct
32 Correct 1 ms 464 KB Output is correct
33 Correct 1 ms 464 KB Output is correct
34 Correct 1 ms 464 KB Output is correct
35 Correct 1 ms 464 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 464 KB Output is correct
2 Correct 6 ms 1360 KB Output is correct
3 Correct 6 ms 1232 KB Output is correct
4 Correct 9 ms 1700 KB Output is correct
5 Correct 9 ms 1808 KB Output is correct
6 Correct 8 ms 1744 KB Output is correct
7 Correct 9 ms 1744 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 464 KB Output is correct
10 Correct 1 ms 480 KB Output is correct
11 Correct 2 ms 464 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 480 KB Output is correct
14 Correct 1 ms 464 KB Output is correct
15 Correct 6 ms 1380 KB Output is correct
16 Correct 9 ms 1692 KB Output is correct
17 Correct 8 ms 1744 KB Output is correct
18 Correct 1 ms 464 KB Output is correct
19 Correct 1 ms 464 KB Output is correct
20 Correct 6 ms 1256 KB Output is correct
21 Correct 9 ms 1744 KB Output is correct
22 Correct 8 ms 1744 KB Output is correct
23 Correct 1 ms 464 KB Output is correct
24 Correct 1 ms 464 KB Output is correct
25 Correct 3 ms 720 KB Output is correct
26 Correct 6 ms 1372 KB Output is correct
27 Correct 8 ms 1288 KB Output is correct
28 Correct 8 ms 1744 KB Output is correct
29 Correct 9 ms 1744 KB Output is correct
30 Correct 8 ms 1744 KB Output is correct
31 Correct 8 ms 1744 KB Output is correct
32 Correct 1 ms 464 KB Output is correct
33 Correct 1 ms 464 KB Output is correct
34 Correct 1 ms 464 KB Output is correct
35 Correct 1 ms 464 KB Output is correct
36 Correct 194 ms 50956 KB Output is correct
37 Correct 294 ms 91952 KB Output is correct
38 Correct 280 ms 91440 KB Output is correct
39 Correct 430 ms 133220 KB Output is correct
40 Correct 412 ms 133128 KB Output is correct
41 Correct 431 ms 133124 KB Output is correct
42 Correct 414 ms 133184 KB Output is correct
43 Correct 18 ms 8484 KB Output is correct
44 Correct 29 ms 8492 KB Output is correct
45 Correct 17 ms 8488 KB Output is correct
46 Correct 26 ms 8484 KB Output is correct
47 Correct 288 ms 91500 KB Output is correct
48 Correct 424 ms 133224 KB Output is correct
49 Correct 430 ms 133228 KB Output is correct
50 Correct 19 ms 8540 KB Output is correct
51 Correct 17 ms 8608 KB Output is correct
52 Correct 275 ms 91548 KB Output is correct
53 Correct 417 ms 133248 KB Output is correct
54 Correct 427 ms 133248 KB Output is correct
55 Correct 30 ms 8516 KB Output is correct
56 Correct 32 ms 8616 KB Output is correct
57 Correct 346 ms 87452 KB Output is correct
58 Correct 311 ms 91716 KB Output is correct
59 Correct 296 ms 91880 KB Output is correct
60 Correct 421 ms 133144 KB Output is correct
61 Correct 454 ms 133232 KB Output is correct
62 Correct 432 ms 133248 KB Output is correct
63 Correct 443 ms 133220 KB Output is correct
64 Correct 24 ms 8488 KB Output is correct
65 Correct 25 ms 8604 KB Output is correct
66 Correct 26 ms 8504 KB Output is correct
67 Correct 26 ms 8620 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1716 ms 90452 KB Output is correct
2 Correct 2009 ms 91664 KB Output is correct
3 Correct 2295 ms 91544 KB Output is correct
4 Correct 2090 ms 133196 KB Output is correct
5 Correct 2204 ms 133304 KB Output is correct
6 Correct 2199 ms 133228 KB Output is correct
7 Correct 2277 ms 133132 KB Output is correct
8 Correct 1574 ms 8488 KB Output is correct
9 Correct 1874 ms 8484 KB Output is correct
10 Correct 1558 ms 8492 KB Output is correct
11 Correct 1980 ms 8612 KB Output is correct
12 Correct 1728 ms 8624 KB Output is correct
13 Correct 1704 ms 8512 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 464 KB Output is correct
16 Correct 1 ms 464 KB Output is correct
17 Correct 330 ms 91400 KB Output is correct
18 Correct 432 ms 133196 KB Output is correct
19 Correct 432 ms 133236 KB Output is correct
20 Correct 28 ms 8496 KB Output is correct
21 Correct 25 ms 8584 KB Output is correct
22 Correct 282 ms 91520 KB Output is correct
23 Correct 446 ms 133300 KB Output is correct
24 Correct 424 ms 133272 KB Output is correct
25 Correct 19 ms 8488 KB Output is correct
26 Correct 18 ms 8620 KB Output is correct
27 Correct 5 ms 1360 KB Output is correct
28 Correct 9 ms 1744 KB Output is correct
29 Correct 9 ms 1744 KB Output is correct
30 Correct 1 ms 464 KB Output is correct
31 Correct 1 ms 484 KB Output is correct
32 Correct 5 ms 1360 KB Output is correct
33 Correct 7 ms 1768 KB Output is correct
34 Correct 9 ms 1744 KB Output is correct
35 Correct 1 ms 464 KB Output is correct
36 Correct 1 ms 464 KB Output is correct

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 485 ms 15116 KB Output is correct
2 Correct 3409 ms 91636 KB Output is correct
3 Correct 3100 ms 91676 KB Output is correct
4 Correct 3466 ms 133268 KB Output is correct
5 Execution timed out 4043 ms 133132 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #6
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 464 KB Output is correct
2 Correct 6 ms 1360 KB Output is correct
3 Correct 6 ms 1232 KB Output is correct
4 Correct 9 ms 1700 KB Output is correct
5 Correct 9 ms 1808 KB Output is correct
6 Correct 8 ms 1744 KB Output is correct
7 Correct 9 ms 1744 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 464 KB Output is correct
10 Correct 1 ms 480 KB Output is correct
11 Correct 2 ms 464 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 480 KB Output is correct
14 Correct 1 ms 464 KB Output is correct
15 Correct 6 ms 1380 KB Output is correct
16 Correct 9 ms 1692 KB Output is correct
17 Correct 8 ms 1744 KB Output is correct
18 Correct 1 ms 464 KB Output is correct
19 Correct 1 ms 464 KB Output is correct
20 Correct 6 ms 1256 KB Output is correct
21 Correct 9 ms 1744 KB Output is correct
22 Correct 8 ms 1744 KB Output is correct
23 Correct 1 ms 464 KB Output is correct
24 Correct 1 ms 464 KB Output is correct
25 Correct 3 ms 720 KB Output is correct
26 Correct 6 ms 1372 KB Output is correct
27 Correct 8 ms 1288 KB Output is correct
28 Correct 8 ms 1744 KB Output is correct
29 Correct 9 ms 1744 KB Output is correct
30 Correct 8 ms 1744 KB Output is correct
31 Correct 8 ms 1744 KB Output is correct
32 Correct 1 ms 464 KB Output is correct
33 Correct 1 ms 464 KB Output is correct
34 Correct 1 ms 464 KB Output is correct
35 Correct 1 ms 464 KB Output is correct
36 Correct 194 ms 50956 KB Output is correct
37 Correct 294 ms 91952 KB Output is correct
38 Correct 280 ms 91440 KB Output is correct
39 Correct 430 ms 133220 KB Output is correct
40 Correct 412 ms 133128 KB Output is correct
41 Correct 431 ms 133124 KB Output is correct
42 Correct 414 ms 133184 KB Output is correct
43 Correct 18 ms 8484 KB Output is correct
44 Correct 29 ms 8492 KB Output is correct
45 Correct 17 ms 8488 KB Output is correct
46 Correct 26 ms 8484 KB Output is correct
47 Correct 288 ms 91500 KB Output is correct
48 Correct 424 ms 133224 KB Output is correct
49 Correct 430 ms 133228 KB Output is correct
50 Correct 19 ms 8540 KB Output is correct
51 Correct 17 ms 8608 KB Output is correct
52 Correct 275 ms 91548 KB Output is correct
53 Correct 417 ms 133248 KB Output is correct
54 Correct 427 ms 133248 KB Output is correct
55 Correct 30 ms 8516 KB Output is correct
56 Correct 32 ms 8616 KB Output is correct
57 Correct 346 ms 87452 KB Output is correct
58 Correct 311 ms 91716 KB Output is correct
59 Correct 296 ms 91880 KB Output is correct
60 Correct 421 ms 133144 KB Output is correct
61 Correct 454 ms 133232 KB Output is correct
62 Correct 432 ms 133248 KB Output is correct
63 Correct 443 ms 133220 KB Output is correct
64 Correct 24 ms 8488 KB Output is correct
65 Correct 25 ms 8604 KB Output is correct
66 Correct 26 ms 8504 KB Output is correct
67 Correct 26 ms 8620 KB Output is correct
68 Correct 1716 ms 90452 KB Output is correct
69 Correct 2009 ms 91664 KB Output is correct
70 Correct 2295 ms 91544 KB Output is correct
71 Correct 2090 ms 133196 KB Output is correct
72 Correct 2204 ms 133304 KB Output is correct
73 Correct 2199 ms 133228 KB Output is correct
74 Correct 2277 ms 133132 KB Output is correct
75 Correct 1574 ms 8488 KB Output is correct
76 Correct 1874 ms 8484 KB Output is correct
77 Correct 1558 ms 8492 KB Output is correct
78 Correct 1980 ms 8612 KB Output is correct
79 Correct 1728 ms 8624 KB Output is correct
80 Correct 1704 ms 8512 KB Output is correct
81 Correct 1 ms 384 KB Output is correct
82 Correct 1 ms 464 KB Output is correct
83 Correct 1 ms 464 KB Output is correct
84 Correct 330 ms 91400 KB Output is correct
85 Correct 432 ms 133196 KB Output is correct
86 Correct 432 ms 133236 KB Output is correct
87 Correct 28 ms 8496 KB Output is correct
88 Correct 25 ms 8584 KB Output is correct
89 Correct 282 ms 91520 KB Output is correct
90 Correct 446 ms 133300 KB Output is correct
91 Correct 424 ms 133272 KB Output is correct
92 Correct 19 ms 8488 KB Output is correct
93 Correct 18 ms 8620 KB Output is correct
94 Correct 5 ms 1360 KB Output is correct
95 Correct 9 ms 1744 KB Output is correct
96 Correct 9 ms 1744 KB Output is correct
97 Correct 1 ms 464 KB Output is correct
98 Correct 1 ms 484 KB Output is correct
99 Correct 5 ms 1360 KB Output is correct
100 Correct 7 ms 1768 KB Output is correct
101 Correct 9 ms 1744 KB Output is correct
102 Correct 1 ms 464 KB Output is correct
103 Correct 1 ms 464 KB Output is correct
104 Correct 2140 ms 77708 KB Output is correct
105 Correct 2699 ms 91284 KB Output is correct
106 Correct 2297 ms 91768 KB Output is correct
107 Correct 2274 ms 133188 KB Output is correct
108 Correct 1863 ms 133232 KB Output is correct
109 Correct 2319 ms 133248 KB Output is correct
110 Correct 2459 ms 133168 KB Output is correct
111 Correct 1844 ms 8612 KB Output is correct
112 Correct 2021 ms 8668 KB Output is correct
113 Correct 1707 ms 8488 KB Output is correct
114 Correct 2098 ms 8540 KB Output is correct

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 791 ms 5192 KB Output is correct
2 Correct 1567 ms 8500 KB Output is correct
3 Correct 1527 ms 8600 KB Output is correct
4 Correct 1580 ms 8612 KB Output is correct
5 Correct 2120 ms 8512 KB Output is correct
6 Correct 1446 ms 8496 KB Output is correct
7 Correct 1986 ms 8528 KB Output is correct
8 Correct 0 ms 336 KB Output is correct
9 Correct 1 ms 464 KB Output is correct
10 Correct 1 ms 464 KB Output is correct
11 Correct 2 ms 464 KB Output is correct
12 Correct 6 ms 1360 KB Output is correct
13 Correct 6 ms 1232 KB Output is correct
14 Correct 9 ms 1700 KB Output is correct
15 Correct 9 ms 1808 KB Output is correct
16 Correct 8 ms 1744 KB Output is correct
17 Correct 9 ms 1744 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 464 KB Output is correct
20 Correct 1 ms 480 KB Output is correct
21 Correct 2 ms 464 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 1 ms 480 KB Output is correct
24 Correct 1 ms 464 KB Output is correct
25 Correct 6 ms 1380 KB Output is correct
26 Correct 9 ms 1692 KB Output is correct
27 Correct 8 ms 1744 KB Output is correct
28 Correct 1 ms 464 KB Output is correct
29 Correct 1 ms 464 KB Output is correct
30 Correct 6 ms 1256 KB Output is correct
31 Correct 9 ms 1744 KB Output is correct
32 Correct 8 ms 1744 KB Output is correct
33 Correct 1 ms 464 KB Output is correct
34 Correct 1 ms 464 KB Output is correct
35 Correct 3 ms 720 KB Output is correct
36 Correct 6 ms 1372 KB Output is correct
37 Correct 8 ms 1288 KB Output is correct
38 Correct 8 ms 1744 KB Output is correct
39 Correct 9 ms 1744 KB Output is correct
40 Correct 8 ms 1744 KB Output is correct
41 Correct 8 ms 1744 KB Output is correct
42 Correct 1 ms 464 KB Output is correct
43 Correct 1 ms 464 KB Output is correct
44 Correct 1 ms 464 KB Output is correct
45 Correct 1 ms 464 KB Output is correct
46 Correct 194 ms 50956 KB Output is correct
47 Correct 294 ms 91952 KB Output is correct
48 Correct 280 ms 91440 KB Output is correct
49 Correct 430 ms 133220 KB Output is correct
50 Correct 412 ms 133128 KB Output is correct
51 Correct 431 ms 133124 KB Output is correct
52 Correct 414 ms 133184 KB Output is correct
53 Correct 18 ms 8484 KB Output is correct
54 Correct 29 ms 8492 KB Output is correct
55 Correct 17 ms 8488 KB Output is correct
56 Correct 26 ms 8484 KB Output is correct
57 Correct 288 ms 91500 KB Output is correct
58 Correct 424 ms 133224 KB Output is correct
59 Correct 430 ms 133228 KB Output is correct
60 Correct 19 ms 8540 KB Output is correct
61 Correct 17 ms 8608 KB Output is correct
62 Correct 275 ms 91548 KB Output is correct
63 Correct 417 ms 133248 KB Output is correct
64 Correct 427 ms 133248 KB Output is correct
65 Correct 30 ms 8516 KB Output is correct
66 Correct 32 ms 8616 KB Output is correct
67 Correct 346 ms 87452 KB Output is correct
68 Correct 311 ms 91716 KB Output is correct
69 Correct 296 ms 91880 KB Output is correct
70 Correct 421 ms 133144 KB Output is correct
71 Correct 454 ms 133232 KB Output is correct
72 Correct 432 ms 133248 KB Output is correct
73 Correct 443 ms 133220 KB Output is correct
74 Correct 24 ms 8488 KB Output is correct
75 Correct 25 ms 8604 KB Output is correct
76 Correct 26 ms 8504 KB Output is correct
77 Correct 26 ms 8620 KB Output is correct
78 Correct 1716 ms 90452 KB Output is correct
79 Correct 2009 ms 91664 KB Output is correct
80 Correct 2295 ms 91544 KB Output is correct
81 Correct 2090 ms 133196 KB Output is correct
82 Correct 2204 ms 133304 KB Output is correct
83 Correct 2199 ms 133228 KB Output is correct
84 Correct 2277 ms 133132 KB Output is correct
85 Correct 1574 ms 8488 KB Output is correct
86 Correct 1874 ms 8484 KB Output is correct
87 Correct 1558 ms 8492 KB Output is correct
88 Correct 1980 ms 8612 KB Output is correct
89 Correct 1728 ms 8624 KB Output is correct
90 Correct 1704 ms 8512 KB Output is correct
91 Correct 1 ms 384 KB Output is correct
92 Correct 1 ms 464 KB Output is correct
93 Correct 1 ms 464 KB Output is correct
94 Correct 330 ms 91400 KB Output is correct
95 Correct 432 ms 133196 KB Output is correct
96 Correct 432 ms 133236 KB Output is correct
97 Correct 28 ms 8496 KB Output is correct
98 Correct 25 ms 8584 KB Output is correct
99 Correct 282 ms 91520 KB Output is correct
100 Correct 446 ms 133300 KB Output is correct
101 Correct 424 ms 133272 KB Output is correct
102 Correct 19 ms 8488 KB Output is correct
103 Correct 18 ms 8620 KB Output is correct
104 Correct 5 ms 1360 KB Output is correct
105 Correct 9 ms 1744 KB Output is correct
106 Correct 9 ms 1744 KB Output is correct
107 Correct 1 ms 464 KB Output is correct
108 Correct 1 ms 484 KB Output is correct
109 Correct 5 ms 1360 KB Output is correct
110 Correct 7 ms 1768 KB Output is correct
111 Correct 9 ms 1744 KB Output is correct
112 Correct 1 ms 464 KB Output is correct
113 Correct 1 ms 464 KB Output is correct
114 Correct 485 ms 15116 KB Output is correct
115 Correct 3409 ms 91636 KB Output is correct
116 Correct 3100 ms 91676 KB Output is correct
117 Correct 3466 ms 133268 KB Output is correct
118 Execution timed out 4043 ms 133132 KB Time limit exceeded
119 Halted 0 ms 0 KB -