제출 #1068162

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1068162		Sir_Ahmed_Imran	모임들 (IOI18_meetings)	C++17	19 / 100	455 ms	786432 KiB

meetings

                            ///~~~LOTA~~~///
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define append push_back
#define add insert
#define nl '\n'
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<ll,ll>
#define all(x) (x).begin(),(x).end()
#define L0TA ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define terminator main
#define N 90000
vector<ll> minimum_costs(vector<int> a,vector<int> l,vector<int> r){
    int n,m,o;
    n=a.size();
    m=l.size();
    ll pre[n][n];
    ll suf[n][n];
    for(int i=0;i<n;i++){
        pre[i][i]=o=a[i];
        suf[i][i]=0;
        for(int j=i-1;j>=0;j--){
            o=max(o,a[j]);
            pre[i][j]=pre[i][j+1]+o;
        }
        o=a[i];
        for(int j=i+1;j<n;j++){
            o=max(o,a[j]);
            suf[i][j]=suf[i][j-1]+o;
        }
    }
    ll x;
    vector<ll> ans;
    for(int i=0;i<m;i++){
        x=1e18;
        for(int j=l[i];j<=r[i];j++)
            x=min(x,pre[j][l[i]]+suf[j][r[i]]);
        ans.append(x);
    }
    return ans;
}

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