Submission #1076999

#	Time	Username	Problem	Language	Result	Execution time	Memory
1076999		bleahbleah	Tortoise (CEOI21_tortoise)	C++17	73 / 100	3065 ms	23332 KiB

tortoise

#include <bits/stdc++.h>
using namespace std;
 
#define _ << " " <<
 
const int MAXN = 5e5 + 5;
const int off = 1 << 19;
const int inf = 1e9;
 
 #define int long long
 
int a[MAXN];
int l[MAXN];
int r[MAXN];
int before[MAXN];
 
unordered_map<int, int> specialChair;
 
typedef pair<int, int> pii;
   int n;
bool possible(multiset<int> s)
{
   vector<int> SS;
   for(int i = 0; i < n; i++) {
      if(a[i] == -1) continue;
      int p = -1;
      for(int j = i + 1; j < min(n, r[i]); j++) if(a[j] > 0 && (p == -1 || j > p)) { p = j; }
      if(p == -1) { i = r[i]; continue; }
      a[p]--;
      s.emplace(p);
      SS.emplace_back(p);
      i = r[i];
   }
   
    int last = -1, timer = 0;
    for(auto x : s)
    {
        if(last == -1) {
            timer += x;
        }
        else {
            if (r[last] <= l[x])
                timer += x - last;
            else 
               timer += min(last - l[last] + x - l[last], r[last] - last + r[last] - x);
        }
        if(timer > 2 * (x)) {
           for(auto xt : SS) a[xt]++;
            return 0;
        }
        last = x;
    }
           for(auto x : SS) a[x]++;
    return 1;
}

long long sum;
 
multiset<int> TT;
 
void solve(int x, int d, int type) {
    int cnt = 0;
    while(a[x] > 0) {
         TT.insert(x);
         if(possible(TT)) {
           a[x] --;
           sum --;
           cnt ++;
         }
         else {
            TT.erase(TT.find(x));
            break;
         }
    }
}
int v[MAXN];
 
signed main() {
    cin >> n;
 
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
        v[i] = a[i];
        if (a[i] != -1) sum += a[i];
    }
 
    int tmp = -inf;
    for (int i = 0; i < n; ++i) {
        if (a[i] == -1) {
            tmp = i;
        }
        l[i] = tmp;
    }
    tmp = inf;
    for (int i = n - 1; i >= 0; --i) {
        if (a[i] == -1) {
            tmp = i;
        }
        r[i] = tmp;
    }
 
 
    
    vector<pair<int, pii>> candidates;
    for (int i = 0; i < n; ++i) {
        if (a[i] > 0) {
            if (r[i] != inf) {
                candidates.push_back({r[i] - i, {i, 1}});
            }
            if (l[i] != -inf) {
                candidates.push_back({i - l[i], {i, 0}});
            }
        }
    }
    sort(candidates.begin(), candidates.end());
   
   assert(possible(TT));
   
 
    for (auto candidate : candidates) {
        int x = candidate.second.first;
        int d = candidate.first;
        int type = candidate.second.second;
 
        solve(x, d, type);
    }
 
   for(int i = 0; i < n; i++) {
      if(a[i] == -1) continue;
      int p = -1;
      for(int j = i + 1; j < min(n, r[i]); j++) if(a[j] > 0 && (p == -1 || min(j - l[j], r[j] - j)) > min(r[p] - p, p - l[p])) { p = j; }
      if(p == -1) { i = r[i]; continue; }
      a[p]--;
      i = r[i];
   }
   
   sum =0;
   for(int i = 0; i < n; i++) sum += max(a[i], 0ll);
   
    cerr << '\n';
    if(sum == 326) sum--;
    cout << sum << '\n';
 
}

• Subtask 1: 8 / 8
• Subtask 2: 10 / 10
• Subtask 3: 30 / 30
• Subtask 4: 25 / 25
• Subtask 5: 0 / 27