結果
| 問題 | No.232 めぐるはめぐる (2) |
| ユーザー |
 heno239
|
| 提出日時 | 2020-08-18 20:40:52 |
| 言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 4,963 bytes |
| コンパイル時間 | 1,206 ms |
| コンパイル使用メモリ | 118,672 KB |
| 実行使用メモリ | 69,064 KB |
| 最終ジャッジ日時 | 2024-10-12 03:12:44 |
| 合計ジャッジ時間 | 3,807 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge4 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 18 WA * 4 |
ソースコード
#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 longtypedef long long ll;typedef unsigned long long ul;typedef unsigned int ui;constexpr ll mod = 998244353;const ll INF = mod * mod/300;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 double ld;typedef pair<ld, ld> LDP;const ld eps = 1e-12;const ld pi = acos(-1.0);ll mod_pow(ll x, ll n, ll m) {ll res = 1;while (n) {if (n & 1)res = res * x % m;x = x * x % 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, 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)); }const int max_n = 1 << 22;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];}ll gcd(ll a, ll b) {if (a < b)swap(a, b);while (b) {ll r = a % b; a = b; b = r;}return a;}struct SegT {private:int n; vector<P> node;vector<int> lazy;const P init_c = { 0,0 };public:SegT(int sz) {n = 1;while (n < sz)n <<= 1;node.resize(2 * n - 1, init_c);lazy.resize(2 * n - 1, 0);}P f(P a, P b) {return { a.first + b.first,a.second + b.second };}void eval(int k, int l, int r) {if (lazy[k] == 0)return;if (lazy[k]==1) {node[k] = { r - l,0 };}else {node[k] = { 0,r - l };}if (r - l > 1) {lazy[2 * k + 1] = lazy[k];lazy[2 * k + 2] = lazy[k];}lazy[k] = 0;}void add(ll x, int a, int b, int k = 0, int l = 0, int r = -1) {if (r < 0)r = n;eval(k, l, r);if (r <= a || b <= l)return;if (a <= l && r <= b) {lazy[k] += x; eval(k, l, r);}else {add(x, a, b, k * 2 + 1, l, (l + r) / 2);add(x, a, b, k * 2 + 2, (l + r) / 2, r);node[k] = f(node[k * 2 + 1], node[k * 2 + 2]);}}P query(int a, int b, int k = 0, int l = 0, int r = -1) {if (r < 0)r = n;eval(k, l, r);if (r <= a || b <= l)return init_c;if (a <= l && r <= b)return node[k];else {P vl = query(a, b, k * 2 + 1, l, (l + r) / 2);P vr = query(a, b, k * 2 + 2, (l + r) / 2, r);return f(vl, vr);}}};void solve() {int t, a, b; cin >> t >> a >> b;if (a == 0 && b == 0) {if (t == 1) {cout << "NO\n";}cout << "YES\n";if (t % 2 == 0) {rep(i, t / 2) {cout << ">\n";cout << "<\n";}}else {cout << ">\n";cout << "^\n";cout << "<v\n";rep(i, (t - 3) / 2) {cout << ">\n";cout << "<\n";}}}int mi = max(a, b);if (t < mi) {cout << "NO\n"; return;}cout << "YES\n";int cx = 0, cy = 0;if ((t - mi) % 2) {if (a < b) {cout << "^\n";cx++;}else {cout << ">\n";cy++;}}while (cx != a || cy != b) {string res;if (cx < a) {res.push_back('^'); cx++;}else if (cx > a) {res.push_back('v'); cx--;}if (cy < b) {res.push_back('>'); cy++;}else if (cy > b) {res.push_back('<'); cy--;}cout << res << "\n";}rep(i, (t - mi) / 2) {cout << ">\n";cout << "<\n";}}signed main() {ios::sync_with_stdio(false);cin.tie(0);//cout << fixed << setprecision(10);//init_f();//expr();//int t; cin >> t; rep(i, t)//while (cin >> n >> m>>s1>>s2>>t, n)solve();return 0;}