Submission #1113183

#	Time	Username	Problem	Language	Result	Execution time	Memory
1113183		duckindog	Line Town (CCO23_day1problem3)	C++17	3 / 25	2088 ms	9756 KiB

Main

#include <bits/stdc++.h>

using namespace std;

#define int long long

const int N = 500'000 + 10,
          MAX = 1'000'000'000'000'000;
int n;
int h[N];

int32_t main() { 
  cin.tie(0)->sync_with_stdio(0);

  cin >> n;
  for (int i = 1; i <= n; ++i) cin >> h[i];

  int answer = MAX;
  for (int negNum = 0; negNum <= n; ++negNum) { 
    
    deque<int> odd, even;
    for (int i = 1; i <= n; ++i) { 
      if (i & 1) { 
        if (h[i] == 1) even.push_back(i);
        else odd.push_back(i);
      } else { 
        if (h[i] == 1) odd.push_back(i);
        else even.push_back(i);
      }
    }

    int total = 0;
    for (int i = 1; i <= negNum; ++i) { 
      auto& vt = (i & 1 ? odd : even);
      if (!vt.size()) { total = MAX; break; }
      
      total += max(0ll, i - vt.front());
      vt.pop_front();
    }
    for (int i = negNum + 1; i <= n; ++i) { 
      auto& vt = ((i ^ 1) & 1 ? odd : even);
      if (!vt.size()) { total = MAX; break; }
      
      total += max(0ll, i - vt.front());
      vt.pop_front();
    }
    
    answer = min(answer, total);
  }

  cout << (answer == MAX ? -1 : answer) << "\n";
}

• Subtask 1: 3 / 3
• Subtask 2: 0 / 3
• Subtask 3: 0 / 3
• Subtask 4: 0 / 4
• Subtask 5: 0 / 4
• Subtask 6: 0 / 3
• Subtask 7: 0 / 2
• Subtask 8: 0 / 3