Submission #45871087


Source Code Expand

#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int,null_type,less_equal<int>,rb_tree_tag, tree_order_statistics_node_update>oset; 
#define hi cout << "test\n" ;/////
const int mod = 1e9+ 7  ;
#define all(cv) cv.begin(),cv.end() 
#define rall(cv) cv.rbegin() ,cv.rend() 
#define  ll unsigned long long
const ll inf = 1e18 ; 
#define FastIO ios_base::sync_with_stdio(false) , cin.tie(0) , cout.tie(0)
#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" = "; _print(x); cerr << endl;
#else
#define dbg(x)
#endif
ll binpow(ll a, ll b) {if (b == 0)return 1; ll res = binpow(a, b / 2);if (b % 2) return res * res * a;else return res * res;}
ll expo(ll a, ll b, ll mod) {ll ans = 1; while (b > 0) {if (b & 1)ans = (ans * a) % mod; a = (a * a) % mod; b = b >> 1;} return ans;}
ll gcd(ll a, ll b) { return((b == 0) ? a : gcd(b, a % b)); }
ll lcm(ll a, ll b) { return (b / gcd(a, b)) * a; }
void _print(auto t) {cerr << t;}
template <class T, class V> void _print(pair <T, V> p);
template <class T> void _print(vector <T> v);
template <class T> void _print(set <T> v);
template <class T, class V> void _print(map <T, V> v);
template <class T> void _print(multiset <T> v);
template <class T, class V> void _print(pair <T, V> p) {cerr << "{"; _print(p.first); cerr << ","; _print(p.second); cerr << "}";}
template <class T> void _print(vector <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
template <class T> void _print(set <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
template <class T> void _print(multiset <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void _print(map <T, V> v) {cerr << "[ "; for (auto i : v) {_print(i); cerr << " ";} cerr << "]";}
template < typename T > void output (const vector<T> & vec ){  for(auto elem : vec) cout<<elem<<" ";cout <<"\n" ;}
//--------------------------------------------------------------- ------------------------------------------------------------------- 
vector < string > ans ; 
string s = "" ;
int n  = 9 ; 
string base = "0123456789**" ; 

void rec (string s ,  int st ){
     
        if ( st == 11 ) return ; 
                         
      ans.push_back( s ) ; 
       for ( int i = st ; i <= 9 ; i++ ){
            s.push_back( base[i] ) ; 
            rec ( s , i + 1 ) ;
            s.pop_back() ; 
      }
      

}
bool cmp ( string & a , string & b ) {
   if ( a.size() < b.size() ) 
      return 0;
   else if ( a.size() > b.size() ) return 1; 
   else 
      return a > b ; 
}
void solve(){
  
     rec ( "" , 0) ; 
     for ( int i= 0 ; i < ans.size()  ; i++ ) {
      reverse ( all ( ans[i] )) ; 
     } 
     sort ( ans.begin() , ans.end() , cmp )  ; 
     reverse ( all ( ans )) ; 
     
     int k ; cin >> k ; 
     cout << ans[k + 1] ; 
    
}
//---------------------------------------------------------------------------------------------------------------------------------
int32_t main(){
 #ifndef ONLINE_JUDGE
    freopen("error.txt","w",stderr) ;
 #endif 
      
     FastIO ;
     int test = 1;
   //  cin>>test; 
     while(test--){
     solve(); 
     if(test>0)
        cout << endl; 
     }
 
 }      

Submission Info

Submission Time
Task C - 321-like Searcher
User Moorit
Language C++ 20 (gcc 12.2)
Score 300
Code Size 3354 Byte
Status AC
Exec Time 1 ms
Memory 3696 KiB

Compile Error

Main.cpp: In function ‘void solve()’:
Main.cpp:63:25: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::vector<std::__cxx11::basic_string<char> >::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
   63 |      for ( int i= 0 ; i < ans.size()  ; i++ ) {
      |                       ~~^~~~~~~~~~~~

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 3
AC × 30
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All sample_01.txt, sample_02.txt, sample_03.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt, test_21.txt, test_22.txt, test_23.txt, test_24.txt, test_25.txt, test_26.txt, test_27.txt
Case Name Status Exec Time Memory
sample_01.txt AC 1 ms 3572 KiB
sample_02.txt AC 1 ms 3500 KiB
sample_03.txt AC 1 ms 3640 KiB
test_01.txt AC 1 ms 3496 KiB
test_02.txt AC 1 ms 3496 KiB
test_03.txt AC 1 ms 3628 KiB
test_04.txt AC 1 ms 3572 KiB
test_05.txt AC 1 ms 3488 KiB
test_06.txt AC 1 ms 3508 KiB
test_07.txt AC 1 ms 3636 KiB
test_08.txt AC 1 ms 3576 KiB
test_09.txt AC 1 ms 3572 KiB
test_10.txt AC 1 ms 3468 KiB
test_11.txt AC 1 ms 3508 KiB
test_12.txt AC 1 ms 3464 KiB
test_13.txt AC 1 ms 3576 KiB
test_14.txt AC 1 ms 3568 KiB
test_15.txt AC 1 ms 3540 KiB
test_16.txt AC 1 ms 3544 KiB
test_17.txt AC 1 ms 3560 KiB
test_18.txt AC 1 ms 3696 KiB
test_19.txt AC 1 ms 3484 KiB
test_20.txt AC 1 ms 3548 KiB
test_21.txt AC 1 ms 3692 KiB
test_22.txt AC 1 ms 3572 KiB
test_23.txt AC 1 ms 3572 KiB
test_24.txt AC 1 ms 3560 KiB
test_25.txt AC 1 ms 3544 KiB
test_26.txt AC 1 ms 3556 KiB
test_27.txt AC 1 ms 3572 KiB