結果
問題 | No.197 手品 |
ユーザー |
![]() |
提出日時 | 2015-04-29 00:08:03 |
言語 | C++11 (gcc 13.3.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,550 bytes |
コンパイル時間 | 1,313 ms |
コンパイル使用メモリ | 162,436 KB |
実行使用メモリ | 6,948 KB |
最終ジャッジ日時 | 2024-06-27 07:38:31 |
合計ジャッジ時間 | 2,513 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 33 WA * 10 |
ソースコード
#include <bits/stdc++.h>using namespace std;typedef pair<int,int> PII;typedef long long LL;typedef unsigned long long ULL;template<class T> inline bool amax (T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; }template<class T> inline bool amin (T &a, const T &b) { if (a > b) { a = b; return 1; } return 0; }template<class T> ostream& operator << (ostream &os, const vector<T> &v) { os << "["; for (typename vector<T>::const_iterator it = v.begin(); it != v.end(); it++) { os << (it != v.begin() ? ", " : "") << *it; } os << "]"; return os; }template<class T> ostream& operator << (ostream &os, const set<T> &s) { os << "["; for (typename set<T>::const_iterator it = s.begin(); it != s.end();it++) { os << (it != s.begin() ? ", " : "") << *it; } os << "]"; return os; }template<class Key, class Val> ostream& operator << (ostream &os, const map<Key, Val> &m) { os << "{"; for (typename map<Key, Val>::const_iterator it= m.begin(); it != m.end(); it++) { os << (it != m.begin() ? ", " : "") << it->first << ":" << it->second; } os << "}"; return os; }template<class T, class S> ostream& operator << (ostream &os, const pair<T, S> &p) { os << "(" << p.first << ", " << p.second << ")"; return os; }template <class Target, class Source> inline Target lexical_cast (const Source &s) { Target t; stringstream ss; ss << s; ss >> t; return t; }//> v < ^ (clock wise)int dx[] = {1,0,-1,0};int dy[] = {0,1,0,-1};const int INFI = 1<<28;const long long int INFL = 1LL<<60;const double INFD = 1e+300;const float INFF = 1e+100;const double EPS = 1e-8;int main(){cout.setf(ios::fixed); cout.precision(10);ios_base::sync_with_stdio(false);string before, after;int N;cin >> before >> N >> after;string _before, _after;_before = before;_after = after;sort(_before.begin(), _before.end());sort(_after.begin(), _after.end());bool ans = false;if (_before != _after) ans = true;if (_before == _after) {int diff = 0;bool d[3] = {false};for (int i = 0; i < 3; i++) if (before[i] != after[i]) {diff++;d[i] = true;}if (N == 0 && diff) ans = true;if (N == 1 && diff == 2 && d[0] && d[2]) ans = true;if (N == 1 && diff == 0 && (before != "xox" && before != "oxo" && after != "xox" && after != "oxo")) ans = true;if (N == 2 && diff == 2 && (d[0]&d[1] || d[1]&d[2])) ans = true;}if (ans) cout << "SUCCESS" << endl;else cout << "FAILURE" << endl;return 0;}