#449840 (C++14) No.1008 Bench Craftsman

提出ソース

結果

問題	No.1008 Bench Craftsman
ユーザー	heno239
提出日時	2020-03-27 17:44:22
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	4,253 bytes
コンパイル時間	1,369 ms
コンパイル使用メモリ	122,880 KB
実行使用メモリ	8,096 KB
最終ジャッジ日時	2024-06-10 16:25:11
合計ジャッジ時間	12,777 ms
ジャッジサーバーID （参考情報）	judge2 / judge5

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 5,248 KB
testcase_01	AC	1 ms 5,376 KB
testcase_02	AC	1 ms 5,376 KB
testcase_03	AC	2 ms 5,376 KB
testcase_04	AC	2 ms 5,376 KB
testcase_05	WA	-
testcase_06	AC	190 ms 7,424 KB
testcase_07	AC	2 ms 5,376 KB
testcase_08	AC	7 ms 5,376 KB
testcase_09	AC	118 ms 5,376 KB
testcase_10	WA	-
testcase_11	WA	-
testcase_12	WA	-
testcase_13	WA	-
testcase_14	WA	-
testcase_15	AC	565 ms 7,968 KB
testcase_16	WA	-
testcase_17	AC	568 ms 8,092 KB
testcase_18	WA	-
testcase_19	WA	-
testcase_20	WA	-
testcase_21	WA	-
testcase_22	AC	422 ms 5,376 KB
testcase_23	WA	-
testcase_24	WA	-
testcase_25	WA	-
testcase_26	WA	-
testcase_27	AC	356 ms 5,376 KB
testcase_28	WA	-
testcase_29	WA	-

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

ソースコード

raw source code

#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 998244353;
const ll INF = mod * mod;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acos(-1.0);

ll mod_pow(ll a, ll n, ll m = mod) {
	ll res = 1;
	while (n) {
		if (n & 1)res = res * a%m;
		a = a * a%m; n >>= 1;
	}
	return res;
}

struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n%mod + mod) % mod;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint &a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint &a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint &a, modint b) { a.n = ((ll)a.n*b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, int n) {
	if (n == 0)return modint(1);
	modint res = (a*a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p%a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
const int max_n = 10000;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}

int dx[4] = { 0,1,0,-1 };
int dy[4] = { 1,0,-1,0 };

struct BIT {
private:
	vector<ll> node, node2; int n;
public:
	BIT(int n_) {
		n = n_; node.resize(n, 0); node2.resize(n, 0);
	}
	//0-indexed
	void add(int a, int b, ll w) {
		for (int i = a; i < n; i |= i + 1)node[i] += -a * w;
		for (int i = b; i < n; i |= i + 1)node[i] += b * w;
		for (int i = a; i < n; i |= i + 1)node2[i] += w;
		for (int i = b; i < n; i |= i + 1)node2[i] += -w;
	}
	ll sum(int a) {
		ll ret = 0;
		for (int i = a - 1; i >= 0; i = (i &(i + 1)) - 1)ret += node[i];
		for (int i = a - 1; i >= 0; i = (i &(i + 1)) - 1)ret += a * node2[i];
		return ret;
	}
	ll sum(int a, int b) {
		return sum(b) - sum(a);
	}
};

void solve() {
	int n, m; cin >> n >> m;
	vector<ll> a(n);
	rep(i, n)cin >> a[i];
	vector<int> x(m), w(m);
	rep(i, m) {
		cin >> x[i] >> w[i]; x[i]--;
	}
	int le = -1, ri = 100010;
	while (ri - le > 1) {
		int c = (le + ri) / 2;
		BIT b1(n);
		BIT b2(n);
		rep(i, m) {
			b1.add(x[i], x[i] + 1, w[i]);
			int d;
			if (c > 0)d = w[i] / c;
			else d = n;
			int l = x[i] - d;
			l = max(l, 0);
			b1.add(l, x[i], w[i]);
			b1.add(l, x[i], -x[i] * c);
			b2.add(l, x[i], c);
			int r = x[i] + d;
			r = min(r, n-1);
			b1.add(x[i] + 1, r + 1, w[i]);
			b1.add(x[i] + 1, r + 1, x[i] * c);
			b2.add(x[i] + 1, r + 1, -c);
		}
		bool valid = true;
		rep(i, n) {
			ll s = b1.sum(i, i + 1) + i * b2.sum(i, i + 1);
			if (s >= a[i]) {
				valid = false; break;
			}
		}
		if (valid)ri = c;
		else le = c;
	}
	if (ri == 100010)ri = -1;
	cout << ri << endl;
}


signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(7);
	//init_f();
	//init();
	//int t; cin >> t; rep(i, t)solve();
	solve();
	stop
		return 0;
}

yukicoder

結果

テストケース

ソースコード