結果

問題 No.1515 Making Many Multiples
ユーザー leaf_1415leaf_1415
提出日時 2021-05-21 22:58:25
言語 C++11
(gcc 11.4.0)
結果
AC  
実行時間 1,178 ms / 2,000 ms
コード長 7,800 bytes
コンパイル時間 912 ms
コンパイル使用メモリ 96,276 KB
実行使用メモリ 99,432 KB
最終ジャッジ日時 2024-04-18 16:30:55
合計ジャッジ時間 18,035 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
6,816 KB
testcase_01 AC 2 ms
6,940 KB
testcase_02 AC 1,144 ms
99,296 KB
testcase_03 AC 1,129 ms
99,368 KB
testcase_04 AC 1,121 ms
98,780 KB
testcase_05 AC 1,178 ms
99,308 KB
testcase_06 AC 969 ms
99,308 KB
testcase_07 AC 1,013 ms
99,432 KB
testcase_08 AC 380 ms
33,512 KB
testcase_09 AC 618 ms
66,432 KB
testcase_10 AC 611 ms
67,976 KB
testcase_11 AC 970 ms
80,820 KB
testcase_12 AC 539 ms
59,208 KB
testcase_13 AC 15 ms
6,940 KB
testcase_14 AC 1,018 ms
87,056 KB
testcase_15 AC 16 ms
6,944 KB
testcase_16 AC 1,138 ms
96,432 KB
testcase_17 AC 215 ms
67,944 KB
testcase_18 AC 175 ms
78,796 KB
testcase_19 AC 58 ms
49,512 KB
testcase_20 AC 215 ms
48,268 KB
testcase_21 AC 760 ms
97,560 KB
testcase_22 AC 3 ms
6,940 KB
testcase_23 AC 801 ms
97,932 KB
testcase_24 AC 2 ms
6,940 KB
testcase_25 AC 2 ms
6,944 KB
testcase_26 AC 2 ms
6,940 KB
testcase_27 AC 1,125 ms
97,868 KB
testcase_28 AC 631 ms
98,488 KB
testcase_29 AC 32 ms
14,136 KB
testcase_30 AC 51 ms
12,832 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <iostream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <cassert>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <string>
#include <algorithm>
#include <utility>
#include <complex>
#define rep(x, s, t) for(llint (x) = (s); (x) <= (t); (x)++)
#define per(x, s, t) for(llint (x) = (s); (x) >= (t); (x)--)
#define reps(x, s) for(llint (x) = 0; (x) < (llint)(s).size(); (x)++)
#define chmin(x, y) (x) = min((x), (y))
#define chmax(x, y) (x) = max((x), (y))
#define sz(x) ((ll)(x).size())
#define ceil(x, y) (((x)+(y)-1) / (y))
#define all(x) (x).begin(),(x).end()
#define outl(...) dump_func(__VA_ARGS__)
#define inf 1e18

using namespace std;

typedef long long llint;
typedef long long ll;
typedef pair<ll, ll> P;

struct edge{
	ll to, cost;
	edge(){}
	edge(ll a, ll b){ to = a, cost = b;}
};
const ll dx[] = {1, 0, -1, 0}, dy[] = {0, -1, 0, 1};

//const ll mod = 1000000007;
const ll mod = 998244353;

struct mint{
	ll x = 0;
	mint(ll y = 0){x = y; if(x < 0 || x >= mod) x = (x%mod+mod)%mod;}
	mint(const mint &ope) {x = ope.x;}
	
	mint operator-(){return mint(-x);}
	mint operator+(const mint &ope){return mint(x) += ope;}
	mint operator-(const mint &ope){return mint(x) -= ope;}
	mint operator*(const mint &ope){return mint(x) *= ope;}
	mint operator/(const mint &ope){return mint(x) /= ope;}
	mint& operator+=(const mint &ope){
		x += ope.x;
		if(x >= mod) x -= mod;
		return *this;
	}
	mint& operator-=(const mint &ope){
		x += mod - ope.x;
		if(x >= mod) x -= mod;
		return *this;
	}
	mint& operator*=(const mint &ope){
		x *= ope.x, x %= mod;
		return *this;
	}
	mint& operator/=(const mint &ope){
		ll n = mod-2; mint mul = ope;
		while(n){
			if(n & 1) *this *= mul;
			mul *= mul;
			n >>= 1;
		}
		return *this;
	}
	mint inverse(){return mint(1) / *this;}
	bool operator ==(const mint &ope){return x == ope.x;}
	bool operator !=(const mint &ope){return x != ope.x;}
};
mint modpow(mint a, ll n){
	if(n == 0) return mint(1);
	if(n % 2) return a * modpow(a, n-1);
	else return modpow(a*a, n/2);
}
istream& operator >>(istream &is, mint &ope){
	ll t; is >> t, ope.x = t;
	return is;
}
ostream& operator <<(ostream &os, mint &ope){return os << ope.x;}
ostream& operator <<(ostream &os, const mint &ope){return os << ope.x;}

bool exceed(ll x, ll y, ll m){return x >= m / y + 1;}
void mark(){ cout << "*" << endl; }
void yes(){ cout << "YES" << endl; }
void no(){ cout << "NO" << endl; }
ll sgn(ll x){ if(x > 0) return 1; if(x < 0) return -1; return 0;}
ll gcd(ll a, ll b){if(b == 0) return a; return gcd(b, a%b);}
ll lcm(ll a, ll b){return a/gcd(a, b)*b;}
ll digitnum(ll x, ll b = 10){ll ret = 0; for(; x; x /= b) ret++; return ret;}
ll digitsum(ll x, ll b = 10){ll ret = 0; for(; x; x /= b) ret += x % b; return ret;}
string lltos(ll x){string ret; for(;x;x/=10) ret += x % 10 + '0'; reverse(ret.begin(), ret.end()); return ret;}
ll stoll(string &s){ll ret = 0; for(auto c : s) ret *= 10, ret += c - '0'; return ret;}
template<typename T>
void uniq(T &vec){ sort(vec.begin(), vec.end()); vec.erase(unique(vec.begin(), vec.end()), vec.end());}

template<typename T>
ostream& operator << (ostream& os, vector<T>& vec) {
	for(int i = 0; i < vec.size(); i++) os << vec[i] << (i + 1 == vec.size() ? "" : " ");
	return os;
}
template<typename T>
ostream& operator << (ostream& os, deque<T>& deq) {
	for(int i = 0; i < deq.size(); i++) os << deq[i] << (i + 1 == deq.size() ? "" : " ");
	return os;
}
template<typename T, typename U>
ostream& operator << (ostream& os, pair<T, U>& pair_var) {
	os << "(" << pair_var.first << ", " << pair_var.second << ")";
	return os;
}
template<typename T, typename U>
ostream& operator << (ostream& os, const pair<T, U>& pair_var) {
	os << "(" << pair_var.first << ", " << pair_var.second << ")";
	return os;
}
template<typename T, typename U>
ostream& operator << (ostream& os, map<T, U>& map_var) {
	for(typename map<T, U>::iterator itr = map_var.begin(); itr != map_var.end(); itr++) {
		os << "(" << itr->first << ", " << itr->second << ")";
		itr++; if(itr != map_var.end()) os << ","; itr--;
	}
	return os;
}
template<typename T>
ostream& operator << (ostream& os, set<T>& set_var) {
	for(typename set<T>::iterator itr = set_var.begin(); itr != set_var.end(); itr++) {
		os << *itr; ++itr; if(itr != set_var.end()) os << " "; itr--;
	}
	return os;
}
template<typename T>
ostream& operator << (ostream& os, multiset<T>& set_var) {
	for(typename multiset<T>::iterator itr = set_var.begin(); itr != set_var.end(); itr++) {
		os << *itr; ++itr; if(itr != set_var.end()) os << " "; itr--;
	}
	return os;
}
template<typename T>
void outa(T a[], ll s, ll t){
	for(ll i = s; i <= t; i++){ cout << a[i]; if(i < t) cout << " ";}
	cout << endl;
}
void dump_func() {cout << endl;}
template <class Head, class... Tail>
void dump_func(Head &&head, Tail &&... tail) {
	cout << head;
	if(sizeof...(Tail) > 0) cout << " ";
	dump_func(std::move(tail)...);
}



struct Matrix{
	typedef mint T;
	
	int h, w;
	vector<T> mat;
	Matrix(){h = w = 0;}
	Matrix(int h, int w){
		this->h = h, this->w = w;
		mat.resize(h*w);
	}
	
	T addope(T a, T b){ return a+b; } //加法作用素
	static T addIdent(){ return mint(0);} //加法単位元
	T mulope(T a, T b){ return a*b; } //乗法作用素
	static T mulIdent(){ return mint(1); } //乗法単位元
	
	T& at(int i, int j){ return mat[w*(i-1)+(j-1)];}
	static Matrix Ident(int size){
		Matrix ret(size, size);
		for(int i = 1; i <= size; i++){
			for(int j = 1; j <= size; j++){
				if(i == j) ret.at(i, j) = mulIdent();
				else ret.at(i, j) = addIdent();
			}
		}
		return ret;
	}
	Matrix operator+(Matrix& ope){
		Matrix ret(h, w);
		for(int i = 1; i <= h; i++){
			for(int j = 1; j <= w; j++){
				ret.at(i, j) = at(i, j) + ope.at(i, j);
			}
		}
		return ret;
	}
	Matrix operator*(Matrix& ope){
		Matrix ret(h, ope.w);
		for(int i = 1; i <= h; i++){
			for(int j = 1; j <= ope.w; j++){
				ret.at(i, j) = addIdent();
				for(int k = 1; k <= w; k++){
					ret.at(i, j) = addope(ret.at(i, j), mulope(at(i, k), ope.at(k, j)));
				}
			}
		}
		return ret;
	}
	Matrix pow(llint n){
		if(n == 0) return Ident(h);
		if(n % 2) return pow(n-1) * (*this);
		else{
			Matrix tmp = pow(n/2);
			return tmp * tmp;
		}
	}
};
ostream& operator << (ostream& os, Matrix& mat) {
	for(int i = 1; i <= mat.h; i++){
		for(int j = 1; j <= mat.w; j++) os << mat.mat[mat.w*(i-1)+(j-1)] << " "; cout << endl;
	}
	return os;
}
ostream& operator << (ostream& os, const Matrix& mat) {
	for(int i = 1; i <= mat.h; i++){
		for(int j = 1; j <= mat.w; j++) os << mat.mat[mat.w*(i-1)+(j-1)] << " "; cout << endl;
	}
	return os;
}

typedef pair<ll, P> Q;
ll n, k, x, y;
ll a[2005];
ll dp[2005][2005], maxx[2005], maxy[2005];
vector<P> svec[2005];

int main(void)
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> n >> k >> x >> y;
	rep(i, 1, n) cin >> a[i], a[i] %= k;
	rep(i, 0, k-1) rep(j, 0, k-1) svec[(i+j)%k].push_back(P(i, j));
	
	rep(i, 0, k-1) rep(j, 0, k-1) dp[i][j] = -inf;
	rep(i, 0, k-1) maxx[i] = maxy[i] = -inf;
	dp[x%k][y%k] = 0, maxx[x%k] = maxy[y%k] = 0;
	
	rep(i, 1, n){
		vector<Q> vec;
		ll x = (k - a[i])%k;
		for(auto p : svec[x]) vec.push_back(Q(dp[p.first][p.second]+1, p));
		rep(j, 0, k-1){
			vec.push_back(Q(maxx[j], P(j, a[i])));
			ll p = (k-(j+a[i])%k)%k;
			vec.push_back(Q(dp[j][p]+1, P(j, a[i])));
		}
		rep(j, 0, k-1){
			vec.push_back(Q(maxy[j], P(a[i], j)));
			ll p = (k-(j+a[i])%k)%k;
			vec.push_back(Q(dp[p][j]+1, P(a[i], j)));
		}
		for(auto t : vec){
			ll x = t.second.first, y = t.second.second;
			chmax(dp[x][y], t.first);
			chmax(maxx[x], dp[x][y]), chmax(maxy[y], dp[x][y]);
		}
	}
	
	ll ans = 0;
	rep(i, 0, k-1) rep(j, 0, k-1) chmax(ans, dp[i][j]);
	outl(ans);
	
	return 0;
}
0