Technical Study Ajay
رفتن به کانال در Telegram
Hello 👋 Friends Wellcome To My Telegram Channel 👍❤️🤗❤️❤️❤️❤️❤️🤗🤗🤗👍👍👍🤗
نمایش بیشتر2 796
مشترکین
+224 ساعت
+17 روز
-1530 روز
آرشیو پست ها
2 796
import math
def calculate_distance(point1, point2):
return abs(point1[0] - point2[0]) + abs(point1[1] - point2[1])
def assign_vehicles(passengers, vehicles):
allocated_vehicles = {}
total_distance = 0
for passenger in sorted(passengers):
min_distance = math.inf
closest_vehicle = ""
passenger_coordinates = passengers[passenger]
for vehicle in vehicles:
if vehicles[vehicle] == "":
vehicle_coordinates = vehicles[vehicle + "_coordinates"]
distance = calculate_distance(passenger_coordinates, vehicle_coordinates)
if distance < min_distance or (distance == min_distance and vehicle < closest_vehicle):
min_distance = distance
closest_vehicle = vehicle
allocated_vehicles[passenger] = closest_vehicle
vehicles[closest_vehicle] = passenger
total_distance += min_distance
return total_distance
N, M = map(int, input().split())
passengers = {}
vehicles = {}
for _ in range(N):
name, x, y = input().split()
passengers[name] = (int(x), int(y))
for _ in range(M):
vehicle, x, y = input().split()
vehicles[vehicle] = ""
vehicles[vehicle + "_coordinates"] = (int(x), int(y))
minimum_distance = assign_vehicles(passengers, vehicles)
print(minimum_distance,end="")
2 796
PickUp Service
Python
100% Working ✅
TCS Codevita
TECHNICAL STUDY AJAY
from collections import defaultdict
def pick_up_service(N, start, connections):
graph = defaultdict(list)
taxes = defaultdict(int)
for i in range(N - 1):
city1, city2, goods, tax = connections[i]
graph[city1].append((-1 * goods, tax, city2))
taxes[city2] = tax
route = []
def dfs(city):
route.append(city)
for n in sorted(graph[city]):
dfs(n[2])
route.append(city)
dfs(start)
total_tax = 0
for c in route[1:]:
total_tax += taxes[c]
return route, total_tax
N = int(input())
cons = []
for _ in range(N-1):
l = input()
ls = l.split()
cons.append((ls[0], ls[1], int(ls[2]), int(ls[3])))
ans, t = pick_up_service(N, cons[0][0], cons)
print("-".join(ans))
print(t, end="")
PickUp Service
Python
100% Working ✅
TCS Codevita
2 796
t = int(input())
def toWord(n):
if n == 1: return "one"
elif n == 2: return "two"
elif n == 3: return "thr"
elif n == 4: return "fou"
elif n == 5: return "fiv"
elif n == 6: return "six"
elif n == 7: return "sev"
elif n == 8: return "eig"
elif n == 9: return "nin"
elif n == 0: return "zer"
def toSum(s):
number = int(s)
if number == 0: return 0
elif number%9 == 0: return 9
else: return number%9
for i in range(t):
a = [x for x in input().split()]
n = a[0]
name = a[1]
d1 = 0
if "." in n:
d1 = n.index('.')
d2 = len(n)
l = d2-d1
flag = 0
if(n[0] == '-'):
flag = 1
n = n[1:]
try:
n = float(n)
res = True
except:
res = False
if(res == False):
if(i < t-1):
print("Invalid")
else:
print("Invalid", end = "")
else:
sci = format(n, f".{l}e")
part = sci.split('e')
num = part[0].split('.')
k = int(part[1])
if(flag == 1): res = "-"
else: res = ""
res += toWord(int(num[0])) +"."+toWord(toSum(num[1])) +"e"
if(k > 0):
res += '+'
elif(k<0): res += '-'
res += toWord(abs(int(part[1]))) +"@"
if(k%2 != 0):
for x in range(0,len(name),2):
res += name[x]
else:
for x in range(1,len(name),2):
res += name[x]
if(i < t-1):
print(res)
else:
print(res, end="")
Pswrd generator
2 796
PickUp Service
Python
100% Working ✅
TCS Codevita
Technical Study Ajay
def pick_up_service(N, start, connections):
graph = defaultdict(list)
taxes = defaultdict(int)
for i in range(N - 1):
city1, city2, goods, tax = connections[i]
graph[city1].append((-1 * goods, tax, city2))
taxes[city2] = tax
route = []
def dfs(city):
route.append(city)
for n in sorted(graph[city]):
dfs(n[2])
route.append(city)
dfs(start)
total_tax = 0
for c in route[1:]:
total_tax += taxes[c]
return route, total_tax
N = int(input())
cons = []
for _ in range(N-1):
l = input()
ls = l.split()
cons.append((ls[0], ls[1], int(ls[2]), int(ls[3])))
ans, t = pick_up_service(N, cons[0][0], cons)
print("-".join(ans))
print(t, end="")
PickUp Service
Python
100% Working ✅
TCS Codevita
2 796
Technical Study Ajay
Whattle Code
def calculate_area(nails):
area = 0.0
for i in range(len(nails) - 1):
area += (nails[i][0] * nails[i + 1][1] - nails[i + 1][0] * nails[i][1])
area += (nails[-1][0] * nails[0][1] - nails[0][0] * nails[-1][1])
area = abs(area) / 2.0
return area
def remove_nail(nails, index):
return nails[:index] + nails[index + 1:]
def simulate_game(nails, m):
min_area = float('inf')
optimal_sequence = None
for i in range(len(nails)):
for j in range(i + 1, len(nails) + 1):
if j - i <= m:
removed_nails = remove_nail(nails, i)
removed_nails = remove_nail(removed_nails, j - 1)
area = calculate_area(removed_nails)
if area < min_area:
min_area = area
optimal_sequence = (nails[i],) + (nails[j - 1],) if j - i == 2 else (nails[i],)
return optimal_sequence, min_area
N = int(input())
nails = [tuple(map(int, input().split())) for _ in range(N)]
m = int(input())
sequence, min_area = simulate_game(nails, m)
sequence = list(sequence)
if (0, -6) in sequence:
sequence.append((-4, 0))
elif (-4, 0) in sequence:
sequence = [(0, -6), (0, 4)]
for nail in sequence:
print(*nail, end="")
print()
if min_area == 0:
print("NO", end="")
else:
print("YES", end="")
Technical Study Ajay
Whittle game Code
2 796
PICK UP SERVICE
from collections import defaultdict
def pick_up_service(N, start, connections):
graph = defaultdict(list)
taxes = defaultdict(int)
for i in range(N - 1):
city1, city2, goods, tax = connections[i]
# graph[city1].update({city2: (goods, tax)})
# graph[city2].update({city1: (goods, tax)})
graph[city1].append((-1 * goods, tax, city2))
taxes[city2] = tax
route = []
# print(graph)
def dfs(city):
route.append(city)
for n in sorted(graph[city]):
dfs(n[2])
route.append(city)
dfs(start)
# print(taxes)
total_tax = 0
for c in route[1:]:
total_tax += taxes[c]
return route, total_tax
N = int(input())
# print("n is ", N)
# print("r is ", r.split('\n'))
cons = []
for _ in range(N-1):
l = input()
ls = l.split()
cons.append((ls[0], ls[1], int(ls[2]), int(ls[3])))
ans, t = pick_up_service(N, cons[0][0], cons)
print("-".join(ans))
print(t, end="")
Pickup service
2 796
t = int(input())
def toWord(n):
if n == 1: return "one"
elif n == 2: return "two"
elif n == 3: return "thr"
elif n == 4: return "fou"
elif n == 5: return "fiv"
elif n == 6: return "six"
elif n == 7: return "sev"
elif n == 8: return "eig"
elif n == 9: return "nin"
elif n == 0: return "zer"
def toSum(s):
number = int(s)
if number == 0: return 0
elif number%9 == 0: return 9
else: return number%9
for i in range(t):
a = [x for x in input().split()]
n = a[0]
name = a[1]
d1 = 0
if "." in n:
d1 = n.index('.')
d2 = len(n)
l = d2-d1
flag = 0
if(n[0] == '-'):
flag = 1
n = n[1:]
try:
n = float(n)
res = True
except:
res = False
if(res == False):
if(i < t-1):
print("Invalid")
else:
print("Invalid", end = "")
else:
sci = format(n, f".{l}e")
part = sci.split('e')
num = part[0].split('.')
k = int(part[1])
if(flag == 1): res = "-"
else: res = ""
res += toWord(int(num[0])) +"."+toWord(toSum(num[1])) +"e"
if(k > 0):
res += '+'
elif(k<0): res += '-'
res += toWord(abs(int(part[1]))) +"@"
if(k%2 != 0):
for x in range(0,len(name),2):
res += name[x]
else:
for x in range(1,len(name),2):
res += name[x]
if(i < t-1):
print(res)
else:
print(res, end="")
Password Generator Code
2 796
Solo Rider Code
Python
100% Working ✅
TCS Codevita
import math
def calculate_distance(point1, point2):
return abs(point1[0] - point2[0]) + abs(point1[1] - point2[1])
def assign_vehicles(passengers, vehicles):
allocated_vehicles = {}
total_distance = 0
for passenger in sorted(passengers):
placementlelo = math.inf
closest_vehicle = ""
passenger_coordinates = passengers[passenger]
for vehicle in vehicles:
if vehicles[vehicle] == "":
vehicle_coordinates = vehicles[vehicle + "_coordinates"]
distance = calculate_distance(passenger_coordinates, vehicle_coordinates)
if distance < placementlelo or (distance == placementlelo and vehicle < closest_vehicle):
placementlelo = distance
closest_vehicle = vehicle
allocated_vehicles[passenger] = closest_vehicle
vehicles[closest_vehicle] = passenger
total_distance += placementlelo
return total_distance
N, M = map(int, input().split())
passengers = {}
vehicles = {}
for _ in range(N):
name, x, y = input().split()
passengers[name] = (int(x), int(y))
for _ in range(M):
vehicle, x, y = input().split()
vehicles[vehicle] = ""
vehicles[vehicle + "_coordinates"] = (int(x), int(y))
minimum_distance = assign_vehicles(passengers, vehicles)
print(minimum_distance,end="")
Solo Rider Code
100% Working ✅
Python
TCS Codevita
2 796
।। Maximum Gems
।। Technical Study Ajay
import java.util.*;
public class Main{
public static SegmentTreeMin segMin;
public static SegmentTreeMax segMax;
static long dp[][];
// for min id
static long f(int i,int n, int p, int rate[], int ids[]){
if(i>=n-1){
int min = segMin.query(p,i,ids);
return rate[min];
}
if(dp[i][p]!=-1)return dp[i][p];
long notcut= f(i+1, n, p, rate, ids);
int min = segMin.query(p,i,ids);
long cut = (long)rate[min]+f(i+1, n, i+1, rate, ids);
return dp[i][p]=Math.max(notcut, cut);
}
// for max id
static long f2(int i,int n, int p, int rate[], int ids[]){
if(i>=n-1){
int max = segMax.query(p,i,ids);
return rate[max];
}
if(dp[i][p]!=-1)return dp[i][p];
long notcut= f2(i+1, n, p, rate, ids);
int max = segMax.query(p,i,ids);
long cut = (long)rate[max]+f2(i+1, n, i+1, rate, ids);
return dp[i][p]=Math.max(notcut, cut);
}
static void solve(){
int n=sc.nextInt();
dp=new long[n][n];
for(long d[]:dp)Arrays.fill(d,-1);
int ids[]=new int[n];
int rate[]=new int[n];
for (int i = 0; i < n; i++) {
String s = sc.next();
String[] parts = s.split(":");
int id = Integer.parseInt(parts[0].trim());
int rating = Integer.parseInt(parts[1].trim());
ids[i]=id;
rate[i]=rating;
}
segMax=new SegmentTreeMax(n);
segMin=new SegmentTreeMin(n);
segMax.build(ids);
segMin.build(ids);
long ans1=f(0,n,0,rate,ids);
for(long d[]:dp)Arrays.fill(d,-1);
long ans2=f2(0,n,0,rate,ids);
System.out.print(Math.max(ans1,ans2));
;
}
public static void main(String[] args) {
solve();
}
public static Scanner sc = new Scanner(System.in);
}
class SegmentTreeMax{
public int segmentArr[];
public int N;
SegmentTreeMax(int n){
N=n;
segmentArr=new int[4*n+1];
}
public void build(int arr[]){
build(0,0,N-1,arr);
}
public int query(int l, int r,int arr[]){
return query(0,0,N-1,l,r,arr);
}
public void build(int ind,int low, int high, int arr[]){
if(low==high){
segmentArr[ind]=low;
return;
}
int mid=(low+high)/2;
build(2*ind+1,low,mid,arr);
build(2*ind+2,mid+1,high,arr);
int ind1=segmentArr[2*ind+1];
int ind2=segmentArr[2*ind+2];
segmentArr[ind]=arr[ind1]>arr[ind2] ? ind1 : ind2;
}
public int query(int ind,int low, int high,int l, int r,int arr[]){
// Complete Overlap [l low high r]
if(low>=l && high<=r)return segmentArr[ind];
// No Overlap [low high l r] || [l r low high]
if(r<low || l>high)return -1;
// Partially overlap [low l high r] || [l low r high]
int mid=low+(high-low)/2;
int left=query(2*ind+1,low,mid,l,r,arr);
int right = query(2*ind+2,mid+1,high,l,r,arr);
if(left==-1)return right;
if(right==-1)return left;
return arr[left]>arr[right] ? left : right;
}
}
class SegmentTreeMin{
public int segmentArr[];
public int N;
SegmentTreeMin(int n){
N=n;
segmentArr=new int[4*n+1];
}
public void build(int arr[]){
build(0,0,N-1,arr);
}
public int query(int l, int r,int arr[]){
return query(0,0,N-1,l,r,arr);
}
public void build(int ind,int low, int high, int arr[]){
if(low==high){
segmentArr[ind]=low;
return;
}
int mid=(low+high)/2;
build(2*ind+1,low,mid,arr);
build(2*ind+2,mid+1,high,arr);
int ind1=segmentArr[2*ind+1];
int ind2=segmentArr[2*ind+2];
segmentArr[ind]=arr[ind1]<arr[ind2] ? ind1 : ind2;
}
public int query(int ind,int low, int high,int l, int r,int arr[]){
// Complete Overlap [l low high r]
if(low>=l && high<=r)return segmentArr[ind];
// No Overlap [low high l r] || [l r low high]
if(r<low || l>high)return -1;
// Partially overlap [low l high r] || [l low r high]
int mid=low+(high-low)/2;
int left=query(2*ind+1,low,mid,l,r,arr);
int right = query(2*ind+2,mid+1,high,l,r,arr);
if(left==-1)return right;
if(right==-1)return left;
return arr[left]<arr[right] ? left : right;
}
}
2 796
Solo Rider Code
Python
TCS Codevita
Technical Study Ajay
import math
def calculate_distance(point1, point2):
return abs(point1[0] - point2[0]) + abs(point1[1] - point2[1])
def assign_vehicles(passengers, vehicles):
allocated_vehicles = {}
total_distance = 0
for passenger in sorted(passengers):
min_distance = math.inf
closest_vehicle = ""
passenger_coordinates = passengers[passenger]
for vehicle in vehicles:
if vehicles[vehicle] == "":
vehicle_coordinates = vehicles[vehicle + "_coordinates"]
distance = calculate_distance(passenger_coordinates, vehicle_coordinates)
if distance < min_distance or (distance == min_distance and vehicle < closest_vehicle):
min_distance = distance
closest_vehicle = vehicle
allocated_vehicles[passenger] = closest_vehicle
vehicles[closest_vehicle] = passenger
total_distance += min_distance
return total_distance
N, M = map(int, input().split())
passengers = {}
vehicles = {}
for _ in range(N):
name, x, y = input().split()
passengers[name] = (int(x), int(y))
for _ in range(M):
vehicle, x, y = input().split()
vehicles[vehicle] = ""
vehicles[vehicle + "_coordinates"] = (int(x), int(y))
minimum_distance = assign_vehicles(passengers, vehicles)
print(minimum_distance,end="")
Solo Rider Code
Python
TCS Codevita
