oj.uz

Submission #719744

# Submission time Handle Problem Language Result Execution time Memory
719744 2023-04-06T15:17:07 Z bin9638 Meetings (IOI18_meetings) C++17
19 / 100
 635 ms 234720 KB 
#include <bits/stdc++.h>

#ifndef SKY
#include "meetings.h"
#endif // SKY

using namespace std;

#define N 5010
#define ll long long
#define fs first
#define sc second
#define ii pair<int,int>
#define pb push_back

int n,q;
ll a[N],sum_left[N][N],sum_right[N][N];

vector<ll> minimum_costs(vector<int> H, vector<int> L,vector<int> R)
{
    n=H.size();
    for(int i=0;i<n;i++)
        a[i]=H[i];
    q=L.size();
    vector<ll>kq(q);
    for(int i=0;i<n;i++)
    {
        ll sum=0,val=0;
        for(int j=i;j>=0;j--)
        {
            val=max(val,a[j]);
            sum+=val;
            sum_left[i][j]=sum;
        }
        sum=0,val=0;
        for(int j=i;j<n;j++)
        {
            val=max(val,a[j]);
            sum+=val;
            sum_right[i][j]=sum;
        }
    }
    for(int t=0;t<q;t++)
    {
        int l=L[t],r=R[t];
        ll res=1e18;
        for(int i=l;i<=r;i++)
            res=min(res,sum_left[i][l]+sum_right[i][r]-a[i]);
        kq[t]=res;
    }
    return kq;
}

#ifdef SKY
int main()
{
    freopen("A.inp","r",stdin);
    freopen("A.out","w",stdout);
    ios::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);
    return 0;
}
#endif

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 44 ms 95008 KB Output is correct
3 Correct 45 ms 95052 KB Output is correct
4 Correct 45 ms 94984 KB Output is correct
5 Correct 46 ms 95020 KB Output is correct
6 Correct 44 ms 95040 KB Output is correct
7 Correct 45 ms 95048 KB Output is correct
8 Correct 43 ms 94992 KB Output is correct
9 Correct 45 ms 95052 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 44 ms 95008 KB Output is correct
3 Correct 45 ms 95052 KB Output is correct
4 Correct 45 ms 94984 KB Output is correct
5 Correct 46 ms 95020 KB Output is correct
6 Correct 44 ms 95040 KB Output is correct
7 Correct 45 ms 95048 KB Output is correct
8 Correct 43 ms 94992 KB Output is correct
9 Correct 45 ms 95052 KB Output is correct
10 Correct 276 ms 234640 KB Output is correct
11 Correct 635 ms 234684 KB Output is correct
12 Correct 284 ms 234704 KB Output is correct
13 Correct 619 ms 234628 KB Output is correct
14 Correct 290 ms 234720 KB Output is correct
15 Correct 283 ms 234576 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 Runtime error 16 ms 2900 KB Execution killed with signal 11
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 Runtime error 16 ms 2900 KB Execution killed with signal 11
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 44 ms 95008 KB Output is correct
3 Correct 45 ms 95052 KB Output is correct
4 Correct 45 ms 94984 KB Output is correct
5 Correct 46 ms 95020 KB Output is correct
6 Correct 44 ms 95040 KB Output is correct
7 Correct 45 ms 95048 KB Output is correct
8 Correct 43 ms 94992 KB Output is correct
9 Correct 45 ms 95052 KB Output is correct
10 Correct 276 ms 234640 KB Output is correct
11 Correct 635 ms 234684 KB Output is correct
12 Correct 284 ms 234704 KB Output is correct
13 Correct 619 ms 234628 KB Output is correct
14 Correct 290 ms 234720 KB Output is correct
15 Correct 283 ms 234576 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Runtime error 16 ms 2900 KB Execution killed with signal 11
18 Halted 0 ms 0 KB -