제출 #255622

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
255622		tleontest1	Art Exhibition (JOI18_art)	C++17	100 / 100	356 ms	60064 KiB

art

#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target ("avx2")

#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long lo;
typedef pair< lo,lo > PII;
 
#define fi first
#define se second
#define mp make_pair
#define int long long
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)
 
const lo MAX = -1000000000000000000;
const lo MIN = 1000000000000000000;
const lo inf = 100000000000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 500005;
const lo mod = 1000000007;
 
int n,m,b[li],a[li],k,flag,t,dp[li][4];
int cev;
string s;
PII p[li];
vector<int> v;
 
inline int f(int sira,int al){
	int cevv=-inf;
	if(sira>n){
		if(al==0)return -inf;
		return 0;
	}
	if(~dp[sira][al])return dp[sira][al];
	if(al==0){
		if(sira!=n)
		cevv=max(cevv,f(sira+1,1)+p[sira].fi+p[sira].se);
		cevv=max(cevv,f(n+1,1)+p[sira].se);
		cevv=max(cevv,f(sira+1,0));
	}
	else{
		if(sira!=n)
			cevv=max(cevv,f(sira+1,al)+p[sira].se);
		cevv=max(cevv,f(n+1,al)+p[sira].se-p[sira].fi);
	}
	return dp[sira][al]=cevv;
}
 
main(void){
	memset(dp,-1,sizeof(dp));
	scanf("%lld",&n);
	FOR{
		scanf("%lld %lld",&p[i].fi,&p[i].se);
	}
	sort(p+1,p+n+1);
	printf("%lld\n",f(1,0));
	return 0;
}

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

art.cpp:58:10: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main(void){
          ^
art.cpp: In function 'int main()':
art.cpp:60:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld",&n);
  ~~~~~^~~~~~~~~~~
art.cpp:62:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld %lld",&p[i].fi,&p[i].se);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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