#308856 (C++14) No.771 しおり

提出ソース

結果

問題	No.771 しおり
ユーザー	naimonon77
提出日時	2019-01-07 12:55:06
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	4,106 bytes
コンパイル時間	1,717 ms
コンパイル使用メモリ	176,824 KB
実行使用メモリ	19,840 KB
最終ジャッジ日時	2024-05-03 03:32:15
合計ジャッジ時間	22,219 ms
ジャッジサーバーID （参考情報）	judge5 / judge3

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	1,620 ms 19,784 KB
testcase_01	WA	-
testcase_02	AC	7 ms 19,584 KB
testcase_03	AC	6 ms 19,776 KB
testcase_04	AC	6 ms 19,712 KB
testcase_05	AC	6 ms 19,752 KB
testcase_06	AC	6 ms 19,688 KB
testcase_07	AC	5 ms 19,688 KB
testcase_08	AC	7 ms 19,712 KB
testcase_09	AC	5 ms 19,712 KB
testcase_10	AC	5 ms 19,724 KB
testcase_11	AC	6 ms 19,584 KB
testcase_12	AC	5 ms 19,712 KB
testcase_13	AC	5 ms 19,712 KB
testcase_14	AC	10 ms 19,700 KB
testcase_15	AC	6 ms 19,752 KB
testcase_16	AC	6 ms 19,704 KB
testcase_17	AC	6 ms 19,840 KB
testcase_18	AC	5 ms 19,712 KB
testcase_19	AC	6 ms 19,664 KB
testcase_20	AC	5 ms 19,664 KB
testcase_21	AC	5 ms 19,712 KB
testcase_22	AC	6 ms 19,840 KB
testcase_23	AC	6 ms 19,712 KB
testcase_24	WA	-
testcase_25	AC	809 ms 19,604 KB
testcase_26	AC	30 ms 19,712 KB
testcase_27	AC	205 ms 19,700 KB
testcase_28	AC	419 ms 19,660 KB
testcase_29	AC	196 ms 19,696 KB
testcase_30	AC	1,667 ms 19,712 KB
testcase_31	AC	1,696 ms 19,692 KB
testcase_32	AC	51 ms 19,736 KB
testcase_33	AC	1,600 ms 19,712 KB
testcase_34	AC	1,607 ms 19,712 KB
testcase_35	AC	56 ms 19,712 KB
testcase_36	AC	18 ms 19,712 KB
testcase_37	AC	17 ms 19,712 KB
testcase_38	AC	49 ms 19,712 KB
testcase_39	AC	16 ms 19,712 KB
testcase_40	WA	-
testcase_41	WA	-
testcase_42	AC	1,634 ms 19,712 KB
testcase_43	AC	205 ms 19,712 KB
testcase_44	AC	1,618 ms 19,584 KB
testcase_45	AC	1,680 ms 19,776 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#define NOMINMAX
#define TEST_MODE true

#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES

#include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep2(i, a, b) for (int i = (a); i < (int)(b); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rrep2(i, a, b) for (int i = (a)-1; i >= (int)b; --i)
#define range(i, a, b, c) for (int i = a;             \
                                   c > 0 ? i < b : i > b; \
                                   i += c)
#define chmax(a, b) (a = (a) < (b) ? (b) : (a))
#define chmin(a, b) (a = (a) > (b) ? (b) : (a))
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define all(a) begin(a), end(a)
#define ifnot(a) if (not(a))
#define int long long

#ifdef LOCAL_ENV

#if TEST_MODE == true
const bool test = true;
#define dump(x) cerr << #x << " : " << (x) << " "
#define dumpl(x) dump(x) << endl
#else
const bool test = false;
#define dump(x) 
#define dumpl(x)
#endif

#else
const bool test = false;
#define dump(x) 
#define dumpl(x)
#endif

int dx[] = { 1, 0, -1, 0 };
int dy[] = { 0, 1, 0, -1 };
const int INF = (int)1 << 60;
const int undefined = INF;
const ll INFL = (ll)1 << 60;
ll mod_n = (int)1e9 + 7;
const double eps = 1e-10;
typedef long double Real;
// return -1, 0, 1
int sgn(const Real &r) { return (r > eps) - (r < -eps); }
int sgn(const Real &a, const Real &b) { return sgn(a - b); }

//.....................
const int MAX = (int)2e5 + 5;

vector<string> split(const string &str, char sep)
{
	vector<string> v;
	stringstream ss(str);
	string buffer;
	while (getline(ss, buffer, sep))
	{
		v.push_back(buffer);
	}
	return v;
}

string join(const vector<string>& v, const string delim = 0) {
	string s;
	if (!v.empty()) {
		s += v[0];
		for (decltype(v.size()) i = 1, c = v.size(); i < c; ++i) {
			if (delim != "") s += delim;
			s += v[i];
		}
	}
	return s;
}

string operator * (const string& s, const int& n) {
	string res = "";
	rep(i, n) res += s;
	return res;
}

template <class InputIterator>
int sum(InputIterator begin, InputIterator end)
{
	return accumulate(begin, end, 0ll);
}

template<typename T>
T gcd(T a, T b)
{
	T c;
	while (a != 0) {
		c = a; a = b % a;  b = c;
	}
	return b;
}

template<typename T>
T bit_count(T N) {
	T cnt = 0;
	while (N) {
		if (N & 1) cnt++;
		N >>= 1;
	}
	return cnt;
}

template<typename T>
void print_vec(ostream& ostream, vector<T> a) {
	rep(i, a.size() - 1) ostream << a[i] << " ";
	ostream << a.back() << endl;
}

ll pow_n(ll x, ll n) {
	ll res = 1;
	while (n > 0) {
		if (n & 1) res = res * x;
		x = x * x;
		n >>= 1;
	}
	return res;
}

class Solver {
public:
	int H, W;

	bool grid_ng(int y, int x) {
		return y < 0 || y >= H || x < 0 || x >= W;
	}

	struct Point {
		int x, y;
		bool operator < (const Point& r) const {
			if (y != r.y) return y < r.y;
			return x < r.x;
		}
	};

	double M;
	int N;

	int ask(int x, int y) {
		cout << x << " " << y << endl;
		int res; cin >> res;
		if (res == 0) exit(0);
		return res;
	}

	struct A {
		int dist, book_id;
	};

	int n;
	A dp[1 << 20];

	void solve() {
		cin >> n;
		vector<int> a(n + 1), b(n + 1);
		rep(i, n) cin >> a[i] >> b[i];
		a[n] = 0; b[n] = 0;
		rep(i, 1 << n) dp[i] = { INF, 0 };
		dp[0] = { 0, n };
		rep(loop, n) {
			rep(i, 1 << n) {
				rep(j, n) {
					int tmp = ((i >> j) & 1);
					if (tmp == 1) continue;
					int next = (i | (1 << j));
					int id = dp[i].book_id;
					int dist = max(dp[i].dist,
						b[id] - a[id] + a[j]);
					if (id == n) dist = 0;
					//if (i == 0) dumpl(next);
					//if (i == 0) dumpl(dist);
					if (dist < dp[next].dist) {
						dp[next].dist = dist;
						dp[next].book_id = j;
					}
				}
			}
		}
		rep(i, 1 << n) {
			cerr << bitset<3>(i) << " "<< 
				dp[i].dist << endl;
		}
		cout << dp[(1 << n) - 1].dist << endl;
 	}
};

signed main()
{
	srand((unsigned int)time(NULL));
	cout << fixed << setprecision(20);
	auto ptr = new Solver();
	ptr->solve();
	delete ptr;
	//while (true) {
	//	if (cin.eof() == true) break;
	//	auto ptr = new Solver();
	//	ptr->solve();
	//	delete ptr;
	//}
	return 0;
}

yukicoder

結果

テストケース

ソースコード