Submission #1109927

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1109927	2024-11-08T06:19:41 Z	flashmt	Group Photo (JOI21_ho_t3)	C++17	100 / 100	228 ms	98572 KB

Main

#include <bits/stdc++.h>
using namespace std;
const int oo = 1 << 30;

int main()
{
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int n;
  cin >> n;
  vector<int> id(n + 1);
  for (int i = 0; i < n; i++)
  {
    int x;
    cin >> x;
    id[x] = i;
  }

  vector<vector<int>> c(n + 1, vector<int>(n + 1));
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= n; j++)
    {
      c[i][j] = c[i - 1][j] + c[i][j - 1] - c[i - 1][j - 1];
      if (j < i && id[j] < id[i])
        c[i][j]++;
    }

  vector<int> f(n + 1, oo);
  f[0] = 0;
  for (int i = 1; i <= n; i++)
    for (int j = 0; j < i; j++)
    {
      int cost = c[i][i] + c[j][j] - c[i][j] - c[j][i];
      cost += (n - i) * (i - j) - (c[n][i] + c[i][j] - c[n][j] - c[i][i]);
      f[i] = min(f[i], f[j] + cost);
    }

  cout << f[n] << endl;
}

Subtask #1
5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	336 KB	Output is correct
2	Correct	1 ms	336 KB	Output is correct
3	Correct	1 ms	336 KB	Output is correct
4	Correct	1 ms	336 KB	Output is correct
5	Correct	1 ms	336 KB	Output is correct
6	Correct	1 ms	336 KB	Output is correct
7	Correct	1 ms	460 KB	Output is correct
8	Correct	1 ms	336 KB	Output is correct
9	Correct	1 ms	336 KB	Output is correct
10	Correct	1 ms	336 KB	Output is correct

Subtask #2
7.0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	336 KB	Output is correct
2	Correct	1 ms	336 KB	Output is correct
3	Correct	1 ms	336 KB	Output is correct
4	Correct	1 ms	336 KB	Output is correct
5	Correct	1 ms	336 KB	Output is correct
6	Correct	1 ms	336 KB	Output is correct
7	Correct	1 ms	460 KB	Output is correct
8	Correct	1 ms	336 KB	Output is correct
9	Correct	1 ms	336 KB	Output is correct
10	Correct	1 ms	336 KB	Output is correct
11	Correct	1 ms	336 KB	Output is correct
12	Correct	1 ms	336 KB	Output is correct
13	Correct	1 ms	336 KB	Output is correct
14	Correct	1 ms	336 KB	Output is correct
15	Correct	1 ms	336 KB	Output is correct
16	Correct	1 ms	336 KB	Output is correct
17	Correct	1 ms	336 KB	Output is correct
18	Correct	1 ms	336 KB	Output is correct
19	Correct	1 ms	336 KB	Output is correct
20	Correct	1 ms	336 KB	Output is correct

Subtask #3
32.0 / 32.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	336 KB	Output is correct
2	Correct	1 ms	336 KB	Output is correct
3	Correct	1 ms	336 KB	Output is correct
4	Correct	1 ms	336 KB	Output is correct
5	Correct	1 ms	336 KB	Output is correct
6	Correct	1 ms	336 KB	Output is correct
7	Correct	1 ms	460 KB	Output is correct
8	Correct	1 ms	336 KB	Output is correct
9	Correct	1 ms	336 KB	Output is correct
10	Correct	1 ms	336 KB	Output is correct
11	Correct	1 ms	336 KB	Output is correct
12	Correct	1 ms	336 KB	Output is correct
13	Correct	1 ms	336 KB	Output is correct
14	Correct	1 ms	336 KB	Output is correct
15	Correct	1 ms	336 KB	Output is correct
16	Correct	1 ms	336 KB	Output is correct
17	Correct	1 ms	336 KB	Output is correct
18	Correct	1 ms	336 KB	Output is correct
19	Correct	1 ms	336 KB	Output is correct
20	Correct	1 ms	336 KB	Output is correct
21	Correct	1 ms	592 KB	Output is correct
22	Correct	2 ms	592 KB	Output is correct
23	Correct	1 ms	592 KB	Output is correct
24	Correct	2 ms	592 KB	Output is correct
25	Correct	1 ms	592 KB	Output is correct
26	Correct	1 ms	592 KB	Output is correct
27	Correct	1 ms	592 KB	Output is correct
28	Correct	1 ms	592 KB	Output is correct
29	Correct	1 ms	592 KB	Output is correct
30	Correct	1 ms	592 KB	Output is correct

Subtask #4
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	336 KB	Output is correct
2	Correct	1 ms	336 KB	Output is correct
3	Correct	1 ms	336 KB	Output is correct
4	Correct	1 ms	336 KB	Output is correct
5	Correct	1 ms	336 KB	Output is correct
6	Correct	1 ms	336 KB	Output is correct
7	Correct	1 ms	460 KB	Output is correct
8	Correct	1 ms	336 KB	Output is correct
9	Correct	1 ms	336 KB	Output is correct
10	Correct	1 ms	336 KB	Output is correct
11	Correct	1 ms	336 KB	Output is correct
12	Correct	1 ms	336 KB	Output is correct
13	Correct	1 ms	336 KB	Output is correct
14	Correct	1 ms	336 KB	Output is correct
15	Correct	1 ms	336 KB	Output is correct
16	Correct	1 ms	336 KB	Output is correct
17	Correct	1 ms	336 KB	Output is correct
18	Correct	1 ms	336 KB	Output is correct
19	Correct	1 ms	336 KB	Output is correct
20	Correct	1 ms	336 KB	Output is correct
21	Correct	1 ms	592 KB	Output is correct
22	Correct	2 ms	592 KB	Output is correct
23	Correct	1 ms	592 KB	Output is correct
24	Correct	2 ms	592 KB	Output is correct
25	Correct	1 ms	592 KB	Output is correct
26	Correct	1 ms	592 KB	Output is correct
27	Correct	1 ms	592 KB	Output is correct
28	Correct	1 ms	592 KB	Output is correct
29	Correct	1 ms	592 KB	Output is correct
30	Correct	1 ms	592 KB	Output is correct
31	Correct	5 ms	2896 KB	Output is correct
32	Correct	5 ms	2768 KB	Output is correct
33	Correct	6 ms	2896 KB	Output is correct
34	Correct	5 ms	2908 KB	Output is correct
35	Correct	5 ms	2896 KB	Output is correct
36	Correct	5 ms	2896 KB	Output is correct
37	Correct	5 ms	2896 KB	Output is correct
38	Correct	6 ms	3008 KB	Output is correct
39	Correct	6 ms	2772 KB	Output is correct
40	Correct	5 ms	2896 KB	Output is correct

Subtask #5
36.0 / 36.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	336 KB	Output is correct
2	Correct	1 ms	336 KB	Output is correct
3	Correct	1 ms	336 KB	Output is correct
4	Correct	1 ms	336 KB	Output is correct
5	Correct	1 ms	336 KB	Output is correct
6	Correct	1 ms	336 KB	Output is correct
7	Correct	1 ms	460 KB	Output is correct
8	Correct	1 ms	336 KB	Output is correct
9	Correct	1 ms	336 KB	Output is correct
10	Correct	1 ms	336 KB	Output is correct
11	Correct	1 ms	336 KB	Output is correct
12	Correct	1 ms	336 KB	Output is correct
13	Correct	1 ms	336 KB	Output is correct
14	Correct	1 ms	336 KB	Output is correct
15	Correct	1 ms	336 KB	Output is correct
16	Correct	1 ms	336 KB	Output is correct
17	Correct	1 ms	336 KB	Output is correct
18	Correct	1 ms	336 KB	Output is correct
19	Correct	1 ms	336 KB	Output is correct
20	Correct	1 ms	336 KB	Output is correct
21	Correct	1 ms	592 KB	Output is correct
22	Correct	2 ms	592 KB	Output is correct
23	Correct	1 ms	592 KB	Output is correct
24	Correct	2 ms	592 KB	Output is correct
25	Correct	1 ms	592 KB	Output is correct
26	Correct	1 ms	592 KB	Output is correct
27	Correct	1 ms	592 KB	Output is correct
28	Correct	1 ms	592 KB	Output is correct
29	Correct	1 ms	592 KB	Output is correct
30	Correct	1 ms	592 KB	Output is correct
31	Correct	5 ms	2896 KB	Output is correct
32	Correct	5 ms	2768 KB	Output is correct
33	Correct	6 ms	2896 KB	Output is correct
34	Correct	5 ms	2908 KB	Output is correct
35	Correct	5 ms	2896 KB	Output is correct
36	Correct	5 ms	2896 KB	Output is correct
37	Correct	5 ms	2896 KB	Output is correct
38	Correct	6 ms	3008 KB	Output is correct
39	Correct	6 ms	2772 KB	Output is correct
40	Correct	5 ms	2896 KB	Output is correct
41	Correct	208 ms	98260 KB	Output is correct
42	Correct	219 ms	98376 KB	Output is correct
43	Correct	208 ms	98308 KB	Output is correct
44	Correct	198 ms	98536 KB	Output is correct
45	Correct	198 ms	98380 KB	Output is correct
46	Correct	208 ms	98384 KB	Output is correct
47	Correct	205 ms	98376 KB	Output is correct
48	Correct	209 ms	98376 KB	Output is correct
49	Correct	212 ms	98380 KB	Output is correct
50	Correct	228 ms	98396 KB	Output is correct
51	Correct	214 ms	98376 KB	Output is correct
52	Correct	218 ms	98376 KB	Output is correct
53	Correct	220 ms	98376 KB	Output is correct
54	Correct	220 ms	98572 KB	Output is correct
55	Correct	202 ms	98376 KB	Output is correct

Submission #1109927

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 7.0 / 7.0

Subtask #3 32.0 / 32.0

Subtask #4 20.0 / 20.0

Subtask #5 36.0 / 36.0

Subtask #1
5.0 / 5.0

Subtask #2
7.0 / 7.0

Subtask #3
32.0 / 32.0

Subtask #4
20.0 / 20.0

Subtask #5
36.0 / 36.0