#856126 (C++17) No.655 E869120 and Good Triangles

提出ソース

結果

問題	No.655 E869120 and Good Triangles
ユーザー	heno239
提出日時	2023-04-02 19:57:42
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	6,996 bytes
コンパイル時間	2,062 ms
コンパイル使用メモリ	159,016 KB
実行使用メモリ	167,172 KB
最終ジャッジ日時	2024-09-25 00:37:34
合計ジャッジ時間	12,363 ms
ジャッジサーバーID （参考情報）	judge5 / judge1

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	8 ms 14,360 KB
testcase_01	AC	8 ms 14,356 KB
testcase_02	AC	7 ms 13,996 KB
testcase_03	AC	7 ms 14,556 KB
testcase_04	AC	7 ms 14,140 KB
testcase_05	AC	7 ms 13,984 KB
testcase_06	AC	7 ms 14,236 KB
testcase_07	AC	8 ms 15,668 KB
testcase_08	AC	8 ms 14,260 KB
testcase_09	AC	7 ms 14,032 KB
testcase_10	AC	514 ms 166,660 KB
testcase_11	AC	485 ms 167,128 KB
testcase_12	AC	504 ms 166,828 KB
testcase_13	AC	481 ms 167,000 KB
testcase_14	AC	470 ms 167,108 KB
testcase_15	AC	520 ms 166,580 KB
testcase_16	AC	514 ms 167,088 KB
testcase_17	AC	525 ms 167,052 KB
testcase_18	AC	515 ms 167,100 KB
testcase_19	AC	511 ms 167,172 KB
testcase_20	AC	489 ms 167,056 KB
testcase_21	AC	491 ms 166,992 KB
testcase_22	AC	465 ms 167,120 KB
testcase_23	AC	489 ms 167,168 KB
testcase_24	WA	-
testcase_25	AC	341 ms 165,120 KB
testcase_26	AC	340 ms 165,060 KB
testcase_27	WA	-
testcase_28	AC	324 ms 165,092 KB
testcase_29	WA	-
testcase_30	AC	8 ms 14,808 KB
testcase_31	AC	8 ms 15,324 KB
testcase_32	AC	8 ms 15,312 KB

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

ソースコード

raw source code

#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#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<unordered_set>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
#include<chrono>
using namespace std;

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

typedef unsigned long long ul;
typedef unsigned int ui;
//ll mod = 1;
//constexpr ll mod = 998244353;
constexpr ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;

#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;

template<typename T>
void chmin(T& a, T b) {
	a = min(a, b);
}
template<typename T>
void chmax(T& a, T b) {
	a = max(a, b);
}
template<typename T>
vector<T> vmerge(vector<T>& a, vector<T>& b) {
	vector<T> res;
	int ida = 0, idb = 0;
	while (ida < a.size() || idb < b.size()) {
		if (idb == b.size()) {
			res.push_back(a[ida]); ida++;
		}
		else if (ida == a.size()) {
			res.push_back(b[idb]); idb++;
		}
		else {
			if (a[ida] < b[idb]) {
				res.push_back(a[ida]); ida++;
			}
			else {
				res.push_back(b[idb]); idb++;
			}
		}
	}
	return res;
}
template<typename T>
void cinarray(vector<T>& v) {
	rep(i, v.size())cin >> v[i];
}
template<typename T>
void coutarray(vector<T>& v) {
	rep(i, v.size()) {
		if (i > 0)cout << " "; cout << v[i];
	}
	cout << "\n";
}
ll mod_pow(ll x, ll n, ll m = mod) {
	if (n < 0) {
		ll res = mod_pow(x, -n, m);
		return mod_pow(res, m - 2, m);
	}
	if (abs(x) >= m)x %= m;
	if (x < 0)x += m;
	//if (x == 0)return 0;
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; n >>= 1;
	}
	return res;
}
//mod should be <2^31
struct modint {
	int n;
	modint() :n(0) { ; }
	modint(ll m) {
		if (m < 0 || mod <= m) {
			m %= mod; if (m < 0)m += mod;
		}
		n = m;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.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 -= (int)mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += (int)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, ll 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)); }
modint operator/=(modint& a, modint b) { a = a / b; return a; }
const int max_n = 1 << 20;
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];
}
modint combP(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[a - b];
}

ll gcd(ll a, ll b) {
	a = abs(a); b = abs(b);
	if (a < b)swap(a, b);
	while (b) {
		ll r = a % b; a = b; b = r;
	}
	return a;
}
using ld = long double;
//typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-10;
const ld pi = acosl(-1.0);
template<typename T>
void addv(vector<T>& v, int loc, T val) {
	if (loc >= v.size())v.resize(loc + 1, 0);
	v[loc] += val;
}
/*const int mn = 2000005;
bool isp[mn];
vector<int> ps;
void init() {
	fill(isp + 2, isp + mn, true);
	for (int i = 2; i < mn; i++) {
		if (!isp[i])continue;
		ps.push_back(i);
		for (int j = 2 * i; j < mn; j += i) {
			isp[j] = false;
		}
	}
}*/

//[,val)
template<typename T>
auto prev_itr(set<T>& st, T val) {
	auto res = st.lower_bound(val);
	if (res == st.begin())return st.end();
	res--; return res;
}

//[val,)
template<typename T>
auto next_itr(set<T>& st, T val) {
	auto res = st.lower_bound(val);
	return res;
}
using mP = pair<modint, modint>;
mP operator+(mP a, mP b) {
	return { a.first + b.first,a.second + b.second };
}
mP operator+=(mP& a, mP b) {
	a = a + b; return a;
}
mP operator-(mP a, mP b) {
	return { a.first - b.first,a.second - b.second };
}
mP operator-=(mP& a, mP b) {
	a = a - b; return a;
}
LP operator+(LP a, LP b) {
	return { a.first + b.first,a.second + b.second };
}
LP operator+=(LP& a, LP b) {
	a = a + b; return a;
}
LP operator-(LP a, LP b) {
	return { a.first - b.first,a.second - b.second };
}
LP operator-=(LP& a, LP b) {
	a = a - b; return a;
}

mt19937 mt(time(0));

const string drul = "DRUL";
string senw = "SENW";
//DRUL,or SENW
//int dx[4] = { 1,0,-1,0 };
//int dy[4] = { 0,1,0,-1 };

//-----------------------------------------

int dx[6] = { -1,-1,0,0,1,1 };
int dy[6] = { -1,0,-1,1,0,1 };
int d[4005][4005];
int c1[4005][4005];
int c2[4005][4005];

void solve() {
	int n, k; ll p; cin >> n >> k >> p;
	rep(i, n)rep(j, i + 1) {
		d[i][j] = mod;
	}
	queue<P> q;
	rep(i, k) {
		int x, y; cin >> x >> y; x--; y--;
		d[x][y] = 0;
		q.push({ x,y });
	}
	while (!q.empty()) {
		P p = q.front(); q.pop();
		int a = p.first, b = p.second;
		int nd = d[a][b] + 1;
		rep(dir, 6) {
			int na = a + dx[dir];
			int nb = b + dy[dir];
			if (na >= 0 && nb >= 0 && na < n && nb <= na) {
				if (nd < d[na][nb]) {
					d[na][nb] = nd;
					q.push({ na,nb });
				}
			}
		}
	}
	/*rep(i, n) {
		rep(j, i + 1) {
			cout << d[i][j] << " ";
		}cout << "\n";
	}*/
	per(i, n) {
		per(j, i + 1) {
			c1[i][j] = d[i][j] + c1[i][j + 1] + c1[i + 1][j] - c1[i + 1][j + 1];
			c2[i][j] = d[i][j] + c2[i + 1][j] + c2[i + 1][j + 1] - c2[i + 2][j + 1];
		}
	}
	auto calc = [&](int i, int j, int len) {
		int res = 0;
		res += c2[i][j];
		res -= c2[i + len][j + len];
		res -= c1[i + len][j] - c1[i + len][j + len];
		return res;
	};
	//cout << calc(0, 0, 3) << "\n";
	vector<int> cur(n + 1, 0);
	ll ans = 0;
	per(i, n) {
		vector<int> nex(i+1);
		rep(j, i + 1) {
			nex[j] = min(cur[j], cur[j + 1]) + 1;
			while (nex[j]>0&&calc(i, j, nex[j]) >= p)nex[j]--;
		}
		swap(cur, nex);
		rep(j, i + 1) {
			ans += n - i - cur[j];
		}
	}
	cout << ans << "\n";
}



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

yukicoder

結果

テストケース

ソースコード