oj.uz

Submission #62201

# Submission time Handle Problem Language Result Execution time Memory
62201 2018-07-27T20:13:19 Z qkxwsm Art Exhibition (JOI18_art) C++17
50 / 100
 1000 ms 8380 KB 
/*
PROG: source
LANG: C++11
    _____
  .'     '.
 /  0   0  \
|     ^     |
|  \     /  |
 \  '---'  /
  '._____.'
 */
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;

struct chash
{
    int operator()(int x) const
	{
		x ^= (x >> 20) ^ (x >> 12);
    	return x ^ (x >> 7) ^ (x >> 4);
	}
	int operator()(long long x) const
	{
		return x ^ (x >> 32);
	}
};

template<typename T> using orderedset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T> using hashtable = gp_hash_table<T, T, chash>;

template<class T>
void readi(T &x)
{
	T input = 0;
	bool negative = false;
	char c = ' ';
	while (c < '-')
	{
		c = getchar();
	}
	if (c == '-')
	{
		negative = true;
		c = getchar();
	}
	while (c >= '0')
	{
		input = input * 10 + (c - '0');
		c = getchar();
	}
	if (negative)
	{
		input = -input;
	}
	x = input;
}
template<class T>
void printi(T output)
{
	if (output == 0)
	{
		putchar('0');
		return;
	}
	if (output < 0)
	{
		putchar('-');
		output = -output;
	}
	int aout[20];
	int ilen = 0;
	while(output)
	{
		aout[ilen] = ((output % 10));
		output /= 10;
		ilen++;
	}
	for (int i = ilen - 1; i >= 0; i--)
	{
		putchar(aout[i] + '0');
	}
	return;
}
template<class T>
void ckmin(T &a, T b)
{
	a = min(a, b);
}
template<class T>
void ckmax(T &a, T b)
{
	a = max(a, b);
}
template<class T>
T normalize(T x, T mod = 1000000007)
{
	return (((x % mod) + mod) % mod);
}
long long randomizell(long long mod)
{
	return ((1ll << 45) * rand() + (1ll << 30) * rand() + (1ll << 15) * rand() + rand()) % mod;
}
int randomize(int mod)
{
	return ((1ll << 15) * rand() + rand()) % mod;
}

#define y0 ___y0
#define y1 ___y1
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define PF push_front
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define debug(x) cerr << #x << " = " << x << endl;

const long double PI = 4.0 * atan(1.0);
const long double EPS = 1e-10;

#define MAGIC 347
#define SINF 10007
#define CO 1000007
#define INF 1000000007
#define BIG 1000000931
#define LARGE 1696969696967ll
#define GIANT 2564008813937411ll
#define LLINF 2696969696969696969ll
#define MAXN 100013

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;

int N;
pll arr[MAXN];
ll pref[MAXN];
ll ans;

int32_t main()
{
	ios_base::sync_with_stdio(0);
	srand(time(0));
	//	cout << fixed << setprecision(10);
	//	cerr << fixed << setprecision(10);
	if (fopen("input.in", "r"))
	{
		freopen ("input.in", "r", stdin);
		freopen ("output.out", "w", stdout);
	}
    cin >> N;
    for (int i = 0; i < N; i++)
    {
        cin >> arr[i].fi >> arr[i].se;
    }
    sort(arr, arr + N);
    for (int i = 0; i < N; i++)
    {
        pref[i + 1] = pref[i] + arr[i].se;
    }
    // for (int i = 0; i < N; i++)
    // {
    //     for (int j = i; j < N; j++)
    //     {
    //         ckmax(ans, pref[j + 1] - arr[j].fi - (pref[i] - arr[i].fi));
    //     }
    // }
    ll best = -LLINF;
    for (int i = N - 1; i >= 0; i--)
    {
        ckmax(best, pref[i + 1] - arr[i].fi);
        ckmax(ans, best - (pref[i] - arr[i].fi));
    }
    cout << ans << '\n';
	//	cerr << "time elapsed = " << (clock() / (CLOCKS_PER_SEC / 1000)) << " ms" << endl;
	return 0;
}

Compilation message

art.cpp: In function 'int32_t main()':
art.cpp:156:11: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   freopen ("input.in", "r", stdin);
   ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
art.cpp:157:11: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   freopen ("output.out", "w", stdout);
   ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 248 KB Output is correct
2 Correct 3 ms 484 KB Output is correct
3 Correct 3 ms 484 KB Output is correct
4 Correct 3 ms 484 KB Output is correct
5 Correct 2 ms 484 KB Output is correct
6 Correct 3 ms 560 KB Output is correct
7 Correct 3 ms 616 KB Output is correct
8 Correct 3 ms 616 KB Output is correct
9 Correct 3 ms 636 KB Output is correct
10 Correct 2 ms 636 KB Output is correct
11 Correct 2 ms 772 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 248 KB Output is correct
2 Correct 3 ms 484 KB Output is correct
3 Correct 3 ms 484 KB Output is correct
4 Correct 3 ms 484 KB Output is correct
5 Correct 2 ms 484 KB Output is correct
6 Correct 3 ms 560 KB Output is correct
7 Correct 3 ms 616 KB Output is correct
8 Correct 3 ms 616 KB Output is correct
9 Correct 3 ms 636 KB Output is correct
10 Correct 2 ms 636 KB Output is correct
11 Correct 2 ms 772 KB Output is correct
12 Correct 3 ms 772 KB Output is correct
13 Correct 3 ms 772 KB Output is correct
14 Correct 3 ms 816 KB Output is correct
15 Correct 2 ms 816 KB Output is correct
16 Correct 3 ms 816 KB Output is correct
17 Correct 3 ms 816 KB Output is correct
18 Correct 3 ms 816 KB Output is correct
19 Correct 2 ms 1012 KB Output is correct
20 Correct 3 ms 1012 KB Output is correct
21 Correct 3 ms 1012 KB Output is correct
22 Correct 4 ms 1012 KB Output is correct
23 Correct 3 ms 1012 KB Output is correct
24 Correct 2 ms 1012 KB Output is correct
25 Correct 3 ms 1012 KB Output is correct
26 Correct 3 ms 1012 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 248 KB Output is correct
2 Correct 3 ms 484 KB Output is correct
3 Correct 3 ms 484 KB Output is correct
4 Correct 3 ms 484 KB Output is correct
5 Correct 2 ms 484 KB Output is correct
6 Correct 3 ms 560 KB Output is correct
7 Correct 3 ms 616 KB Output is correct
8 Correct 3 ms 616 KB Output is correct
9 Correct 3 ms 636 KB Output is correct
10 Correct 2 ms 636 KB Output is correct
11 Correct 2 ms 772 KB Output is correct
12 Correct 3 ms 772 KB Output is correct
13 Correct 3 ms 772 KB Output is correct
14 Correct 3 ms 816 KB Output is correct
15 Correct 2 ms 816 KB Output is correct
16 Correct 3 ms 816 KB Output is correct
17 Correct 3 ms 816 KB Output is correct
18 Correct 3 ms 816 KB Output is correct
19 Correct 2 ms 1012 KB Output is correct
20 Correct 3 ms 1012 KB Output is correct
21 Correct 3 ms 1012 KB Output is correct
22 Correct 4 ms 1012 KB Output is correct
23 Correct 3 ms 1012 KB Output is correct
24 Correct 2 ms 1012 KB Output is correct
25 Correct 3 ms 1012 KB Output is correct
26 Correct 3 ms 1012 KB Output is correct
27 Correct 6 ms 1180 KB Output is correct
28 Correct 5 ms 1328 KB Output is correct
29 Correct 8 ms 1456 KB Output is correct
30 Correct 7 ms 1580 KB Output is correct
31 Correct 7 ms 1708 KB Output is correct
32 Correct 6 ms 1716 KB Output is correct
33 Correct 6 ms 1964 KB Output is correct
34 Correct 5 ms 2092 KB Output is correct
35 Correct 5 ms 2220 KB Output is correct
36 Correct 8 ms 2348 KB Output is correct
37 Correct 7 ms 2476 KB Output is correct
38 Correct 5 ms 2608 KB Output is correct
39 Correct 6 ms 2736 KB Output is correct
40 Correct 5 ms 2864 KB Output is correct
41 Correct 6 ms 2992 KB Output is correct
42 Correct 6 ms 3116 KB Output is correct
43 Correct 7 ms 3356 KB Output is correct
44 Correct 7 ms 3484 KB Output is correct
45 Correct 7 ms 3564 KB Output is correct
46 Correct 6 ms 3644 KB Output is correct
47 Correct 5 ms 3772 KB Output is correct
48 Correct 7 ms 3900 KB Output is correct
49 Correct 7 ms 4028 KB Output is correct
50 Correct 5 ms 4156 KB Output is correct
51 Correct 5 ms 4284 KB Output is correct

Subtask #4
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 248 KB Output is correct
2 Correct 3 ms 484 KB Output is correct
3 Correct 3 ms 484 KB Output is correct
4 Correct 3 ms 484 KB Output is correct
5 Correct 2 ms 484 KB Output is correct
6 Correct 3 ms 560 KB Output is correct
7 Correct 3 ms 616 KB Output is correct
8 Correct 3 ms 616 KB Output is correct
9 Correct 3 ms 636 KB Output is correct
10 Correct 2 ms 636 KB Output is correct
11 Correct 2 ms 772 KB Output is correct
12 Correct 3 ms 772 KB Output is correct
13 Correct 3 ms 772 KB Output is correct
14 Correct 3 ms 816 KB Output is correct
15 Correct 2 ms 816 KB Output is correct
16 Correct 3 ms 816 KB Output is correct
17 Correct 3 ms 816 KB Output is correct
18 Correct 3 ms 816 KB Output is correct
19 Correct 2 ms 1012 KB Output is correct
20 Correct 3 ms 1012 KB Output is correct
21 Correct 3 ms 1012 KB Output is correct
22 Correct 4 ms 1012 KB Output is correct
23 Correct 3 ms 1012 KB Output is correct
24 Correct 2 ms 1012 KB Output is correct
25 Correct 3 ms 1012 KB Output is correct
26 Correct 3 ms 1012 KB Output is correct
27 Correct 6 ms 1180 KB Output is correct
28 Correct 5 ms 1328 KB Output is correct
29 Correct 8 ms 1456 KB Output is correct
30 Correct 7 ms 1580 KB Output is correct
31 Correct 7 ms 1708 KB Output is correct
32 Correct 6 ms 1716 KB Output is correct
33 Correct 6 ms 1964 KB Output is correct
34 Correct 5 ms 2092 KB Output is correct
35 Correct 5 ms 2220 KB Output is correct
36 Correct 8 ms 2348 KB Output is correct
37 Correct 7 ms 2476 KB Output is correct
38 Correct 5 ms 2608 KB Output is correct
39 Correct 6 ms 2736 KB Output is correct
40 Correct 5 ms 2864 KB Output is correct
41 Correct 6 ms 2992 KB Output is correct
42 Correct 6 ms 3116 KB Output is correct
43 Correct 7 ms 3356 KB Output is correct
44 Correct 7 ms 3484 KB Output is correct
45 Correct 7 ms 3564 KB Output is correct
46 Correct 6 ms 3644 KB Output is correct
47 Correct 5 ms 3772 KB Output is correct
48 Correct 7 ms 3900 KB Output is correct
49 Correct 7 ms 4028 KB Output is correct
50 Correct 5 ms 4156 KB Output is correct
51 Correct 5 ms 4284 KB Output is correct
52 Execution timed out 1077 ms 8380 KB Time limit exceeded
53 Halted 0 ms 0 KB -