oj.uz

답안 #212087

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
212087 2020-03-22T08:57:00 Z NONAME Holding (COCI20_holding) C++17
0 / 110
 9 ms 384 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-O3")
#define F first
#define S second
#define pb push_back
#define N +1000005
#define M ll(1e9 + 7)
#define sz(x) (int)x.size()
#define re return
#define oo ll(1e18)
#define el '\n'
using namespace std;
//using namespace __gnu_pbds;
//typedef tree <int, null_type, less_equal <int> , rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef long long ll;
typedef long double ld;
 
int ans = 1e9, l, r, i, j, msk, n, k, a[N], sm;
pair <int, int> f[(1 << 15)];
 
int main()
{
//    srand(time(0));
    ios_base::sync_with_stdio(0);
    iostream::sync_with_stdio(0);
    ios::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);
//    in("input.txt");
//    out("output.txt");
    cin >> n >> l >> r >> k;
    l--;
    r--;
    for (i = 0; i < n; i++) cin >> a[i];
    for (i = l; i <= r; i++) sm += a[i];
    for (i = 0; i < (1 << n); i++) f[i] = {k, 1e9};
    f[0] = {0, sm};
    for (msk = 0; msk < (1 << n); msk++)
    {
        ans = min(ans, f[msk].S);
        for (i = 0; i < n; i++)
        {
            if (msk & (1 << i)) continue;
            for (j = 0; j < n; j++)
            {
                if (i == j || (msk & (1 << j))) continue;
                if ((i < l && j > r) || (i > r && j < l) || (i >= l && i <= r && j >= l && j <= r)) continue;
                int nmsk = (msk | ((1 << i) | (1 << j)));
                int sum = f[msk].S, fst, sd;
                if (i >= l && i <= r) fst = a[i], sd = a[j];
                                 else fst = a[j], sd = a[i];
                if (f[msk].F + abs(i - j) <= k && sum + sd - fst <= f[nmsk].S)
                {
                    if (f[nmsk].S != sum + sd - fst) f[nmsk].F = f[msk].F + abs(i - j);
                  else f[nmsk].F = min(f[nmsk].F, f[msk].F + abs(i - j));
                    f[nmsk].S = sum + sd - fst;
                }
            }
        }
    }
    cout << ans;
}

Subtask #1
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Incorrect 9 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Incorrect 9 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Incorrect 9 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Incorrect 9 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -