oj.uz

Submission #982863

# Submission time Handle Problem Language Result Execution time Memory
982863 2024-05-14T21:17:32 Z mariaclara Meetings (IOI18_meetings) C++17
19 / 100
 5500 ms 6748 KB 
#include "meetings.h"
#include<bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int,int> pii;
const int MAXN = 4e5+5; 
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
#define mk make_pair
#define pb push_back
#define fr first
#define sc second

vector<ll> minimum_costs(vector<int> H, vector<int> L, vector<int> R) {
    int N = sz(H), Q = sz(L);
    if(N <= 5000 and Q <= 5000) {
        vector<ll> ans(Q,1e15), p(N);
        vector<int> v(N);

        for(int i = 0; i < N; i++) {
            v[i] = H[i];

            for(int j = i-1; j >= 0; j--)
                v[j] = max(v[j+1], H[j]);
            for(int j = i+1; j < N; j++)
                v[j] = max(v[j-1], H[j]);
            
            p[0] = v[0];
            for(int j = 1; j < N; j++) p[j] = p[j-1] + v[j];

            for(int j = 0; j < Q; j++)
                ans[j] = min(ans[j], p[R[j]] - p[L[j]] + v[L[j]]);
        }

        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:39:1: warning: control reaches end of non-void function [-Wreturn-type]
   39 | }
      | ^

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 50 ms 348 KB Output is correct
3 Correct 50 ms 500 KB Output is correct
4 Correct 51 ms 344 KB Output is correct
5 Correct 50 ms 344 KB Output is correct
6 Correct 50 ms 496 KB Output is correct
7 Correct 50 ms 348 KB Output is correct
8 Correct 50 ms 496 KB Output is correct
9 Correct 50 ms 348 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 50 ms 348 KB Output is correct
3 Correct 50 ms 500 KB Output is correct
4 Correct 51 ms 344 KB Output is correct
5 Correct 50 ms 344 KB Output is correct
6 Correct 50 ms 496 KB Output is correct
7 Correct 50 ms 348 KB Output is correct
8 Correct 50 ms 496 KB Output is correct
9 Correct 50 ms 348 KB Output is correct
10 Correct 182 ms 748 KB Output is correct
11 Correct 170 ms 728 KB Output is correct
12 Correct 180 ms 728 KB Output is correct
13 Correct 171 ms 744 KB Output is correct
14 Correct 177 ms 756 KB Output is correct
15 Correct 176 ms 732 KB Output is correct

Subtask #3
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1016 ms 2428 KB Output is correct
3 Execution timed out 5562 ms 6748 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1016 ms 2428 KB Output is correct
3 Execution timed out 5562 ms 6748 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 344 KB Output is correct
2 Correct 50 ms 348 KB Output is correct
3 Correct 50 ms 500 KB Output is correct
4 Correct 51 ms 344 KB Output is correct
5 Correct 50 ms 344 KB Output is correct
6 Correct 50 ms 496 KB Output is correct
7 Correct 50 ms 348 KB Output is correct
8 Correct 50 ms 496 KB Output is correct
9 Correct 50 ms 348 KB Output is correct
10 Correct 182 ms 748 KB Output is correct
11 Correct 170 ms 728 KB Output is correct
12 Correct 180 ms 728 KB Output is correct
13 Correct 171 ms 744 KB Output is correct
14 Correct 177 ms 756 KB Output is correct
15 Correct 176 ms 732 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 1016 ms 2428 KB Output is correct
18 Execution timed out 5562 ms 6748 KB Time limit exceeded
19 Halted 0 ms 0 KB -