SPOJ-INVERSE-SORT

Problem

Algorithm:


 We have to generate  10!  combination of "abcdefghij " by reversing and put appropriate distance from "abcdefghij "

 So we need key(string)->value  data structure.
First thing comes to our mind is map<string,int>
But it uses O(logN) time to insert a value as everything is ordered here
So we use unordered_map (Normally o(1) highest o(n) barely) 

 After that we take 2 string input and then find the relative string S from s1->s2 and another AC!!

CODE

Time needed 40-45sec.

মন্তব্যসমূহ

একটি মন্তব্য পোস্ট করুন

এই ব্লগটি থেকে জনপ্রিয় পোস্টগুলি

lightOJ-1072 Calm Down

Statement  #include<bits/stdc++.h> using namespace std; #define sf(a)                   scanf("%I64d",&a) #define sff(a,b)                scanf("%I64d %I64d",&a,&b) #define sfff(a,b,c)             scanf("%I64d %I64d %I64d",&a,&b,&c) #define sffff(a,b,c,d)          scanf("%I64d %I64d %I64d %I64d",&a,&b,&c,&d) #define sfffff(a,b,c,d,e)       scanf("%I64d %I64d %I64d %I64d %I64d",&a,&b,&c,&d,&e) #define read                    freopen("input.txt","r",stdin) #define write                   freopen("output.txt","w",stdout) #define ll                      long long #define MAX                     1000009 #define Max                     100000000009 #define pb                      push_back #define all(c)                  c.begin(),c.end() #define mset(a,b)               memset(a,b,sizeof(a)) #define MOD
আরও পড়ুন