제출 #699426

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
699426		Ahmed_Solyman	Art Exhibition (JOI18_art)	C++14	30 / 100	256 ms	262144 KiB

art

#include <bits/stdc++.h>
#include <ext/rope>
 
using namespace std;
using namespace __gnu_cxx;
#pragma GCC optimize("-Ofast")
#pragma GCC optimize("-O1")
//-------------------------------------------------------------//
typedef long long ll;
typedef unsigned long long ull;
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define PI acos(-1)
#define lb lower_bound
#define ub upper_bound
#define endl '\n'
#define all(v) v.begin(),v.end()
#define allr(v) v.rbegin(),v.rend()
#define sum_to(n) (n*(n+1))/2
#define pb push_back
#define pf push_front
#define sz size()
#define fil(arr,x) memset(arr,x,sizeof(arr))
const ll mod=1e9+7;
int dx[8]={0,1,0,-1,1,1,-1,-1};
int dy[8]={1,0,-1,0,1,-1,-1,1};
//-------------------------------------------------------------//
ll lcm(ll a,ll b)
{
    return (max(a,b)/__gcd(a,b))*min(a,b);
}
void person_bool(bool x)
{
    cout<<(x?"YES":"NO")<<endl;
}
int n;
vector<pair<ll,ll>>arr;
ll dp[5000][5000];
ll solve(int i,int j){
	if(i==n+1){
		return 0;
	}
	ll &ret=dp[i][j];
	if(~ret)return ret;
	return ret=max(solve(i+1,j),solve(i+1,i)+arr[i].second-(!j?0:arr[i].first-arr[j].first));
}
int main()
{
    //freopen("input.txt","r",stdin);
    //freopen("output.txt","w",stdout);
    fast
    cin>>n;
    arr.resize(n+1);
    for(int i=0;i<n;i++){
    	cin>>arr[i].first>>arr[i].second;
    }
    sort(all(arr));
    fil(dp,-1);
    cout<<solve(1,0)<<endl;
    return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 20 / 20
• Subtask 3: 0 / 20
• Subtask 4: 0 / 50