oj.uz

Submission #71046

# Submission time Handle Problem Language Result Execution time Memory
71046 2018-08-24T04:44:31 Z qkxwsm Global Warming (CEOI18_glo) C++17
100 / 100
 195 ms 4744 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, typename U> using hashtable = gp_hash_table<T, U, 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, class U>
T normalize(T x, U 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 200013

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;
int X;
int arr[MAXN];
int pref[MAXN];
int fw[MAXN], bw[MAXN];
int fen[MAXN];
vector<int> compress;
int ans;

void update(int idx, int v)
{
        for (int e = idx + 1; e <= N + 2; e += e & (-e))
        {
                ckmax(fen[e], v);
        }
        return;
}
int query(int idx)
{
        int res = 0;
        for (int e = idx + 1; e > 0; e -= e & (-e))
        {
                ckmax(res, fen[e]);
        }
        return res;
}
int getindex(int x)
{
        return LB(compress.begin(), compress.end(), x) - compress.begin();
}

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 >> X;
        for (int i = 0; i < N; i++)
        {
                cin >> arr[i];
                compress.PB(arr[i]);
        }
        sort(compress.begin(), compress.end());
        compress.erase(unique(compress.begin(), compress.end()), compress.end());
        //you only want to change prefixes
        for (int i = 0; i <= N + 2; i++)
        {
                fen[i] = 0;
        }
        for (int i = N - 1; i >= 0; i--)
        {
                int idx = getindex(arr[i]);
                bw[i] = query(N - idx - 2) + 1;
                update(N - idx - 1, bw[i]);
                ckmax(ans, bw[i]);
        }
        for (int i = 0; i <= N + 2; i++)
        {
                fen[i] = 0;
        }
        for (int i = 0; i < N; i++)
        {
                int idx = getindex(arr[i]);
                fw[i] = query(idx - 1) + 1;
                update(idx, fw[i]);
                ckmax(ans, fw[i]);
                if (i != N - 1)
                {
                        idx = getindex(arr[i + 1] + X);
                        ckmax(ans, bw[i + 1] + query(idx - 1));
                }
        }
        //can you make the LIS at least j?
        cout << ans << '\n';
	//	cerr << "time elapsed = " << (clock() / (CLOCKS_PER_SEC / 1000)) << " ms" << endl;
	return 0;
}

Compilation message

glo.cpp: In function 'int32_t main()':
glo.cpp:182: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);
   ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
glo.cpp:183: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
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 500 KB Output is correct
3 Correct 3 ms 500 KB Output is correct
4 Correct 2 ms 500 KB Output is correct
5 Correct 3 ms 500 KB Output is correct
6 Correct 3 ms 532 KB Output is correct
7 Correct 2 ms 532 KB Output is correct
8 Correct 3 ms 576 KB Output is correct
9 Correct 3 ms 596 KB Output is correct
10 Correct 3 ms 600 KB Output is correct
11 Correct 2 ms 600 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 500 KB Output is correct
3 Correct 3 ms 500 KB Output is correct
4 Correct 2 ms 500 KB Output is correct
5 Correct 3 ms 500 KB Output is correct
6 Correct 3 ms 532 KB Output is correct
7 Correct 2 ms 532 KB Output is correct
8 Correct 3 ms 576 KB Output is correct
9 Correct 3 ms 596 KB Output is correct
10 Correct 3 ms 600 KB Output is correct
11 Correct 2 ms 600 KB Output is correct
12 Correct 2 ms 600 KB Output is correct
13 Correct 3 ms 600 KB Output is correct
14 Correct 3 ms 600 KB Output is correct
15 Correct 3 ms 620 KB Output is correct
16 Correct 3 ms 620 KB Output is correct
17 Correct 3 ms 620 KB Output is correct
18 Correct 3 ms 620 KB Output is correct

Subtask #3
13.0 / 13.0

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

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 192 ms 4744 KB Output is correct
2 Correct 195 ms 4744 KB Output is correct
3 Correct 191 ms 4744 KB Output is correct
4 Correct 181 ms 4744 KB Output is correct
5 Correct 92 ms 4744 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 4744 KB Output is correct
2 Correct 44 ms 4744 KB Output is correct
3 Correct 46 ms 4744 KB Output is correct
4 Correct 22 ms 4744 KB Output is correct
5 Correct 3 ms 4744 KB Output is correct
6 Correct 28 ms 4744 KB Output is correct
7 Correct 33 ms 4744 KB Output is correct

Subtask #6
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 88 ms 4744 KB Output is correct
2 Correct 105 ms 4744 KB Output is correct
3 Correct 179 ms 4744 KB Output is correct
4 Correct 78 ms 4744 KB Output is correct
5 Correct 50 ms 4744 KB Output is correct
6 Correct 89 ms 4744 KB Output is correct
7 Correct 103 ms 4744 KB Output is correct
8 Correct 71 ms 4744 KB Output is correct

Subtask #7
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 500 KB Output is correct
3 Correct 3 ms 500 KB Output is correct
4 Correct 2 ms 500 KB Output is correct
5 Correct 3 ms 500 KB Output is correct
6 Correct 3 ms 532 KB Output is correct
7 Correct 2 ms 532 KB Output is correct
8 Correct 3 ms 576 KB Output is correct
9 Correct 3 ms 596 KB Output is correct
10 Correct 3 ms 600 KB Output is correct
11 Correct 2 ms 600 KB Output is correct
12 Correct 2 ms 600 KB Output is correct
13 Correct 3 ms 600 KB Output is correct
14 Correct 3 ms 600 KB Output is correct
15 Correct 3 ms 620 KB Output is correct
16 Correct 3 ms 620 KB Output is correct
17 Correct 3 ms 620 KB Output is correct
18 Correct 3 ms 620 KB Output is correct
19 Correct 3 ms 620 KB Output is correct
20 Correct 4 ms 620 KB Output is correct
21 Correct 3 ms 620 KB Output is correct
22 Correct 3 ms 620 KB Output is correct
23 Correct 3 ms 620 KB Output is correct
24 Correct 3 ms 620 KB Output is correct
25 Correct 3 ms 620 KB Output is correct
26 Correct 3 ms 620 KB Output is correct
27 Correct 192 ms 4744 KB Output is correct
28 Correct 195 ms 4744 KB Output is correct
29 Correct 191 ms 4744 KB Output is correct
30 Correct 181 ms 4744 KB Output is correct
31 Correct 92 ms 4744 KB Output is correct
32 Correct 40 ms 4744 KB Output is correct
33 Correct 44 ms 4744 KB Output is correct
34 Correct 46 ms 4744 KB Output is correct
35 Correct 22 ms 4744 KB Output is correct
36 Correct 3 ms 4744 KB Output is correct
37 Correct 28 ms 4744 KB Output is correct
38 Correct 33 ms 4744 KB Output is correct
39 Correct 88 ms 4744 KB Output is correct
40 Correct 105 ms 4744 KB Output is correct
41 Correct 179 ms 4744 KB Output is correct
42 Correct 78 ms 4744 KB Output is correct
43 Correct 50 ms 4744 KB Output is correct
44 Correct 89 ms 4744 KB Output is correct
45 Correct 103 ms 4744 KB Output is correct
46 Correct 71 ms 4744 KB Output is correct
47 Correct 98 ms 4744 KB Output is correct
48 Correct 80 ms 4744 KB Output is correct
49 Correct 188 ms 4744 KB Output is correct
50 Correct 78 ms 4744 KB Output is correct
51 Correct 78 ms 4744 KB Output is correct
52 Correct 104 ms 4744 KB Output is correct
53 Correct 90 ms 4744 KB Output is correct
54 Correct 99 ms 4744 KB Output is correct
55 Correct 155 ms 4744 KB Output is correct