답안 #637576

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
637576	2022-09-02T12:39:46 Z	danikoynov	Group Photo (JOI21_ho_t3)	C++14	44 / 100	5000 ms	308 KB

Main

/**
 ____ ____ ____ ____ ____ ____
||l |||e |||i |||n |||a |||d ||
||__|||__|||__|||__|||__|||__||
|/__\|/__\|/__\|/__\|/__\|/__\|

**/

#include<bits/stdc++.h>
#define endl '\n'

using namespace std;
typedef long long ll;

void speed()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
}

const int maxn = 5010;

int n, a[maxn], dp[maxn], pos[maxn];
void solve()
{
    cin >> n;
    for (int i = 1; i <= n; i ++)
    {
        cin >> a[i];
        pos[a[i]] = i;
    }

    for (int i = 1; i <= n; i ++)
    {
        dp[i] = n * n;
        for (int j = 0; j < i; j ++)
    {
        int st = j + 1, sum = 0;
        for (int k = i; k > j; k --)
        {
            ll cur = pos[k];
            ///cout << i << " " << j << " " << k << " " << cur << endl;
            for (int d = k + 1; d <= i; d ++)
                if (pos[d] > pos[k])
                cur ++;
            for (int d = 1; d <= j; d ++)
                if (pos[d] > pos[k])
                cur ++;
            cur -= st;
            st ++;
            sum = sum + max((ll)0, cur);
        }
        ///cout << i << " " << j << " " << sum << endl;
        dp[i] = min(dp[i], dp[j] + sum);
    }
    ///cout << i << " -- " << dp[i] << endl;

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

}

int main()
{
    solve();
    return 0;
}

Subtask #1

5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	300 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	308 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct

Subtask #2

7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	300 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	308 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	0 ms	304 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	304 KB	Output is correct
17	Correct	1 ms	304 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	300 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct

Subtask #3

32.0 / 32.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	300 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	308 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	0 ms	304 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	304 KB	Output is correct
17	Correct	1 ms	304 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	300 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	106 ms	212 KB	Output is correct
22	Correct	119 ms	288 KB	Output is correct
23	Correct	104 ms	292 KB	Output is correct
24	Correct	106 ms	296 KB	Output is correct
25	Correct	104 ms	288 KB	Output is correct
26	Correct	106 ms	292 KB	Output is correct
27	Correct	108 ms	288 KB	Output is correct
28	Correct	104 ms	212 KB	Output is correct
29	Correct	104 ms	212 KB	Output is correct
30	Correct	110 ms	212 KB	Output is correct

Subtask #4

0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	300 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	308 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	0 ms	304 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	304 KB	Output is correct
17	Correct	1 ms	304 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	300 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	106 ms	212 KB	Output is correct
22	Correct	119 ms	288 KB	Output is correct
23	Correct	104 ms	292 KB	Output is correct
24	Correct	106 ms	296 KB	Output is correct
25	Correct	104 ms	288 KB	Output is correct
26	Correct	106 ms	292 KB	Output is correct
27	Correct	108 ms	288 KB	Output is correct
28	Correct	104 ms	212 KB	Output is correct
29	Correct	104 ms	212 KB	Output is correct
30	Correct	110 ms	212 KB	Output is correct
31	Execution timed out	5079 ms	212 KB	Time limit exceeded
32	Halted	0 ms	0 KB	-

Subtask #5

0 / 36.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	300 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	308 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	0 ms	304 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	304 KB	Output is correct
17	Correct	1 ms	304 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	300 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	106 ms	212 KB	Output is correct
22	Correct	119 ms	288 KB	Output is correct
23	Correct	104 ms	292 KB	Output is correct
24	Correct	106 ms	296 KB	Output is correct
25	Correct	104 ms	288 KB	Output is correct
26	Correct	106 ms	292 KB	Output is correct
27	Correct	108 ms	288 KB	Output is correct
28	Correct	104 ms	212 KB	Output is correct
29	Correct	104 ms	212 KB	Output is correct
30	Correct	110 ms	212 KB	Output is correct
31	Execution timed out	5079 ms	212 KB	Time limit exceeded
32	Halted	0 ms	0 KB	-