oj.uz

Submission #1113493

# Submission time Handle Problem Language Result Execution time Memory
1113493 2024-11-16T16:36:26 Z duckindog Line Town (CCO23_day1problem3) C++17
13 / 25
 166 ms 28560 KB 
#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];

struct BIT { 
  int bit[N];
  inline void upd(int i, int x) { 
    for (; i <= n; i += i & -i) bit[i] += x;
  }
  inline int que(int i) { 
    int ret = 0;
    for (; i; i -= i & -i) ret += bit[i];
    return ret;
  }
} T, Z;

int pref[N];

vector<int> position;

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

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

  int cntZero = 0, totalZero = 0;
  for (int i = 1; i <= n; ++i) {
    if (h[i]) continue;
    position.push_back(i);
    cntZero += 1;
    totalZero += i - 1 - Z.que(i - 1);
    Z.upd(i, 1);
  }
  const int sz = n - cntZero;
  
  int answer = MAX;
  for (int type = 1; type <= 2; ++type) { 
    memset(pref, 0, sizeof pref);
    memset(T.bit, 0, sizeof T.bit);

    deque<int> odd, even;
    for (int i = 1; i <= n; ++i) { 
      if (!h[i]) continue;
      auto& vt = (i ^ (h[i] == 1)) & 1 ? odd : even;
      vt.push_back(i);
    }

    vector<int> sequence;
    for (int i = 1; i < sz; ++i) { 
      auto& ret = pref[i];
      ret = pref[i - 1];

      auto& vt = i & 1 ? odd : even;
      if (!vt.size()) { ret = MAX; continue; }
      int pos = vt.front();
      vt.pop_front();

      ret += pos - 1 - T.que(pos - 1); 
      ret -= position.end() - upper_bound(position.begin(), position.end(), pos);
      T.upd(pos, 1);
      sequence.push_back(pos);
    }
    
    int total = totalZero;
    if (type == 1) { //calculate total
      auto& vt = (n ^ 1) & 1 ? odd : even;
      if (!vt.size()) total = MAX;
      else { 
        int pos = vt.front();
        vt.pop_front();
        total += pos - 1 - T.que(pos - 1) - Z.que(pos - 1);
        sequence.push_back(pos);
      }
    } else if (sz) { 
      auto& ret = pref[sz];
      ret = pref[sz - 1];

      auto& vt = sz & 1 ? odd : even;
      if (!vt.size()) ret = MAX;
      else { 
        int pos = vt.front();
        vt.pop_front();

        ret += pos - 1 - T.que(pos - 1); 
        ret -= position.end() - upper_bound(position.begin(), position.end(), pos);
        T.upd(pos, 1);
        sequence.push_back(pos);
      }
    }
    
    if ((int)sequence.size() == sz) {       
      if (type == 1) answer = min(answer, pref[sz - 1] + total);
      else answer = min(answer, pref[sz] + total);

      for (int i = (type == 1 ? sz - 2 : sz - 1); i >= 1; i -= 2) { 
        if (!(cntZero & 1)) swap(sequence[i - 1], sequence[i]);

        T.upd(sequence[i - 1], -1);
        T.upd(sequence[i], -1);

        total += sequence[i - 1] - 1 - T.que(sequence[i - 1] - 1) - Z.que(sequence[i - 1] - 1);
        T.upd(sequence[i - 1], 1);
        
        total += sequence[i] - 1 - T.que(sequence[i] - 1) - Z.que(sequence[i] - 1);
        T.upd(sequence[i], 1);
 
        T.upd(sequence[i - 1], -1);
        T.upd(sequence[i], -1);
        
        answer = min(answer, pref[i - 1] + total);
      }
    }
  }

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

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 10832 KB Output is correct
2 Correct 2 ms 10832 KB Output is correct
3 Correct 2 ms 10832 KB Output is correct
4 Correct 2 ms 10832 KB Output is correct
5 Correct 3 ms 10832 KB Output is correct
6 Correct 2 ms 11012 KB Output is correct
7 Correct 2 ms 10832 KB Output is correct
8 Correct 3 ms 10832 KB Output is correct
9 Correct 2 ms 11000 KB Output is correct
10 Correct 2 ms 10832 KB Output is correct
11 Correct 2 ms 10832 KB Output is correct
12 Correct 2 ms 10832 KB Output is correct
13 Correct 2 ms 10832 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 10832 KB Output is correct
2 Correct 2 ms 10832 KB Output is correct
3 Correct 2 ms 10832 KB Output is correct
4 Correct 2 ms 10832 KB Output is correct
5 Correct 3 ms 10832 KB Output is correct
6 Correct 2 ms 11012 KB Output is correct
7 Correct 2 ms 10832 KB Output is correct
8 Correct 3 ms 10832 KB Output is correct
9 Correct 2 ms 11000 KB Output is correct
10 Correct 2 ms 10832 KB Output is correct
11 Correct 2 ms 10832 KB Output is correct
12 Correct 2 ms 10832 KB Output is correct
13 Correct 2 ms 10832 KB Output is correct
14 Correct 3 ms 10844 KB Output is correct
15 Correct 102 ms 26152 KB Output is correct
16 Correct 119 ms 26180 KB Output is correct
17 Correct 104 ms 26068 KB Output is correct
18 Correct 70 ms 26040 KB Output is correct
19 Correct 107 ms 26168 KB Output is correct
20 Correct 160 ms 26304 KB Output is correct
21 Correct 156 ms 26024 KB Output is correct
22 Correct 156 ms 26072 KB Output is correct
23 Correct 156 ms 26184 KB Output is correct
24 Correct 91 ms 26004 KB Output is correct

Subtask #3
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 10832 KB Output is correct
2 Correct 2 ms 10832 KB Output is correct
3 Correct 2 ms 10832 KB Output is correct
4 Correct 2 ms 10832 KB Output is correct
5 Correct 3 ms 10832 KB Output is correct
6 Correct 2 ms 11012 KB Output is correct
7 Correct 2 ms 10832 KB Output is correct
8 Correct 3 ms 10832 KB Output is correct
9 Correct 2 ms 11000 KB Output is correct
10 Correct 2 ms 10832 KB Output is correct
11 Correct 2 ms 10832 KB Output is correct
12 Correct 2 ms 10832 KB Output is correct
13 Correct 2 ms 10832 KB Output is correct
14 Correct 2 ms 10832 KB Output is correct
15 Correct 3 ms 10320 KB Output is correct
16 Correct 2 ms 10832 KB Output is correct
17 Correct 3 ms 10832 KB Output is correct
18 Correct 3 ms 10448 KB Output is correct
19 Correct 3 ms 10740 KB Output is correct
20 Correct 3 ms 10576 KB Output is correct
21 Correct 4 ms 10576 KB Output is correct
22 Correct 2 ms 10832 KB Output is correct
23 Correct 3 ms 10576 KB Output is correct
24 Correct 3 ms 10576 KB Output is correct
25 Correct 4 ms 10576 KB Output is correct
26 Correct 4 ms 10576 KB Output is correct
27 Correct 3 ms 10384 KB Output is correct
28 Correct 3 ms 10576 KB Output is correct
29 Correct 4 ms 10576 KB Output is correct
30 Correct 2 ms 10832 KB Output is correct
31 Correct 3 ms 10832 KB Output is correct
32 Correct 2 ms 10832 KB Output is correct

Subtask #4
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 10832 KB Output is correct
2 Correct 2 ms 10832 KB Output is correct
3 Correct 2 ms 10832 KB Output is correct
4 Correct 2 ms 10832 KB Output is correct
5 Correct 3 ms 10832 KB Output is correct
6 Correct 2 ms 11012 KB Output is correct
7 Correct 2 ms 10832 KB Output is correct
8 Correct 3 ms 10832 KB Output is correct
9 Correct 2 ms 11000 KB Output is correct
10 Correct 2 ms 10832 KB Output is correct
11 Correct 2 ms 10832 KB Output is correct
12 Correct 2 ms 10832 KB Output is correct
13 Correct 2 ms 10832 KB Output is correct
14 Correct 3 ms 10844 KB Output is correct
15 Correct 102 ms 26152 KB Output is correct
16 Correct 119 ms 26180 KB Output is correct
17 Correct 104 ms 26068 KB Output is correct
18 Correct 70 ms 26040 KB Output is correct
19 Correct 107 ms 26168 KB Output is correct
20 Correct 160 ms 26304 KB Output is correct
21 Correct 156 ms 26024 KB Output is correct
22 Correct 156 ms 26072 KB Output is correct
23 Correct 156 ms 26184 KB Output is correct
24 Correct 91 ms 26004 KB Output is correct
25 Correct 2 ms 10832 KB Output is correct
26 Correct 3 ms 10320 KB Output is correct
27 Correct 2 ms 10832 KB Output is correct
28 Correct 3 ms 10832 KB Output is correct
29 Correct 3 ms 10448 KB Output is correct
30 Correct 3 ms 10740 KB Output is correct
31 Correct 3 ms 10576 KB Output is correct
32 Correct 4 ms 10576 KB Output is correct
33 Correct 2 ms 10832 KB Output is correct
34 Correct 3 ms 10576 KB Output is correct
35 Correct 3 ms 10576 KB Output is correct
36 Correct 4 ms 10576 KB Output is correct
37 Correct 4 ms 10576 KB Output is correct
38 Correct 3 ms 10384 KB Output is correct
39 Correct 3 ms 10576 KB Output is correct
40 Correct 4 ms 10576 KB Output is correct
41 Correct 2 ms 10832 KB Output is correct
42 Correct 3 ms 10832 KB Output is correct
43 Correct 2 ms 10832 KB Output is correct
44 Correct 109 ms 24256 KB Output is correct
45 Correct 96 ms 24256 KB Output is correct
46 Correct 98 ms 24148 KB Output is correct
47 Correct 80 ms 24256 KB Output is correct
48 Correct 133 ms 28560 KB Output is correct
49 Correct 147 ms 26304 KB Output is correct
50 Correct 83 ms 23656 KB Output is correct
51 Correct 118 ms 23616 KB Output is correct
52 Correct 115 ms 23612 KB Output is correct
53 Correct 53 ms 23616 KB Output is correct
54 Correct 144 ms 27112 KB Output is correct
55 Correct 110 ms 27036 KB Output is correct
56 Correct 166 ms 25660 KB Output is correct
57 Correct 36 ms 20156 KB Output is correct
58 Correct 38 ms 20156 KB Output is correct
59 Correct 42 ms 20288 KB Output is correct

Subtask #5
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 10320 KB Output is correct
2 Incorrect 3 ms 10320 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 10320 KB Output is correct
2 Incorrect 3 ms 10320 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 10832 KB Output is correct
2 Correct 2 ms 10832 KB Output is correct
3 Correct 2 ms 10832 KB Output is correct
4 Correct 2 ms 10832 KB Output is correct
5 Correct 3 ms 10832 KB Output is correct
6 Correct 2 ms 11012 KB Output is correct
7 Correct 2 ms 10832 KB Output is correct
8 Correct 3 ms 10832 KB Output is correct
9 Correct 2 ms 11000 KB Output is correct
10 Correct 2 ms 10832 KB Output is correct
11 Correct 2 ms 10832 KB Output is correct
12 Correct 2 ms 10832 KB Output is correct
13 Correct 2 ms 10832 KB Output is correct
14 Correct 2 ms 10832 KB Output is correct
15 Correct 3 ms 10320 KB Output is correct
16 Correct 2 ms 10832 KB Output is correct
17 Correct 3 ms 10832 KB Output is correct
18 Correct 3 ms 10448 KB Output is correct
19 Correct 3 ms 10740 KB Output is correct
20 Correct 3 ms 10576 KB Output is correct
21 Correct 4 ms 10576 KB Output is correct
22 Correct 2 ms 10832 KB Output is correct
23 Correct 3 ms 10576 KB Output is correct
24 Correct 3 ms 10576 KB Output is correct
25 Correct 4 ms 10576 KB Output is correct
26 Correct 4 ms 10576 KB Output is correct
27 Correct 3 ms 10384 KB Output is correct
28 Correct 3 ms 10576 KB Output is correct
29 Correct 4 ms 10576 KB Output is correct
30 Correct 2 ms 10832 KB Output is correct
31 Correct 3 ms 10832 KB Output is correct
32 Correct 2 ms 10832 KB Output is correct
33 Correct 4 ms 10320 KB Output is correct
34 Incorrect 3 ms 10320 KB Output isn't correct
35 Halted 0 ms 0 KB -

Subtask #8
0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 10832 KB Output is correct
2 Correct 2 ms 10832 KB Output is correct
3 Correct 2 ms 10832 KB Output is correct
4 Correct 2 ms 10832 KB Output is correct
5 Correct 3 ms 10832 KB Output is correct
6 Correct 2 ms 11012 KB Output is correct
7 Correct 2 ms 10832 KB Output is correct
8 Correct 3 ms 10832 KB Output is correct
9 Correct 2 ms 11000 KB Output is correct
10 Correct 2 ms 10832 KB Output is correct
11 Correct 2 ms 10832 KB Output is correct
12 Correct 2 ms 10832 KB Output is correct
13 Correct 2 ms 10832 KB Output is correct
14 Correct 3 ms 10844 KB Output is correct
15 Correct 102 ms 26152 KB Output is correct
16 Correct 119 ms 26180 KB Output is correct
17 Correct 104 ms 26068 KB Output is correct
18 Correct 70 ms 26040 KB Output is correct
19 Correct 107 ms 26168 KB Output is correct
20 Correct 160 ms 26304 KB Output is correct
21 Correct 156 ms 26024 KB Output is correct
22 Correct 156 ms 26072 KB Output is correct
23 Correct 156 ms 26184 KB Output is correct
24 Correct 91 ms 26004 KB Output is correct
25 Correct 2 ms 10832 KB Output is correct
26 Correct 3 ms 10320 KB Output is correct
27 Correct 2 ms 10832 KB Output is correct
28 Correct 3 ms 10832 KB Output is correct
29 Correct 3 ms 10448 KB Output is correct
30 Correct 3 ms 10740 KB Output is correct
31 Correct 3 ms 10576 KB Output is correct
32 Correct 4 ms 10576 KB Output is correct
33 Correct 2 ms 10832 KB Output is correct
34 Correct 3 ms 10576 KB Output is correct
35 Correct 3 ms 10576 KB Output is correct
36 Correct 4 ms 10576 KB Output is correct
37 Correct 4 ms 10576 KB Output is correct
38 Correct 3 ms 10384 KB Output is correct
39 Correct 3 ms 10576 KB Output is correct
40 Correct 4 ms 10576 KB Output is correct
41 Correct 2 ms 10832 KB Output is correct
42 Correct 3 ms 10832 KB Output is correct
43 Correct 2 ms 10832 KB Output is correct
44 Correct 109 ms 24256 KB Output is correct
45 Correct 96 ms 24256 KB Output is correct
46 Correct 98 ms 24148 KB Output is correct
47 Correct 80 ms 24256 KB Output is correct
48 Correct 133 ms 28560 KB Output is correct
49 Correct 147 ms 26304 KB Output is correct
50 Correct 83 ms 23656 KB Output is correct
51 Correct 118 ms 23616 KB Output is correct
52 Correct 115 ms 23612 KB Output is correct
53 Correct 53 ms 23616 KB Output is correct
54 Correct 144 ms 27112 KB Output is correct
55 Correct 110 ms 27036 KB Output is correct
56 Correct 166 ms 25660 KB Output is correct
57 Correct 36 ms 20156 KB Output is correct
58 Correct 38 ms 20156 KB Output is correct
59 Correct 42 ms 20288 KB Output is correct
60 Correct 4 ms 10320 KB Output is correct
61 Incorrect 3 ms 10320 KB Output isn't correct
62 Halted 0 ms 0 KB -