답안 #388763

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
388763	2021-04-12T21:08:17 Z	SorahISA	IOI 바이러스 (JOI21_fever)	C++17	25 / 100	5000 ms	141640 KB

fever

#pragma GCC optimize("Ofast", "unroll-loops")
#include <bits/stdc++.h>
using namespace std;

// #define int long long
#define double long double
using pii = pair<int, int>;
template<typename T>
using Prior = std::priority_queue<T>;
template<typename T>
using prior = std::priority_queue<T, vector<T>, greater<T>>;

#define X first
#define Y second
#define eb emplace_back
#define ALL(x) begin(x), end(x)
#define RALL(x) rbegin(x), rend(x)
#define fastIO() ios_base::sync_with_stdio(0), cin.tie(0)

vector<pii> city;
vector<int> infect, dir;
map<int, vector<pii>> meet; /// (time |-> people meet)

void solve() {
    int n; cin >> n, city.resize(n);
    
    for (auto &[x, y] : city) cin >> x >> y;
    int x0 = city[0].X, y0 = city[0].Y;
    for (auto &[x, y] : city) x -= x0, y -= y0;
    
    auto walk = [&](int id, int t) -> pii {
        return {city[id].X + t * (dir[id] == 1) - t * (dir[id] == 2),
                city[id].Y + t * (dir[id] == 3) - t * (dir[id] == 4)};
    };
    
    int maxAns = 1;
    for (int d : {1, 2, 3, 4}) {
        /// dir: [+x, -x, +y, -y] ///
        infect.assign(n, 0), dir.assign(n, 0), meet.clear();
        infect[0] = 1, dir[0] = d;
        
        /// assign directions ///
        for (int i = 1; i < n; ++i) {
            if (abs(city[i].X) == abs(city[i].Y)) {
                if (d == 1) dir[i] = city[i].X > 0 ? (city[i].Y > 0 ? 4 : 3) : 1;
                if (d == 2) dir[i] = city[i].X < 0 ? (city[i].Y > 0 ? 4 : 3) : 2;
                if (d == 3) dir[i] = city[i].Y > 0 ? (city[i].X > 0 ? 2 : 1) : 3;
                if (d == 4) dir[i] = city[i].Y < 0 ? (city[i].X > 0 ? 2 : 1) : 4;
            }
            if (abs(city[i].X) < abs(city[i].Y)) dir[i] = city[i].Y > 0 ? 4 : 3;
            if (abs(city[i].X) > abs(city[i].Y)) dir[i] = city[i].X > 0 ? 2 : 1;
        }
        
        /// calculate meet time for every {x, y} ///
        for (int i = 0; i < n; ++i) {
            for (int j = i+1; j < n; ++j) {
                int dx = abs(city[i].X - city[j].X);
                int dy = abs(city[i].Y - city[j].Y);
                if (dx == dy and walk(i, dx) == walk(j, dx)) meet[2*dx].eb(i, j);
                if (dx == 0 and walk(i, dy) == walk(j, 0) and walk(i, 0) == walk(j, dy)) meet[dy].eb(i, j);
                if (dy == 0 and walk(i, dx) == walk(j, 0) and walk(i, 0) == walk(j, dx)) meet[dx].eb(i, j);
            }
        }
        
        /// check if infection happens ///
        for (auto [t, vec] : meet) {
            // for (int _ = 0; _ < 3; ++_) {
                for (auto [x, y] : vec) infect[x] = infect[y] = infect[x] | infect[y];
            // }
        }
        maxAns = max(maxAns, accumulate(ALL(infect), 0));
        
        // for (int i = 0; i < n; ++i) {
            // if (infect[i]) cout << i << "\n";
        // }
    }
    cout << maxAns << "\n";
}

int32_t main() {
    fastIO();
    
    int t = 1; // cin >> t;
    while (t--) solve();
    
    return 0;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
8.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	208 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	0 ms	204 KB	Output is correct
11	Correct	0 ms	204 KB	Output is correct
12	Correct	0 ms	204 KB	Output is correct
13	Correct	0 ms	204 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	1 ms	204 KB	Output is correct
17	Correct	0 ms	204 KB	Output is correct
18	Correct	0 ms	204 KB	Output is correct
19	Correct	0 ms	204 KB	Output is correct
20	Correct	0 ms	204 KB	Output is correct
21	Correct	0 ms	204 KB	Output is correct
22	Correct	0 ms	204 KB	Output is correct
23	Correct	0 ms	204 KB	Output is correct
24	Correct	1 ms	204 KB	Output is correct
25	Correct	0 ms	204 KB	Output is correct
26	Correct	0 ms	204 KB	Output is correct
27	Correct	1 ms	204 KB	Output is correct
28	Correct	0 ms	204 KB	Output is correct
29	Correct	1 ms	204 KB	Output is correct
30	Correct	0 ms	204 KB	Output is correct
31	Correct	0 ms	204 KB	Output is correct
32	Correct	0 ms	204 KB	Output is correct
33	Correct	1 ms	204 KB	Output is correct
34	Correct	0 ms	204 KB	Output is correct
35	Correct	0 ms	204 KB	Output is correct
36	Correct	0 ms	204 KB	Output is correct
37	Correct	0 ms	204 KB	Output is correct
38	Correct	0 ms	208 KB	Output is correct
39	Correct	1 ms	204 KB	Output is correct
40	Correct	0 ms	204 KB	Output is correct
41	Correct	0 ms	204 KB	Output is correct
42	Correct	0 ms	204 KB	Output is correct
43	Correct	0 ms	204 KB	Output is correct
44	Correct	0 ms	204 KB	Output is correct
45	Correct	0 ms	204 KB	Output is correct

Subtask #3
6.0 / 6.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	208 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct

Subtask #4
6.0 / 6.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	208 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	0 ms	204 KB	Output is correct
11	Correct	0 ms	204 KB	Output is correct
12	Correct	0 ms	204 KB	Output is correct
13	Correct	0 ms	204 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	1 ms	204 KB	Output is correct
17	Correct	0 ms	204 KB	Output is correct
18	Correct	0 ms	204 KB	Output is correct
19	Correct	0 ms	204 KB	Output is correct
20	Correct	0 ms	204 KB	Output is correct
21	Correct	0 ms	204 KB	Output is correct
22	Correct	0 ms	204 KB	Output is correct
23	Correct	0 ms	204 KB	Output is correct
24	Correct	1 ms	204 KB	Output is correct
25	Correct	0 ms	204 KB	Output is correct
26	Correct	0 ms	204 KB	Output is correct
27	Correct	1 ms	204 KB	Output is correct
28	Correct	0 ms	204 KB	Output is correct
29	Correct	1 ms	204 KB	Output is correct
30	Correct	0 ms	204 KB	Output is correct
31	Correct	0 ms	204 KB	Output is correct
32	Correct	0 ms	204 KB	Output is correct
33	Correct	1 ms	204 KB	Output is correct
34	Correct	0 ms	204 KB	Output is correct
35	Correct	0 ms	204 KB	Output is correct
36	Correct	0 ms	204 KB	Output is correct
37	Correct	0 ms	204 KB	Output is correct
38	Correct	0 ms	208 KB	Output is correct
39	Correct	1 ms	204 KB	Output is correct
40	Correct	0 ms	204 KB	Output is correct
41	Correct	0 ms	204 KB	Output is correct
42	Correct	0 ms	204 KB	Output is correct
43	Correct	0 ms	204 KB	Output is correct
44	Correct	0 ms	204 KB	Output is correct
45	Correct	0 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	204 KB	Output is correct
51	Correct	1 ms	204 KB	Output is correct
52	Correct	1 ms	208 KB	Output is correct
53	Correct	1 ms	204 KB	Output is correct
54	Correct	1 ms	204 KB	Output is correct
55	Correct	1 ms	204 KB	Output is correct
56	Correct	1 ms	204 KB	Output is correct
57	Correct	1 ms	204 KB	Output is correct
58	Correct	3 ms	460 KB	Output is correct
59	Correct	1 ms	332 KB	Output is correct
60	Correct	1 ms	336 KB	Output is correct
61	Correct	1 ms	204 KB	Output is correct
62	Correct	1 ms	204 KB	Output is correct
63	Correct	1 ms	204 KB	Output is correct
64	Correct	1 ms	208 KB	Output is correct
65	Correct	1 ms	332 KB	Output is correct

Subtask #5
0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	208 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	0 ms	204 KB	Output is correct
11	Correct	0 ms	204 KB	Output is correct
12	Correct	0 ms	204 KB	Output is correct
13	Correct	0 ms	204 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	1 ms	204 KB	Output is correct
17	Correct	0 ms	204 KB	Output is correct
18	Correct	0 ms	204 KB	Output is correct
19	Correct	0 ms	204 KB	Output is correct
20	Correct	0 ms	204 KB	Output is correct
21	Correct	0 ms	204 KB	Output is correct
22	Correct	0 ms	204 KB	Output is correct
23	Correct	0 ms	204 KB	Output is correct
24	Correct	1 ms	204 KB	Output is correct
25	Correct	0 ms	204 KB	Output is correct
26	Correct	0 ms	204 KB	Output is correct
27	Correct	1 ms	204 KB	Output is correct
28	Correct	0 ms	204 KB	Output is correct
29	Correct	1 ms	204 KB	Output is correct
30	Correct	0 ms	204 KB	Output is correct
31	Correct	0 ms	204 KB	Output is correct
32	Correct	0 ms	204 KB	Output is correct
33	Correct	1 ms	204 KB	Output is correct
34	Correct	0 ms	204 KB	Output is correct
35	Correct	0 ms	204 KB	Output is correct
36	Correct	0 ms	204 KB	Output is correct
37	Correct	0 ms	204 KB	Output is correct
38	Correct	0 ms	208 KB	Output is correct
39	Correct	1 ms	204 KB	Output is correct
40	Correct	0 ms	204 KB	Output is correct
41	Correct	0 ms	204 KB	Output is correct
42	Correct	0 ms	204 KB	Output is correct
43	Correct	0 ms	204 KB	Output is correct
44	Correct	0 ms	204 KB	Output is correct
45	Correct	0 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	204 KB	Output is correct
51	Correct	1 ms	204 KB	Output is correct
52	Correct	1 ms	208 KB	Output is correct
53	Correct	1 ms	204 KB	Output is correct
54	Correct	1 ms	204 KB	Output is correct
55	Correct	1 ms	204 KB	Output is correct
56	Correct	1 ms	204 KB	Output is correct
57	Correct	1 ms	204 KB	Output is correct
58	Correct	3 ms	460 KB	Output is correct
59	Correct	1 ms	332 KB	Output is correct
60	Correct	1 ms	336 KB	Output is correct
61	Correct	1 ms	204 KB	Output is correct
62	Correct	1 ms	204 KB	Output is correct
63	Correct	1 ms	204 KB	Output is correct
64	Correct	1 ms	208 KB	Output is correct
65	Correct	1 ms	332 KB	Output is correct
66	Correct	73 ms	388 KB	Output is correct
67	Correct	72 ms	412 KB	Output is correct
68	Correct	73 ms	356 KB	Output is correct
69	Correct	94 ms	844 KB	Output is correct
70	Correct	79 ms	492 KB	Output is correct
71	Correct	78 ms	464 KB	Output is correct
72	Correct	74 ms	384 KB	Output is correct
73	Correct	72 ms	344 KB	Output is correct
74	Correct	129 ms	588 KB	Output is correct
75	Correct	4411 ms	68548 KB	Output is correct
76	Correct	136 ms	2352 KB	Output is correct
77	Correct	329 ms	9044 KB	Output is correct
78	Correct	79 ms	460 KB	Output is correct
79	Correct	91 ms	500 KB	Output is correct
80	Correct	72 ms	368 KB	Output is correct
81	Correct	75 ms	508 KB	Output is correct
82	Correct	1648 ms	29608 KB	Output is correct
83	Execution timed out	5051 ms	141640 KB	Time limit exceeded
84	Halted	0 ms	0 KB	-

Subtask #6
0 / 32.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	208 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	0 ms	204 KB	Output is correct
11	Correct	0 ms	204 KB	Output is correct
12	Correct	0 ms	204 KB	Output is correct
13	Correct	0 ms	204 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	1 ms	204 KB	Output is correct
17	Correct	0 ms	204 KB	Output is correct
18	Correct	0 ms	204 KB	Output is correct
19	Correct	0 ms	204 KB	Output is correct
20	Correct	0 ms	204 KB	Output is correct
21	Correct	0 ms	204 KB	Output is correct
22	Correct	0 ms	204 KB	Output is correct
23	Correct	0 ms	204 KB	Output is correct
24	Correct	1 ms	204 KB	Output is correct
25	Correct	0 ms	204 KB	Output is correct
26	Correct	0 ms	204 KB	Output is correct
27	Correct	1 ms	204 KB	Output is correct
28	Correct	0 ms	204 KB	Output is correct
29	Correct	1 ms	204 KB	Output is correct
30	Correct	0 ms	204 KB	Output is correct
31	Correct	0 ms	204 KB	Output is correct
32	Correct	0 ms	204 KB	Output is correct
33	Correct	1 ms	204 KB	Output is correct
34	Correct	0 ms	204 KB	Output is correct
35	Correct	0 ms	204 KB	Output is correct
36	Correct	0 ms	204 KB	Output is correct
37	Correct	0 ms	204 KB	Output is correct
38	Correct	0 ms	208 KB	Output is correct
39	Correct	1 ms	204 KB	Output is correct
40	Correct	0 ms	204 KB	Output is correct
41	Correct	0 ms	204 KB	Output is correct
42	Correct	0 ms	204 KB	Output is correct
43	Correct	0 ms	204 KB	Output is correct
44	Correct	0 ms	204 KB	Output is correct
45	Correct	0 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	204 KB	Output is correct
51	Correct	1 ms	204 KB	Output is correct
52	Correct	1 ms	208 KB	Output is correct
53	Correct	1 ms	204 KB	Output is correct
54	Correct	1 ms	204 KB	Output is correct
55	Correct	1 ms	204 KB	Output is correct
56	Correct	1 ms	204 KB	Output is correct
57	Correct	1 ms	204 KB	Output is correct
58	Correct	3 ms	460 KB	Output is correct
59	Correct	1 ms	332 KB	Output is correct
60	Correct	1 ms	336 KB	Output is correct
61	Correct	1 ms	204 KB	Output is correct
62	Correct	1 ms	204 KB	Output is correct
63	Correct	1 ms	204 KB	Output is correct
64	Correct	1 ms	208 KB	Output is correct
65	Correct	1 ms	332 KB	Output is correct
66	Execution timed out	5080 ms	2732 KB	Time limit exceeded
67	Halted	0 ms	0 KB	-

Subtask #7
0 / 31.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	208 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	0 ms	204 KB	Output is correct
11	Correct	0 ms	204 KB	Output is correct
12	Correct	0 ms	204 KB	Output is correct
13	Correct	0 ms	204 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	1 ms	204 KB	Output is correct
17	Correct	0 ms	204 KB	Output is correct
18	Correct	0 ms	204 KB	Output is correct
19	Correct	0 ms	204 KB	Output is correct
20	Correct	0 ms	204 KB	Output is correct
21	Correct	0 ms	204 KB	Output is correct
22	Correct	0 ms	204 KB	Output is correct
23	Correct	0 ms	204 KB	Output is correct
24	Correct	1 ms	204 KB	Output is correct
25	Correct	0 ms	204 KB	Output is correct
26	Correct	0 ms	204 KB	Output is correct
27	Correct	1 ms	204 KB	Output is correct
28	Correct	0 ms	204 KB	Output is correct
29	Correct	1 ms	204 KB	Output is correct
30	Correct	0 ms	204 KB	Output is correct
31	Correct	0 ms	204 KB	Output is correct
32	Correct	0 ms	204 KB	Output is correct
33	Correct	1 ms	204 KB	Output is correct
34	Correct	0 ms	204 KB	Output is correct
35	Correct	0 ms	204 KB	Output is correct
36	Correct	0 ms	204 KB	Output is correct
37	Correct	0 ms	204 KB	Output is correct
38	Correct	0 ms	208 KB	Output is correct
39	Correct	1 ms	204 KB	Output is correct
40	Correct	0 ms	204 KB	Output is correct
41	Correct	0 ms	204 KB	Output is correct
42	Correct	0 ms	204 KB	Output is correct
43	Correct	0 ms	204 KB	Output is correct
44	Correct	0 ms	204 KB	Output is correct
45	Correct	0 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	204 KB	Output is correct
51	Correct	1 ms	204 KB	Output is correct
52	Correct	1 ms	208 KB	Output is correct
53	Correct	1 ms	204 KB	Output is correct
54	Correct	1 ms	204 KB	Output is correct
55	Correct	1 ms	204 KB	Output is correct
56	Correct	1 ms	204 KB	Output is correct
57	Correct	1 ms	204 KB	Output is correct
58	Correct	3 ms	460 KB	Output is correct
59	Correct	1 ms	332 KB	Output is correct
60	Correct	1 ms	336 KB	Output is correct
61	Correct	1 ms	204 KB	Output is correct
62	Correct	1 ms	204 KB	Output is correct
63	Correct	1 ms	204 KB	Output is correct
64	Correct	1 ms	208 KB	Output is correct
65	Correct	1 ms	332 KB	Output is correct
66	Correct	73 ms	388 KB	Output is correct
67	Correct	72 ms	412 KB	Output is correct
68	Correct	73 ms	356 KB	Output is correct
69	Correct	94 ms	844 KB	Output is correct
70	Correct	79 ms	492 KB	Output is correct
71	Correct	78 ms	464 KB	Output is correct
72	Correct	74 ms	384 KB	Output is correct
73	Correct	72 ms	344 KB	Output is correct
74	Correct	129 ms	588 KB	Output is correct
75	Correct	4411 ms	68548 KB	Output is correct
76	Correct	136 ms	2352 KB	Output is correct
77	Correct	329 ms	9044 KB	Output is correct
78	Correct	79 ms	460 KB	Output is correct
79	Correct	91 ms	500 KB	Output is correct
80	Correct	72 ms	368 KB	Output is correct
81	Correct	75 ms	508 KB	Output is correct
82	Correct	1648 ms	29608 KB	Output is correct
83	Execution timed out	5051 ms	141640 KB	Time limit exceeded
84	Halted	0 ms	0 KB	-

답안 #388763

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 8.0 / 8.0

Subtask #3 6.0 / 6.0

Subtask #4 6.0 / 6.0

Subtask #5 0 / 12.0

Subtask #6 0 / 32.0

Subtask #7 0 / 31.0

Subtask #1
5.0 / 5.0

Subtask #2
8.0 / 8.0

Subtask #3
6.0 / 6.0

Subtask #4
6.0 / 6.0

Subtask #5
0 / 12.0

Subtask #6
0 / 32.0

Subtask #7
0 / 31.0