Submission #448492

# Submission time Handle Problem Language Result Execution time Memory
448492 2021-07-30T09:28:25 Z BT21tata Palindrome-Free Numbers (BOI13_numbers) C++17
34.1667 / 100
1000 ms 324 KB
#include<bits/stdc++.h>
#pragma GCC target ("avx,avx2,fma")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
typedef long long ll;
typedef long double ld;
#define SPEED ios_base::sync_with_stdio(false); cin.tie(0), cout.tie(0)
#define rall(v) (v).rbegin(),(v).rend()
#define all(v) (v).begin(),(v).end()
#define OK cerr<<"OK"<<endl<<flush
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pb push_back
#define F first
#define S second
#define y0 jahdakdh
#define y1 jahsadakdakdh
#define endl '\n'
using namespace std;
const ll MOD=1e9+7;
// mt19937 rng(std::chrono::system_clock::now().time_since_epoch().count());
 
ll a, b, p[20];
ll ans;
int check(int x)
{
    string s=to_string(x);
    int n=s.length();
    s+='-';
    for(int i=0; i<n-1; i++)
    {
        if(s[i]==s[i+1]) return n-(i+1)-1;
        else if(s[i]==s[i+2]) return n-(i+2)-1;
    }
    return -1;
}

int main()
{
    SPEED;
    p[0]=1;
    for(int i=1; i<=18; i++)
        p[i]=p[i-1]*10;
    cin>>a>>b;
    for(int i=a; i<=b;)
    {
        int e=check(i);
        if(e==-1) ans++, e++;
        //cout<<i<<' '<<e<<endl;
        i=(i/p[e]*p[e])+p[e];
    }
    cout<<ans<<endl;
    return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Execution timed out 1074 ms 204 KB Time limit exceeded
4 Correct 4 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 3 ms 204 KB Output is correct
15 Correct 4 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Execution timed out 1096 ms 204 KB Time limit exceeded
20 Correct 4 ms 204 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 208 ms 296 KB Output is correct
2 Execution timed out 1093 ms 204 KB Time limit exceeded
3 Execution timed out 1093 ms 204 KB Time limit exceeded
4 Execution timed out 1084 ms 204 KB Time limit exceeded
5 Execution timed out 1090 ms 204 KB Time limit exceeded
6 Execution timed out 1086 ms 204 KB Time limit exceeded
7 Correct 85 ms 204 KB Output is correct
8 Correct 63 ms 288 KB Output is correct
9 Correct 112 ms 292 KB Output is correct
10 Correct 152 ms 204 KB Output is correct
11 Correct 203 ms 300 KB Output is correct
12 Execution timed out 1014 ms 300 KB Time limit exceeded
13 Correct 239 ms 324 KB Output is correct
14 Execution timed out 1083 ms 204 KB Time limit exceeded
15 Execution timed out 1084 ms 204 KB Time limit exceeded
16 Execution timed out 1094 ms 204 KB Time limit exceeded
17 Execution timed out 1093 ms 204 KB Time limit exceeded
18 Execution timed out 1095 ms 204 KB Time limit exceeded
19 Execution timed out 1086 ms 204 KB Time limit exceeded
20 Execution timed out 1086 ms 204 KB Time limit exceeded
21 Execution timed out 1095 ms 204 KB Time limit exceeded
22 Execution timed out 1091 ms 204 KB Time limit exceeded
23 Execution timed out 1066 ms 204 KB Time limit exceeded
24 Execution timed out 1096 ms 204 KB Time limit exceeded
25 Execution timed out 1097 ms 204 KB Time limit exceeded
26 Execution timed out 1096 ms 204 KB Time limit exceeded
27 Execution timed out 1091 ms 204 KB Time limit exceeded
28 Execution timed out 1090 ms 204 KB Time limit exceeded
29 Execution timed out 1088 ms 204 KB Time limit exceeded
30 Execution timed out 1097 ms 204 KB Time limit exceeded
31 Execution timed out 1094 ms 204 KB Time limit exceeded
32 Execution timed out 1089 ms 204 KB Time limit exceeded
33 Execution timed out 1096 ms 204 KB Time limit exceeded
34 Execution timed out 1086 ms 204 KB Time limit exceeded
35 Execution timed out 1083 ms 204 KB Time limit exceeded
36 Execution timed out 1089 ms 204 KB Time limit exceeded
37 Execution timed out 1095 ms 204 KB Time limit exceeded
38 Execution timed out 1099 ms 204 KB Time limit exceeded
39 Execution timed out 1093 ms 204 KB Time limit exceeded
40 Execution timed out 1081 ms 204 KB Time limit exceeded
41 Execution timed out 1096 ms 204 KB Time limit exceeded
42 Execution timed out 1095 ms 204 KB Time limit exceeded
43 Execution timed out 1097 ms 204 KB Time limit exceeded
44 Execution timed out 1092 ms 204 KB Time limit exceeded
45 Execution timed out 1081 ms 204 KB Time limit exceeded