oj.uz

Submission #1114223

# Submission time Handle Problem Language Result Execution time Memory
1114223 2024-11-18T11:42:09 Z duckindog Line Town (CCO23_day1problem3) C++17
17 / 25
 173 ms 102988 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];

namespace sub4 { 
  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;
  void solve() { 
    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";
  }
}

namespace sub5 { 
  static const int SZ = 2000 + 10;
  int bit[SZ];
  void upd(int i, int x) { 
    for (; i <= n; i += i & -i) bit[i] += x;
  } 
  int que(int i) { 
    int ret = 0;
    for (; i; i -= i & -i) ret += bit[i];
    return ret;
  }

  long long f[SZ][SZ];
  void solve() { 
    vector<int> vt(n); iota(vt.begin(), vt.end(), 1);
    sort(vt.begin(), vt.end(), [&](const auto& a, const auto& b) { 
      return abs(h[a]) > abs(h[b]);
    });
    for (int i = 1; i <= n; ++i) upd(i, 1);

    memset(f, 14, sizeof f);
    f[0][n + 1] = 0;
    for (int i = 1; i <= n; ++i) { 
      int pos = vt[i - 1];
      upd(pos, -1);

      { // go left
        int cnt = que(pos);
        for (int l = 1; l <= i; ++l) { 
          if (((abs(pos - l) ^ (h[pos] < 0)) & 1) || !h[pos]) { 
            int r = n - i + 1 + l;
            auto& ret = f[l][r];
            ret = min(ret, f[l - 1][r] + cnt);
          }
        }
        
      }

      { // go right
        int cnt = que(n) - que(pos);
        for (int r = n; r >= n - i + 1; --r) { 
          if (((abs(pos - r) ^ (h[pos] > 0)) & 1) || !h[pos]) { 
            int l = i - (n - r + 1);
            auto& ret = f[l][r];
            ret = min(ret, f[l][r + 1] + cnt);
          }
        }
      }
    }

    long long answer = MAX;
    for (int i = 0; i <= n; ++i) answer = min(answer, f[i][i + 1]);

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

int32_t main() { 
  cin.tie(0)->sync_with_stdio(0);
 
  cin >> n;
  for (int i = 1; i <= n; ++i) cin >> h[i];

  if (all_of(h + 1, h + n + 1, [](const auto& a) { return abs(a) <= 1; })) { 
    sub4::solve();
    return 0;
  };
  
  sub5::solve();
}

Subtask #1
3.0 / 3.0

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

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 12624 KB Output is correct
2 Correct 2 ms 12624 KB Output is correct
3 Correct 2 ms 12624 KB Output is correct
4 Correct 4 ms 12624 KB Output is correct
5 Correct 3 ms 12792 KB Output is correct
6 Correct 2 ms 12624 KB Output is correct
7 Correct 3 ms 12624 KB Output is correct
8 Correct 3 ms 12624 KB Output is correct
9 Correct 3 ms 12880 KB Output is correct
10 Correct 3 ms 12624 KB Output is correct
11 Correct 3 ms 12624 KB Output is correct
12 Correct 3 ms 12624 KB Output is correct
13 Correct 3 ms 12624 KB Output is correct
14 Correct 3 ms 12624 KB Output is correct
15 Correct 104 ms 28024 KB Output is correct
16 Correct 110 ms 28084 KB Output is correct
17 Correct 113 ms 28092 KB Output is correct
18 Correct 74 ms 28088 KB Output is correct
19 Correct 106 ms 28088 KB Output is correct
20 Correct 163 ms 28340 KB Output is correct
21 Correct 149 ms 28088 KB Output is correct
22 Correct 157 ms 28096 KB Output is correct
23 Correct 152 ms 27984 KB Output is correct
24 Correct 88 ms 28088 KB Output is correct

Subtask #3
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 12624 KB Output is correct
2 Correct 2 ms 12624 KB Output is correct
3 Correct 2 ms 12624 KB Output is correct
4 Correct 4 ms 12624 KB Output is correct
5 Correct 3 ms 12792 KB Output is correct
6 Correct 2 ms 12624 KB Output is correct
7 Correct 3 ms 12624 KB Output is correct
8 Correct 3 ms 12624 KB Output is correct
9 Correct 3 ms 12880 KB Output is correct
10 Correct 3 ms 12624 KB Output is correct
11 Correct 3 ms 12624 KB Output is correct
12 Correct 3 ms 12624 KB Output is correct
13 Correct 3 ms 12624 KB Output is correct
14 Correct 2 ms 12624 KB Output is correct
15 Correct 3 ms 11088 KB Output is correct
16 Correct 2 ms 12624 KB Output is correct
17 Correct 3 ms 12624 KB Output is correct
18 Correct 3 ms 11256 KB Output is correct
19 Correct 3 ms 11088 KB Output is correct
20 Correct 3 ms 11088 KB Output is correct
21 Correct 3 ms 11088 KB Output is correct
22 Correct 2 ms 12624 KB Output is correct
23 Correct 2 ms 11088 KB Output is correct
24 Correct 2 ms 11088 KB Output is correct
25 Correct 2 ms 11260 KB Output is correct
26 Correct 3 ms 11088 KB Output is correct
27 Correct 3 ms 11088 KB Output is correct
28 Correct 3 ms 11088 KB Output is correct
29 Correct 2 ms 11088 KB Output is correct
30 Correct 3 ms 12624 KB Output is correct
31 Correct 2 ms 12624 KB Output is correct
32 Correct 2 ms 12624 KB Output is correct

Subtask #4
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 12624 KB Output is correct
2 Correct 2 ms 12624 KB Output is correct
3 Correct 2 ms 12624 KB Output is correct
4 Correct 4 ms 12624 KB Output is correct
5 Correct 3 ms 12792 KB Output is correct
6 Correct 2 ms 12624 KB Output is correct
7 Correct 3 ms 12624 KB Output is correct
8 Correct 3 ms 12624 KB Output is correct
9 Correct 3 ms 12880 KB Output is correct
10 Correct 3 ms 12624 KB Output is correct
11 Correct 3 ms 12624 KB Output is correct
12 Correct 3 ms 12624 KB Output is correct
13 Correct 3 ms 12624 KB Output is correct
14 Correct 3 ms 12624 KB Output is correct
15 Correct 104 ms 28024 KB Output is correct
16 Correct 110 ms 28084 KB Output is correct
17 Correct 113 ms 28092 KB Output is correct
18 Correct 74 ms 28088 KB Output is correct
19 Correct 106 ms 28088 KB Output is correct
20 Correct 163 ms 28340 KB Output is correct
21 Correct 149 ms 28088 KB Output is correct
22 Correct 157 ms 28096 KB Output is correct
23 Correct 152 ms 27984 KB Output is correct
24 Correct 88 ms 28088 KB Output is correct
25 Correct 2 ms 12624 KB Output is correct
26 Correct 3 ms 11088 KB Output is correct
27 Correct 2 ms 12624 KB Output is correct
28 Correct 3 ms 12624 KB Output is correct
29 Correct 3 ms 11256 KB Output is correct
30 Correct 3 ms 11088 KB Output is correct
31 Correct 3 ms 11088 KB Output is correct
32 Correct 3 ms 11088 KB Output is correct
33 Correct 2 ms 12624 KB Output is correct
34 Correct 2 ms 11088 KB Output is correct
35 Correct 2 ms 11088 KB Output is correct
36 Correct 2 ms 11260 KB Output is correct
37 Correct 3 ms 11088 KB Output is correct
38 Correct 3 ms 11088 KB Output is correct
39 Correct 3 ms 11088 KB Output is correct
40 Correct 2 ms 11088 KB Output is correct
41 Correct 3 ms 12624 KB Output is correct
42 Correct 2 ms 12624 KB Output is correct
43 Correct 2 ms 12624 KB Output is correct
44 Correct 113 ms 26068 KB Output is correct
45 Correct 101 ms 26048 KB Output is correct
46 Correct 101 ms 25984 KB Output is correct
47 Correct 96 ms 26024 KB Output is correct
48 Correct 137 ms 29932 KB Output is correct
49 Correct 146 ms 28088 KB Output is correct
50 Correct 93 ms 25100 KB Output is correct
51 Correct 124 ms 25024 KB Output is correct
52 Correct 127 ms 25024 KB Output is correct
53 Correct 77 ms 25024 KB Output is correct
54 Correct 156 ms 28724 KB Output is correct
55 Correct 112 ms 27956 KB Output is correct
56 Correct 158 ms 28212 KB Output is correct
57 Correct 42 ms 21992 KB Output is correct
58 Correct 42 ms 21792 KB Output is correct
59 Correct 36 ms 21964 KB Output is correct

Subtask #5
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 35408 KB Output is correct
2 Correct 5 ms 35408 KB Output is correct
3 Correct 12 ms 35408 KB Output is correct
4 Correct 11 ms 35408 KB Output is correct
5 Correct 10 ms 35408 KB Output is correct
6 Correct 14 ms 35408 KB Output is correct
7 Correct 14 ms 35420 KB Output is correct
8 Correct 11 ms 35408 KB Output is correct
9 Correct 3 ms 12880 KB Output is correct
10 Correct 5 ms 35488 KB Output is correct
11 Correct 14 ms 35312 KB Output is correct
12 Correct 14 ms 35556 KB Output is correct
13 Correct 14 ms 35408 KB Output is correct

Subtask #6
0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 35408 KB Output is correct
2 Correct 5 ms 35408 KB Output is correct
3 Correct 12 ms 35408 KB Output is correct
4 Correct 11 ms 35408 KB Output is correct
5 Correct 10 ms 35408 KB Output is correct
6 Correct 14 ms 35408 KB Output is correct
7 Correct 14 ms 35420 KB Output is correct
8 Correct 11 ms 35408 KB Output is correct
9 Correct 3 ms 12880 KB Output is correct
10 Correct 5 ms 35488 KB Output is correct
11 Correct 14 ms 35312 KB Output is correct
12 Correct 14 ms 35556 KB Output is correct
13 Correct 14 ms 35408 KB Output is correct
14 Runtime error 173 ms 102988 KB Execution killed with signal 11
15 Halted 0 ms 0 KB -

Subtask #7
0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 12624 KB Output is correct
2 Correct 2 ms 12624 KB Output is correct
3 Correct 2 ms 12624 KB Output is correct
4 Correct 4 ms 12624 KB Output is correct
5 Correct 3 ms 12792 KB Output is correct
6 Correct 2 ms 12624 KB Output is correct
7 Correct 3 ms 12624 KB Output is correct
8 Correct 3 ms 12624 KB Output is correct
9 Correct 3 ms 12880 KB Output is correct
10 Correct 3 ms 12624 KB Output is correct
11 Correct 3 ms 12624 KB Output is correct
12 Correct 3 ms 12624 KB Output is correct
13 Correct 3 ms 12624 KB Output is correct
14 Correct 2 ms 12624 KB Output is correct
15 Correct 3 ms 11088 KB Output is correct
16 Correct 2 ms 12624 KB Output is correct
17 Correct 3 ms 12624 KB Output is correct
18 Correct 3 ms 11256 KB Output is correct
19 Correct 3 ms 11088 KB Output is correct
20 Correct 3 ms 11088 KB Output is correct
21 Correct 3 ms 11088 KB Output is correct
22 Correct 2 ms 12624 KB Output is correct
23 Correct 2 ms 11088 KB Output is correct
24 Correct 2 ms 11088 KB Output is correct
25 Correct 2 ms 11260 KB Output is correct
26 Correct 3 ms 11088 KB Output is correct
27 Correct 3 ms 11088 KB Output is correct
28 Correct 3 ms 11088 KB Output is correct
29 Correct 2 ms 11088 KB Output is correct
30 Correct 3 ms 12624 KB Output is correct
31 Correct 2 ms 12624 KB Output is correct
32 Correct 2 ms 12624 KB Output is correct
33 Correct 5 ms 35408 KB Output is correct
34 Correct 5 ms 35408 KB Output is correct
35 Correct 12 ms 35408 KB Output is correct
36 Correct 11 ms 35408 KB Output is correct
37 Correct 10 ms 35408 KB Output is correct
38 Correct 14 ms 35408 KB Output is correct
39 Correct 14 ms 35420 KB Output is correct
40 Correct 11 ms 35408 KB Output is correct
41 Correct 3 ms 12880 KB Output is correct
42 Correct 5 ms 35488 KB Output is correct
43 Correct 14 ms 35312 KB Output is correct
44 Correct 14 ms 35556 KB Output is correct
45 Correct 14 ms 35408 KB Output is correct
46 Correct 14 ms 35420 KB Output is correct
47 Correct 12 ms 35572 KB Output is correct
48 Incorrect 12 ms 35420 KB Output isn't correct
49 Halted 0 ms 0 KB -

Subtask #8
0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 12624 KB Output is correct
2 Correct 2 ms 12624 KB Output is correct
3 Correct 2 ms 12624 KB Output is correct
4 Correct 4 ms 12624 KB Output is correct
5 Correct 3 ms 12792 KB Output is correct
6 Correct 2 ms 12624 KB Output is correct
7 Correct 3 ms 12624 KB Output is correct
8 Correct 3 ms 12624 KB Output is correct
9 Correct 3 ms 12880 KB Output is correct
10 Correct 3 ms 12624 KB Output is correct
11 Correct 3 ms 12624 KB Output is correct
12 Correct 3 ms 12624 KB Output is correct
13 Correct 3 ms 12624 KB Output is correct
14 Correct 3 ms 12624 KB Output is correct
15 Correct 104 ms 28024 KB Output is correct
16 Correct 110 ms 28084 KB Output is correct
17 Correct 113 ms 28092 KB Output is correct
18 Correct 74 ms 28088 KB Output is correct
19 Correct 106 ms 28088 KB Output is correct
20 Correct 163 ms 28340 KB Output is correct
21 Correct 149 ms 28088 KB Output is correct
22 Correct 157 ms 28096 KB Output is correct
23 Correct 152 ms 27984 KB Output is correct
24 Correct 88 ms 28088 KB Output is correct
25 Correct 2 ms 12624 KB Output is correct
26 Correct 3 ms 11088 KB Output is correct
27 Correct 2 ms 12624 KB Output is correct
28 Correct 3 ms 12624 KB Output is correct
29 Correct 3 ms 11256 KB Output is correct
30 Correct 3 ms 11088 KB Output is correct
31 Correct 3 ms 11088 KB Output is correct
32 Correct 3 ms 11088 KB Output is correct
33 Correct 2 ms 12624 KB Output is correct
34 Correct 2 ms 11088 KB Output is correct
35 Correct 2 ms 11088 KB Output is correct
36 Correct 2 ms 11260 KB Output is correct
37 Correct 3 ms 11088 KB Output is correct
38 Correct 3 ms 11088 KB Output is correct
39 Correct 3 ms 11088 KB Output is correct
40 Correct 2 ms 11088 KB Output is correct
41 Correct 3 ms 12624 KB Output is correct
42 Correct 2 ms 12624 KB Output is correct
43 Correct 2 ms 12624 KB Output is correct
44 Correct 113 ms 26068 KB Output is correct
45 Correct 101 ms 26048 KB Output is correct
46 Correct 101 ms 25984 KB Output is correct
47 Correct 96 ms 26024 KB Output is correct
48 Correct 137 ms 29932 KB Output is correct
49 Correct 146 ms 28088 KB Output is correct
50 Correct 93 ms 25100 KB Output is correct
51 Correct 124 ms 25024 KB Output is correct
52 Correct 127 ms 25024 KB Output is correct
53 Correct 77 ms 25024 KB Output is correct
54 Correct 156 ms 28724 KB Output is correct
55 Correct 112 ms 27956 KB Output is correct
56 Correct 158 ms 28212 KB Output is correct
57 Correct 42 ms 21992 KB Output is correct
58 Correct 42 ms 21792 KB Output is correct
59 Correct 36 ms 21964 KB Output is correct
60 Correct 5 ms 35408 KB Output is correct
61 Correct 5 ms 35408 KB Output is correct
62 Correct 12 ms 35408 KB Output is correct
63 Correct 11 ms 35408 KB Output is correct
64 Correct 10 ms 35408 KB Output is correct
65 Correct 14 ms 35408 KB Output is correct
66 Correct 14 ms 35420 KB Output is correct
67 Correct 11 ms 35408 KB Output is correct
68 Correct 3 ms 12880 KB Output is correct
69 Correct 5 ms 35488 KB Output is correct
70 Correct 14 ms 35312 KB Output is correct
71 Correct 14 ms 35556 KB Output is correct
72 Correct 14 ms 35408 KB Output is correct
73 Runtime error 173 ms 102988 KB Execution killed with signal 11
74 Halted 0 ms 0 KB -