結果
問題 | No.8069 Torn Documents |
ユーザー | ミドリムシ |
提出日時 | 2020-04-01 22:39:32 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 4,094 bytes |
コンパイル時間 | 1,799 ms |
コンパイル使用メモリ | 177,876 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-07-21 21:38:29 |
合計ジャッジ時間 | 3,334 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 5 ms
5,248 KB |
testcase_01 | AC | 3 ms
5,376 KB |
testcase_02 | AC | 2 ms
5,376 KB |
testcase_03 | AC | 2 ms
5,376 KB |
testcase_04 | AC | 2 ms
5,376 KB |
testcase_05 | AC | 2 ms
5,376 KB |
testcase_06 | AC | 1 ms
5,376 KB |
testcase_07 | AC | 2 ms
5,376 KB |
testcase_08 | AC | 2 ms
5,376 KB |
testcase_09 | AC | 2 ms
5,376 KB |
testcase_10 | AC | 2 ms
5,376 KB |
testcase_11 | AC | 3 ms
5,376 KB |
testcase_12 | AC | 2 ms
5,376 KB |
testcase_13 | AC | 2 ms
5,376 KB |
testcase_14 | AC | 2 ms
5,376 KB |
testcase_15 | AC | 2 ms
5,376 KB |
testcase_16 | AC | 2 ms
5,376 KB |
testcase_17 | AC | 2 ms
5,376 KB |
testcase_18 | WA | - |
testcase_19 | AC | 2 ms
5,376 KB |
testcase_20 | AC | 2 ms
5,376 KB |
testcase_21 | AC | 2 ms
5,376 KB |
testcase_22 | AC | 2 ms
5,376 KB |
testcase_23 | AC | 2 ms
5,376 KB |
testcase_24 | AC | 2 ms
5,376 KB |
testcase_25 | AC | 2 ms
5,376 KB |
testcase_26 | AC | 1 ms
5,376 KB |
testcase_27 | AC | 2 ms
5,376 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; using lint = long long; const lint mod = 998244353; #define all(x) (x).begin(), (x).end() #define bitcount(n) __builtin_popcountl((lint)(n)) #define fcout cout << fixed << setprecision(15) #define highest(x) (63 - __builtin_clzl(x)) template<class T> inline void YES(T condition){ if(condition) cout << "YES" << endl; else cout << "NO" << endl; } template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; } template<class T> inline void assert_NO(T condition){ if(!condition){ cout << "NO" << endl; exit(0); } } template<class T> inline void assert_No(T condition){ if(!condition){ cout << "No" << endl; exit(0); } } template<class T> inline void assert_minus_1(T condition){ if(!condition){ cout << -1 << endl; exit(0); } } lint power(lint base, lint exponent, lint module){ if(exponent % 2){ return power(base, exponent - 1, module) * base % module; }else if(exponent){ lint root_ans = power(base, exponent / 2, module); return root_ans * root_ans % module; }else{ return 1; }} struct position{ int y, x; }; position mv[4] = {{0, -1}, {1, 0}, {0, 1}, {-1, 0}}; // double euclidean(position first, position second){ return sqrt((second.x - first.x) * (second.x - first.x) + (second.y - first.y) * (second.y - first.y)); } template<class T, class U> string to_string(pair<T, U> x){ return to_string(x.first) + "," + to_string(x.second); } string to_string(string x){ return x; } template<class itr> void array_output(itr start, itr goal){ string ans; for(auto i = start; i != goal; i++) ans += to_string(*i) + " "; if(!ans.empty()) ans.pop_back(); cout << ans << endl; } template<class itr> void cins(itr first, itr last){ for(auto i = first; i != last; i++){ cin >> (*i); } } template<class T> T gcd_calc(T a, T b){ if(b){ return gcd_calc(b, a % b); }else{ return a; }} template<class T> T gcd(T a, T b){ if(a < b) swap(a, b); return gcd_calc(a, b); } template<class T> T lcm(T a, T b){ return a / gcd(a, b) * b; } struct combination{ vector<lint> fact, inv; combination(int sz) : fact(sz + 1), inv(sz + 1){ fact[0] = 1; for(int i = 1; i <= sz; i++){ fact[i] = fact[i - 1] * i % mod; } inv[sz] = power(fact[sz], mod - 2, mod); for(int i = sz - 1; i >= 0; i--){ inv[i] = inv[i + 1] * (i + 1) % mod; } } lint C(int p, int q) const{ if(q < 0 || p < q) return 0; return (fact[p] * inv[q] % mod * inv[p - q] % mod); } }; template<class itr> bool next_sequence(itr first, itr last, int max_bound){ itr now = last; while(now != first){ now--; (*now)++; if((*now) == max_bound){ (*now) = 0; }else{ return true; } } return false; } template<class T> bool chmax(T &a, const T &b){ if(a < b){ a = b; return 1; } return 0; } template<class T> bool chmin(T &a, const T &b){ if(b < a){ a = b; return 1; } return 0; } inline int at(int x, int k){ return (x >> k) & 1; } random_device rnd; #define rep(i, n) for(int i = 0; i < n; i++) int main(){ int A, B; cin >> A >> B; string S; cin >> S; string simple; rep(i, S.size() - 1){ if(S[i] == 'L' || S[i] == 'R'){ if(S[i + 1] == 'U' || S[i + 1] == 'D'){ simple.push_back(S[i]); } } if(S[i] == 'U' || S[i] == 'D'){ if(S[i + 1] == 'L' || S[i + 1] == 'R'){ simple.push_back(S[i]); } } } simple.push_back(S.back()); if(!count(all(simple), 'L') || !count(all(simple), 'U')){ cout << -1 << endl; return 0; } string last = simple.substr(simple.size() - 2, 2); if(last == "RD" || last == "DR"){ cout << -1 << endl; return 0; } set<pair<int, int>> ans; if(count(all(last), 'U')){ swap(A, B); } ans.insert({1, 0}); ans.insert({A, B - 1}); ans.insert({A, B + 1}); ans.insert({A + 1, B}); ans.insert({0, B + 2}); ans.insert({1, B + 1}); cout << ans.size() << endl; for(auto i: ans){ if(count(all(last), 'U')){ swap(i.first, i.second); } cout << i.first << " " << i.second << endl; } }