oj.uz

Submission #823361

# Submission time Handle Problem Language Result Execution time Memory
823361 2023-08-12T11:27:25 Z Trumling Meetings (IOI18_meetings) C++14
19 / 100
 2944 ms 786432 KB 
#include "meetings.h"
#include<bits/stdc++.h>
using namespace  std;
#define F first 
#define S second 
#define all(x) x.begin(),x.end()  
typedef long long ll;
#define INF 9999999999999999
#define pb  push_back
/*
ll seg[2000000];
void build(int  l,int r,int idx)
{
    if(l==r)
    {
        seg[idx]=h[l];
        return;
    }
    build(l,(l+r)/2,idx*2);
    build((l+r)/2,r,idx*2+1);

    seg[idx]=max(seg[idx*2],seg[idx*2+1]);
}
*/
vector<long long> minimum_costs(vector<int> H, vector<int> L,vector<int> R) {
    ll Q=L.size();
    ll N=H.size();
    
    vector<ll>C(Q,INF);
    vector<vector<ll> >v(N,vector<ll>(N,0));

    for(int i=0;i<N;i++)
    {
        ll maxi=-1;
            for(int c=i;c>=0;c--)
            {
                maxi=max(maxi,(ll)H[c]);
                v[i][c]=((c==i)?0:v[i][c+1])+maxi;
            }
            maxi=H[i];
            for(int c=i+1;c<N;c++)
            {
            maxi=max(maxi,(ll)H[c]);
            v[i][c]=v[i][c-1]+maxi;
            }
    }

    for(int i=0;i<Q;i++)
        for(int j=L[i];j<=R[i];j++)
        {
            //cout<<v[j][L[i]]<<' '<<v[j][R[i]]<<'\n';
            C[i]=min(C[i],v[j][L[i]]+v[j][R[i]]-H[j]);
        }
                
            

    return C;
    
        
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 41 ms 70856 KB Output is correct
3 Correct 40 ms 70840 KB Output is correct
4 Correct 40 ms 70852 KB Output is correct
5 Correct 42 ms 70896 KB Output is correct
6 Correct 41 ms 70808 KB Output is correct
7 Correct 48 ms 70996 KB Output is correct
8 Correct 41 ms 70888 KB Output is correct
9 Correct 42 ms 70896 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 41 ms 70856 KB Output is correct
3 Correct 40 ms 70840 KB Output is correct
4 Correct 40 ms 70852 KB Output is correct
5 Correct 42 ms 70896 KB Output is correct
6 Correct 41 ms 70808 KB Output is correct
7 Correct 48 ms 70996 KB Output is correct
8 Correct 41 ms 70888 KB Output is correct
9 Correct 42 ms 70896 KB Output is correct
10 Correct 260 ms 196312 KB Output is correct
11 Correct 388 ms 196364 KB Output is correct
12 Correct 260 ms 196356 KB Output is correct
13 Correct 376 ms 196364 KB Output is correct
14 Correct 265 ms 196308 KB Output is correct
15 Correct 297 ms 196368 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 Correct 2944 ms 504612 KB Output is correct
3 Runtime error 255 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 212 KB Output is correct
2 Correct 2944 ms 504612 KB Output is correct
3 Runtime error 255 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 212 KB Output is correct
2 Correct 41 ms 70856 KB Output is correct
3 Correct 40 ms 70840 KB Output is correct
4 Correct 40 ms 70852 KB Output is correct
5 Correct 42 ms 70896 KB Output is correct
6 Correct 41 ms 70808 KB Output is correct
7 Correct 48 ms 70996 KB Output is correct
8 Correct 41 ms 70888 KB Output is correct
9 Correct 42 ms 70896 KB Output is correct
10 Correct 260 ms 196312 KB Output is correct
11 Correct 388 ms 196364 KB Output is correct
12 Correct 260 ms 196356 KB Output is correct
13 Correct 376 ms 196364 KB Output is correct
14 Correct 265 ms 196308 KB Output is correct
15 Correct 297 ms 196368 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 2944 ms 504612 KB Output is correct
18 Runtime error 255 ms 786432 KB Execution killed with signal 9
19 Halted 0 ms 0 KB -