답안 #779749

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
779749	2023-07-11T18:30:00 Z	Joshua_Andersson	Self Study (JOI22_ho_t2)	C++14	100 / 100	240 ms	13184 KB

Main

#undef _GLIBCXX_DEBUG                // disable run-time bound checking, etc
#pragma GCC optimize("Ofast,inline") // Ofast = O3,fast-math,allow-store-data-races,no-protect-parens
#pragma GCC optimize ("unroll-loops")

#pragma GCC target("bmi,bmi2,lzcnt,popcnt")                      // bit manipulation
#pragma GCC target("movbe")                                      // byte swap
#pragma GCC target("aes,pclmul,rdrnd")                           // encryption
#pragma GCC target("avx,avx2,f16c,fma,sse3,ssse3,sse4.1,sse4.2") // SIMD

#include <bits/stdc++.h>
#include <bits/extc++.h>
using namespace std;

#define enablell 1

typedef long long ll;
typedef unsigned long long ull;
#if enablell
#define int ll
#define inf int(1e18)
#define float double
#else
const int inf = int(2e9);
#endif
typedef vector<ull> vull;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<vvvi> vvvvi;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<vvb> vvvb;
typedef pair<int, int> p2;
typedef vector<p2> vp2;
typedef vector<vp2> vvp2;
typedef vector<vvp2> vvvp2;
typedef tuple<int, int, int> p3;
typedef vector<p3> vp3;
typedef vector<vp3> vvp3;
typedef vector<vvp3> vvvp3;
typedef tuple<int, int, int, int> p4;
typedef vector<p4> vp4;

#define PBDS 0
#define _LOCAL _MSC_VER > 0
#if _LOCAL
#define gc() getchar()
#define popcount(x) __popcnt(x)
#define leading_zeros(x) _lzcnt_u32(x)
uint32_t clz(uint32_t x) { return _lzcnt_u32(x); }
uint32_t ctz(uint32_t x) { return _tzcnt_u32(x); }
#define bswap64(x) _byteswap_uint64(x)
#define assert(x) debassert(x)
#else
#define popcount(x) __builtin_popcount(x)
uint32_t clz(uint32_t x) { return __builtin_clz(x); }
uint32_t ctz(uint32_t x) { return __builtin_ctzll(x); }
#define bswap64(x) __builtin_bswap64(x)
#define gc() getchar_unlocked()
#if PBDS
using namespace __gnu_pbds;
// lower_bound is now upper_bound and vice versa (multiset). generally a bit broken
template<typename T> using indexed_multiset = tree<int, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T> using indexed_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename U> using indexed_set = tree<T, U, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
struct chash { // large odd number for C
	const uint64_t C = ll(4e18 * acos(0)) | 71;
	ll operator()(ll x) const { return __builtin_bswap64(x * C); }
};

template<typename T, typename U> using fast_map = __gnu_pbds::gp_hash_table<T, U, chash>;
template<typename T> using fast_set = __gnu_pbds::gp_hash_table<T, null_type, chash>;
template<typename T, typename H> using fast_set_h = __gnu_pbds::gp_hash_table<T, null_type, H>;
#endif

#endif

#define FAST_INPUT 0
#define FILE_TC 0
#if FILE_TC && _LOCAL
//ifstream filein("C:\\users\\matis\\source\\repos\\comp_prog\\x64\\release\\in.txt");
ifstream filein("C:\\users\\matis\\source\\repos\\comp_prog\\x64\\debug\\in.txt");
//ifstream filein("E:\\downloads\\test_data\\test_data\\005-case05.in");
//ifstream filein("E:\\desktop\\po-repos\\swedish-olympiad-2023\\online\\tomtplanering\\data\\secret\\group10\\010-case10.in");

#define cin filein
void fast() {}
#else
inline void fast() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); }
#endif

#if FAST_INPUT && (!FILE_TC || !_LOCAL)
inline void read(int& v) { v = 0; int sign = 1; char c = gc(); if (c == '-') { sign = -1; } else { v += c - '0'; } while ((c = gc()) && c != ' ' && c != '\n') { if (c == EOF) { v = -1; return; } v *= 10; v += c - '0'; } v *= sign; }
inline void read(int& u, int& v) { read(u); read(v); }
inline void read(int& u, int& v, int& k) { read(u); read(v); read(k); }
//inline void read(int& v) { char c; while ((c = getchar()) != EOF && c != ' ' && c != '\n') { v *= 10; v += c - '0'; } }
inline void read(string& s) { char c; while ((c = gc()) != EOF && c != '\n' && c != ' ') { s.push_back(c); } }
inline void readline(string& s) { char c; while ((c = gc()) != EOF && c != '\n') { s.push_back(c); } }
#else
template <typename T> inline void read(T& a) { cin >> a; }
template <typename T> inline void read(T& a, T& b) { cin >> a >> b; }
template <typename T> inline void read(T& a, T& b, T& c) { cin >> a >> b >> c; }
#endif
#define quit cout << endl; _Exit(0);
#define dread(type, a) type a; read(a)
#define dread2(type, a, b) dread(type, a); dread(type, b)
#define dread3(type, a, b, c) dread2(type, a, b); dread(type, c)
#define dread4(type, a, b, c, d) dread3(type, a, b, c); dread(type, d)
#define dread5(type, a, b, c, d, e) dread4(type, a, b, c, d); dread(type, e)
#define readvector(type, name, size) vector<type> name(size); rep(i,size) {dread(type,temp); name[i]=temp;}
#ifdef _DEBUG
#define noop cout << "";
#define deb __debugbreak();
#define debassert(expr) if(!(expr)) deb;
#define debif(expr) if(expr) deb;
#else
#define noop ;
#define deb ;
#define debif(expr) ;
#define debassert(expr) ;
#endif

#define rep(i, high) for (int i = 0; i < high; i++)
#define repp(i, low, high) for (int i = low; i < high; i++)
#define repe(i, container) for (auto& i : container)
#define per(i, high) for (int i = high-1; i >= 0; i--)
#define perr(i, low, high) for (int i = high-1; i >= low; i--)

#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define setcontains(set, x) (set.find(x) != set.end())
#define within(a, b, c, d) (a >= 0 && a < b && c >= 0 && c < d)
#define sz(container) ((int)container.size())
#define mp(a,b) (make_pair(a,b))

#define ceildiv(x,y) ((x + y - 1) / y)

template <typename T, typename U> inline void operator+=(pair<T, U>& l, const pair<T, U>& r) { l = { l.first + r.first,l.second + r.second }; }
template <typename T, typename U> inline pair<T, U> operator+(const pair<T, U> l, const pair<T, U> r) { return { l.first + r.first, l.second + r.second }; }
template <typename T, typename U> inline pair<T, U> operator-(const pair<T, U> l, const pair<T, U> r) { return { l.first - r.first, l.second - r.second }; }
template <typename T, typename U> inline pair<T, U> operator*(const pair<T, U> l, const int m) { return { l.first * m, l.second * m }; }
template <typename Out> inline void split(const string& s, char delim, Out result) { istringstream iss(s); string item; while (getline(iss, item, delim)) { *result++ = item; } }
inline vector<string> split(const string& s, char delim) { vector<string> elems; split(s, delim, back_inserter(elems)); return elems; }
vector<string> split(string s, string d) { size_t k = 0, n, e = d.length(); string t; vector<string> r; while ((n = s.find(d, k)) != string::npos) { t = s.substr(k, n - k); k = n + e; r.push_back(t); } r.push_back(s.substr(k)); return r; }
ll binpow(ll a, ll b) { ll res = 1; while (b > 0) { if (b & 1) res = res * a; a = a * a; b >>= 1; } return res; }
ll binpow(ll a, ll b, ll m) { a %= m; long long res = 1; while (b > 0) { if (b & 1) res = res * a % m; a = a * a % m; b >>= 1; } return res; } // For a < 2^31

#if 1
auto Start = chrono::high_resolution_clock::now();
void resettimer() { Start = chrono::high_resolution_clock::now(); }
int elapsedmillis() { return chrono::duration_cast<chrono::milliseconds>(chrono::high_resolution_clock::now() - Start).count(); }
random_device rd;
mt19937 rng(rd());
template<typename T, typename U> inline int randint(T lo, U hi) { return uniform_int_distribution<int>((int)lo, (int)hi)(rng); } // [lo,hi]
template<typename T> inline T randel(vector<T>& v) { return v[uniform_int_distribution<int>(int(0), int(v.size()) - int(1))(rng)]; } // [lo,hi]
#endif
const ll mod = 1e9 + 7;
vp2 dirs = { {0,1},{0,-1},{1,0},{-1,0}, {0,0} };

bool works(int t, int m, vi& a, vi& b)
{
	int n = a.size();
	vi left(n, t);

	int spare = 0;

	rep(i, n)
	{
		if (a[i]>b[i])
		{
			int req = ceildiv(left[i], a[i]);
			if (req<=m)
			{
				spare += m-req;
				left[i] = 0;
			}
			else
			{
				left[i] -= m * a[i];
			}
		}
		else
		{
			spare += m;
		}
	}

	rep(i, n)
	{
		if (left[i])
		{
			int req = ceildiv(left[i], b[i]);
			if (req <= spare)
			{
				spare -= req;
			}
			else
			{
				return 0;
			}
		}
	}
	return 1;
}

int32_t main()
{
	fast();


	dread2(int, n, m);
	readvector(int, a, n);
	readvector(int, b, n);
	int lo = -1;
	int hi = binpow(2,62);
	while (hi-lo>1)
	{
		int mid = (hi + lo) / 2;

		if (works(mid,m,a,b))
		{
			lo = mid;
		}
		else
		{
			hi = mid;
		}
	}
	cout << lo;

	quit;
}

Subtask #1
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	0 ms	280 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	2 ms	340 KB	Output is correct
11	Correct	188 ms	7372 KB	Output is correct
12	Correct	175 ms	7364 KB	Output is correct
13	Correct	81 ms	7324 KB	Output is correct
14	Correct	167 ms	7372 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	42 ms	7300 KB	Output is correct
17	Correct	91 ms	7296 KB	Output is correct
18	Correct	103 ms	7372 KB	Output is correct

Subtask #2
25.0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	42 ms	7300 KB	Output is correct
3	Correct	91 ms	7296 KB	Output is correct
4	Correct	103 ms	7372 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	248 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	47 ms	3796 KB	Output is correct
14	Correct	33 ms	2696 KB	Output is correct
15	Correct	23 ms	2112 KB	Output is correct
16	Correct	21 ms	1720 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	3 ms	340 KB	Output is correct

Subtask #3
27.0 / 27.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	0 ms	280 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	2 ms	340 KB	Output is correct
11	Correct	188 ms	7372 KB	Output is correct
12	Correct	175 ms	7364 KB	Output is correct
13	Correct	81 ms	7324 KB	Output is correct
14	Correct	167 ms	7372 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	0 ms	248 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	0 ms	212 KB	Output is correct
23	Correct	47 ms	3796 KB	Output is correct
24	Correct	33 ms	2696 KB	Output is correct
25	Correct	23 ms	2112 KB	Output is correct
26	Correct	21 ms	1720 KB	Output is correct
27	Correct	1 ms	340 KB	Output is correct
28	Correct	0 ms	212 KB	Output is correct
29	Correct	0 ms	212 KB	Output is correct
30	Correct	0 ms	212 KB	Output is correct
31	Correct	1 ms	212 KB	Output is correct
32	Correct	1 ms	340 KB	Output is correct
33	Correct	3 ms	340 KB	Output is correct
34	Correct	0 ms	212 KB	Output is correct
35	Correct	42 ms	7300 KB	Output is correct
36	Correct	91 ms	7296 KB	Output is correct
37	Correct	103 ms	7372 KB	Output is correct
38	Correct	0 ms	212 KB	Output is correct
39	Correct	0 ms	212 KB	Output is correct
40	Correct	0 ms	212 KB	Output is correct
41	Correct	1 ms	212 KB	Output is correct
42	Correct	0 ms	212 KB	Output is correct
43	Correct	1 ms	212 KB	Output is correct
44	Correct	0 ms	212 KB	Output is correct
45	Correct	3 ms	340 KB	Output is correct
46	Correct	5 ms	540 KB	Output is correct
47	Correct	1 ms	340 KB	Output is correct
48	Correct	33 ms	1552 KB	Output is correct
49	Correct	1 ms	212 KB	Output is correct
50	Correct	1 ms	340 KB	Output is correct
51	Correct	3 ms	360 KB	Output is correct
52	Correct	0 ms	212 KB	Output is correct
53	Correct	0 ms	212 KB	Output is correct
54	Correct	0 ms	212 KB	Output is correct
55	Correct	95 ms	3820 KB	Output is correct
56	Correct	30 ms	2676 KB	Output is correct
57	Correct	51 ms	2676 KB	Output is correct

Subtask #4
29.0 / 29.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	248 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	47 ms	3796 KB	Output is correct
10	Correct	33 ms	2696 KB	Output is correct
11	Correct	23 ms	2112 KB	Output is correct
12	Correct	21 ms	1720 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	340 KB	Output is correct
19	Correct	3 ms	340 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct
21	Correct	42 ms	7300 KB	Output is correct
22	Correct	91 ms	7296 KB	Output is correct
23	Correct	103 ms	7372 KB	Output is correct
24	Correct	29 ms	1364 KB	Output is correct
25	Correct	67 ms	3436 KB	Output is correct
26	Correct	12 ms	980 KB	Output is correct
27	Correct	94 ms	7296 KB	Output is correct
28	Correct	107 ms	7364 KB	Output is correct
29	Correct	103 ms	7368 KB	Output is correct
30	Correct	120 ms	7364 KB	Output is correct
31	Correct	198 ms	7368 KB	Output is correct
32	Correct	118 ms	7388 KB	Output is correct
33	Correct	230 ms	7372 KB	Output is correct
34	Correct	121 ms	8540 KB	Output is correct

Subtask #5
9.0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	0 ms	280 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	2 ms	340 KB	Output is correct
11	Correct	188 ms	7372 KB	Output is correct
12	Correct	175 ms	7364 KB	Output is correct
13	Correct	81 ms	7324 KB	Output is correct
14	Correct	167 ms	7372 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	0 ms	248 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	0 ms	212 KB	Output is correct
23	Correct	47 ms	3796 KB	Output is correct
24	Correct	33 ms	2696 KB	Output is correct
25	Correct	23 ms	2112 KB	Output is correct
26	Correct	21 ms	1720 KB	Output is correct
27	Correct	1 ms	340 KB	Output is correct
28	Correct	0 ms	212 KB	Output is correct
29	Correct	0 ms	212 KB	Output is correct
30	Correct	0 ms	212 KB	Output is correct
31	Correct	1 ms	212 KB	Output is correct
32	Correct	1 ms	340 KB	Output is correct
33	Correct	3 ms	340 KB	Output is correct
34	Correct	0 ms	212 KB	Output is correct
35	Correct	0 ms	212 KB	Output is correct
36	Correct	0 ms	212 KB	Output is correct
37	Correct	1 ms	212 KB	Output is correct
38	Correct	0 ms	212 KB	Output is correct
39	Correct	1 ms	212 KB	Output is correct
40	Correct	0 ms	212 KB	Output is correct
41	Correct	3 ms	340 KB	Output is correct
42	Correct	5 ms	540 KB	Output is correct
43	Correct	1 ms	340 KB	Output is correct
44	Correct	33 ms	1552 KB	Output is correct
45	Correct	1 ms	212 KB	Output is correct
46	Correct	1 ms	340 KB	Output is correct
47	Correct	3 ms	360 KB	Output is correct
48	Correct	0 ms	212 KB	Output is correct
49	Correct	0 ms	212 KB	Output is correct
50	Correct	0 ms	212 KB	Output is correct
51	Correct	95 ms	3820 KB	Output is correct
52	Correct	30 ms	2676 KB	Output is correct
53	Correct	51 ms	2676 KB	Output is correct
54	Correct	29 ms	1364 KB	Output is correct
55	Correct	67 ms	3436 KB	Output is correct
56	Correct	12 ms	980 KB	Output is correct
57	Correct	94 ms	7296 KB	Output is correct
58	Correct	107 ms	7364 KB	Output is correct
59	Correct	103 ms	7368 KB	Output is correct
60	Correct	120 ms	7364 KB	Output is correct
61	Correct	198 ms	7368 KB	Output is correct
62	Correct	118 ms	7388 KB	Output is correct
63	Correct	230 ms	7372 KB	Output is correct
64	Correct	121 ms	8540 KB	Output is correct
65	Correct	0 ms	212 KB	Output is correct
66	Correct	42 ms	7300 KB	Output is correct
67	Correct	91 ms	7296 KB	Output is correct
68	Correct	103 ms	7372 KB	Output is correct
69	Correct	25 ms	1736 KB	Output is correct
70	Correct	6 ms	600 KB	Output is correct
71	Correct	0 ms	212 KB	Output is correct
72	Correct	34 ms	2168 KB	Output is correct
73	Correct	7 ms	752 KB	Output is correct
74	Correct	1 ms	340 KB	Output is correct
75	Correct	184 ms	13132 KB	Output is correct
76	Correct	191 ms	13172 KB	Output is correct
77	Correct	196 ms	13168 KB	Output is correct
78	Correct	211 ms	13132 KB	Output is correct
79	Correct	240 ms	13184 KB	Output is correct
80	Correct	240 ms	13164 KB	Output is correct
81	Correct	213 ms	11124 KB	Output is correct
82	Correct	215 ms	11236 KB	Output is correct

답안 #779749

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 25.0 / 25.0

Subtask #3 27.0 / 27.0

Subtask #4 29.0 / 29.0

Subtask #5 9.0 / 9.0

Subtask #1
10.0 / 10.0

Subtask #2
25.0 / 25.0

Subtask #3
27.0 / 27.0

Subtask #4
29.0 / 29.0

Subtask #5
9.0 / 9.0