oj.uz

Submission #124265

# Submission time Handle Problem Language Result Execution time Memory
124265 2019-07-02T22:45:34 Z tutis Mountains (IOI17_mountains) C++17
100 / 100
 870 ms 235512 KB 
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
struct BitSet
{
	unsigned long long A[32];
	unsigned long long h;
	BitSet()
	{
		h = 0;
		fill_n(A, 32, 0ull);
	}
	bool operator<(const BitSet& o)const
	{
		if (h != o.h)
			return h < o.h;
		for (int i = 0; i < 32; i++)
		{
			if (A[i] != o.A[i])
				return A[i] < o.A[i];
		}
		return false;
	}
	void set(int i)
	{
		int t = i / 64;
		i %= 64;
		A[t] |= (1ull << i);
		h ^= (1ull << i);
		return;
	}
	void unset(int i)
	{
		int t = i / 64;
		i %= 64;
		A[t] &= (~(1ull << i));
		h ^= (1ull << i);
		return;
	}
	void andas(BitSet &o)
	{
		h = 0;
		A[0] &= o.A[0];
		A[1] &= o.A[1];
		A[2] &= o.A[2];
		A[3] &= o.A[3];
		A[4] &= o.A[4];
		A[5] &= o.A[5];
		A[6] &= o.A[6];
		A[7] &= o.A[7];
		A[8] &= o.A[8];
		A[9] &= o.A[9];
		A[10] &= o.A[10];
		A[11] &= o.A[11];
		A[12] &= o.A[12];
		A[13] &= o.A[13];
		A[14] &= o.A[14];
		A[15] &= o.A[15];
		A[16] &= o.A[16];
		A[17] &= o.A[17];
		A[18] &= o.A[18];
		A[19] &= o.A[19];
		A[20] &= o.A[20];
		A[21] &= o.A[21];
		A[22] &= o.A[22];
		A[23] &= o.A[23];
		A[24] &= o.A[24];
		A[25] &= o.A[25];
		A[26] &= o.A[26];
		A[27] &= o.A[27];
		A[28] &= o.A[28];
		A[29] &= o.A[29];
		A[30] &= o.A[30];
		A[31] &= o.A[31];
		h = A[0] ^ A[1] ^ A[2] ^ A[3] ^ A[4] ^ A[5] ^ A[6] ^ A[7] ^
		    A[8] ^ A[9] ^ A[10] ^ A[11] ^ A[12] ^ A[13] ^ A[14] ^ A[15] ^
		    A[16] ^ A[17] ^ A[18] ^ A[19] ^ A[20] ^ A[21] ^ A[22] ^ A[23] ^
		    A[24] ^ A[25] ^ A[26] ^ A[27] ^ A[28] ^ A[29] ^ A[30] ^ A[31];
	}
	int First(int t)
	{
		int ret = 64 * t;
		for (; t < 32; t++)
		{
			if (A[t] == 0)
			{
				ret += 64;
			}
			else
			{
				return ret + __builtin_ctzll(A[t]);
			}
		}
		return ret;
	}
};
BitSet ok[2000];
map<BitSet, int>M;
int dp(BitSet x, int nuo = 0)
{
	int i = x.First(nuo / 64);
	if (i >= 2000)
		return 0;
	int &ans = M[x];
	if (ans != 0)
		return ans;
	x.unset(i);
	ans = dp(x, i + 1);
	x.andas(ok[i]);
	ans = max(ans, 1 + dp(x, i + 1));
	return ans;
}
int maximum_deevs(vector<int> y)
{
	BitSet deevs;
	for (ll i = 0; i < (ll)y.size(); i++)
	{
		ll k = i + 1;
		for (ll j = i + 1; j < (ll)y.size(); j++)
		{
			if ((y[j] - y[i]) * (k - i) >= (y[k] - y[i]) * (j - i))
				k = j;
			if (k != j)
				ok[i].set(j);
		}
		deevs.set(i);
	}
	return dp(deevs);
}/*
int main()
{
	cout << maximum_deevs({ 6, 1, 5, 2, 3, 1}) << endl;//3
	cout << maximum_deevs({ 0, 1, 2}) << endl;//1
}/**/

Compilation message

mountains.cpp:136:2: warning: "/*" within comment [-Wcomment]
 }/**/

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 888 KB Output is correct
2 Correct 2 ms 760 KB Output is correct
3 Correct 2 ms 760 KB Output is correct
4 Correct 2 ms 760 KB Output is correct
5 Correct 2 ms 888 KB Output is correct
6 Correct 2 ms 888 KB Output is correct
7 Correct 2 ms 888 KB Output is correct
8 Correct 2 ms 860 KB Output is correct
9 Correct 2 ms 888 KB Output is correct
10 Correct 2 ms 888 KB Output is correct
11 Correct 2 ms 888 KB Output is correct
12 Correct 2 ms 860 KB Output is correct
13 Correct 2 ms 888 KB Output is correct
14 Correct 2 ms 888 KB Output is correct
15 Correct 2 ms 888 KB Output is correct
16 Correct 2 ms 888 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 888 KB Output is correct
2 Correct 2 ms 760 KB Output is correct
3 Correct 2 ms 760 KB Output is correct
4 Correct 2 ms 760 KB Output is correct
5 Correct 2 ms 888 KB Output is correct
6 Correct 2 ms 888 KB Output is correct
7 Correct 2 ms 888 KB Output is correct
8 Correct 2 ms 860 KB Output is correct
9 Correct 2 ms 888 KB Output is correct
10 Correct 2 ms 888 KB Output is correct
11 Correct 2 ms 888 KB Output is correct
12 Correct 2 ms 860 KB Output is correct
13 Correct 2 ms 888 KB Output is correct
14 Correct 2 ms 888 KB Output is correct
15 Correct 2 ms 888 KB Output is correct
16 Correct 2 ms 888 KB Output is correct
17 Correct 2 ms 888 KB Output is correct
18 Correct 2 ms 888 KB Output is correct
19 Correct 2 ms 888 KB Output is correct
20 Correct 2 ms 888 KB Output is correct
21 Correct 2 ms 888 KB Output is correct
22 Correct 2 ms 888 KB Output is correct
23 Correct 2 ms 888 KB Output is correct
24 Correct 2 ms 888 KB Output is correct
25 Correct 2 ms 888 KB Output is correct
26 Correct 2 ms 888 KB Output is correct
27 Correct 2 ms 888 KB Output is correct
28 Correct 2 ms 888 KB Output is correct
29 Correct 2 ms 888 KB Output is correct
30 Correct 2 ms 888 KB Output is correct
31 Correct 2 ms 888 KB Output is correct
32 Correct 3 ms 1016 KB Output is correct
33 Correct 2 ms 888 KB Output is correct
34 Correct 2 ms 860 KB Output is correct
35 Correct 2 ms 888 KB Output is correct
36 Correct 2 ms 888 KB Output is correct
37 Correct 2 ms 888 KB Output is correct
38 Correct 2 ms 888 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 888 KB Output is correct
2 Correct 2 ms 760 KB Output is correct
3 Correct 2 ms 760 KB Output is correct
4 Correct 2 ms 760 KB Output is correct
5 Correct 2 ms 888 KB Output is correct
6 Correct 2 ms 888 KB Output is correct
7 Correct 2 ms 888 KB Output is correct
8 Correct 2 ms 860 KB Output is correct
9 Correct 2 ms 888 KB Output is correct
10 Correct 2 ms 888 KB Output is correct
11 Correct 2 ms 888 KB Output is correct
12 Correct 2 ms 860 KB Output is correct
13 Correct 2 ms 888 KB Output is correct
14 Correct 2 ms 888 KB Output is correct
15 Correct 2 ms 888 KB Output is correct
16 Correct 2 ms 888 KB Output is correct
17 Correct 2 ms 888 KB Output is correct
18 Correct 2 ms 888 KB Output is correct
19 Correct 2 ms 888 KB Output is correct
20 Correct 2 ms 888 KB Output is correct
21 Correct 2 ms 888 KB Output is correct
22 Correct 2 ms 888 KB Output is correct
23 Correct 2 ms 888 KB Output is correct
24 Correct 2 ms 888 KB Output is correct
25 Correct 2 ms 888 KB Output is correct
26 Correct 2 ms 888 KB Output is correct
27 Correct 2 ms 888 KB Output is correct
28 Correct 2 ms 888 KB Output is correct
29 Correct 2 ms 888 KB Output is correct
30 Correct 2 ms 888 KB Output is correct
31 Correct 2 ms 888 KB Output is correct
32 Correct 3 ms 1016 KB Output is correct
33 Correct 2 ms 888 KB Output is correct
34 Correct 2 ms 860 KB Output is correct
35 Correct 2 ms 888 KB Output is correct
36 Correct 2 ms 888 KB Output is correct
37 Correct 2 ms 888 KB Output is correct
38 Correct 2 ms 888 KB Output is correct
39 Correct 3 ms 1272 KB Output is correct
40 Correct 3 ms 1272 KB Output is correct
41 Correct 4 ms 1400 KB Output is correct
42 Correct 4 ms 1532 KB Output is correct
43 Correct 3 ms 1272 KB Output is correct
44 Correct 3 ms 1272 KB Output is correct
45 Correct 5 ms 2040 KB Output is correct
46 Correct 5 ms 2040 KB Output is correct
47 Correct 4 ms 1912 KB Output is correct
48 Correct 5 ms 2168 KB Output is correct
49 Correct 5 ms 2040 KB Output is correct
50 Correct 5 ms 1956 KB Output is correct
51 Correct 3 ms 1400 KB Output is correct
52 Correct 6 ms 2556 KB Output is correct
53 Correct 5 ms 2296 KB Output is correct
54 Correct 6 ms 2424 KB Output is correct
55 Correct 6 ms 2424 KB Output is correct
56 Correct 5 ms 2424 KB Output is correct
57 Correct 3 ms 1144 KB Output is correct
58 Correct 6 ms 2424 KB Output is correct
59 Correct 4 ms 1656 KB Output is correct
60 Correct 3 ms 1144 KB Output is correct
61 Correct 3 ms 1272 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 888 KB Output is correct
2 Correct 2 ms 760 KB Output is correct
3 Correct 2 ms 760 KB Output is correct
4 Correct 2 ms 760 KB Output is correct
5 Correct 2 ms 888 KB Output is correct
6 Correct 2 ms 888 KB Output is correct
7 Correct 2 ms 888 KB Output is correct
8 Correct 2 ms 860 KB Output is correct
9 Correct 2 ms 888 KB Output is correct
10 Correct 2 ms 888 KB Output is correct
11 Correct 2 ms 888 KB Output is correct
12 Correct 2 ms 860 KB Output is correct
13 Correct 2 ms 888 KB Output is correct
14 Correct 2 ms 888 KB Output is correct
15 Correct 2 ms 888 KB Output is correct
16 Correct 2 ms 888 KB Output is correct
17 Correct 2 ms 888 KB Output is correct
18 Correct 2 ms 888 KB Output is correct
19 Correct 2 ms 888 KB Output is correct
20 Correct 2 ms 888 KB Output is correct
21 Correct 2 ms 888 KB Output is correct
22 Correct 2 ms 888 KB Output is correct
23 Correct 2 ms 888 KB Output is correct
24 Correct 2 ms 888 KB Output is correct
25 Correct 2 ms 888 KB Output is correct
26 Correct 2 ms 888 KB Output is correct
27 Correct 2 ms 888 KB Output is correct
28 Correct 2 ms 888 KB Output is correct
29 Correct 2 ms 888 KB Output is correct
30 Correct 2 ms 888 KB Output is correct
31 Correct 2 ms 888 KB Output is correct
32 Correct 3 ms 1016 KB Output is correct
33 Correct 2 ms 888 KB Output is correct
34 Correct 2 ms 860 KB Output is correct
35 Correct 2 ms 888 KB Output is correct
36 Correct 2 ms 888 KB Output is correct
37 Correct 2 ms 888 KB Output is correct
38 Correct 2 ms 888 KB Output is correct
39 Correct 3 ms 1272 KB Output is correct
40 Correct 3 ms 1272 KB Output is correct
41 Correct 4 ms 1400 KB Output is correct
42 Correct 4 ms 1532 KB Output is correct
43 Correct 3 ms 1272 KB Output is correct
44 Correct 3 ms 1272 KB Output is correct
45 Correct 5 ms 2040 KB Output is correct
46 Correct 5 ms 2040 KB Output is correct
47 Correct 4 ms 1912 KB Output is correct
48 Correct 5 ms 2168 KB Output is correct
49 Correct 5 ms 2040 KB Output is correct
50 Correct 5 ms 1956 KB Output is correct
51 Correct 3 ms 1400 KB Output is correct
52 Correct 6 ms 2556 KB Output is correct
53 Correct 5 ms 2296 KB Output is correct
54 Correct 6 ms 2424 KB Output is correct
55 Correct 6 ms 2424 KB Output is correct
56 Correct 5 ms 2424 KB Output is correct
57 Correct 3 ms 1144 KB Output is correct
58 Correct 6 ms 2424 KB Output is correct
59 Correct 4 ms 1656 KB Output is correct
60 Correct 3 ms 1144 KB Output is correct
61 Correct 3 ms 1272 KB Output is correct
62 Correct 10 ms 3372 KB Output is correct
63 Correct 26 ms 6904 KB Output is correct
64 Correct 22 ms 5468 KB Output is correct
65 Correct 24 ms 6392 KB Output is correct
66 Correct 24 ms 6392 KB Output is correct
67 Correct 23 ms 6008 KB Output is correct
68 Correct 22 ms 5752 KB Output is correct
69 Correct 24 ms 6136 KB Output is correct
70 Correct 134 ms 38904 KB Output is correct
71 Correct 113 ms 32888 KB Output is correct
72 Correct 122 ms 34552 KB Output is correct
73 Correct 111 ms 32120 KB Output is correct
74 Correct 115 ms 34040 KB Output is correct
75 Correct 113 ms 34424 KB Output is correct
76 Correct 32 ms 6904 KB Output is correct
77 Correct 15 ms 4984 KB Output is correct
78 Correct 13 ms 4344 KB Output is correct
79 Correct 15 ms 4188 KB Output is correct
80 Correct 13 ms 4216 KB Output is correct
81 Correct 14 ms 4472 KB Output is correct
82 Correct 14 ms 2424 KB Output is correct
83 Correct 353 ms 91616 KB Output is correct
84 Correct 870 ms 235512 KB Output is correct
85 Correct 16 ms 3064 KB Output is correct
86 Correct 18 ms 3704 KB Output is correct