제출 #209486

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
209486		Sho10	모임들 (IOI18_meetings)	C++14	19 / 100	687 ms	392696 KiB

meetings

/*
ID: Sho10
LANG: C++
*/
#include <bits/stdc++.h> //Andrei Alexandru a.k.a Sho10
#define ll long long int
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define all(a) (a).begin(), (a).end()
#define sz size
#define f first
#define s second
#define pb push_back
#define er erase
#define in insert
#define mp make_pair
#define pi pair
#define rc(s) return cout<<s,0
#define endl '\n'
#define mod 1000000007
#define PI 3.14159265359
#define CODE_START  ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
ll a[100005],l[100005],r[100005],mx[5005][5005], pmx[5005][5005];
vector<ll>ans;
vector<ll> minimum_costs(vector<int>H,vector<int>L,vector<int>R){
    ll n=H.size();
    ll q=L.size();
for(ll i=0;i<H.size();i++)
    a[i]=H[i];
for(ll i=0;i<L.size();i++)
    l[i]=L[i];
for(ll i=0;i<R.size();i++)
    r[i]=R[i];
for(ll i=0;i<n;i++)
{
    mx[i][i]=a[i];
    for(ll j=i+1;j<n;j++)
    {
        mx[i][j]=max(mx[i][j-1],a[j]);
        mx[j][i]=mx[i][j];
    }
}
for(ll i=0;i<n;i++)
    for(ll j=0;j<n;j++)
{
    pmx[i][j+1]=pmx[i][j]+mx[i][j];
}
for(ll i=0;i<q;i++){
    ll lr=l[i],rr=r[i];
    ll val=1e18;
    for(ll j=lr;j<rr+1;j++)
    {
        val=min(val,pmx[j][rr+1]-pmx[j][lr]);
    }
    ans.pb(val);

}
return ans;
}
//
//int32_t main(){
//CODE_START;

컴파일 시 표준 에러 (stderr) 메시지

meetings.cpp: In function 'std::vector<long long int> minimum_costs(std::vector<int>, std::vector<int>, std::vector<int>)':
meetings.cpp:29:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 for(ll i=0;i<H.size();i++)
            ~^~~~~~~~~
meetings.cpp:31:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 for(ll i=0;i<L.size();i++)
            ~^~~~~~~~~
meetings.cpp:33:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 for(ll i=0;i<R.size();i++)
            ~^~~~~~~~~

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