oj.uz

Submission #713872

# Submission time Handle Problem Language Result Execution time Memory
713872 2023-03-23T06:38:14 Z LittleOrange Meetings (IOI18_meetings) C++17
4 / 100
 5500 ms 1488 KB 
#include "meetings.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
std::vector<long long> minimum_costs(std::vector<int> H, std::vector<int> L,std::vector<int> R){
    int Q = L.size();
    std::vector<long long> C(Q);
    int N = H.size();
    for (ll qi = 0; qi < Q; qi++){
        ll l = L[qi],r=R[qi];
        function<ll(ll)> query = [&](ll x){
            ll ans = 0;
            int cur = 0;
            for(ll i = x;i<=R[qi];i++){
                cur = max(cur,H[i]);
                ans += cur;
            }
            cur = H[x];
            for(ll i = x-1;i>=L[qi];i--){
                cur = max(cur,H[i]);
                ans += cur;
            }
            return ans;
        };
        C[qi] = 1e18;
        for(ll x = l;x<=r;x++) C[qi] = min(C[qi],query(x));
    }
    return C;
}

Compilation message

meetings.cpp: In function 'std::vector<long long int> minimum_costs(std::vector<int>, std::vector<int>, std::vector<int>)':
meetings.cpp:8:9: warning: unused variable 'N' [-Wunused-variable]
    8 |     int N = H.size();
      |         ^

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 16 ms 340 KB Output is correct
3 Correct 103 ms 340 KB Output is correct
4 Correct 31 ms 340 KB Output is correct
5 Correct 110 ms 340 KB Output is correct
6 Correct 11 ms 316 KB Output is correct
7 Correct 1 ms 312 KB Output is correct
8 Correct 4 ms 308 KB Output is correct
9 Correct 100 ms 212 KB Output is correct

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 16 ms 340 KB Output is correct
3 Correct 103 ms 340 KB Output is correct
4 Correct 31 ms 340 KB Output is correct
5 Correct 110 ms 340 KB Output is correct
6 Correct 11 ms 316 KB Output is correct
7 Correct 1 ms 312 KB Output is correct
8 Correct 4 ms 308 KB Output is correct
9 Correct 100 ms 212 KB Output is correct
10 Execution timed out 5578 ms 468 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #3
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Execution timed out 5598 ms 1488 KB Time limit exceeded
3 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 Execution timed out 5598 ms 1488 KB Time limit exceeded
3 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 16 ms 340 KB Output is correct
3 Correct 103 ms 340 KB Output is correct
4 Correct 31 ms 340 KB Output is correct
5 Correct 110 ms 340 KB Output is correct
6 Correct 11 ms 316 KB Output is correct
7 Correct 1 ms 312 KB Output is correct
8 Correct 4 ms 308 KB Output is correct
9 Correct 100 ms 212 KB Output is correct
10 Execution timed out 5578 ms 468 KB Time limit exceeded
11 Halted 0 ms 0 KB -