제출 #134244

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
134244		reda	모임들 (IOI18_meetings)	C++14	0 / 100	2 ms	376 KiB

meetings

#include<bits/stdc++.h>
using namespace std ;
#define  pb  push_back
#define  ll long long
#define  ld  long  double
#define  mp make_pair
#define  MOD 1000000007
#define endl '\n'
#pragma GCC optimize ("O3")
#include "meetings.h"
#define MAXN 105
ll h[3005];
ll st[3005*4+1];
void build (ll p , ll l, ll r)
{
    if(l==r)
    {
        st[p]=h[l];
        return ;
    }
    build(2*p,l,(l+r)/2);
    build(2*p+1,(l+r)/2 + 1, r);
    st[p]=max(st[p*2],st[2*p+1]);
}
ll  query(ll p ,ll i , ll j , ll l ,ll r)
{
    
    if(r < i || j < l)
    {
        return 0;
    }
    if(l <= i && j <= r)
    {
        return st[p];
    }
    ll mid = (i + j) / 2;
   ll p1 = query(2*p, i, mid, l, r);
    ll p2 = query(2*p+1, mid+1, j, l, r);
    return max(p1,p2);
 
}
vector<ll>  minimum_costs(vector<int>H, vector<int> L, vector<int> R)
{
    vector<ll> ans;
    int N=H.size();
    int M=L.size();
     for(int i=0;i<H.size();i++)
     {
         h[i+1]=H[i];
     }
    for(int i= 0 ;i < M;i ++ )
    {
        int mn=1e9+6;
         int  l= L[i],r=R[i];
         for(int j=l ; j<=r;j++)
         {
             int c=0;
             for(int s=l;s<r;s++)
             {
                 if(s==j)c+=H[i];
                 else c+=query(1,min(j+1,s+1),max(j+1,s+1),1,N);
             }
             mn=min(mn,c);
         }
         ans.pb(mn);
    }
    return ans;
}

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

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

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