oj.uz

Submission #601636

# Submission time Handle Problem Language Result Execution time Memory
601636 2022-07-22T08:50:49 Z Belgutei Meetings (IOI18_meetings) C++17
19 / 100
 5500 ms 5468 KB 
#include "meetings.h"
#include<bits/stdc++.h>

using namespace std;

#define ll long long
#define ff first
#define ss second
#define pb push_back
#define mk make_pair

int l,r;
stack<pair<int,int> > s;
vector<ll> ret;
ll a[800005];

std::vector<long long> minimum_costs(std::vector<int> H, std::vector<int> L,std::vector<int> R) {
  int q = L.size();
  for(int i = 0; i < q; i ++) {
    l = L[i];
    r = R[i];
    ll sum = 0;
    ll ans = 1e18;
    for(int j = l; j <= r; j ++) {
      sum += H[j];
      while(s.size() > 0 && s.top().ff <= H[j]) {
        int x = s.top().ss;
        ll val = s.top().ff;
        if(s.size() > 1) {
          s.pop();
          int y = s.top().ss + 1;
          sum -= (ll) (x - y + 1) * val;
          sum += (ll) (x - y + 1) * H[j];
        }
        else {
          int y = l;
          sum -= (ll) (x - y + 1) * val;
          sum += (ll) (x - y + 1) * H[j];
          s.pop();
        }
      }
      //
      s.push({H[j], j}); // value / index
      a[j] = sum;
    }
    //
    while(s.size() > 0) s.pop();
    sum = 0;
    for(int j = r; j >= l; j --) {
      sum += H[j];
      while(s.size() > 0 && s.top().ff <= H[j]) {
        int x = s.top().ss;
        ll val = s.top().ff;
        if(s.size() > 1) {
          s.pop();
          int y = s.top().ss - 1;
          sum -= (ll) (y - x + 1) * val;
          sum += (ll) (y - x + 1) * H[j];
        }
        else {
          int y = r;
          sum -= (ll) (y - x + 1) * val;
          sum += (ll) (y - x + 1) * H[j];
          s.pop();
        }
      }
      //
      s.push({H[j], j}); // value / index
      a[j] += sum - H[j]; 
      ans = min(ans,a[j]);
    }
    while(s.size() > 0) s.pop();
    ret.pb(ans);
  }
  return ret;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 2 ms 320 KB Output is correct
4 Correct 3 ms 324 KB Output is correct
5 Correct 2 ms 320 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 324 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 2 ms 340 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 2 ms 320 KB Output is correct
4 Correct 3 ms 324 KB Output is correct
5 Correct 2 ms 320 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 324 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 311 ms 664 KB Output is correct
11 Correct 943 ms 696 KB Output is correct
12 Correct 295 ms 604 KB Output is correct
13 Correct 984 ms 668 KB Output is correct
14 Correct 240 ms 612 KB Output is correct
15 Correct 259 ms 700 KB Output is correct

Subtask #3
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 4373 ms 2184 KB Output is correct
3 Execution timed out 5552 ms 5468 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 4373 ms 2184 KB Output is correct
3 Execution timed out 5552 ms 5468 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #5
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 2 ms 320 KB Output is correct
4 Correct 3 ms 324 KB Output is correct
5 Correct 2 ms 320 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 324 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 311 ms 664 KB Output is correct
11 Correct 943 ms 696 KB Output is correct
12 Correct 295 ms 604 KB Output is correct
13 Correct 984 ms 668 KB Output is correct
14 Correct 240 ms 612 KB Output is correct
15 Correct 259 ms 700 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 4373 ms 2184 KB Output is correct
18 Execution timed out 5552 ms 5468 KB Time limit exceeded
19 Halted 0 ms 0 KB -