답안 #1111258

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1111258	2024-11-11T21:46:21 Z	borisAngelov	Group Photo (JOI21_ho_t3)	C++17	44 / 100	5000 ms	508 KB

Main

#include <bits/stdc++.h>

using namespace std;

const int maxn = 5005;
const int inf = 1e9;

int n;
int a[maxn], positions[maxn], toRem[maxn];

int dp[maxn];

void fastIO()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
}

int main()
{
    fastIO();

    cin >> n;

    for (int i = 1; i <= n; ++i)
    {
        cin >> a[i];
        positions[a[i]] = i;
    }

    dp[n + 1] = 0;

    for (int num = n; num >= 1; --num)
    {
        dp[num] = inf;

        for (int to = num; to <= n; ++to)
        {
            for (int i = 1; i <= n; ++i)
            {
                toRem[i] = 0;
            }

            for (int i = num; i <= to; ++i)
            {
                for (int j = positions[i] - 1; j >= 1; --j)
                {
                    if (a[j] > to) ++toRem[i];
                }
            }

            int cost = 0, inv = 0;
            vector<int> actualPos;

            for (int i = num; i <= to; ++i)
            {
                int newPos = positions[i] - toRem[i];
                //cout << "here for " << i << " -> " << newPos << endl;
                actualPos.push_back(newPos);
            }

            sort(actualPos.begin(), actualPos.end(), greater<int>());

            for (int i = 0; i < actualPos.size(); ++i)
            {
                cost += abs((to - i) - actualPos[i]);
            }

            for (int i = num; i <= to; ++i)
            {
                for (int j = i - 1; j >= num; --j)
                {
                    if (positions[j] > positions[i])
                    {
                        ++inv;
                    }
                }
            }

            int cntNums = to - num + 1;

            cost += (cntNums * (cntNums - 1)) / 2 - inv;

            //cout << num << " " << to << " :: " << cost << endl;

            dp[num] = min(dp[num], cost + dp[to + 1]);
        }

        //cout << num << " ::: " << dp[num] << endl;
    }

    cout << dp[1] << endl;

    return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:65:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   65 |             for (int i = 0; i < actualPos.size(); ++i)
      |                             ~~^~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	336 KB	Output is correct
2	Correct	1 ms	464 KB	Output is correct
3	Correct	1 ms	508 KB	Output is correct
4	Correct	1 ms	336 KB	Output is correct
5	Correct	1 ms	508 KB	Output is correct
6	Correct	1 ms	336 KB	Output is correct
7	Correct	1 ms	336 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

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	336 KB	Output is correct
2	Correct	1 ms	464 KB	Output is correct
3	Correct	1 ms	508 KB	Output is correct
4	Correct	1 ms	336 KB	Output is correct
5	Correct	1 ms	508 KB	Output is correct
6	Correct	1 ms	336 KB	Output is correct
7	Correct	1 ms	336 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	504 KB	Output is correct
14	Correct	1 ms	336 KB	Output is correct
15	Correct	1 ms	336 KB	Output is correct
16	Correct	2 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

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	336 KB	Output is correct
2	Correct	1 ms	464 KB	Output is correct
3	Correct	1 ms	508 KB	Output is correct
4	Correct	1 ms	336 KB	Output is correct
5	Correct	1 ms	508 KB	Output is correct
6	Correct	1 ms	336 KB	Output is correct
7	Correct	1 ms	336 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	504 KB	Output is correct
14	Correct	1 ms	336 KB	Output is correct
15	Correct	1 ms	336 KB	Output is correct
16	Correct	2 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	200 ms	336 KB	Output is correct
22	Correct	196 ms	336 KB	Output is correct
23	Correct	207 ms	336 KB	Output is correct
24	Correct	203 ms	468 KB	Output is correct
25	Correct	200 ms	468 KB	Output is correct
26	Correct	207 ms	348 KB	Output is correct
27	Correct	198 ms	468 KB	Output is correct
28	Correct	218 ms	336 KB	Output is correct
29	Correct	197 ms	468 KB	Output is correct
30	Correct	199 ms	336 KB	Output is correct

Subtask #4
0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	336 KB	Output is correct
2	Correct	1 ms	464 KB	Output is correct
3	Correct	1 ms	508 KB	Output is correct
4	Correct	1 ms	336 KB	Output is correct
5	Correct	1 ms	508 KB	Output is correct
6	Correct	1 ms	336 KB	Output is correct
7	Correct	1 ms	336 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	504 KB	Output is correct
14	Correct	1 ms	336 KB	Output is correct
15	Correct	1 ms	336 KB	Output is correct
16	Correct	2 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	200 ms	336 KB	Output is correct
22	Correct	196 ms	336 KB	Output is correct
23	Correct	207 ms	336 KB	Output is correct
24	Correct	203 ms	468 KB	Output is correct
25	Correct	200 ms	468 KB	Output is correct
26	Correct	207 ms	348 KB	Output is correct
27	Correct	198 ms	468 KB	Output is correct
28	Correct	218 ms	336 KB	Output is correct
29	Correct	197 ms	468 KB	Output is correct
30	Correct	199 ms	336 KB	Output is correct
31	Execution timed out	5052 ms	508 KB	Time limit exceeded
32	Halted	0 ms	0 KB	-

Subtask #5
0 / 36.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	336 KB	Output is correct
2	Correct	1 ms	464 KB	Output is correct
3	Correct	1 ms	508 KB	Output is correct
4	Correct	1 ms	336 KB	Output is correct
5	Correct	1 ms	508 KB	Output is correct
6	Correct	1 ms	336 KB	Output is correct
7	Correct	1 ms	336 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	504 KB	Output is correct
14	Correct	1 ms	336 KB	Output is correct
15	Correct	1 ms	336 KB	Output is correct
16	Correct	2 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	200 ms	336 KB	Output is correct
22	Correct	196 ms	336 KB	Output is correct
23	Correct	207 ms	336 KB	Output is correct
24	Correct	203 ms	468 KB	Output is correct
25	Correct	200 ms	468 KB	Output is correct
26	Correct	207 ms	348 KB	Output is correct
27	Correct	198 ms	468 KB	Output is correct
28	Correct	218 ms	336 KB	Output is correct
29	Correct	197 ms	468 KB	Output is correct
30	Correct	199 ms	336 KB	Output is correct
31	Execution timed out	5052 ms	508 KB	Time limit exceeded
32	Halted	0 ms	0 KB	-

답안 #1111258

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 7.0 / 7.0

Subtask #3 32.0 / 32.0

Subtask #4 0 / 20.0

Subtask #5 0 / 36.0

Subtask #1
5.0 / 5.0

Subtask #2
7.0 / 7.0

Subtask #3
32.0 / 32.0

Subtask #4
0 / 20.0

Subtask #5
0 / 36.0