Submission #68125238

Source Code Expand

#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

//
//
//                               S i r o t a n   w a t c h e s   o v e r   y o u .
//
//                                          ...Jggg+J+JJJg@NQmgJa.....,       
//                                 ....gH@@@@HHB""""7"YYYYHMMMMMMM@@@@@@@Hma,.   
//                            ...JH@@MMHY"!                        ? __""YH@@@@N&...     
//                        ..JH@@HY"~                                          _TW@@@Mme.    
//                     .Jg@@#"=                                                   _TTM@@N..     
//                  .Jg@@MY!                                                          ?T@@@h,.   
//                .-@@@B!                                                                (TM@@@L     
//              .(H@MY                                                                      ?W@@@+    
//             .W@@@                                                                          .T@@@[       
//           .d@@M!                                                                             .T@@N,   
//          .d@M@'                                                                                -W@@o. 
//         (@@M\                                                                                    ?M@N,
//        -d@M%                    ..,                                      ..,                      j@@b  
//       d@@M=                     TM9                                      ?MD                       W@@[ 
//      .H@M:                                                                                         .W@H,
//      H@Ht                                                                                           ,@@#   
//     (@@M~                                                                                           .@@h.
//    .@@M%                        ..gmHHJ.                             .JdHga.                        .H@@e  
//    j@@#_                       .@@@@@@@b                            J@@@@@@@h.                      .H@@\ 
//    d@@@                       .4@@@@@@MF                            (@@@@@@@@                        H@@b  
//    d@@[                         ?"BMY"=            .d@@@@H,          ?TWHHY"!                        d@@e    
//    J@@b          .JJJ-..,                         ,@@@@@@M%                       .........         -@@@M. 
//    ?@@M\         ?YHHM@@@@b                ..      .W@@HP                        X@@HMWY"=          d@@@#
//    ,@@@L.                                 ?H@Ng&+gd@@#H@@NHaJ+gH@[                                  J@@@] 
//     X@@@[            ......                 ?"YYYYY""   ?"YHHHB"^                 .....            (@@@#   
//      WH@N+.      .W@@@@MHB=                                                      .TWH@M@Hmc       .H@@M~    
//     .H@@@@N,      _!~                                                                            .d@@@N,   
//   .J@@#T@@@N,                                                                                  .d@@@@@@@b. 
//  (@@@@! .T@@@n,                                                                              .(H@@@H>.W@@@x  
// (@@@F      4@@@@MaJ.                                                                       .d@@@@Y77   4@@@r 
//.H@@P         ?TM@@@@N...                                                               .-JH@HMY=        d@@N,
//(@@@F             ?"WM@@@MQa-,.                                                  .(J(JN@@M#"             Z@@@L
// d@@H,                 (M@@@@@@@Ng&maJ....                           .. ...J.J+W@@@@@@HY!               .dH@b 
// ?M@@@N&.        ..(JW@@@MM"?7""TYHMH@@HH@@@@@HHHgkHagHa(mggdmmagH@H@@Q@@HMMMHY"7!TMM@@@HaJ,.        ..H@@@M^ 
//   ?"W@@@@MN@@@@@H@@MMY"                  _???!"= ?WMMBYYTMH=7""Y@""?"~^             _"YM@@@@@@@@MH@@@@@#"^ 
//       ?77WMMMYB""!                                                                        _7"WWMMMY"7=     

// need
#include <iostream>
#include <algorithm>
// data structure
#include <bitset>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <cstring>
#include <utility>
#include <vector>
#include <complex>
//#include <deque>
#include <valarray>
#include <unordered_map>
#include <unordered_set>
#include <array>
#include <ranges>
// etc
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <chrono>
#include <random>
#include <numeric>
#include <fstream>

#if 0
std::ifstream ifs("AHC050/in/0000.txt");
auto & scan_in = ifs;
#else
auto & scan_in = std::cin;
#endif
auto & scan_out = std::cout;

// input
#define INIT std::ios::sync_with_stdio(false);std::cin.tie(0);
#define VAR(type, ...)type __VA_ARGS__;MACRO_VAR_Scan(__VA_ARGS__);
template<typename T> void MACRO_VAR_Scan(T & t) { scan_in >> t; }
template<typename First, typename...Rest>void MACRO_VAR_Scan(First & first, Rest& ...rest) { scan_in >> first; MACRO_VAR_Scan(rest...); }
#define VEC_ROW(type, n, ...)std::vector<type> __VA_ARGS__;MACRO_VEC_ROW_Init(n, __VA_ARGS__); for(int w_=0; w_<n; ++w_){MACRO_VEC_ROW_Scan(w_, __VA_ARGS__);}
template<typename T> void MACRO_VEC_ROW_Init(int n, T & t) { t.resize(n); }
template<typename First, typename...Rest>void MACRO_VEC_ROW_Init(int n, First & first, Rest& ...rest) { first.resize(n); MACRO_VEC_ROW_Init(n, rest...); }
template<typename T> void MACRO_VEC_ROW_Scan(int p, T & t) { scan_in >> t[p]; }
template<typename First, typename...Rest>void MACRO_VEC_ROW_Scan(int p, First & first, Rest& ...rest) { scan_in >> first[p]; MACRO_VEC_ROW_Scan(p, rest...); }
#define VEC(type, c, n) std::vector<type> c(n);for(auto& i:c)scan_in>>i;
#define MAT(type, c, m, n) std::vector<std::vector<type>> c(m, std::vector<type>(n));for(auto& R:c)for(auto& w:R)scan_in>>w;
// output
template<typename T>void MACRO_OUT(const T t) { scan_out << t; }
template<typename First, typename...Rest>void MACRO_OUT(const First first, const Rest...rest) { scan_out << first << ' '; MACRO_OUT(rest...); }
#define OUT(...) MACRO_OUT(__VA_ARGS__);
#define FOUT(n, dist) scan_out<<std::fixed<<std::setprecision(n)<<(dist);
#define SOUT(n, c, dist) scan_out<<std::setw(n)<<std::setfill(c)<<(dist);
#define VOUT(v) {auto tv_(v); for(size_t w_ = 0; w_ < tv_.size(); ++w_) {OUT(tv_[w_]);if(w_+1<tv_.size()){SP}}}
#define EOUT(...) do{ OUT(__VA_ARGS__); BR; exit(0); }while(0)
#define SP scan_out<<' ';
#define TAB scan_out<<'\t';
#define BR scan_out<<'\n';
#define SPBR(w, n) scan_out<<(w + 1 == n ? '\n' : ' ');
#define ENDL scan_out<<std::endl;
#define FLUSH scan_out<<std::flush;
#define SHOW(dist) {std::cerr << #dist << "\t: " << (dist) << '\n';}
// utility
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define FOR(w, a, n) for(int w=(a);w<(n);++w)
#define REP(w, n) FOR(w, 0, n)
#define RFOR(w, a, n) for(int w=(n)-1;w>=(a);--w)
#define RREP(w, n) RFOR(w, 0, n)
#define FORC(w, a, n) for(char w=(a);w<(n);++w)
#define REPC(w, n) FORC(w, 0, n)
template<class S, class T, class U> bool IN(S a, T x, U b) { return a <= x && x < b; }
template<class T> inline bool CHMAX(T & a, const T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool CHMIN(T & a, const T b) { if (a > b) { a = b; return true; } return false; }
// test
template<class T> using V = std::vector<T>;
template<class T> using VV = V<V<T>>;
//
//std::ostream& operator<<(std::ostream& os, const __int128& t) {
//	if (t >= 1000000000000000000) {
//		os << (long long)(t / 1000000000000000000) << (long long)(t % 1000000000000000000);
//	}
//	else {
//		os << (long long)t;
//	}
//	return os;
//}
template<typename S, typename T>
std::ostream & operator<<(std::ostream & os, const std::pair<S, T> & p) {
	os << '(' << p.first << ',' << p.second << ')';
	return os;
}
template<typename T>
std::ostream & operator<<(std::ostream & os, const std::vector<T> & v) {
	os << '{';
	for (size_t i = 0; i < v.size(); ++i) {
		os << v[i];
		if (i + 1 < v.size()) os << ',';
	}
	os << '}';
	return os;
}
template<typename T>
std::ostream & operator<<(std::ostream & os, const std::set<T> & v) {
	os << '{';
	for (auto it = v.cbegin(); it != v.cend();) {
		os << *it << (++it == v.cend() ? '}' : ',');
	}
	return os;
}
template<typename S, typename T>
std::ostream & operator<<(std::ostream & os, const std::map<S, T> & m) {
	os << '{';
	for (auto it = m.cbegin(); it != m.cend();) { os << it->first << ':' << it->second; ++it; os << (it != m.cend() ? ',' : '}'); }
	return os;
}
template<typename T>
std::ostream & operator<<(std::ostream & os, std::queue<T> q) {
	os << '<';
	while (!q.empty()) { os << q.front(); q.pop(); os << (q.empty() ? '<' : ','); }
	return os;
}
template<typename T>
std::ostream & operator<<(std::ostream & os, std::stack<T> q) {
	os << '>';
	while (!q.empty()) { os << q.top(); q.pop(); os << (q.empty() ? ']' : ','); }
	return os;
}
namespace std {
	template<typename S, typename T> class numeric_limits<pair<S, T>> {
	public:
		static constexpr pair<S, T> max() noexcept { return { numeric_limits<S>::max(), numeric_limits<T>::max() }; }
		static constexpr pair<S, T> lowest() noexcept { return { numeric_limits<S>::lowest(), numeric_limits<T>::lowest() }; }
	};
}

// type/const
using i64 = long long;
using u64 = unsigned long long;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
//using PAIR = std::pair<int, int>;
using PAIR = std::pair<i64, i64>;
constexpr int INFINT = (1 << 30) - 1;                    // 1.07x10^ 9
constexpr int INFINT_LIM = (1LL << 31) - 1;              // 2.15x10^ 9
constexpr long long INFLL = 1LL << 60;                          // 1.15x10^18
constexpr long long INFLL_LIM = (1LL << 62) - 1 + (1LL << 62);  // 9.22x10^18
constexpr ld EPS = 1e-6;
constexpr int MOD = 998244353;
constexpr long double PI = 3.141592653589793238462643383279;
template<class T, size_t N> void FILL(T(&a)[N], const T & val) { for (auto & x : a) x = val; }
template<class ARY, size_t N, size_t M, class T> void FILL(ARY(&a)[N][M], const T & val) { for (auto & b : a) FILL(b, val); }
template<class T> void FILL(std::vector<T> & a, const T & val) { for (auto & x : a) x = val; }
template<class ARY, class T> void FILL(std::vector<std::vector<ARY>> & a, const T & val) { for (auto & b : a) FILL(b, val); }
// ------------>8------------------------>8------------

i64 dp[10004][1003];

signed main() {
	INIT;

	VAR(i64, n);
	VEC_ROW(i64, n, p, a, b);
	VAR(i64, Q);
	VEC(i64, x, Q);

	REP(i, 1003) dp[n][i] = i;
	RREP(i, n) {
		REP(j, 1003) {
			if (p[i] >= j) {
				dp[i][j] = dp[i + 1][j + a[i]];
			}
			else {
				dp[i][j] = dp[i + 1][std::max(0ll, j - b[i])];
			}
		}
	}

	V<i64> c(n + 1, 0);
	REP(i, n) c[i + 1] = c[i] + b[i];

	REP(i, Q) {
		if (x[i] < 1003) {
			OUT(dp[0][x[i]])BR;
		}
		else {
			if (x[i] - c[n] >= 1003) {
				OUT(x[i] - c[n])BR;
			}
			else {
				i64 ok = n, ng = 0;
				while (ok - ng > 1) {
					i64 me = (ok + ng) / 2;
					if (x[i] - c[me] >= 1003) ng = me;
					else ok = me;
				}
				OUT(dp[ok][x[i] - c[ok]])BR;
			}
		}
	}

	return 0;
}

Submission Info

Submission Time
Task D - Takahashi's Expectation
User satanic0258
Language C++ 23 (gcc 12.2)
Score 425
Code Size 11338 Byte
Status AC
Exec Time 86 ms
Memory 88200 KiB

Compile Error

Main.cpp:26:1: warning: multi-line comment [-Wcomment]
   26 | //    j@@#_                       .@@@@@@@b                            J@@@@@@@h.                      .H@@\
      | ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 425 / 425
Status
AC × 3
AC × 30
Set Name Test Cases
Sample 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt
All 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt, 01_random_03.txt, 01_random_04.txt, 01_random_05.txt, 01_random_06.txt, 01_random_07.txt, 01_random_08.txt, 01_random_09.txt, 01_random_10.txt, 01_random_11.txt, 01_random_12.txt, 01_random_13.txt, 01_random_14.txt, 01_random_15.txt, 01_random_16.txt, 01_random_17.txt, 01_random_18.txt, 01_random_19.txt, 01_random_20.txt, 01_random_21.txt, 01_random_22.txt, 01_random_23.txt, 01_random_24.txt, 01_random_25.txt, 01_random_26.txt, 01_random_27.txt, 01_random_28.txt, 01_random_29.txt
Case Name Status Exec Time Memory
00_sample_00.txt AC 1 ms 3436 KiB
00_sample_01.txt AC 1 ms 3528 KiB
00_sample_02.txt AC 1 ms 3568 KiB
01_random_03.txt AC 85 ms 88080 KiB
01_random_04.txt AC 86 ms 88176 KiB
01_random_05.txt AC 86 ms 88092 KiB
01_random_06.txt AC 86 ms 88116 KiB
01_random_07.txt AC 86 ms 88100 KiB
01_random_08.txt AC 85 ms 88076 KiB
01_random_09.txt AC 86 ms 88072 KiB
01_random_10.txt AC 86 ms 88076 KiB
01_random_11.txt AC 86 ms 88200 KiB
01_random_12.txt AC 85 ms 88100 KiB
01_random_13.txt AC 86 ms 88076 KiB
01_random_14.txt AC 85 ms 88156 KiB
01_random_15.txt AC 85 ms 88072 KiB
01_random_16.txt AC 30 ms 33988 KiB
01_random_17.txt AC 21 ms 5992 KiB
01_random_18.txt AC 74 ms 69388 KiB
01_random_19.txt AC 21 ms 26464 KiB
01_random_20.txt AC 35 ms 50960 KiB
01_random_21.txt AC 62 ms 42712 KiB
01_random_22.txt AC 50 ms 11248 KiB
01_random_23.txt AC 30 ms 10708 KiB
01_random_24.txt AC 84 ms 88088 KiB
01_random_25.txt AC 86 ms 88084 KiB
01_random_26.txt AC 85 ms 88088 KiB
01_random_27.txt AC 86 ms 88168 KiB
01_random_28.txt AC 86 ms 88084 KiB
01_random_29.txt AC 85 ms 88084 KiB