oj.uz

Submission #399044

# Submission time Handle Problem Language Result Execution time Memory
399044 2021-05-05T07:32:51 Z ACmachine Dreaming (IOI13_dreaming) C++17
59 / 100
 1000 ms 19644 KB 
#include "dreaming.h"
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename U> using ordered_map = tree<T, U, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

typedef long long ll;
typedef long double ld;

typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef vector<int> vi;
typedef vector<ll> vll;

#define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
#define FORD(i,j,k,in) for(int i=(j); i >=(k);i-=in)
#define REP(i,b) FOR(i,0,b,1)
#define REPD(i,b) FORD(i,b,0,1)
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(x) begin(x), end(x)
#define MANY_TESTS int tcase; cin >> tcase; while(tcase--)

const double EPS = 1e-9;
const int MOD = 1e9+7;
const ll INFF = 1e18;
const int INF = 1e9;
const ld PI = acos((ld)-1);
const vi dy = {1, 0, -1, 0, -1, 1, 1, -1};
const vi dx = {0, 1, 0, -1, -1, 1, -1, 1};

void DBG(){cout << "]" << endl;}
template<typename T, typename ...U> void DBG(const T& head, const U... args){ cout << head << "; "; DBG(args...); }
#define dbg(...) cout << "Line(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__);
#define chk() cout << "Check at line(" << __LINE__ << ") hit." << endl;

template<class T, unsigned int U>
ostream& operator<<(ostream& out, const array<T, U> &v){out << "[";  REP(i, U) out << v[i] << ", ";  out << "]"; return out;}
template <class T, class U>
ostream& operator<<(ostream& out, const pair<T, U> &par) {out << "[" << par.first << ";" << par.second << "]"; return out;}
template <class T>
ostream& operator<<(ostream& out, const set<T> &cont) { out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template <class T, class U>
ostream& operator<<(ostream& out, const map<T, U> &cont) {out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template<class T>
ostream& operator<<(ostream& out, const vector<T> &v){ out << "[";  REP(i, v.size()) out << v[i] << ", ";  out << "]"; return out;}

template<class T>
istream& operator>>(istream& in, vector<T> &v){ for(auto &x : v) in >> x; return in; }

int travelTime(int n, int m, int l, int A[], int B[], int T[]) {
    vector<int> dist(n, -1);
    vector<int> dist2(n, -1);
    vector<bool> visited(n, false);
    auto get_partition = [&](vector<vector<array<int, 2>>> &g, int s){
        vector<int> curr_visited;
        function<void(int, int, vector<int>&)> dfs = [&](int v, int p, vector<int> &dist){
            curr_visited.pb(v);
            if(p == -1) dist[v] = 0;
            for(auto x : g[v]){
                if(x[0] == p) continue;
                dist[x[0]] = dist[v] + x[1];
                dfs(x[0], v, dist);
            }
        };
        dfs(s, -1, dist);
        curr_visited.clear();
        int fd = max_element(all(dist)) - dist.begin();
        dfs(fd, -1, dist2);
        curr_visited.clear();
        int sd = max_element(all(dist2)) - dist2.begin();
        dfs(sd, -1, dist);
        array<int, 3> res = {INF, INF, -1};
        for(int v : curr_visited){
            if(dist[v] + dist2[v] < res[0] + res[1]){ // guarantees having vertex at the diameter, then we pick middle based on difference between 2
                res = {dist[v], dist2[v], v};
            }
            else if(dist[v] + dist2[v] == res[0] + res[1] && abs(dist[v] - dist2[v]) < abs(res[0] - res[1])){
                res = {dist[v], dist2[v], v};
            }
        }
        // mark component
        for(int v : curr_visited){
            visited[v] = true;
            dist[v] = dist2[v] = -1;
        }
        if(res[0] < res[1])
            swap(res[0], res[1]);
        return res;
    };
    vector<vector<array<int, 2>>> g(n);
    REP(i, m){
        g[A[i]].pb({B[i], T[i]});
        g[B[i]].pb({A[i], T[i]});
    }
    vector<array<int, 3>> partitions;
    REP(i, n){
        if(!visited[i]){
            partitions.pb(get_partition(g, i));
        }
    }
    sort(all(partitions), greater<array<int, 3>>());
    int first_ver = partitions[0][2];
    FOR(i, 1, partitions.size(), 1){
        int second_ver = partitions[i][2];
        g[first_ver].pb({second_ver, l});
        g[second_ver].pb({first_ver, l});
    }
    fill(all(visited), false);
    auto ans = get_partition(g, 0);
    return ans[0] + ans[1];

}

Compilation message

dreaming.cpp: In function 'int travelTime(int, int, int, int*, int*, int*)':
dreaming.cpp:20:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::array<int, 3> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   20 | #define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
      |                                        ^
dreaming.cpp:111:5: note: in expansion of macro 'FOR'
  111 |     FOR(i, 1, partitions.size(), 1){
      |     ^~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 105 ms 17372 KB Output is correct
2 Correct 86 ms 17708 KB Output is correct
3 Correct 51 ms 11724 KB Output is correct
4 Correct 10 ms 2764 KB Output is correct
5 Correct 9 ms 1720 KB Output is correct
6 Correct 19 ms 4144 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 38 ms 6400 KB Output is correct
9 Correct 55 ms 8908 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 83 ms 11788 KB Output is correct
12 Correct 100 ms 14632 KB Output is correct
13 Correct 1 ms 332 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 304 KB Output is correct
4 Correct 1 ms 304 KB Output is correct
5 Correct 1 ms 300 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 308 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 300 KB Output is correct
18 Correct 1 ms 296 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 105 ms 17372 KB Output is correct
2 Correct 86 ms 17708 KB Output is correct
3 Correct 51 ms 11724 KB Output is correct
4 Correct 10 ms 2764 KB Output is correct
5 Correct 9 ms 1720 KB Output is correct
6 Correct 19 ms 4144 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 38 ms 6400 KB Output is correct
9 Correct 55 ms 8908 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 83 ms 11788 KB Output is correct
12 Correct 100 ms 14632 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 304 KB Output is correct
17 Correct 1 ms 304 KB Output is correct
18 Correct 1 ms 300 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 308 KB Output is correct
24 Correct 1 ms 208 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 208 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 300 KB Output is correct
31 Correct 1 ms 296 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 1 ms 204 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 85 ms 17664 KB Output is correct
40 Correct 83 ms 17632 KB Output is correct
41 Correct 52 ms 11800 KB Output is correct
42 Correct 10 ms 2876 KB Output is correct
43 Correct 1 ms 204 KB Output is correct
44 Correct 1 ms 204 KB Output is correct
45 Correct 1 ms 204 KB Output is correct
46 Correct 1 ms 204 KB Output is correct
47 Correct 1 ms 304 KB Output is correct
48 Correct 1 ms 204 KB Output is correct
49 Correct 1 ms 204 KB Output is correct
50 Correct 1 ms 304 KB Output is correct
51 Correct 1 ms 204 KB Output is correct
52 Correct 1 ms 204 KB Output is correct
53 Correct 1 ms 204 KB Output is correct
54 Correct 1 ms 300 KB Output is correct
55 Correct 1 ms 204 KB Output is correct
56 Correct 1 ms 204 KB Output is correct
57 Correct 114 ms 10820 KB Output is correct
58 Correct 115 ms 10688 KB Output is correct
59 Correct 126 ms 10840 KB Output is correct
60 Correct 116 ms 10636 KB Output is correct
61 Correct 108 ms 10884 KB Output is correct
62 Correct 105 ms 10636 KB Output is correct
63 Correct 105 ms 10428 KB Output is correct
64 Correct 105 ms 10428 KB Output is correct
65 Correct 103 ms 10712 KB Output is correct
66 Correct 104 ms 10796 KB Output is correct
67 Correct 116 ms 10716 KB Output is correct
68 Correct 115 ms 10784 KB Output is correct
69 Correct 121 ms 10936 KB Output is correct
70 Correct 121 ms 10924 KB Output is correct
71 Correct 1 ms 204 KB Output is correct
72 Correct 3 ms 588 KB Output is correct
73 Correct 3 ms 588 KB Output is correct
74 Correct 3 ms 588 KB Output is correct
75 Correct 3 ms 716 KB Output is correct
76 Correct 3 ms 588 KB Output is correct
77 Correct 3 ms 612 KB Output is correct
78 Correct 3 ms 588 KB Output is correct
79 Correct 3 ms 568 KB Output is correct
80 Correct 116 ms 10808 KB Output is correct
81 Correct 113 ms 10796 KB Output is correct
82 Correct 106 ms 10804 KB Output is correct
83 Correct 109 ms 10788 KB Output is correct
84 Correct 2 ms 460 KB Output is correct
85 Correct 2 ms 460 KB Output is correct
86 Correct 2 ms 460 KB Output is correct
87 Correct 2 ms 460 KB Output is correct
88 Correct 2 ms 588 KB Output is correct
89 Correct 2 ms 460 KB Output is correct
90 Correct 2 ms 460 KB Output is correct
91 Correct 3 ms 588 KB Output is correct
92 Correct 3 ms 572 KB Output is correct
93 Correct 2 ms 588 KB Output is correct
94 Correct 1 ms 204 KB Output is correct
95 Correct 1 ms 204 KB Output is correct
96 Correct 1 ms 204 KB Output is correct
97 Correct 1 ms 308 KB Output is correct
98 Correct 1 ms 204 KB Output is correct
99 Correct 1 ms 296 KB Output is correct
100 Correct 1 ms 204 KB Output is correct
101 Correct 1 ms 204 KB Output is correct
102 Correct 1 ms 204 KB Output is correct
103 Correct 1 ms 300 KB Output is correct
104 Correct 9 ms 1740 KB Output is correct
105 Correct 18 ms 4168 KB Output is correct
106 Correct 1 ms 332 KB Output is correct
107 Correct 39 ms 6376 KB Output is correct
108 Correct 51 ms 8864 KB Output is correct
109 Correct 1 ms 304 KB Output is correct
110 Correct 77 ms 11872 KB Output is correct
111 Correct 100 ms 14672 KB Output is correct
112 Correct 1 ms 332 KB Output is correct
113 Correct 151 ms 19644 KB Output is correct

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1088 ms 6140 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 304 KB Output is correct
4 Correct 1 ms 304 KB Output is correct
5 Correct 1 ms 300 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 308 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 300 KB Output is correct
18 Correct 1 ms 296 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 2 ms 332 KB Output is correct
27 Correct 5 ms 464 KB Output is correct
28 Correct 10 ms 588 KB Output is correct
29 Correct 2 ms 332 KB Output is correct
30 Correct 5 ms 460 KB Output is correct
31 Correct 9 ms 580 KB Output is correct
32 Correct 2 ms 332 KB Output is correct
33 Correct 5 ms 460 KB Output is correct
34 Correct 9 ms 588 KB Output is correct
35 Correct 1 ms 304 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 1 ms 204 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 1 ms 204 KB Output is correct
41 Correct 1 ms 204 KB Output is correct
42 Correct 1 ms 204 KB Output is correct
43 Correct 1 ms 204 KB Output is correct
44 Correct 1 ms 204 KB Output is correct
45 Correct 1 ms 204 KB Output is correct
46 Correct 1 ms 204 KB Output is correct
47 Correct 1 ms 204 KB Output is correct
48 Correct 1 ms 204 KB Output is correct
49 Correct 1 ms 204 KB Output is correct
50 Correct 1 ms 304 KB Output is correct
51 Correct 1 ms 308 KB Output is correct
52 Correct 1 ms 204 KB Output is correct
53 Correct 1 ms 204 KB Output is correct
54 Correct 3 ms 844 KB Output is correct
55 Correct 3 ms 844 KB Output is correct
56 Correct 25 ms 588 KB Output is correct
57 Correct 40 ms 488 KB Output is correct
58 Correct 3 ms 588 KB Output is correct
59 Correct 3 ms 588 KB Output is correct
60 Correct 29 ms 588 KB Output is correct
61 Correct 36 ms 484 KB Output is correct
62 Correct 3 ms 588 KB Output is correct
63 Correct 3 ms 588 KB Output is correct
64 Correct 46 ms 588 KB Output is correct
65 Correct 22 ms 588 KB Output is correct
66 Correct 3 ms 588 KB Output is correct
67 Correct 3 ms 588 KB Output is correct
68 Correct 19 ms 552 KB Output is correct
69 Correct 18 ms 580 KB Output is correct
70 Correct 34 ms 560 KB Output is correct
71 Correct 34 ms 560 KB Output is correct
72 Correct 3 ms 588 KB Output is correct
73 Correct 3 ms 588 KB Output is correct
74 Correct 6 ms 588 KB Output is correct
75 Correct 5 ms 588 KB Output is correct
76 Correct 3 ms 588 KB Output is correct
77 Correct 3 ms 592 KB Output is correct
78 Correct 35 ms 504 KB Output is correct
79 Correct 34 ms 504 KB Output is correct
80 Correct 47 ms 564 KB Output is correct
81 Correct 48 ms 544 KB Output is correct
82 Correct 9 ms 568 KB Output is correct
83 Correct 8 ms 624 KB Output is correct
84 Correct 33 ms 488 KB Output is correct
85 Correct 45 ms 460 KB Output is correct
86 Correct 20 ms 588 KB Output is correct
87 Correct 7 ms 588 KB Output is correct
88 Correct 21 ms 552 KB Output is correct
89 Correct 23 ms 548 KB Output is correct
90 Correct 31 ms 536 KB Output is correct
91 Correct 33 ms 504 KB Output is correct
92 Correct 2 ms 460 KB Output is correct
93 Correct 2 ms 460 KB Output is correct
94 Correct 2 ms 464 KB Output is correct
95 Correct 3 ms 460 KB Output is correct
96 Correct 2 ms 588 KB Output is correct
97 Correct 3 ms 460 KB Output is correct
98 Correct 2 ms 588 KB Output is correct
99 Correct 3 ms 588 KB Output is correct
100 Correct 3 ms 588 KB Output is correct
101 Correct 2 ms 588 KB Output is correct
102 Correct 1 ms 204 KB Output is correct
103 Correct 1 ms 308 KB Output is correct
104 Correct 1 ms 204 KB Output is correct
105 Correct 1 ms 216 KB Output is correct
106 Correct 1 ms 216 KB Output is correct
107 Correct 1 ms 212 KB Output is correct
108 Correct 1 ms 204 KB Output is correct
109 Correct 1 ms 216 KB Output is correct
110 Correct 1 ms 216 KB Output is correct
111 Correct 1 ms 216 KB Output is correct
112 Correct 1 ms 344 KB Output is correct
113 Correct 2 ms 344 KB Output is correct
114 Correct 1 ms 344 KB Output is correct

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 105 ms 17372 KB Output is correct
2 Correct 86 ms 17708 KB Output is correct
3 Correct 51 ms 11724 KB Output is correct
4 Correct 10 ms 2764 KB Output is correct
5 Correct 9 ms 1720 KB Output is correct
6 Correct 19 ms 4144 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 38 ms 6400 KB Output is correct
9 Correct 55 ms 8908 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 83 ms 11788 KB Output is correct
12 Correct 100 ms 14632 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 304 KB Output is correct
17 Correct 1 ms 304 KB Output is correct
18 Correct 1 ms 300 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 308 KB Output is correct
24 Correct 1 ms 208 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 208 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 300 KB Output is correct
31 Correct 1 ms 296 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 1 ms 204 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 85 ms 17664 KB Output is correct
40 Correct 83 ms 17632 KB Output is correct
41 Correct 52 ms 11800 KB Output is correct
42 Correct 10 ms 2876 KB Output is correct
43 Correct 1 ms 204 KB Output is correct
44 Correct 1 ms 204 KB Output is correct
45 Correct 1 ms 204 KB Output is correct
46 Correct 1 ms 204 KB Output is correct
47 Correct 1 ms 304 KB Output is correct
48 Correct 1 ms 204 KB Output is correct
49 Correct 1 ms 204 KB Output is correct
50 Correct 1 ms 304 KB Output is correct
51 Correct 1 ms 204 KB Output is correct
52 Correct 1 ms 204 KB Output is correct
53 Correct 1 ms 204 KB Output is correct
54 Correct 1 ms 300 KB Output is correct
55 Correct 1 ms 204 KB Output is correct
56 Correct 1 ms 204 KB Output is correct
57 Correct 114 ms 10820 KB Output is correct
58 Correct 115 ms 10688 KB Output is correct
59 Correct 126 ms 10840 KB Output is correct
60 Correct 116 ms 10636 KB Output is correct
61 Correct 108 ms 10884 KB Output is correct
62 Correct 105 ms 10636 KB Output is correct
63 Correct 105 ms 10428 KB Output is correct
64 Correct 105 ms 10428 KB Output is correct
65 Correct 103 ms 10712 KB Output is correct
66 Correct 104 ms 10796 KB Output is correct
67 Correct 116 ms 10716 KB Output is correct
68 Correct 115 ms 10784 KB Output is correct
69 Correct 121 ms 10936 KB Output is correct
70 Correct 121 ms 10924 KB Output is correct
71 Correct 1 ms 204 KB Output is correct
72 Correct 3 ms 588 KB Output is correct
73 Correct 3 ms 588 KB Output is correct
74 Correct 3 ms 588 KB Output is correct
75 Correct 3 ms 716 KB Output is correct
76 Correct 3 ms 588 KB Output is correct
77 Correct 3 ms 612 KB Output is correct
78 Correct 3 ms 588 KB Output is correct
79 Correct 3 ms 568 KB Output is correct
80 Correct 116 ms 10808 KB Output is correct
81 Correct 113 ms 10796 KB Output is correct
82 Correct 106 ms 10804 KB Output is correct
83 Correct 109 ms 10788 KB Output is correct
84 Correct 2 ms 460 KB Output is correct
85 Correct 2 ms 460 KB Output is correct
86 Correct 2 ms 460 KB Output is correct
87 Correct 2 ms 460 KB Output is correct
88 Correct 2 ms 588 KB Output is correct
89 Correct 2 ms 460 KB Output is correct
90 Correct 2 ms 460 KB Output is correct
91 Correct 3 ms 588 KB Output is correct
92 Correct 3 ms 572 KB Output is correct
93 Correct 2 ms 588 KB Output is correct
94 Correct 1 ms 204 KB Output is correct
95 Correct 1 ms 204 KB Output is correct
96 Correct 1 ms 204 KB Output is correct
97 Correct 1 ms 308 KB Output is correct
98 Correct 1 ms 204 KB Output is correct
99 Correct 1 ms 296 KB Output is correct
100 Correct 1 ms 204 KB Output is correct
101 Correct 1 ms 204 KB Output is correct
102 Correct 1 ms 204 KB Output is correct
103 Correct 1 ms 300 KB Output is correct
104 Correct 9 ms 1740 KB Output is correct
105 Correct 18 ms 4168 KB Output is correct
106 Correct 1 ms 332 KB Output is correct
107 Correct 39 ms 6376 KB Output is correct
108 Correct 51 ms 8864 KB Output is correct
109 Correct 1 ms 304 KB Output is correct
110 Correct 77 ms 11872 KB Output is correct
111 Correct 100 ms 14672 KB Output is correct
112 Correct 1 ms 332 KB Output is correct
113 Correct 151 ms 19644 KB Output is correct
114 Execution timed out 1088 ms 6140 KB Time limit exceeded
115 Halted 0 ms 0 KB -