oj.uz

Submission #331443

# Submission time Handle Problem Language Result Execution time Memory
331443 2020-11-28T13:50:21 Z Sho10 Lucky Numbers (RMI19_lucky) C++14
14 / 100
 200 ms 30316 KB 
#include <bits/stdc++.h> //Andrei Alexandru a.k.a Sho10
#define ll long long
#define double long double
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define all(a) (a).begin(), (a).end()
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define pi pair
#define rc(s) return cout<<s,0
#define endl '\n'
#define mod 1000007
#define PI 3.14159265359
#define MAXN 100005
#define INF 1000000005
#define LINF 1000000000000000005ll
#define CODE_START  ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
int n,pref[10000005],viz[1000005],nr[10000005];
int32_t main(){
CODE_START;
int n,q;
cin>>n>>q;
cin>>n;
pref[1000]=980;
pref[10000]=9701;
pref[100000]=96030;
pref[1000000]=950599;
ll start=1;
if(n>=1000000){
start=1000000;
}else if(n>=100000){
start=100000;
}else if(n>=10000){
start=10000;
}else if(n>=1000){
start=1000;
}
for(int i=start+1;i<=n;i++)
{
pref[i]=pref[i-1];
int x=i;
vector<int>v;
while(x){
    v.pb(x%10);
    x/=10;
}
reverse(v.begin(),v.end());
int check=1;
for(int i=0;i<v.size();i++)
if(i+1<v.size()){
    if(v[i]==1&&v[i+1]==3){
check=0;
break;
    }
}
pref[i]+=check;
}
cout<<pref[n]+1<<endl;
}

Compilation message

lucky.cpp: In function 'int32_t main()':
lucky.cpp:52:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   52 | for(int i=0;i<v.size();i++)
      |             ~^~~~~~~~~
lucky.cpp:53:7: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   53 | if(i+1<v.size()){
      |    ~~~^~~~~~~~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 2 ms 364 KB Output is correct
3 Correct 24 ms 1024 KB Output is correct

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 2 ms 364 KB Output is correct
3 Correct 24 ms 1024 KB Output is correct
4 Execution timed out 1099 ms 30316 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1070 ms 29420 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 27.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1070 ms 29420 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 2 ms 364 KB Output is correct
3 Correct 24 ms 1024 KB Output is correct
4 Execution timed out 1099 ms 30316 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 2 ms 364 KB Output is correct
3 Correct 24 ms 1024 KB Output is correct
4 Execution timed out 1099 ms 30316 KB Time limit exceeded
5 Halted 0 ms 0 KB -