Submission #6405573

---

Source Code Expand

#include <bits/stdc++.h>
#include <map>
#include <set>
#include <vector>
#include <algorithm>
#include <iostream>
#include <bitset>
#include <cassert>
#include <queue>
#include <random>
#include <stack>
#include <iomanip>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)n; i++)
#define repf(i, a, b) for (ll i = (ll)a; i < (ll)b; i++)
#define repr(i, a, b) for (ll i = (ll)a; i > (ll)b; i--)
#define repv(x, arr) for (auto &x : arr)
#define all(v) (v).begin(), (v).end()
#define vec(name, num) vector<ll> name((num), 0);
#define mp(a, b) make_pair(a, b)
#define op(i) cout << (i) << endl;
#define F first
#define S second
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<int> vii;
typedef vector<vii> vvii;
const ll mod = 1e9 + 7;
const int infi = 2147483600;
const ll infl = 1e17;


struct REV{
    vector<int> L;
    int N;
    void __init__(int sz){
        N=sz;
        L.resize(N + 1,0);
        repf(i,1,N+1){
            L[i] = re(i);
        }
    }
    int re(int i){
        string s = to_string(i);
        int res=0;
        rep(k,s.size()){
            res += s[s.size()-k-1] - '0';
            res *= 10;
        }
        return res/10;
    }
    int get(int x){
        return L[x];
    }
};

REV rev;

void check(int x,int y,set<pii>& visited,vvii& ans){
    if (ans[x][y]!=-1)
        return;
    int xx=x, yy = y;
    if (xx<yy)
        xx = rev.get(xx);
    else
        yy = rev.get(yy);
    if (xx<yy)
        yy -= xx;
    else
        xx -= yy;
    if (visited.count(mp(xx,yy))==1){
        ans[xx][yy] = 1;
        return;
    }
    visited.insert(mp(x, y));
    check(xx, yy,visited,ans);
    ans[x][y] = ans[xx][yy];
    return;
}

int n, m;

int main()
{
    rev.__init__(1000);
    cin >> n >> m;
    vvii ans(1000, vii(1000, -1));
    rep(i, 1000) ans[i][0] = 0;
    rep(j, 1000) ans[0][j] = 0;
    repf(x,1,n+1){
        repf(y,1,m+1){
            set<pii> visited;
            check(x, y,visited,ans);
        }
    }
    int res = 0;
    repf(x,1,n+1){
        repf(y,1,m+1){
            if (ans[x][y])
                res++;
        }
    }
    cout << res << endl;
}

Submission Info

Judge Result