| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 394417 | Theo830 | Meetings (IOI18_meetings) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll INF = 1e18+7;
ll MOD = 998244353;
typedef pair<ll,ll> ii;
#define iii pair<ll,ii>
#define f(i,a,b) for(ll i = a;i < b;i++)
#define pb push_back
#define vll vector<ll>
#define F first
#define S second
#define all(x) (x).begin(), (x).end()
///I hope I will get uprating and don't make mistakes
///I will never stop programming
///sqrt(-1) Love C++
///Please don't hack me
///@TheofanisOrfanou Theo830
///Think different approaches (bs,dp,greedy,graphs,shortest paths,mst)
///Stay Calm
///Look for special cases
///Beware of overflow and array bounds
///Think the problem backwards
///Training
#include "meetings.h"
std::vector<long long> minimum_costs(std::vector<int> H, std::vector<int> L,std::vector<int> R) {
int Q = L.size();
ll n = H.size();
ll maxi[n][n];
f(i,0,n){
maxi[i][i] = H[i];
f(j,i+1,n){
maxi[i][j] = max(maxi[i][j-1],1LL * H[j]);
}
}
vector<long long> C(Q);
f(k,0,Q){
ll ans = INF;
bool ivra = 0;
ll l = L[k];
while(l <= R[K] && H[l] == 1){
l++;
}
ll r = R[k];
while(r >= L[k] && H[r] == 1){
r--;
}
ans = R[k] - L[k] + 1;
if(l <= r){
ans += r - l + 1;
}
C[k] = ans;
}
return C;
}