#126736 (C++11) No.438 Cwwプログラミング入門

提出ソース

結果

問題	No.438 Cwwプログラミング入門
ユーザー	__math
提出日時	2016-10-28 23:06:34
言語	C++11 (gcc 11.4.0)
結果	WA
実行時間	-
コード長	6,288 bytes
コンパイル時間	2,725 ms
コンパイル使用メモリ	174,444 KB
実行使用メモリ	6,948 KB
最終ジャッジ日時	2024-05-03 16:17:40
合計ジャッジ時間	6,845 ms
ジャッジサーバーID （参考情報）	judge2 / judge1

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	1 ms 6,816 KB
testcase_01	AC	1 ms 6,940 KB
testcase_02	AC	1 ms 6,944 KB
testcase_03	AC	1 ms 6,944 KB
testcase_04	AC	1 ms 6,940 KB
testcase_05	AC	2 ms 6,944 KB
testcase_06	AC	2 ms 6,940 KB
testcase_07	AC	2 ms 6,944 KB
testcase_08	AC	2 ms 6,944 KB
testcase_09	WA	-
testcase_10	AC	1 ms 6,940 KB
testcase_11	AC	1 ms 6,944 KB
testcase_12	AC	2 ms 6,944 KB
testcase_13	AC	1 ms 6,944 KB
testcase_14	AC	2 ms 6,940 KB
testcase_15	AC	1 ms 6,944 KB
testcase_16	AC	1 ms 6,944 KB
testcase_17	WA	-
testcase_18	AC	1 ms 6,940 KB
testcase_19	AC	1 ms 6,944 KB
testcase_20	AC	2 ms 6,944 KB
testcase_21	WA	-
testcase_22	AC	2 ms 6,940 KB
testcase_23	AC	1 ms 6,944 KB
testcase_24	AC	2 ms 6,940 KB
testcase_25	WA	-
testcase_26	WA	-
testcase_27	AC	2 ms 6,940 KB
testcase_28	AC	1 ms 6,944 KB
testcase_29	AC	2 ms 6,944 KB
testcase_30	AC	2 ms 6,940 KB
testcase_31	AC	1 ms 6,940 KB
testcase_32	AC	1 ms 6,944 KB
testcase_33	AC	1 ms 6,944 KB
testcase_34	AC	2 ms 6,940 KB
testcase_35	AC	1 ms 6,940 KB
testcase_36	AC	1 ms 6,944 KB
testcase_37	AC	2 ms 6,940 KB
testcase_38	AC	2 ms 6,944 KB
testcase_39	AC	2 ms 6,940 KB
testcase_40	AC	2 ms 6,940 KB
testcase_41	AC	1 ms 6,944 KB
testcase_42	AC	1 ms 6,940 KB
testcase_43	AC	2 ms 6,940 KB
testcase_44	AC	1 ms 6,944 KB
testcase_45	AC	2 ms 6,940 KB
testcase_46	AC	1 ms 6,944 KB
testcase_47	AC	2 ms 6,940 KB
testcase_48	AC	1 ms 6,940 KB
testcase_49	AC	2 ms 6,940 KB
testcase_50	AC	2 ms 6,944 KB
testcase_51	AC	1 ms 6,940 KB
testcase_52	AC	1 ms 6,940 KB
testcase_53	AC	2 ms 6,940 KB
testcase_54	AC	2 ms 6,944 KB
testcase_55	WA	-
testcase_56	WA	-
testcase_57	WA	-
testcase_58	AC	1 ms 6,944 KB
testcase_59	AC	1 ms 6,940 KB
testcase_60	WA	-
testcase_61	WA	-
testcase_62	AC	1 ms 6,944 KB
testcase_63	WA	-
testcase_64	WA	-
testcase_65	AC	1 ms 6,944 KB
testcase_66	AC	2 ms 6,940 KB
testcase_67	AC	2 ms 6,940 KB
testcase_68	AC	2 ms 6,944 KB
testcase_69	WA	-
testcase_70	WA	-
testcase_71	AC	1 ms 6,940 KB
testcase_72	AC	2 ms 6,944 KB
testcase_73	AC	1 ms 6,944 KB
testcase_74	WA	-
testcase_75	WA	-
testcase_76	AC	2 ms 6,940 KB
testcase_77	AC	1 ms 6,940 KB
testcase_78	AC	2 ms 6,944 KB
testcase_79	AC	2 ms 6,944 KB
testcase_80	AC	1 ms 6,940 KB
testcase_81	AC	2 ms 6,940 KB
testcase_82	AC	1 ms 6,940 KB
testcase_83	AC	1 ms 6,944 KB
testcase_84	AC	1 ms 6,940 KB
testcase_85	AC	2 ms 6,944 KB
testcase_86	AC	1 ms 6,940 KB
testcase_87	AC	1 ms 6,948 KB
testcase_88	AC	1 ms 6,944 KB
testcase_89	WA	-
testcase_90	AC	2 ms 6,940 KB
testcase_91	WA	-
testcase_92	AC	2 ms 6,940 KB
testcase_93	AC	1 ms 6,944 KB
testcase_94	AC	1 ms 6,940 KB
testcase_95	AC	2 ms 6,944 KB
testcase_96	AC	1 ms 6,940 KB
testcase_97	AC	1 ms 6,940 KB
testcase_98	AC	2 ms 6,940 KB
testcase_99	AC	1 ms 6,940 KB
testcase_100	AC	2 ms 6,944 KB

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

ソースコード

raw source code

#include <bits/stdc++.h>

using namespace std;
#define FOR(i,n) for(int i = 0; i < (n); i++)
#define sz(c) ((int)c.size())
#define ten(n) ((int)1e##n)
using ll = long long;

template<typename ...> static inline int getchar_unlocked(void) { return getchar(); }
template<typename ...> static inline void putchar_unlocked(int c) { putchar(c); }
#define mygc(c) (c)=getchar_unlocked()
#define mypc(c) putchar_unlocked(c)
void reader(int& x) { int k, m = 0; x = 0; for (;;) { mygc(k); if (k == '-') { m = 1; break; }if ('0' <= k&&k <= '9') { x = k - '0'; break; } }for (;;) { mygc(k); if (k<'0' || k>'9')break; x = x * 10 + k - '0'; }if (m) x = -x; }
void reader(ll& x) { int k, m = 0; x = 0; for (;;) { mygc(k); if (k == '-') { m = 1; break; }if ('0' <= k&&k <= '9') { x = k - '0'; break; } }for (;;) { mygc(k); if (k<'0' || k>'9')break; x = x * 10 + k - '0'; }if (m) x = -x; }
int reader(char c[]) { int i, s = 0; for (;;) { mygc(i); if (i != ' '&&i != '\n'&&i != '\r'&&i != '\t'&&i != EOF) break; }c[s++] = i; for (;;) { mygc(i); if (i == ' ' || i == '\n' || i == '\r' || i == '\t' || i == EOF) break; c[s++] = i; }c[s] = '\0'; return s; }
int reader(string& c) { int i; for (;;) { mygc(i); if (i != ' '&&i != '\n'&&i != '\r'&&i != '\t'&&i != EOF) break; }c.push_back(i); for (;;) { mygc(i); if (i == ' ' || i == '\n' || i == '\r' || i == '\t' || i == EOF) break; c.push_back(i); }; return sz(c); }
template <class T, class S> void reader(T& x, S& y) { reader(x); reader(y); }
template <class T, class S, class U> void reader(T& x, S& y, U& z) { reader(x); reader(y); reader(z); }
template <class T, class S, class U, class V> void reader(T& x, S& y, U& z, V & w) { reader(x); reader(y); reader(z); reader(w); }
void writer(int x, char c) { int s = 0, m = 0; char f[10]; if (x<0)m = 1, x = -x; while (x)f[s++] = x % 10, x /= 10; if (!s)f[s++] = 0; if (m)mypc('-'); while (s--)mypc(f[s] + '0'); mypc(c); }
void writer(ll x, char c) { int s = 0, m = 0; char f[20]; if (x<0)m = 1, x = -x; while (x)f[s++] = x % 10, x /= 10; if (!s)f[s++] = 0; if (m)mypc('-'); while (s--)mypc(f[s] + '0'); mypc(c); }
void writer(const char c[]) { int i; for (i = 0; c[i] != '\0'; i++)mypc(c[i]); }
void writer(const char x[], char c) { int i; for (i = 0; x[i] != '\0'; i++)mypc(x[i]); mypc(c); }
template<class T> void writerLn(T x) { writer(x, '\n'); }
template<class T, class S> void writerLn(T x, S y) { writer(x, ' '); writer(y, '\n'); }
template<class T, class S, class U> void writerLn(T x, S y, U z) { writer(x, ' '); writer(y, ' '); writer(z, '\n'); }
template<class T> void writerArr(T x[], int n) { if (!n) { mypc('\n'); return; }FOR(i, n - 1)writer(x[i], ' '); writer(x[n - 1], '\n'); }
template<class T> void writerArr(vector<T>& x) { writerArr(x.data(), (int)x.size()); }

template<class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template<class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
ll mod_pow(ll a, ll n, ll mod) {
	ll ret = 1;
	ll p = a % mod;
	while (n) {
		if (n & 1) ret = ret * p % mod;
		p = p * p % mod;
		n >>= 1;
	}
	return ret;
}
template<class T> T extgcd(T a, T b, T& x, T& y) { for (T u = y = 1, v = x = 0; a;) { T q = b / a; swap(x -= q * u, u); swap(y -= q * v, v); swap(b -= q * a, a); } return b; }
template<class T> T mod_inv(T a, T m) { T x, y; extgcd(a, m, x, y); return (m + x % m) % m; }

using Pii = pair<int, int>;
using Pll = pair<ll, ll>;

const int MOD = ten(9) + 7;

bool ver(string s, ll x,ll y,ll z) {
	stack<ll> st;
	for (auto c : s) {
		if (c == 'c') st.push(x);
		else if (c == 'w') st.push(y);
		else if (c == 'C') {
			ll v = st.top(); st.pop();
			ll u = st.top(); st.pop();
			st.push(v + u);
		} else {
			ll v = st.top(); st.pop();
			ll u = st.top(); st.pop();
			st.push(v - u);
		}
	}
	if (st.top() != z) {
		cout << "?";
	}

	return st.top() == z;
}

string solve(ll x, ll y, ll z) {
	if (x == z) return "c";
	if (y == z) return "w";
	if (z == 0) {
		return "ccW";
	}
	if (x == 0 && y == 0) {
		return "mourennaihasimasenn";
	}
	if (x == 0) {
		if(z % y != 0 || z / y >= 5000) return "mourennaihasimasenn";
		string ret;
		FOR(i, z/y) ret.push_back('w');
		FOR(i, z/y-1) ret.push_back('C');
		return ret;
	}
	if (y == 0) {
		if (z % x != 0 || z / x >= 5000) return "mourennaihasimasenn";
		string ret;
		FOR(i, z/x) ret.push_back('c');
		FOR(i, z/x - 1) ret.push_back('C');
		return ret;
	}
	ll g = gcd(x, y);
	if (z % g != 0) {
		return "mourennaihasimasenn";
	}
	x /= g; y /= g; z /= g;
	ll xx, yy; extgcd(x, y, xx, yy);
	xx *= z, yy *= z;
	vector<Pll> vp;
	if (xx < 0) {
		ll d1 = yy / x;
		ll yy1 = yy - d1 * x;
		ll xx1 = xx + d1 * y;
		ll d2 = (-xx) / y;
		ll yy2 = yy - d2 * x;
		ll xx2 = xx + d2 * y;
		vp.emplace_back(xx1, yy1);
		vp.emplace_back(xx2, yy2);
	} else {
		ll d1 = (-yy) / x;
		ll yy1 = yy - d1 * x;
		ll xx1 = xx + d1 * y;
		ll d2 = xx / y;
		ll yy2 = yy - d2 * x;
		ll xx2 = xx + d2 * y;
		vp.emplace_back(xx1, yy1);
		vp.emplace_back(xx2, yy2);
	}

	Pll ans;
	ll diff = ll(1e18);
	for (auto & xxyy : vp) {
		for (int dd = -1; dd <= 1; dd++) {
			ll xx, yy; tie(xx, yy) = xxyy;
			ll ux = xx + dd * y, uy = yy - dd * x;
			assert(x * ux + uy * y == z);
			if (diff > abs(ux) + abs(uy)) {
				diff = abs(ux) + abs(uy);
				ans = Pll(ux, uy);
			}
		}
	}

	ll use = diff + diff - 1;
	if (use > 10000) {
		return "mourennaihasimasenn";
	}

	string astr;
	if (ans.second < 0) {
		FOR(i, abs(ans.second)) astr.push_back('w');
		FOR(i, abs(ans.second) - 1) astr.push_back('C');
		FOR(i, abs(ans.first)) astr.push_back('c');
		FOR(i, abs(ans.first) - 1) astr.push_back('C');
		astr.push_back('W');
	} else {
		FOR(i, abs(ans.first)) astr.push_back('c');
		FOR(i, abs(ans.first) - 1) astr.push_back('C');
		FOR(i, abs(ans.second)) astr.push_back('w');
		FOR(i, abs(ans.second) - 1) astr.push_back('C');
		if (ans.first < 0) {
			astr.push_back('W');
		} else if (ans.first > 0 && ans.second != 0) {
			astr.push_back('C');
		}
	}
	if (sz(astr) > 10000) {
		return "mourennaihasimasenn";
	}
	return astr;
}

void test() {
	ll x =rand(), y = rand(), z = rand();
	FOR(x, 100) FOR(y, 100) FOR(z, 100) {
		string ans = solve(x, y, z);
		if (ans[0] != 'm') {
			ver(ans, x, y, z);
		}
	}
	puts("OK");
}

int main() {
	// test();
	ll x, y, z; reader(x, y, z);
	auto ans = solve(x, y, z);
	cout << ans << endl;
	return 0;
}

yukicoder

結果

テストケース

ソースコード