oj.uz

Submission #329303

# Submission time Handle Problem Language Result Execution time Memory
329303 2020-11-20T11:50:38 Z HoneyBadger Art Exhibition (JOI18_art) C++17
100 / 100
 213 ms 28836 KB 
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <vector>
#include <bitset>
#include <string>
#include <cstring>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <utility>
#include <algorithm>
#include <random>
#include <cmath>
#include <cassert>
#include <climits>
#include <ctime>
#include <chrono>


/*
#pragma GCC optimize("Ofast")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.1,sse4.2,popcnt,abm,mmx,avx,avx2,tune=native")
*/


#ifdef LOCAL
    #define dbg(x) cout << #x << " : " << x << endl;
#else
    #define dbg(x)
#endif

#define int long long
#define pb push_back
#define ppb pop_back()
#define mp make_pair
#define fi(a, b) for (int i = a; i < b; i++)
#define fj(a, b) for (int j = a; j < b; j++)
#define fk(a, b) for (int k = a; k < b; k++)
#define fi1(a, b) for (int i = a - 1; i >= b; i--)
#define fj1(a, b) for (int j = a - 1; j >= b; j--)
#define fk1(a, b) for (int k = a - 1; k >= b; k--)
#define fx(x, a) for (auto& x : a)
#define rep(i, a, b) for (int i = a; i < b; ++i)
#define rep1(i, a, b) for (int i = a - 1; i >= b; --i)
#define siz(x) (int)x.size()
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

using namespace std;

template<typename T1, typename T2>inline void mine(T1 &x, const T2 &y) { if (y < x) x = y; }
template<typename T1, typename T2>inline void maxe(T1 &x, const T2 &y) { if (x < y) x = y; }

ostream& operator << (ostream &out, const vector<int> &b) {
    for (auto k : b) out << k << ' ';
    return out;
}

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef char ch;
typedef string str;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
typedef vector<vpii> vvpii;
typedef vector<ch> vch;
typedef vector<vch> vvch;
typedef vector<str> vs;



const int MOD = 1000000007;
const int INF = 1000000050;
const long long BIG = (long long)2e18 + 50;
const int MX = 200010;
const double EPS = 1e-9;


mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());


int32_t main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int n;
    cin >> n;
   	vpii c(n);
    fi(0, n) {
    	cin >> c[i].first >> c[i].second;
    }
    sort(all(c));
    vi pref(n + 1, 0);
    fi(1, n + 1)
    	pref[i] = pref[i - 1] + c[i - 1].second;
    vi smax(n + 1, -BIG);
    fi1(n, 0)
    	smax[i] = max(smax[i + 1], pref[i + 1] - c[i].first);
    int ans = 0;
    fi(0, n) {
    	maxe(ans, c[i].first - pref[i] + smax[i]);
    }
    cout << ans << '\n';
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 3 ms 620 KB Output is correct
28 Correct 4 ms 620 KB Output is correct
29 Correct 3 ms 620 KB Output is correct
30 Correct 3 ms 620 KB Output is correct
31 Correct 3 ms 620 KB Output is correct
32 Correct 3 ms 620 KB Output is correct
33 Correct 3 ms 620 KB Output is correct
34 Correct 3 ms 620 KB Output is correct
35 Correct 3 ms 620 KB Output is correct
36 Correct 3 ms 620 KB Output is correct
37 Correct 3 ms 620 KB Output is correct
38 Correct 2 ms 620 KB Output is correct
39 Correct 3 ms 620 KB Output is correct
40 Correct 3 ms 620 KB Output is correct
41 Correct 3 ms 640 KB Output is correct
42 Correct 4 ms 620 KB Output is correct
43 Correct 2 ms 620 KB Output is correct
44 Correct 3 ms 620 KB Output is correct
45 Correct 3 ms 620 KB Output is correct
46 Correct 3 ms 620 KB Output is correct
47 Correct 3 ms 748 KB Output is correct
48 Correct 3 ms 620 KB Output is correct
49 Correct 2 ms 620 KB Output is correct
50 Correct 3 ms 620 KB Output is correct
51 Correct 3 ms 620 KB Output is correct

Subtask #4
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 3 ms 620 KB Output is correct
28 Correct 4 ms 620 KB Output is correct
29 Correct 3 ms 620 KB Output is correct
30 Correct 3 ms 620 KB Output is correct
31 Correct 3 ms 620 KB Output is correct
32 Correct 3 ms 620 KB Output is correct
33 Correct 3 ms 620 KB Output is correct
34 Correct 3 ms 620 KB Output is correct
35 Correct 3 ms 620 KB Output is correct
36 Correct 3 ms 620 KB Output is correct
37 Correct 3 ms 620 KB Output is correct
38 Correct 2 ms 620 KB Output is correct
39 Correct 3 ms 620 KB Output is correct
40 Correct 3 ms 620 KB Output is correct
41 Correct 3 ms 640 KB Output is correct
42 Correct 4 ms 620 KB Output is correct
43 Correct 2 ms 620 KB Output is correct
44 Correct 3 ms 620 KB Output is correct
45 Correct 3 ms 620 KB Output is correct
46 Correct 3 ms 620 KB Output is correct
47 Correct 3 ms 748 KB Output is correct
48 Correct 3 ms 620 KB Output is correct
49 Correct 2 ms 620 KB Output is correct
50 Correct 3 ms 620 KB Output is correct
51 Correct 3 ms 620 KB Output is correct
52 Correct 210 ms 28652 KB Output is correct
53 Correct 207 ms 28652 KB Output is correct
54 Correct 207 ms 28780 KB Output is correct
55 Correct 207 ms 28800 KB Output is correct
56 Correct 208 ms 28652 KB Output is correct
57 Correct 206 ms 28708 KB Output is correct
58 Correct 213 ms 28780 KB Output is correct
59 Correct 209 ms 28780 KB Output is correct
60 Correct 206 ms 28780 KB Output is correct
61 Correct 208 ms 28524 KB Output is correct
62 Correct 203 ms 28652 KB Output is correct
63 Correct 205 ms 28652 KB Output is correct
64 Correct 212 ms 28652 KB Output is correct
65 Correct 207 ms 28652 KB Output is correct
66 Correct 203 ms 28692 KB Output is correct
67 Correct 213 ms 28836 KB Output is correct
68 Correct 212 ms 28652 KB Output is correct