oj.uz

Submission #972885

# Submission time Handle Problem Language Result Execution time Memory
972885 2024-05-01T09:31:07 Z kwongweng Meetings (IOI18_meetings) C++17
19 / 100
 3859 ms 786432 KB 
#include "meetings.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef long double ld;
typedef vector<vector<ll>> vll;
#define FOR(i, a, b) for(int i = a; i < b; i++)
#define ROF(i, a, b) for(int i = a; i >= b; i--)
#define pb push_back
#define ms memset
#define fi first
#define se second

vector<ll> minimum_costs(vi H, vi L, vi R) {
  int n = H.size();
  int q = R.size();
  ll val[n][n]; ms(val,0,sizeof(val));
  FOR(i,0,n){
    val[i][i] = H[i];
    int mx = H[i];
    FOR(j,i+1,n){
      mx = max(mx,H[j]);
      val[i][j] = val[i][j-1] + mx;
    }
    mx=H[i];
    ROF(j,i-1,0){
      mx=max(mx,H[j]);
      val[i][j] = val[i][j+1] + mx;
    }
  }
  vector<ll> answer(q);
  FOR(i,0,q){
    answer[i] = 1e18;
    FOR(j,L[i],R[i]+1){
      answer[i]=min(answer[i],val[j][L[i]]+val[j][R[i]]-H[j]);
    }
  }
  return answer;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 51 ms 70820 KB Output is correct
3 Correct 53 ms 70748 KB Output is correct
4 Correct 52 ms 70748 KB Output is correct
5 Correct 51 ms 70912 KB Output is correct
6 Correct 51 ms 70908 KB Output is correct
7 Correct 52 ms 71252 KB Output is correct
8 Correct 51 ms 70736 KB Output is correct
9 Correct 54 ms 70736 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 51 ms 70820 KB Output is correct
3 Correct 53 ms 70748 KB Output is correct
4 Correct 52 ms 70748 KB Output is correct
5 Correct 51 ms 70912 KB Output is correct
6 Correct 51 ms 70908 KB Output is correct
7 Correct 52 ms 71252 KB Output is correct
8 Correct 51 ms 70736 KB Output is correct
9 Correct 54 ms 70736 KB Output is correct
10 Correct 340 ms 196340 KB Output is correct
11 Correct 435 ms 196404 KB Output is correct
12 Correct 318 ms 196340 KB Output is correct
13 Correct 417 ms 196420 KB Output is correct
14 Correct 332 ms 196364 KB Output is correct
15 Correct 321 ms 196380 KB Output is correct

Subtask #3
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 3859 ms 505064 KB Output is correct
3 Runtime error 458 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 0 ms 348 KB Output is correct
2 Correct 3859 ms 505064 KB Output is correct
3 Runtime error 458 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 0 ms 348 KB Output is correct
2 Correct 51 ms 70820 KB Output is correct
3 Correct 53 ms 70748 KB Output is correct
4 Correct 52 ms 70748 KB Output is correct
5 Correct 51 ms 70912 KB Output is correct
6 Correct 51 ms 70908 KB Output is correct
7 Correct 52 ms 71252 KB Output is correct
8 Correct 51 ms 70736 KB Output is correct
9 Correct 54 ms 70736 KB Output is correct
10 Correct 340 ms 196340 KB Output is correct
11 Correct 435 ms 196404 KB Output is correct
12 Correct 318 ms 196340 KB Output is correct
13 Correct 417 ms 196420 KB Output is correct
14 Correct 332 ms 196364 KB Output is correct
15 Correct 321 ms 196380 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 3859 ms 505064 KB Output is correct
18 Runtime error 458 ms 786432 KB Execution killed with signal 9
19 Halted 0 ms 0 KB -