MTHREE exam help ! Infosys exam help ! Cognizant exam help ! Amazon exam answer

#include<bits/stdc++.h> using namespace std; using ll = long long; vector<string> read(){     vector<string> strs;     string line;     getline(cin , line);     istringstream iss(line);     copy(istream_iterator<string>(iss), istream_iterator<string>(), back_inserter(strs));     return strs; } map<string , vector<string>> graph; map<string , ll> mask , id; map<string , string> open; ll ans = 0; ll dfs1(string &u){     ll curr = id.count(u) ? 1LL << id[u] : 0;     for(string &v : graph[u]) curr |= dfs1(v);     return mask[u] = curr; } void dfs2(string &u , int bit){     if(id[u] == bit){         open[u] = u;         return;     }     for(string &v : graph[u]){         if(mask[v] >> bit & 1){             if(open[u] != v) ans++ , open[u] = v;             return dfs2(v , bit);         }     } } int main(){     ll N ; cin >> N;     cin.ignore();     while(N--){         vector<string> children = read();         reverse(children.begin() , children.end());         string parent = children.back();         children.pop_back();         graph[parent] = children;     }     ll cid = 0;     vector<string> colors = read();     for(string &color : colors) if(!id.count(color)) id[color] = ++cid;     string u = "source";     dfs1(u);     for(string &color : colors) dfs2(u , id[color]);     cout << ans;     return 0; } Route the balls

https://t.me/codeing_are Share the group only .....✅✅✅✅✅✅✅

Next code uploaded sooon with proofs 👇👇👇👇👇

JustifyWords def max_words_fitted(k, words, n, m): words = [word for word in words if len(word) <= m] def backtrack(index, lines): if index == len(words): return sum(len(line.split()) for line in lines) max_words = 0 word = words[index] for i in range(len(lines)): if len(lines[i]) + len(word) + (1 if lines[i] else 0) <= m: original_line = lines[i] lines[i] = lines[i] + (' ' if lines[i] else '') + word max_words = max(max_words, backtrack(index + 1, lines)) lines[i] = original_line if len(lines) < n: lines.append(word) max_words = max(max_words, backtrack(index + 1, lines)) lines.pop() return max_words return backtrack(0, []) # Input k = int(input().strip()) words = [input().strip() for _ in range(k)] n, m = map(int, input().strip().split()) print(max_words_fitted(k, words, n, m))

1)Flight Optimization TCS CodeVita accepted 2)magic stars intensity ac 3)Sofa problem done with private 4)Faulty sankes and ladders 5)Frenkitsen wala Codevita These code are Allredy uploaded with 💯 correct answer Dance rev 100% Working

https://t.me/codeing_are Share the group ✅✅✅✅✅✅✅✅✅✅✅✅

Want more code ?

With proof

// Flight Optimization TCS CodeVita accepted

Fight optimisation

#include <bits/stdc++.h> using namespace std; #define loop(i, a, n) for (lli i = (a); i < (n); ++i) #define loopD(i, a, n) for (lli i = (a); i >= (n); --i) #define all(c) (c).begin(), (c).end() #define rall(c) (c).rbegin(), (c).rend() #define sz(a) ((int)a.size()) #define YES cout << "YES" << endl; #define NO cout << "NO" << endl; #define endl '\n' #define fastio std::ios::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL); #define pb push_back #define pp pop_back() #define fi first #define si second #define v(a) vector<int>(a) #define vv(a) vector<vector<int>>(a) #define present(c, x) ((c).find(x) != (c).end()) #define set_bits __builtin_popcountll #define MOD 1000000007 #define int long long typedef long long lli; typedef vector<int> vi; typedef vector<vi> vvi; typedef pair<lli, lli> pll; typedef pair<int, int> pii; typedef unordered_map<int, int> umpi; typedef map<int, int> mpi; typedef vector<pii> vp; typedef vector<lli> vll; typedef vector<vll> vvll; struct Flight { string src; string to; int dt; int at; int cost; }; int parse_time(const string& time_str) { int hour = stoi(time_str.substr(0, 2)); int minute = stoi(time_str.substr(3, 2)); string am_pm = time_str.substr(5, 2); if (am_pm == "Am") { if (hour == 12) hour = 0; } else if (am_pm == "Pm") { if (hour != 12) hour += 12; } return hour * 60 + minute; } void solve() { int N; cin >> N; vector<Flight> fff(N); unordered_map<string, vector<Flight>> mp; for (int i = 0; i < N; ++i) { string src, to, des, arrival_str; int cost; cin >> src >> to >> des >> arrival_str >> cost; int dt = parse_time(des); int at = parse_time(arrival_str); Flight ff = {src, to, dt, at, cost}; fff[i] = ff; mp[src].push_back(ff); } string src, des; cin >> src >> des; string edes, last; cin >> edes >> last; int earliest_dt = parse_time(edes); int latest_at = parse_time(last); typedef tuple<int, int, string> State; priority_queue<State, vector<State>, greater<State>> pq; for (const auto& ff : mp[src]) { if (ff.dt >= earliest_dt) { if (ff.at <= latest_at) { pq.emplace(ff.cost, ff.at, ff.to); } } } unordered_map<string, int> ans; unordered_map<string, int> at; while (!pq.empty()) { int cost_so_far, current_at; string current_city; tie(cost_so_far, current_at, current_city) = pq.top(); pq.pop(); if (ans.find(current_city) != ans.end()) { if (cost_so_far > ans[current_city]) continue; if (cost_so_far == ans[current_city] && current_at >= at[current_city]) continue; } ans[current_city] = cost_so_far; at[current_city] = current_at; if (current_city == des) { cout << cost_so_far; return ; } for (const auto& ff : mp[current_city]) { if (ff.dt >= current_at) { if (ff.dt >= earliest_dt && ff.at <= latest_at) { int new_cost = cost_so_far + ff.cost; pq.emplace(new_cost, ff.at, ff.to); } } } } cout << "Impossible"; return ; } int32_t main() { int tc = 1; // cin >> tc; while (tc--) { solve(); } return 0; }

#include <bits/stdc++.h> using namespace std; #define loop(i, a, n) for (lli i = (a); i < (n); ++i) #define loopD(i, a, n) for (lli i = (a); i >= (n); --i) #define all(c) (c).begin(), (c).end() #define rall(c) (c).rbegin(), (c).rend() #define sz(a) ((lli)a.size()) #define YES cout << "YES" << endl; #define NO cout << "NO" << endl; #define endl '\n' #define fastio std::ios::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL); #define pb push_back #define pp pop_back() #define fi first #define si second #define v(a) vector<int>(a) #define vv(a) vector<vector<int>>(a) #define present(c, x) ((c).find(x) != (c).end()) #define set_bits __builtin_popcountll #define MOD 1000000007 #define int long long typedef long long lli; typedef vector<int> vi; typedef vector<vi> vvi; typedef pair<lli, lli> pll; typedef pair<int, int> pii; typedef unordered_map<int, int> umpi; typedef map<int, int> mpi; typedef vector<pii> vp; typedef vector<lli> vll; typedef vector<vll> vvll; struct Line { int x1, y1, x2, y2; bool vertical() const { return x1 == x2; } bool horizontal() const { return y1 == y2; } bool diagonal() const { return abs(x2 - x1) == abs(y2 - y1); } }; int N, K; vector<Line> lines; map<pair<int, int>, vector<int>> ptsMap; void add(const Line& line, int idx) { int x1 = line.x1, y1 = line.y1; int x2 = line.x2, y2 = line.y2; if (line.vertical()) { int yStart = min(y1, y2); int yEnd = max(y1, y2); for(int y = yStart; y <= yEnd; y++) { ptsMap[{x1, y}].push_back(idx); } } else if (line.horizontal()) { int xStart = min(x1, x2); int xEnd = max(x1, x2); for(int x = xStart; x <= xEnd; x++) { ptsMap[{x, y1}].push_back(idx); } } else if (line.diagonal()) { int steps = abs(x2 - x1); int dx = (x2 - x1) / steps; int dy = (y2 - y1) / steps; for(int i = 0; i <= steps; i++) { int x = x1 + i * dx; int y = y1 + i * dy; ptsMap[{x, y}].push_back(idx); } } } int ff(int x1, int y1, int x2, int y2) { if(x1 == x2) return abs(y1 - y2); if(y1 == y2) return abs(x1 - x2); if(abs(x1 - x2) == abs(y1 - y2)) return abs(x1 - x2); return 0; } int solve(const pair<int, int>& pt, const vector<int>& lst) { vector<int> d; for(auto lIdx : lst) { const Line& ln = lines[lIdx]; bool oneSided = (pt.first == ln.x1 && pt.second == ln.y1) || (pt.first == ln.x2 && pt.second == ln.y2); if(oneSided) { int ex = (pt.first == ln.x1 && pt.second == ln.y1) ? ln.x2 : ln.x1; int ey = (pt.first == ln.x1 && pt.second == ln.y1) ? ln.y2 : ln.y1; d.push_back(ff(pt.first, pt.second, ex, ey)); } else { d.push_back(ff(pt.first, pt.second, ln.x1, ln.y1)); d.push_back(ff(pt.first, pt.second, ln.x2, ln.y2)); } } return d.empty() ? 0 : *min_element(d.begin(), d.end()); } void solve() { cin >> N; lines.resize(N); for(int i = 0; i < N; i++) { cin >> lines[i].x1 >> lines[i].y1 >> lines[i].x2 >> lines[i].y2; add(lines[i], i); } cin >> K; int total = 0; for(auto &[pt, lst] : ptsMap) { if(sz(lst) == K) { total += solve(pt, lst); } } cout << total; } int32_t main() { solve(); return 0; } // magic stars intensity ac Full accepted ☺️

Magic Star Intensity Code TCS CodeVita Zone 1 #include <iostream> #include <vector> #include <map> #include <set> #include <cmath> #include <algorithm> using namespace std; struct Line {     int x1, y1, x2, y2; }; int countCells(Line line, pair<int, int> star, bool split) {     if (line.x1 == line.x2) {         if (split) {             return min(abs(star.second - line.y1), abs(star.second - line.y2)) + 1;         }         else {             return abs(line.y1 - line.y2) + 1;         }     }     else {         if (split) {             return min(abs(star.first - line.x1), abs(star.first - line.x2)) + 1;         }         else {             return abs(line.x1 - line.x2) + 1;         }     } } bool intersects(Line a, Line b, pair<int, int>& intersection) {     if (a.x1 == a.x2 && b.y1 == b.y2) {         if (b.x1 <= a.x1 && a.x1 <= b.x2 && a.y1 <= b.y1 && b.y1 <= a.y2) {             intersection = {a.x1, b.y1};             return true;         }     }     if (a.y1 == a.y2 && b.x1 == b.x2) {         if (a.x1 <= b.x1 && b.x1 <= a.x2 && b.y1 <= a.y1 && a.y1 <= b.y2) {             intersection = {b.x1, a.y1};             return true;         }     }     return false; } int main() {     int N, K;     cin >> N;     vector<Line> lines(N);     for (int i = 0; i < N; ++i) {         cin >> lines[i].x1 >> lines[i].y1 >> lines[i].x2 >> lines[i].y2;         if (lines[i].x1 > lines[i].x2 || (lines[i].x1 == lines[i].x2 && lines[i].y1 > lines[i].y2)) {             swap(lines[i].x1, lines[i].x2);             swap(lines[i].y1, lines[i].y2);         }     }     cin >> K;     map<pair<int, int>, vector<Line>> stars;     for (int i = 0; i < N; ++i) {         for (int j = i + 1; j < N; ++j) {             pair<int, int> intersection;             if (intersects(lines[i], lines[j], intersection)) {                 stars[intersection].push_back(lines[i]);                 stars[intersection].push_back(lines[j]);             }         }     }     int placementlelo = 0;     for (auto& star : stars) {         if (star.second.size() / 2 == K) {             vector<int> intensities;             for (auto& line : star.second) {                 intensities.push_back(countCells(line, star.first, true));             }             placementlelo += *min_element(intensities.begin(), intensities.end());         }     }     cout << placementlelo << endl;     return 0; } Magic Star Intensity Code C++ TCS CodeVita Zone 1

Fastt everyone

Do 15.5k

Share the group everyone if you want this question answers 🙏

Ready for this code