제출 #373621

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
373621		Valera_Grinenko	Art Exhibition (JOI18_art)	C++17	100 / 100	248 ms	20972 KiB

art

#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
#include <set>
#include <stack>
#include <map>
#include <unordered_map>
#include <iomanip>
#include <cmath>
#include <queue>
#include <bitset>
#include <numeric>
#include <array>
#include <cstring>
#include <random>
#include <chrono>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define make_unique(x) sort(all((x))); (x).resize(unique(all((x))) - (x).begin())
typedef long long ll;
typedef long double ld;
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// template<class T>
// using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
int main() {

  ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

  int n = 0;

  cin >> n;

  vector<pair<ll, ll> > ab(n);

  for(auto& x : ab) cin >> x.fi >> x.se;

  sort(all(ab));

  ll ans = 0;

  ll ca = 0, cb = 0, cur = 0;

  for(int i = 0; i < n; i++) {
    cb = cb + (i ? ab[i - 1].fi : 0) + (i ? ab[i - 1].se : 0) - ab[i].fi;
    cur = min(cur, cb);
    ca = ca + (i ? ab[i - 1].fi : 0) + ab[i].se - ab[i].fi;
    ans = max(ans, ca - cur);
  }

  cout << ans;

  return 0;
}
/*

*/

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

art.cpp:3: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
    3 | #pragma GCC optimization ("unroll-loops")
      |

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