oj.uz

답안 #968282

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
968282 2024-04-23T09:28:42 Z Pring Line Town (CCO23_day1problem3) C++17
0 / 25
 1 ms 348 KB 
#include <bits/stdc++.h>
using namespace std;

#ifdef MIKU
string dbmc = "\033[1;38;2;57;197;187m", dbrs = "\033[0m";
#define debug(x...) cout << dbmc << "[" << #x << "]: ", dout(x)
void dout() { cout << dbrs << endl; }
template <typename T, typename ...U>
void dout(T t, U ...u) { cout << t << (sizeof...(u) ? ", " : ""); dout(u...); }
#else
#define debug(...) 39
#endif

#define fs first
#define sc second
#define mp make_pair
#define FOR(i, j, k) for (int i = j, Z = k; i < Z; i++)
using ll = long long;
typedef pair<int, int> pii;

const int MXN = 2005, INF = 1e9;
int n, a[MXN];
vector<int> v;
int pre[MXN], suf[MXN];

int calc() {
    // for (auto &i : v) cout << i << ' ';
    // cout << endl;
    vector<int> st;
    pre[0] = 0;
    int sum = 0;
    FOR(i, 0, v.size()) {
        int &now = pre[i + 1];
        if (st.empty()) st.push_back(v[i]);
        else if ((st.back() + v[i]) & 1) st.push_back(v[i]);
        else {
            sum += v[i] - st.back() / 2;
            st.pop_back();
        }
        now = (st.empty() ? sum : INF);
    }
    for (auto &i : v) i = n - i;
    reverse(v.begin(), v.end());
    st.clear();
    suf[0] = 0;
    sum = 0;
    FOR(i, 0, v.size()) {
        int &now = suf[i + 1];
        if (st.empty()) st.push_back(v[i]);
        else if ((st.back() + v[i]) & 1) st.push_back(v[i]);
        else {
            sum += (v[i] - st.back()) / 2;
            st.pop_back();
        }
        now = (st.empty() ? sum : INF);
    }
    // FOR(i, 0, v.size() + 1) cout << pre[i] << ' ';
    // cout << endl;
    // FOR(i, 0, v.size() + 1) cout << suf[i] << ' ';
    // cout << endl;
    int ans = INF;
    FOR(i, 0, v.size()) ans = min(ans, pre[i] + suf[v.size() - i - 1]);
    return ans;
}

void miku() {
    cin >> n;
    FOR(i, 0, n) {
        cin >> a[i];
    }
    if (a[0] == 1) v.push_back(0);
    FOR(i, 1, n) if (a[i] != a[i - 1]) v.push_back(i);
    if (a[n - 1] == -1) v.push_back(n);
    int x = calc();
    cout << (x >= INF ? -1 : x) << '\n';
}

int32_t main() {
    cin.tie(0) -> sync_with_stdio(false);
    cin.exceptions(cin.failbit);
    miku();
    return 0;
}

Subtask #1
0 / 3.0

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

Subtask #2
0 / 3.0

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

Subtask #3
0 / 3.0

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

Subtask #4
0 / 4.0

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

Subtask #5
0 / 4.0

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

Subtask #6
0 / 3.0

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

Subtask #7
0 / 2.0

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

Subtask #8
0 / 3.0

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