| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1364447 | mariza | Meetings (IOI18_meetings) | C++20 | 2604 ms | 851968 KiB |
#include "meetings.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF=1e18;
vector<ll> minimum_costs(vector<int> a, vector<int> l, vector<int> r){
ll n=a.size(), q=l.size();
ll c[n][n];
for(ll i=0; i<n; i++){
ll x=0;
for(ll j=i; j<n; j++){
x=max(x,(ll)a[j]);
c[i][j]=x;
c[j][i]=x;
}
}
for(ll i=0; i<n; i++){
for(ll j=1; j<n; j++){
c[i][j]+=c[i][j-1];
}
}
vector<ll> ans;
for(ll i=0; i<q; i++){
ll x=INF;
for(ll j=l[i]; j<=r[i]; j++){
// cout<<j<<" "<<(c[j][r[i]]-((l[i]==0)?0:c[j][l[i]-1]))<<endl;
x=min(x,c[j][r[i]]-((l[i]==0)?0:c[j][l[i]-1]));
}
ans.push_back(x);
}
return ans;
}
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
