Algorithms/absolutePermutation.cpp at master · piyush-hack/Algorithms · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
#include <bits/stdc++.h>

using namespace std;

string ltrim(const string &);
string rtrim(const string &);
vector<string> split(const string &);

/*
 * Complete the 'absolutePermutation' function below.
 *
 * The function is expected to return an INTEGER_ARRAY.
 * The function accepts following parameters:
 *  1. INTEGER n
 *  2. INTEGER k
 */

vector<int> absolutePermutation(int n, int k)
{

    map<int, int> mp;
    vector<int> vec;
    int diff = 0;
    for (int i = 1; i <= n; i++)
    {
        mp.insert({i, i});
    }

    // map<int, int>::iterator itr;


    // for (itr = mp.begin(); itr != mp.end(); ++itr)
    // {
    //     cout << itr->first<<" " ;
    // }
    // std::cout <<std::endl;

    //find its corresponding i such that |given no - i| exists in map
    for (int i = 1; i <= n; i++)
    {
        if (i <= k)
        {
            diff = i + k;

            if(!(mp[diff])){
                int temp = i - k;
                if(mp[temp]){
                    diff = temp;
                }
            }
        }
        else
        {
            diff = i - k;

            if(!(mp[diff])){
                int temp = i + k;
                if(mp[temp]){
                    diff = temp;
                }
            }
        }
        // std::cout << diff << std::endl;

        if (mp[diff])
        {
            vec.push_back(diff);
            mp.erase((diff));
            // std::cout <<"pusshed and deleted " << diff<< std::endl;

        }
        else
        {
            // std::cout << "no is "<< i <<" " << diff << " not found hence breaking"<< std::endl;
            vector<int> dum;
            dum.push_back(-1);
            return dum;
            break;
        }
    }

    return vec;
}


int main()
{
    ofstream fout(getenv("OUTPUT_PATH"));

    string t_temp;
    getline(cin, t_temp);

    int t = stoi(ltrim(rtrim(t_temp)));

    for (int t_itr = 0; t_itr < t; t_itr++)
    {
        string first_multiple_input_temp;
        getline(cin, first_multiple_input_temp);

        vector<string> first_multiple_input = split(rtrim(first_multiple_input_temp));

        int n = stoi(first_multiple_input[0]);

        int k = stoi(first_multiple_input[1]);

        vector<int> result = absolutePermutation(n, k);

        for (size_t i = 0; i < result.size(); i++)
        {
            cout << result[i];

            if (i != result.size() - 1)
            {
                cout << " ";
            }
        }

        cout << "\n";
    }

    fout.close();

    return 0;
}

string ltrim(const string &str)
{
    string s(str);

    s.erase(
        s.begin(),
        find_if(s.begin(), s.end(), not1(ptr_fun<int, int>(isspace))));

    return s;
}

string rtrim(const string &str)
{
    string s(str);

    s.erase(
        find_if(s.rbegin(), s.rend(), not1(ptr_fun<int, int>(isspace))).base(),
        s.end());

    return s;
}

vector<string> split(const string &str)
{
    vector<string> tokens;

    string::size_type start = 0;
    string::size_type end = 0;

    while ((end = str.find(" ", start)) != string::npos)
    {
        tokens.push_back(str.substr(start, end - start));

        start = end + 1;
    }

    tokens.push_back(str.substr(start));

    return tokens;
}