이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
#define pii pair<int,int>
#define iii pair<int,pii>
#define fi first
#define se second
#define vi vector<int>
#define all(x) x.begin(),x.end()
#define TEXT "a"
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
const int inf = 1e9 + 7;
const ld eps = 1e-8;
const double pi = acos(-1);
const int N = 5e5 + 5;
struct node{
ll a, b;
bool operator < (const node& N) const{
if (a != N.a) return a < N.a;
return b < N.b;
}
node(){}
};
int n;
node v[N];
ll backtrack(ll M, ll m, ll s, ll i){
if (i > n){
if (M == LLONG_MIN) return LLONG_MIN;
return s - (M - m);
}
ll res = LLONG_MIN;
res = max(res,backtrack(max(M,v[i].a),min(m,v[i].a), s + v[i].b, i + 1));
res = max(res,backtrack(M,m,s,i + 1));
return res;
}
int main(){
cin.tie(0) -> sync_with_stdio(0);
if (fopen(TEXT".inp","r")){
freopen(TEXT".inp","r",stdin);
freopen(TEXT".out","w",stdout);
}
ll res = LLONG_MIN;
cin >> n;
for (int i = 1; i <= n; i++){
cin >> v[i].a >> v[i].b;
}
sort(v + 1,v + 1 + n);
v[0].a = v[1].a;
v[0].b = 0;
ll p = 0;
ll cur = v[0].a;
for (int i = 1; i <= n; i++){
p += v[i].b;
res = max(res,p - v[i].a + cur);
cur = max(cur,v[i].a - p);
}
//cout << res << "\n";
cout << backtrack(LLONG_MIN, LLONG_MAX, 0, 1) << "\n";
return 0;
}
컴파일 시 표준 에러 (stderr) 메시지
art.cpp: In function 'int main()':
art.cpp:50:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
50 | freopen(TEXT".inp","r",stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
art.cpp:51:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
51 | freopen(TEXT".out","w",stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |