답안 #825002

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
825002	2023-08-14T13:06:46 Z	LittleCube	송신탑 (IOI22_towers)	C++17	23 / 100	4000 ms	3492 KB

towers

#include "towers.h"
#include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define F first
#define S second
using namespace std;

namespace
{
  int N;
  vector<int> H, p, l, r, vis;
}

void init(int _N, vector<int> _H)
{
  H = _H;
}

int max_towers(int L, int R, int D)
{
  H = vector<int>(H.begin() + L, H.begin() + R + 1);
  N = (int)H.size();
  H.emplace_back(2e9);

  p = vector<int>(N + 1, 0);
  vis = vector<int>(N + 1, 0);
  l = r = p;
  vector<int> mono = {N};
  
  for (int i = 0; i <= N; i++)
  {
    while (H[mono.back()] < H[i])
      r[mono.back()] = i, mono.pop_back();
    l[i] = mono.back();
    mono.push_back(i);
  }

  for (int i = 0; i < N; i++)
    if (H[l[i]] < H[r[i]])
      p[i] = l[i];
    else
      p[i] = r[i];

  vector<int> v;
  for (int i = 0; i < N; i++)
    vis[p[i]] = 1;
  for (int i = 0; i < N; i++)
    if (!vis[i])
      v.emplace_back(i);
  sort(v.begin(), v.end(), [&](int i, int j)
       { return H[i] < H[j]; });

  for (int i = 0; i < N; i++)
    vis[i] = 0;
  int ans = 0;
  for (auto i : v)
    if (!vis[i])
    {
      int c = i;
      bool flag = 1;
      while (c != N)
      {
        if (H[c] < H[i] + D && vis[c])
          flag = 0;
        vis[c] = 1;
        c = p[c];
      }
      if (flag)
        ans++;
    }
  return ans;
}

Subtask #1
0 / 4.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	208 KB	Output is correct
2	Correct	1 ms	208 KB	Output is correct
3	Correct	1 ms	208 KB	Output is correct
4	Correct	1 ms	208 KB	Output is correct
5	Correct	1 ms	208 KB	Output is correct
6	Correct	0 ms	208 KB	Output is correct
7	Correct	1 ms	208 KB	Output is correct
8	Correct	1 ms	208 KB	Output is correct
9	Correct	0 ms	208 KB	Output is correct
10	Correct	1 ms	208 KB	Output is correct
11	Correct	0 ms	208 KB	Output is correct
12	Correct	0 ms	208 KB	Output is correct
13	Correct	1 ms	208 KB	Output is correct
14	Correct	1 ms	208 KB	Output is correct
15	Correct	0 ms	208 KB	Output is correct
16	Correct	1 ms	336 KB	Output is correct
17	Correct	1 ms	208 KB	Output is correct
18	Correct	1 ms	208 KB	Output is correct
19	Correct	0 ms	208 KB	Output is correct
20	Correct	1 ms	336 KB	Output is correct
21	Correct	1 ms	336 KB	Output is correct
22	Correct	1 ms	336 KB	Output is correct
23	Correct	1 ms	336 KB	Output is correct
24	Correct	0 ms	336 KB	Output is correct
25	Correct	1 ms	208 KB	Output is correct
26	Correct	1 ms	336 KB	Output is correct
27	Correct	1 ms	336 KB	Output is correct
28	Correct	1 ms	336 KB	Output is correct
29	Correct	1 ms	336 KB	Output is correct
30	Correct	1 ms	336 KB	Output is correct
31	Correct	1 ms	336 KB	Output is correct
32	Correct	1 ms	336 KB	Output is correct
33	Correct	1 ms	336 KB	Output is correct
34	Correct	1 ms	336 KB	Output is correct
35	Correct	1 ms	336 KB	Output is correct
36	Correct	7 ms	976 KB	Output is correct
37	Correct	11 ms	1444 KB	Output is correct
38	Correct	9 ms	1444 KB	Output is correct
39	Correct	11 ms	1464 KB	Output is correct
40	Correct	10 ms	1464 KB	Output is correct
41	Correct	18 ms	2712 KB	Output is correct
42	Correct	9 ms	1440 KB	Output is correct
43	Correct	10 ms	1672 KB	Output is correct
44	Correct	9 ms	1440 KB	Output is correct
45	Correct	13 ms	1448 KB	Output is correct
46	Correct	9 ms	1448 KB	Output is correct
47	Correct	11 ms	1464 KB	Output is correct
48	Correct	13 ms	1460 KB	Output is correct
49	Correct	9 ms	1436 KB	Output is correct
50	Correct	11 ms	1452 KB	Output is correct
51	Correct	9 ms	1456 KB	Output is correct
52	Correct	17 ms	3008 KB	Output is correct
53	Correct	20 ms	3084 KB	Output is correct
54	Correct	19 ms	3008 KB	Output is correct
55	Correct	11 ms	3492 KB	Output is correct
56	Correct	17 ms	2592 KB	Output is correct
57	Correct	17 ms	2728 KB	Output is correct
58	Correct	17 ms	2976 KB	Output is correct
59	Correct	25 ms	2968 KB	Output is correct
60	Correct	26 ms	3112 KB	Output is correct
61	Correct	19 ms	3000 KB	Output is correct
62	Correct	26 ms	3000 KB	Output is correct
63	Correct	19 ms	2984 KB	Output is correct
64	Correct	10 ms	2576 KB	Output is correct
65	Correct	12 ms	3492 KB	Output is correct
66	Correct	10 ms	2616 KB	Output is correct
67	Correct	11 ms	3488 KB	Output is correct

Subtask #4
0 / 14.0

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

Subtask #5
0 / 17.0

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

Subtask #6
0 / 19.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	208 KB	Output is correct
2	Correct	1 ms	208 KB	Output is correct
3	Correct	1 ms	208 KB	Output is correct
4	Correct	1 ms	208 KB	Output is correct
5	Correct	1 ms	208 KB	Output is correct
6	Correct	0 ms	208 KB	Output is correct
7	Correct	1 ms	208 KB	Output is correct
8	Correct	1 ms	208 KB	Output is correct
9	Correct	0 ms	208 KB	Output is correct
10	Correct	1 ms	208 KB	Output is correct
11	Correct	0 ms	208 KB	Output is correct
12	Correct	0 ms	208 KB	Output is correct
13	Correct	1 ms	208 KB	Output is correct
14	Correct	1 ms	208 KB	Output is correct
15	Correct	0 ms	208 KB	Output is correct
16	Correct	1 ms	336 KB	Output is correct
17	Correct	1 ms	208 KB	Output is correct
18	Correct	1 ms	208 KB	Output is correct
19	Correct	0 ms	208 KB	Output is correct
20	Correct	1 ms	336 KB	Output is correct
21	Correct	1 ms	336 KB	Output is correct
22	Correct	1 ms	336 KB	Output is correct
23	Correct	1 ms	336 KB	Output is correct
24	Correct	0 ms	336 KB	Output is correct
25	Correct	1 ms	208 KB	Output is correct
26	Correct	1 ms	336 KB	Output is correct
27	Correct	1 ms	336 KB	Output is correct
28	Correct	1 ms	336 KB	Output is correct
29	Correct	1 ms	336 KB	Output is correct
30	Correct	1 ms	336 KB	Output is correct
31	Correct	1 ms	336 KB	Output is correct
32	Correct	1 ms	336 KB	Output is correct
33	Correct	1 ms	336 KB	Output is correct
34	Correct	1 ms	336 KB	Output is correct
35	Correct	1 ms	336 KB	Output is correct
36	Correct	7 ms	976 KB	Output is correct
37	Correct	11 ms	1444 KB	Output is correct
38	Correct	9 ms	1444 KB	Output is correct
39	Correct	11 ms	1464 KB	Output is correct
40	Correct	10 ms	1464 KB	Output is correct
41	Correct	18 ms	2712 KB	Output is correct
42	Correct	9 ms	1440 KB	Output is correct
43	Correct	10 ms	1672 KB	Output is correct
44	Correct	9 ms	1440 KB	Output is correct
45	Correct	13 ms	1448 KB	Output is correct
46	Correct	9 ms	1448 KB	Output is correct
47	Correct	11 ms	1464 KB	Output is correct
48	Correct	13 ms	1460 KB	Output is correct
49	Correct	9 ms	1436 KB	Output is correct
50	Correct	11 ms	1452 KB	Output is correct
51	Correct	9 ms	1456 KB	Output is correct
52	Correct	17 ms	3008 KB	Output is correct
53	Correct	20 ms	3084 KB	Output is correct
54	Correct	19 ms	3008 KB	Output is correct
55	Correct	11 ms	3492 KB	Output is correct
56	Correct	17 ms	2592 KB	Output is correct
57	Correct	17 ms	2728 KB	Output is correct
58	Correct	17 ms	2976 KB	Output is correct
59	Correct	25 ms	2968 KB	Output is correct
60	Correct	26 ms	3112 KB	Output is correct
61	Correct	19 ms	3000 KB	Output is correct
62	Correct	26 ms	3000 KB	Output is correct
63	Correct	19 ms	2984 KB	Output is correct
64	Correct	10 ms	2576 KB	Output is correct
65	Correct	12 ms	3492 KB	Output is correct
66	Correct	10 ms	2616 KB	Output is correct
67	Correct	11 ms	3488 KB	Output is correct
68	Execution timed out	4048 ms	1704 KB	Time limit exceeded
69	Halted	0 ms	0 KB	-

Subtask #7
0 / 23.0

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

답안 #825002

Compilation message

Subtask #1 0 / 4.0

Subtask #2 11.0 / 11.0

Subtask #3 12.0 / 12.0

Subtask #4 0 / 14.0

Subtask #5 0 / 17.0

Subtask #6 0 / 19.0

Subtask #7 0 / 23.0

Subtask #1
0 / 4.0

Subtask #2
11.0 / 11.0

Subtask #3
12.0 / 12.0

Subtask #4
0 / 14.0

Subtask #5
0 / 17.0

Subtask #6
0 / 19.0

Subtask #7
0 / 23.0