oj.uz

Submission #790745

# Submission time Handle Problem Language Result Execution time Memory
790745 2023-07-23T07:30:08 Z PoonYaPat Meetings (IOI18_meetings) C++14
19 / 100
 631 ms 351628 KB 
#include "meetings.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

ll s[30000],h[5005],mmax[5005][5005],sumL[5005][5005],sumR[5005][5005];
int n;


vector<long long> minimum_costs(vector<int> H, vector<int> L, vector<int> R) {
  n=H.size();
  assert(n<=5000);
  vector<ll> ans;
  for (int i=0; i<n; ++i) h[i]=H[i];
  
  for (int i=0; i<n; ++i) {
    mmax[i][i]=h[i];
    for (int j=i+1; j<n; ++j) mmax[i][j]=max(mmax[i][j-1],h[j]);
  }

  for (int r=0; r<n; ++r) {
    sumL[r][r]=h[r];
    for (int l=r-1; l>=0; --l) sumL[l][r]=sumL[l+1][r]+mmax[l][r];
  }

  for (int l=0; l<n; ++l) {
    sumR[l][l]=h[l];
    for (int r=l+1; r<n; ++r) sumR[l][r]=sumR[l][r-1]+mmax[l][r];
  }

  for (int i=0; i<L.size(); ++i) {
    ll mi=LLONG_MAX;
    for (int j=L[i]; j<=R[i]; ++j) mi=min(mi,sumL[L[i]][j]+sumR[j][R[i]]-h[j]);
    ans.push_back(mi);
  }
  return ans;
}

Compilation message

meetings.cpp: In function 'std::vector<long long int> minimum_costs(std::vector<int>, std::vector<int>, std::vector<int>)':
meetings.cpp:31:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 |   for (int i=0; i<L.size(); ++i) {
      |                 ~^~~~~~~~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 134 ms 142416 KB Output is correct
3 Correct 133 ms 142376 KB Output is correct
4 Correct 138 ms 142496 KB Output is correct
5 Correct 131 ms 142312 KB Output is correct
6 Correct 134 ms 142416 KB Output is correct
7 Correct 135 ms 142416 KB Output is correct
8 Correct 137 ms 142380 KB Output is correct
9 Correct 132 ms 142412 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 134 ms 142416 KB Output is correct
3 Correct 133 ms 142376 KB Output is correct
4 Correct 138 ms 142496 KB Output is correct
5 Correct 131 ms 142312 KB Output is correct
6 Correct 134 ms 142416 KB Output is correct
7 Correct 135 ms 142416 KB Output is correct
8 Correct 137 ms 142380 KB Output is correct
9 Correct 132 ms 142412 KB Output is correct
10 Correct 514 ms 351584 KB Output is correct
11 Correct 599 ms 351600 KB Output is correct
12 Correct 505 ms 351500 KB Output is correct
13 Correct 631 ms 351500 KB Output is correct
14 Correct 505 ms 351604 KB Output is correct
15 Correct 508 ms 351628 KB Output is correct

Subtask #3
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Runtime error 15 ms 1108 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -

Subtask #4
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Runtime error 15 ms 1108 KB Execution killed with signal 6
3 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 134 ms 142416 KB Output is correct
3 Correct 133 ms 142376 KB Output is correct
4 Correct 138 ms 142496 KB Output is correct
5 Correct 131 ms 142312 KB Output is correct
6 Correct 134 ms 142416 KB Output is correct
7 Correct 135 ms 142416 KB Output is correct
8 Correct 137 ms 142380 KB Output is correct
9 Correct 132 ms 142412 KB Output is correct
10 Correct 514 ms 351584 KB Output is correct
11 Correct 599 ms 351600 KB Output is correct
12 Correct 505 ms 351500 KB Output is correct
13 Correct 631 ms 351500 KB Output is correct
14 Correct 505 ms 351604 KB Output is correct
15 Correct 508 ms 351628 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Runtime error 15 ms 1108 KB Execution killed with signal 6
18 Halted 0 ms 0 KB -