oj.uz

답안 #691617

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
691617 2023-01-31T10:36:47 Z abysmal Group Photo (JOI21_ho_t3) C++14
64 / 100
 5000 ms 98260 KB 
#include<iostream>
#include<stdio.h>
#include<stdint.h>
#include<vector>
#include<algorithm>
#include<utility>
#include<set>
#include<map>
#include<queue>
#include<stack>
#include<deque>
#include<string>
#include<assert.h>
#include<math.h>
#include<chrono>
#include<random>
#include<bitset>

using namespace std;

const int64_t INF = (int64_t) 1e9 + 5;
const int64_t mINF = (int64_t) 4 * 1e4;
const int64_t MOD = (int64_t) 1e9 + 7;
const int nbit = 30;
const int ndig = 10;
const int nchar = 26;
const int p1 = 31;
const int p2 = 53;
const int D = 4;
int dr[D] = {0, 1, 0, -1};
int dc[D] = {1, 0, -1, 0};
// 0 right // 1 down // 2 left // 3 up

struct Solution
{
    int n;
    Solution() {}

    void solve()
    {
        cin >> n;

        vector<int> pos(n, -1);
        for(int i = 1; i <= n; i++)
        {
            int x;
            cin >> x;

            pos[x - 1] = i;
        }

        vector<vector<int> > cost(n, vector<int>(n, 0));
        vector<int> bit(n + 1, 0);
        for(int i = 0; i < n; i++)
        {
            for(int j = i; j < n; j++)
            {
                int x = 0;
                int cnt = i + 1;

                vector<int> bit2 = bit;
                for(int k = j; k >= i; k--)
                {
                    int tmp = sum(n, bit2) - sum(pos[k], bit2);
                    int new_pos = pos[k] + tmp;

                    x += max(new_pos - cnt, 0);

                    update(pos[k], bit2);
                    cnt++;
                }

                cost[i][j] = x;
            }

            update(pos[i], bit);
        }

        vector<int> dp(n + 1, INF);
        dp[0] = 0;
        for(int i = 1; i <= n; i++)
        {
            for(int j = i; j <= n; j++)
            {
                dp[j] = min(dp[j], dp[i - 1] + cost[i - 1][j - 1]);
            }
        }

        cout << dp[n] << "\n";
    }

    int sum(int i, vector<int>& bit)
    {
        int ans = 0;
        while(i > 0)
        {
            ans += bit[i];

            i -= (i & (-i));
        }

        return ans;
    }

    void update(int i, vector<int>& bit)
    {
        while(i < (int) bit.size())
        {
            bit[i]++;

            i += (i & (-i));
        }
    }

    int modsub(int t1, int t2)
    {
        int64_t res = t1 - t2;
        if(res < 0) res += MOD;

        return res;
    }

    int modadd(int t1, int t2)
    {
        int64_t res = t1 + t2;
        if(res >= MOD) res -= MOD;

        return res;
    }

    int modmul(int t1, int t2)
    {
        int64_t res = 1LL * t1 * t2;
        return (res % MOD);
    }

    bool BIT(int mask, int j)
    {
        return (mask & MASK(j));
    }

    int64_t MASK(int j)
    {
        return (1LL << j);
    }

    int64_t Abs(int64_t t1)
    {
        if(t1 < 0) return -t1;
        return t1;
    }
};

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

//    freopen("in.txt", "r", stdin);
//    freopen("out.txt", "w", stdout);
}

int main()
{
    __startup();
    int t = 1;
//    cin >> t;

    for(int i = 1; i <= t; i++)
    {
        Solution().solve();
    }

    return 0;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
7.0 / 7.0

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

Subtask #3
32.0 / 32.0

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

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 324 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 320 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 16 ms 468 KB Output is correct
22 Correct 18 ms 468 KB Output is correct
23 Correct 20 ms 468 KB Output is correct
24 Correct 15 ms 468 KB Output is correct
25 Correct 15 ms 488 KB Output is correct
26 Correct 15 ms 452 KB Output is correct
27 Correct 19 ms 492 KB Output is correct
28 Correct 16 ms 468 KB Output is correct
29 Correct 17 ms 448 KB Output is correct
30 Correct 14 ms 468 KB Output is correct
31 Correct 1731 ms 2828 KB Output is correct
32 Correct 1767 ms 2844 KB Output is correct
33 Correct 1773 ms 2840 KB Output is correct
34 Correct 1463 ms 2852 KB Output is correct
35 Correct 1462 ms 2844 KB Output is correct
36 Correct 1432 ms 2852 KB Output is correct
37 Correct 1421 ms 2844 KB Output is correct
38 Correct 1458 ms 2772 KB Output is correct
39 Correct 1466 ms 2844 KB Output is correct
40 Correct 1426 ms 2772 KB Output is correct

Subtask #5
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 324 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 320 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 16 ms 468 KB Output is correct
22 Correct 18 ms 468 KB Output is correct
23 Correct 20 ms 468 KB Output is correct
24 Correct 15 ms 468 KB Output is correct
25 Correct 15 ms 488 KB Output is correct
26 Correct 15 ms 452 KB Output is correct
27 Correct 19 ms 492 KB Output is correct
28 Correct 16 ms 468 KB Output is correct
29 Correct 17 ms 448 KB Output is correct
30 Correct 14 ms 468 KB Output is correct
31 Correct 1731 ms 2828 KB Output is correct
32 Correct 1767 ms 2844 KB Output is correct
33 Correct 1773 ms 2840 KB Output is correct
34 Correct 1463 ms 2852 KB Output is correct
35 Correct 1462 ms 2844 KB Output is correct
36 Correct 1432 ms 2852 KB Output is correct
37 Correct 1421 ms 2844 KB Output is correct
38 Correct 1458 ms 2772 KB Output is correct
39 Correct 1466 ms 2844 KB Output is correct
40 Correct 1426 ms 2772 KB Output is correct
41 Execution timed out 5097 ms 98260 KB Time limit exceeded
42 Halted 0 ms 0 KB -