Submission #1054847

#	Time	Username	Problem	Language	Result	Execution time	Memory
1054847		Ahmed57	Meetings (IOI18_meetings)	C++17	0 / 100	2 ms	4700 KiB

meetings

#include "bits/stdc++.h"

using namespace std;
#define int long long
int arr[100001];
int logg[100001];
int table[100001][17];
int n ,q;
map<pair<int,int>,int> dp; 
vector<int> val[21];
int solve(int l,int r){
    if(l>r)return 0;
    if(dp.find(make_pair(l,r))!=dp.end())return dp[{l,r}];
    int sz = (r-l+1);
    int ind = max(table[l][logg[sz]],table[r-(1<<logg[sz])+1][logg[sz]]);
    int it = lower_bound(val[arr[ind]].begin(),val[arr[ind]].end(),l)-val[arr[ind]].begin();
    int it2 = it;
    while(it2<val[arr[ind]].size()&&val[arr[ind]][it2]<=r)it2++;
    it2--;
    int ma = 1e18;
    {//l
        ma = min(ma,solve(l,val[arr[ind]][it]-1)+((r-l+1)-(val[arr[ind]][it]-l))*arr[ind]);
    }
    {//r
        ma = min(ma,solve(val[arr[ind]][it2]+1,r)+((r-l+1)-(r-val[arr[ind]][it2]))*arr[ind]);
    }
    for(int i = it;i<it2;i++){
        ma = min(ma,solve(val[arr[ind]][i]+1,val[arr[ind]][i+1]-1)+((r-l+1)-(val[arr[ind]][i+1]-val[arr[ind]][i]-1))*arr[ind]);
    }
    return dp[{l,r}] = ma;
}
vector<long long> minimum_costs(vector<int32_t> H, vector<int32_t> L, vector<int32_t> R){
    n = H.size();
    q = L.size();

    for(int i = 0;i<n;i++){
        table[i][0] = H[i];
        arr[i] = H[i];
        val[arr[i]].push_back(i);
    }
    for(int j = 1;j<17;j++){
        for(int i = 0;i<n-(1<<j)+1;i++){
            table[i][j] = max(table[i][j-1],table[i+(1<<(j-1))][j-1]);
        }
    }
    logg[1] = 0;
    for(int i = 2;i<=n;i++)logg[i] = logg[i/2]+1;
    vector<long long> an;
    for(int i = 0;i<q;i++){
        an.push_back(solve(L[i],R[i]));
    }
    return an;
}

Compilation message (stderr)

meetings.cpp: In function 'long long int solve(long long int, long long int)':
meetings.cpp:18:14: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   18 |     while(it2<val[arr[ind]].size()&&val[arr[ind]][it2]<=r)it2++;
      |           ~~~^~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 4
• Subtask 2: 0 / 15
• Subtask 3: 0 / 17
• Subtask 4: 0 / 24
• Subtask 5: 0 / 40