結果

問題 No.197 手品
コンテスト
ユーザー mmn15277198
提出日時 2021-04-13 19:43:02
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 3,953 bytes
コンパイル時間 972 ms
コンパイル使用メモリ 100,916 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-06-30 00:26:25
合計ジャッジ時間 2,385 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3 WA * 1
other AC * 39 WA * 4
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function 'void solve()':
main.cpp:138:5: warning: 'cnt_3' may be used uninitialized [-Wmaybe-uninitialized]
  138 |     if (cnt_3 != cnt_4) {
      |     ^~
main.cpp:135:9: note: 'cnt_3' was declared here
  135 |     int cnt_3 , cnt_4 = 0;
      |         ^~~~~

ソースコード

diff # 

#include <iostream>
#include <vector>
#include <functional>
#include <algorithm>
#include <map>
#include <cstdio>
#include <cmath>
#include <iomanip>
#include <queue>

using namespace std;

#define rep(i,n) for (int i = 0; i < (n); i++)
#define vi vector<int>
#define vll vector<long long>
#define vb vector<bool>
#define vs vector<string>
#define all(x) x.begin() , x.end()
#define pb push_back
#define eb emplace_back
#define chmax(x,y) (x) = max((x) , (y))
#define chmin(x,y) (x) = min((x) , (y))
#define fi first
#define se second

typedef long long ll;
typedef long double ld;

//const int MOD = int(1e9) + 7;
//const int MOD = 998244353;
const ll MOD = ll(1e9) + 7;
//const ll MOD = 998244353;
const ld PI = 3.1415926535897932384626;
const int INF = 1001001001;
const ll LINF = 1001001001001001001;
const int MX = 220000;

ll gcd (ll a , ll b) { if (a < b) swap(a , b); if (a % b == 0) return b; else return gcd(b , a % b); }
ll lcm (ll a , ll b) { return a / gcd(a , b) * b; }
ll lin() { ll x; scanf("%lld" , &x); return x; }
int in() { int x; scanf("%d" , &x); return x; }

void io_setup() {
    cout << fixed << setprecision(30);
}

ll modpow (ll x , ll p) {
    ll ret = 1;
    while (p) {
        if (p % 2 == 1) {
            ret *= x;
            ret %= MOD;
        }
        x *= x;
        x %= MOD;
        p /= 2;
    }
    return ret;
}

ll moddiv (ll a , ll b) {
    return a * modpow(b , MOD - 2) % MOD;
}

ll modsub (ll a , ll b) {
    if (a >= b) return (a - b) % MOD;
    else return (MOD - a + b);
}

vll fact(MX);
vll factinv(MX);
void init_fact () {
    fact[0] = 1;
    for (int i = 1; i < MX; i++) {
        fact[i] = 1LL * i * fact[i - 1] % MOD;
    }
    for (int i = 0; i < MX; i++) {
        factinv[i] = modpow(fact[i] , MOD - 2);
    }
}

ll nCk (ll n , ll k) {
    return ((fact[n] * factinv[k] % MOD) * factinv[n - k] % MOD);
}

bool is_prime (int x) {
    if (x == 2 || x == 3 || x == 5 || x == 7) {
        return true;
    }
    for (ll i = 2; i*i <= x; i++) {
        if (x % i == 0) {
            return false;
        }
    }
    return true;
}

vb prime_table(MX , true);
void init_prime() {
    for (int i = 2; i < MX; i++) {
        for (int j = i + i; j < MX; j += i) {
            prime_table[j] = false;
        }
    }
    return;
}

void solve () {
    string s;
    cin >> s;
    ll n = lin();
    string t;
    cin >> t;
    if (n == 0) {
        if (s != t) {
            cout << "SUCCESS" << endl;
        } else {
            cout << "FAILURE" << endl;
        }
        return;
    }
    int cnt_1 = 0 , cnt_2 = 0;
    for (auto i : s) {
        cnt_1 += (i == 'o');
        cnt_2 += (i == 'x');
    }
    for (auto i : t) {
        cnt_1 += (i == 'o');
        cnt_2 += (i == 'x');
    }
    if (cnt_1 = 0 || cnt_2 == 0) {
        cout << "FAILURE" << endl;
        return;
    }
    int cnt_3 , cnt_4 = 0;
    for (auto i : s) cnt_3 += (i == 'o');
    for (auto i : t) cnt_4 += (i == 'o');
    if (cnt_3 != cnt_4) {
        cout << "SUCCESS" << endl;
        return;
    }
    if (n % 2 == 0) {
        if (s == t) {
            cout << "FAILURE" << endl;
        } else if (t[0] == s[1] && t[1] == s[2] && t[2] == s[0]) {
            cout << "FAILURE" << endl;
        } else if (t[0] == s[2] && t[1] == s[0] && t[2] == s[1]){
            cout << "FAILURE" << endl;
        } else {
            cout << "SUCCESS" << endl;
        }
        return;
    }
    if (n % 2 == 1) {
        if (t[0] == s[1] && t[1] == s[0] && t[2] == s[2]) {
             cout << "FAILURE" << endl;
        } else if (t[0] == s[0] && t[1] == s[2] && t[2] == s[1]) {
            cout << "FAILURE" << endl;
        } else if (t[0] == s[2] && t[1] == s[1] && t[2] == s[0]) {
            cout << "FAILURE" << endl;
        } else {
            cout << "SUCCESS" << endl;
        }
        return;
    }
    return;
}

int main() {
    io_setup();
    //init_fact();
    //init_prime();
    solve();
    return 0;
}
0