oj.uz

답안 #1079620

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1079620 2024-08-28T19:00:41 Z mindiyak 꿈 (IOI13_dreaming) C++14
59 / 100
 1000 ms 16404 KB 
#pragma GCC optimize("O1,O2,O3,Ofast,unroll-loops")
#include "dreaming.h"
#include <bits/stdc++.h>
#include <string>
#include <iostream>
#include <cmath>
#include <numeric>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<int, int> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<vector<int>> vvi;
typedef vector<ld> vd;
typedef vector<long> vl;
typedef vector<ull> vull;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<vpi> vvpi;
#define FOR(i, a, b) for (int i = a; i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i, a, b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i, a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto &a : x)
#define uid(a, b) uniform_int_distribution<int>(a, b)(rng)
#define len(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define F first
#define nl endl
#define S second
#define lb lower_bound
#define ub upper_bound
#define aint(x) x.begin(), x.end()
#define raint(x) x.rbegin(), x.rend()
#define ins insert
const int MOD = 1000000007;
 
vi visited;
vvpi paths;
vi prev_arr;
int node = 0;
int maxdist = 0;
int ans = 0;
int n;
map<pair<int,int>,int> cons;
 
void dij(int pos){
    vi dist(n,-1);
    prev_arr = vi(n,-1);
 
    queue<int> p;
    p.push(pos);
    dist[pos] = 0;
 
    while(!p.empty()){
        int a = p.front();p.pop();
        visited[a] = 1;
 
        for(auto b:paths[a]){
            if(a!= pos && prev_arr[a] == b.F)continue;
            dist[b.F] = dist[a] + b.S;
            p.push(b.F);
            prev_arr[b.F] = a;
            if(dist[b.F] > maxdist){
                maxdist = dist[b.F];
                node = b.F;
            }
        }
    }
}
 
// void dij2(int pos,int mxdst){
//     vi dist(n,-1);
//     vi dist2(n,-1);
//     prev_arr = vi(n,-1);
 
//     queue<int> p;
//     p.push(pos);
//     dist[pos] = 0;
//     dist2[pos] = mxdst;
 
//     while(!p.empty()){
//         int a = p.front();p.pop();
 
//         for(auto b:paths[a]){
//             if(backtrack.count(b.F) == 0)continue;
//             if(a!= pos && prev_arr[a] == b.F)continue;
            
//             dist[b.F] = dist[a] + b.S;
//             dist2[b.F] = dist2[a] - b.S;
//             p.push(b.F);
//             prev_arr[b.F] = a;
//             if(max(dist[b.F],dist2[b.F]) < maxdist){
//                 maxdist = max(dist[b.F],dist2[b.F]);
//                 node = b.F;
//             }
//         }
//     }
// }
 
void go_back(int pos,int counter1){
    int counter2 = 0;
 
    while(prev_arr[pos] != -1){
        counter1 -= cons[{min(pos,prev_arr[pos]),max(pos,prev_arr[pos])}];
        counter2 += cons[{min(pos,prev_arr[pos]),max(pos,prev_arr[pos])}];
        maxdist = min(max(counter1,counter2),maxdist);
 
        pos = prev_arr[pos];
    }
}
 
int travelTime(int N, int m, int L, int A[], int B[], int T[]) {
    if(n==1)return 0;
    n = N;
    paths = vvpi(n);
    visited = vi(n,0);
    vi distances(n,0);
    ans = 0;
    int cnt = 0;
 
    FOR(i,0,m){
        cons[{min(A[i],B[i]),max(A[i],B[i])}] = T[i];
        paths[A[i]].pb({B[i],T[i]});
        paths[B[i]].pb({A[i],T[i]});
    }
 
    for(int i=0;i<n;i++){
        if(visited[i])continue;
        maxdist = 0;
        node = i;
        dij(i);
        // cerr << i << " " << node << " " << maxdist << endl;
 
        maxdist = 0;
        int head = node;
        node = i;
        dij(head);
        // cerr << "width " << head << " " << node << " " << maxdist << endl;
 
        ans = max(ans,maxdist);
 
        // backtrack.clear();
        go_back(node,maxdist);
 
        // cerr << "path - ";
        // for(int a:backtrack)cerr << a << " ";
        // cerr << endl;
 
        // dij2(node,maxdist);       
 
        // head = node;
        // maxdist = 0;
        // dij(head);
 
        // cerr << "center " << head << " " << maxdist << endl;
        // cerr << endl;
 
        distances[i] = maxdist;
        cnt += 1;
    }
 
    sort(distances.rbegin(),distances.rend());
 
    if(m == n-1)return ans;
 
    if(cnt >= 2)ans = max(ans,distances[0]+distances[1]+L);
    if(cnt >= 3)ans = max(ans,distances[1]+distances[2]+L+L);
 
    return ans;
    
}

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 79 ms 13948 KB Output is correct
2 Correct 93 ms 13964 KB Output is correct
3 Correct 54 ms 9096 KB Output is correct
4 Correct 12 ms 2396 KB Output is correct
5 Correct 8 ms 1884 KB Output is correct
6 Correct 21 ms 3392 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 36 ms 6416 KB Output is correct
9 Correct 49 ms 7860 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 69 ms 10812 KB Output is correct
12 Correct 113 ms 12312 KB Output is correct
13 Correct 1 ms 600 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct

Subtask #3
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 79 ms 13948 KB Output is correct
2 Correct 93 ms 13964 KB Output is correct
3 Correct 54 ms 9096 KB Output is correct
4 Correct 12 ms 2396 KB Output is correct
5 Correct 8 ms 1884 KB Output is correct
6 Correct 21 ms 3392 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 36 ms 6416 KB Output is correct
9 Correct 49 ms 7860 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 69 ms 10812 KB Output is correct
12 Correct 113 ms 12312 KB Output is correct
13 Correct 1 ms 600 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 344 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 0 ms 344 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 79 ms 13956 KB Output is correct
40 Correct 111 ms 13928 KB Output is correct
41 Correct 54 ms 9100 KB Output is correct
42 Correct 15 ms 2396 KB Output is correct
43 Correct 1 ms 348 KB Output is correct
44 Correct 1 ms 348 KB Output is correct
45 Correct 1 ms 348 KB Output is correct
46 Correct 1 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 1 ms 348 KB Output is correct
50 Correct 0 ms 344 KB Output is correct
51 Correct 0 ms 344 KB Output is correct
52 Correct 1 ms 348 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Correct 0 ms 348 KB Output is correct
56 Correct 0 ms 344 KB Output is correct
57 Correct 116 ms 16060 KB Output is correct
58 Correct 83 ms 16152 KB Output is correct
59 Correct 87 ms 15936 KB Output is correct
60 Correct 80 ms 15920 KB Output is correct
61 Correct 87 ms 15940 KB Output is correct
62 Correct 74 ms 16272 KB Output is correct
63 Correct 77 ms 15816 KB Output is correct
64 Correct 103 ms 15820 KB Output is correct
65 Correct 77 ms 15820 KB Output is correct
66 Correct 82 ms 15804 KB Output is correct
67 Correct 92 ms 15924 KB Output is correct
68 Correct 72 ms 16024 KB Output is correct
69 Correct 75 ms 16196 KB Output is correct
70 Correct 103 ms 15956 KB Output is correct
71 Correct 1 ms 348 KB Output is correct
72 Correct 2 ms 908 KB Output is correct
73 Correct 2 ms 860 KB Output is correct
74 Correct 2 ms 860 KB Output is correct
75 Correct 2 ms 860 KB Output is correct
76 Correct 2 ms 860 KB Output is correct
77 Correct 2 ms 1112 KB Output is correct
78 Correct 2 ms 860 KB Output is correct
79 Correct 2 ms 860 KB Output is correct
80 Correct 81 ms 16404 KB Output is correct
81 Correct 101 ms 15940 KB Output is correct
82 Correct 79 ms 15896 KB Output is correct
83 Correct 71 ms 15964 KB Output is correct
84 Correct 1 ms 600 KB Output is correct
85 Correct 1 ms 604 KB Output is correct
86 Correct 1 ms 856 KB Output is correct
87 Correct 3 ms 604 KB Output is correct
88 Correct 2 ms 860 KB Output is correct
89 Correct 1 ms 860 KB Output is correct
90 Correct 2 ms 600 KB Output is correct
91 Correct 3 ms 860 KB Output is correct
92 Correct 3 ms 860 KB Output is correct
93 Correct 1 ms 760 KB Output is correct
94 Correct 0 ms 348 KB Output is correct
95 Correct 0 ms 344 KB Output is correct
96 Correct 0 ms 348 KB Output is correct
97 Correct 0 ms 348 KB Output is correct
98 Correct 1 ms 348 KB Output is correct
99 Correct 0 ms 348 KB Output is correct
100 Correct 1 ms 348 KB Output is correct
101 Correct 1 ms 348 KB Output is correct
102 Correct 0 ms 348 KB Output is correct
103 Correct 0 ms 348 KB Output is correct
104 Correct 8 ms 1884 KB Output is correct
105 Correct 17 ms 3216 KB Output is correct
106 Correct 1 ms 344 KB Output is correct
107 Correct 38 ms 6316 KB Output is correct
108 Correct 47 ms 7824 KB Output is correct
109 Correct 1 ms 348 KB Output is correct
110 Correct 84 ms 10812 KB Output is correct
111 Correct 80 ms 12312 KB Output is correct
112 Correct 1 ms 348 KB Output is correct
113 Correct 132 ms 15168 KB Output is correct

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1049 ms 8680 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 2 ms 344 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 4 ms 860 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 2 ms 716 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 2 ms 604 KB Output is correct
34 Correct 4 ms 720 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 344 KB Output is correct
44 Correct 1 ms 348 KB Output is correct
45 Correct 1 ms 348 KB Output is correct
46 Correct 1 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 1 ms 348 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 2 ms 860 KB Output is correct
55 Correct 4 ms 860 KB Output is correct
56 Correct 3 ms 604 KB Output is correct
57 Correct 3 ms 604 KB Output is correct
58 Correct 2 ms 860 KB Output is correct
59 Correct 3 ms 908 KB Output is correct
60 Correct 3 ms 604 KB Output is correct
61 Correct 3 ms 680 KB Output is correct
62 Correct 2 ms 860 KB Output is correct
63 Correct 2 ms 700 KB Output is correct
64 Correct 5 ms 604 KB Output is correct
65 Correct 3 ms 600 KB Output is correct
66 Correct 2 ms 860 KB Output is correct
67 Correct 2 ms 860 KB Output is correct
68 Correct 3 ms 604 KB Output is correct
69 Correct 5 ms 816 KB Output is correct
70 Correct 3 ms 604 KB Output is correct
71 Correct 5 ms 600 KB Output is correct
72 Correct 2 ms 856 KB Output is correct
73 Correct 2 ms 860 KB Output is correct
74 Correct 4 ms 856 KB Output is correct
75 Correct 3 ms 896 KB Output is correct
76 Correct 2 ms 856 KB Output is correct
77 Correct 2 ms 856 KB Output is correct
78 Correct 5 ms 604 KB Output is correct
79 Correct 3 ms 604 KB Output is correct
80 Correct 3 ms 348 KB Output is correct
81 Correct 3 ms 348 KB Output is correct
82 Correct 2 ms 860 KB Output is correct
83 Correct 4 ms 860 KB Output is correct
84 Correct 3 ms 604 KB Output is correct
85 Correct 3 ms 604 KB Output is correct
86 Correct 4 ms 604 KB Output is correct
87 Correct 2 ms 860 KB Output is correct
88 Correct 3 ms 796 KB Output is correct
89 Correct 3 ms 600 KB Output is correct
90 Correct 3 ms 728 KB Output is correct
91 Correct 3 ms 600 KB Output is correct
92 Correct 1 ms 604 KB Output is correct
93 Correct 1 ms 604 KB Output is correct
94 Correct 2 ms 604 KB Output is correct
95 Correct 3 ms 604 KB Output is correct
96 Correct 1 ms 856 KB Output is correct
97 Correct 3 ms 604 KB Output is correct
98 Correct 2 ms 604 KB Output is correct
99 Correct 2 ms 864 KB Output is correct
100 Correct 2 ms 864 KB Output is correct
101 Correct 3 ms 608 KB Output is correct
102 Correct 0 ms 352 KB Output is correct
103 Correct 1 ms 352 KB Output is correct
104 Correct 0 ms 604 KB Output is correct
105 Correct 0 ms 352 KB Output is correct
106 Correct 0 ms 348 KB Output is correct
107 Correct 0 ms 360 KB Output is correct
108 Correct 0 ms 352 KB Output is correct
109 Correct 0 ms 352 KB Output is correct
110 Correct 1 ms 352 KB Output is correct
111 Correct 1 ms 360 KB Output is correct
112 Correct 1 ms 360 KB Output is correct
113 Correct 1 ms 360 KB Output is correct
114 Correct 1 ms 360 KB Output is correct

Subtask #6
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 79 ms 13948 KB Output is correct
2 Correct 93 ms 13964 KB Output is correct
3 Correct 54 ms 9096 KB Output is correct
4 Correct 12 ms 2396 KB Output is correct
5 Correct 8 ms 1884 KB Output is correct
6 Correct 21 ms 3392 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 36 ms 6416 KB Output is correct
9 Correct 49 ms 7860 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 69 ms 10812 KB Output is correct
12 Correct 113 ms 12312 KB Output is correct
13 Correct 1 ms 600 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 344 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 0 ms 344 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 79 ms 13956 KB Output is correct
40 Correct 111 ms 13928 KB Output is correct
41 Correct 54 ms 9100 KB Output is correct
42 Correct 15 ms 2396 KB Output is correct
43 Correct 1 ms 348 KB Output is correct
44 Correct 1 ms 348 KB Output is correct
45 Correct 1 ms 348 KB Output is correct
46 Correct 1 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 1 ms 348 KB Output is correct
50 Correct 0 ms 344 KB Output is correct
51 Correct 0 ms 344 KB Output is correct
52 Correct 1 ms 348 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Correct 0 ms 348 KB Output is correct
56 Correct 0 ms 344 KB Output is correct
57 Correct 116 ms 16060 KB Output is correct
58 Correct 83 ms 16152 KB Output is correct
59 Correct 87 ms 15936 KB Output is correct
60 Correct 80 ms 15920 KB Output is correct
61 Correct 87 ms 15940 KB Output is correct
62 Correct 74 ms 16272 KB Output is correct
63 Correct 77 ms 15816 KB Output is correct
64 Correct 103 ms 15820 KB Output is correct
65 Correct 77 ms 15820 KB Output is correct
66 Correct 82 ms 15804 KB Output is correct
67 Correct 92 ms 15924 KB Output is correct
68 Correct 72 ms 16024 KB Output is correct
69 Correct 75 ms 16196 KB Output is correct
70 Correct 103 ms 15956 KB Output is correct
71 Correct 1 ms 348 KB Output is correct
72 Correct 2 ms 908 KB Output is correct
73 Correct 2 ms 860 KB Output is correct
74 Correct 2 ms 860 KB Output is correct
75 Correct 2 ms 860 KB Output is correct
76 Correct 2 ms 860 KB Output is correct
77 Correct 2 ms 1112 KB Output is correct
78 Correct 2 ms 860 KB Output is correct
79 Correct 2 ms 860 KB Output is correct
80 Correct 81 ms 16404 KB Output is correct
81 Correct 101 ms 15940 KB Output is correct
82 Correct 79 ms 15896 KB Output is correct
83 Correct 71 ms 15964 KB Output is correct
84 Correct 1 ms 600 KB Output is correct
85 Correct 1 ms 604 KB Output is correct
86 Correct 1 ms 856 KB Output is correct
87 Correct 3 ms 604 KB Output is correct
88 Correct 2 ms 860 KB Output is correct
89 Correct 1 ms 860 KB Output is correct
90 Correct 2 ms 600 KB Output is correct
91 Correct 3 ms 860 KB Output is correct
92 Correct 3 ms 860 KB Output is correct
93 Correct 1 ms 760 KB Output is correct
94 Correct 0 ms 348 KB Output is correct
95 Correct 0 ms 344 KB Output is correct
96 Correct 0 ms 348 KB Output is correct
97 Correct 0 ms 348 KB Output is correct
98 Correct 1 ms 348 KB Output is correct
99 Correct 0 ms 348 KB Output is correct
100 Correct 1 ms 348 KB Output is correct
101 Correct 1 ms 348 KB Output is correct
102 Correct 0 ms 348 KB Output is correct
103 Correct 0 ms 348 KB Output is correct
104 Correct 8 ms 1884 KB Output is correct
105 Correct 17 ms 3216 KB Output is correct
106 Correct 1 ms 344 KB Output is correct
107 Correct 38 ms 6316 KB Output is correct
108 Correct 47 ms 7824 KB Output is correct
109 Correct 1 ms 348 KB Output is correct
110 Correct 84 ms 10812 KB Output is correct
111 Correct 80 ms 12312 KB Output is correct
112 Correct 1 ms 348 KB Output is correct
113 Correct 132 ms 15168 KB Output is correct
114 Execution timed out 1049 ms 8680 KB Time limit exceeded
115 Halted 0 ms 0 KB -