oj.uz

Submission #615284

# Submission time Handle Problem Language Result Execution time Memory
615284 2022-07-31T08:16:26 Z Minindu2006 Meetings (IOI18_meetings) C++17
19 / 100
 3496 ms 786432 KB 
#include "meetings.h"
#include <bits/stdc++.h>
#define ll long long
using namespace std;

vector<ll> minimum_costs(vector<int> H, vector<int> L, vector<int> R)
{
  int n = H.size(), q = L.size();
  ll cost[n][n]; // cost from ith to jth
  for(int i=0;i<n;i++)
  {
    cost[i][i] = H[i];
    for(int k=i-1;k>=0;k--)
      cost[i][k] = max(cost[i][k + 1], (ll)H[k]);
    for(int k=i+1;k<n;k++)
      cost[i][k] = max(cost[i][k - 1], (ll)H[k]);
    for(int k=1;k<n;k++)
      cost[i][k] += cost[i][k - 1];
  }
  vector<ll> res;
  for(int i=0;i<q;i++)
  {
    ll ans = LLONG_MAX;
    for(int k=L[i];k<=R[i];k++)
      ans = min(ans, (L[i] > 0 ? cost[k][R[i]] - cost[k][L[i] - 1] : cost[k][R[i]]));
    res.push_back(ans);
  }
  return res;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 84 ms 70780 KB Output is correct
3 Correct 83 ms 70732 KB Output is correct
4 Correct 94 ms 70660 KB Output is correct
5 Correct 84 ms 70784 KB Output is correct
6 Correct 90 ms 70784 KB Output is correct
7 Correct 85 ms 70776 KB Output is correct
8 Correct 81 ms 70776 KB Output is correct
9 Correct 86 ms 70760 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 84 ms 70780 KB Output is correct
3 Correct 83 ms 70732 KB Output is correct
4 Correct 94 ms 70660 KB Output is correct
5 Correct 84 ms 70784 KB Output is correct
6 Correct 90 ms 70784 KB Output is correct
7 Correct 85 ms 70776 KB Output is correct
8 Correct 81 ms 70776 KB Output is correct
9 Correct 86 ms 70760 KB Output is correct
10 Correct 390 ms 196388 KB Output is correct
11 Correct 534 ms 196356 KB Output is correct
12 Correct 396 ms 196240 KB Output is correct
13 Correct 544 ms 196356 KB Output is correct
14 Correct 472 ms 196300 KB Output is correct
15 Correct 449 ms 196252 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 3496 ms 505156 KB Output is correct
3 Runtime error 391 ms 786432 KB Execution killed with signal 9
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 3496 ms 505156 KB Output is correct
3 Runtime error 391 ms 786432 KB Execution killed with signal 9
4 Halted 0 ms 0 KB -

Subtask #5
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 84 ms 70780 KB Output is correct
3 Correct 83 ms 70732 KB Output is correct
4 Correct 94 ms 70660 KB Output is correct
5 Correct 84 ms 70784 KB Output is correct
6 Correct 90 ms 70784 KB Output is correct
7 Correct 85 ms 70776 KB Output is correct
8 Correct 81 ms 70776 KB Output is correct
9 Correct 86 ms 70760 KB Output is correct
10 Correct 390 ms 196388 KB Output is correct
11 Correct 534 ms 196356 KB Output is correct
12 Correct 396 ms 196240 KB Output is correct
13 Correct 544 ms 196356 KB Output is correct
14 Correct 472 ms 196300 KB Output is correct
15 Correct 449 ms 196252 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 3496 ms 505156 KB Output is correct
18 Runtime error 391 ms 786432 KB Execution killed with signal 9
19 Halted 0 ms 0 KB -