Submission #1120490

#	Time	Username	Problem	Language	Result	Execution time	Memory
1120490		vjudge1	Palindrome-Free Numbers (BOI13_numbers)	C++17	25 / 100	1083 ms	512 KiB

numbers

/*
#ifndef ONLINE_JUDGE
#include "AkbarKING.h" // aska geldi akbarking.h
#else
#define debug(...)
#define debugArr(...)
#define debugG(...)
#endif
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/hash_policy.hpp>

#define int long long
#define $AzH_TxdmN$ ios_base::sync_with_stdio(0);cin.tie(nullptr);cout.tie(nullptr);
#pragma GCC target("sse,sse2,sse3,ssse3,popcnt,abm,mmx,tune=native")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("fast-math")

#define ep emplace_back
#define pb push_back
#define pii pair<int,int>
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()

using namespace std;
using namespace __gnu_pbds;

template <typename T>
using __indexed_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template <typename T>
using __indexed_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;

const int sz = 3e5+9;
const int LOG = 63;
const int MOD = 1e9+7;
const int INF = 1e18;

int a,b;

void solve()
{
    cin>>a>>b;
    int res = 0;
    for (int i = a; i <= b; ++i)
    {
        string s = to_string(i);
        string curr = "";
        vector<vector<bool>>dp((int)s.size()+1, vector<bool>((int)s.size()+1,false));
        for (int j = 1; j <= (int)s.size(); j++)
        {
            for (int i = 0; i <= (int)s.size()-j; i++)
            {
                if (j <= 2)
                {
                    dp[i][i+j-1] = (s[i] == s[i+j-1]);
                }
                else if (s[i] == s[i + j - 1])
                {
                    dp[i][i+j-1] = dp[i+1][i+j-2];
                }
            }
        }
        int d = 0;
        for (int i = 0; i < (int)s.size() && !d; ++i)
        {
            for (int j = i+1; j < (int)s.size() && !d; ++j)
            {
                if (dp[i][j])
                {
                    d = 1;
                    break;
                }
            }
        }
        res += (!d);
    }
    cout<<res<<'\n';
}

signed main()
{
    $AzH_TxdmN$
    int t = 1;
    //cin>>t;
    while (t--)
    {
        solve();
    }
}

• Subtask 1: 25 / 25
• Subtask 2: 0 / 75