The problem statement:
Among the large Wisconsin cattle ranchers, it is customary to brand cows with serial numbers to please the Accounting Department. The cow hands don't appreciate the advantage of this filing system, though, and wish to call the members of their herd by a pleasing name rather than saying, "C'mon, #4734, get along."
Help the poor cowhands out by writing a program that will translate the brand serial number of a cow into possible names uniquely associated with that serial number. Since the cow hands all have cellular saddle phones these days, use the standard Touch-Tone(R) telephone keypad mapping to get from numbers to letters (except for "Q" and "Z"):
2: A,B,C 5: J,K,L 8: T,U,V
3: D,E,F 6: M,N,O 9: W,X,Y
4: G,H,I 7: P,R,S
Acceptable names for cattle are provided to you in a file named "dict.txt", which contains a list of fewer than 5,000 acceptable cattle names (all letters capitalized). Take a cow's brand number and report which of all the possible words to which that number maps are in the given dictionary which is supplied as dict.txt in the grading environment (and is sorted into ascending order).
For instance, the brand number 4734 produces all the following names:
GPDG GPDH GPDI GPEG GPEH GPEI GPFG GPFH GPFI GRDG GRDH GRDI
GREG GREH GREI GRFG GRFH GRFI GSDG GSDH GSDI GSEG GSEH GSEI
GSFG GSFH GSFI HPDG HPDH HPDI HPEG HPEH HPEI HPFG HPFH HPFI
HRDG HRDH HRDI HREG HREH HREI HRFG HRFH HRFI HSDG HSDH HSDI
HSEG HSEH HSEI HSFG HSFH HSFI IPDG IPDH IPDI IPEG IPEH IPEI
IPFG IPFH IPFI IRDG IRDH IRDI IREG IREH IREI IRFG IRFH IRFI
ISDG ISDH ISDI ISEG ISEH ISEI ISFG ISFH ISFI
As it happens, the only one of these 81 names that is in the list of valid names is "GREG".
Write a program that is given the brand number of a cow and prints all the valid names that can be generated from that brand number or ``NONE'' if there are no valid names. Serial numbers can be as many as a dozen digits long.
PROGRAM NAME: namenum
INPUT FORMAT
A single line with a number from 1 through 12 digits in length.
SAMPLE INPUT (file namenum.in)
4734
OUTPUT FORMAT
A list of valid names that can be generated from the input, one per line, in ascending alphabetical order.
SAMPLE OUTPUT (file namenum.out)
GREG
My code:
#include<bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
ofstream fout("namenum.out");
ifstream fin("namenum.in");
long long int n,n1;
fin>>n;
int d=0; n1=n;
while(n1){
n1/=10;
d++;
}
n1=n;
unordered_map<int,vector<char>> m={{2,{'A','B','C'}},
{3,{'D','E','F'}},
{4,{'G','H','I'}},
{5,{'J','K','L'}},
{6,{'M','N','O'}},
{7,{'P','R','S'}},
{8,{'T','U','V'}},
{9,{'W','X','Y'}}};
fin.open("dict.txt");
string s;
fin>>s;
vector<string> ans;
while(!fin.eof()){
if(s.length()==d){
int flag=1,check=0;
for(int i=d-1;i>=0;i--){
flag=1;
for(int j=0;j<3;j++){
if(m[n1%10][j]==s[i]){
flag=0;
}
}
n1/=10;
if(flag==1){
check=1;
break;
}
}
if(check==0){
ans.push_back(s);
}
n1=n;
}
}
sort(ans.begin(),ans.end());
for(int i=0;i<ans.size();i++){
fout<<ans[i]<<'\n';
}
return 0;
}
The following error is occuring:
> Run 1: Execution error: Your program (`namenum') used more than
the allotted runtime of 1 seconds (it ended or was stopped at
1.855 seconds) when presented with test case 1. It used 1360 KB of
memory.
------ Data for Run 1 [length=5 bytes] ------
4734
----------------------------
Test 1: RUNTIME 1.855>1 (1360 KB)
I don't get this error. How am i supposed to calculate the time and rectify my code accordingly?
