Cách đa năng hoá toán tử < , và những lợi ích của nó trong set,map.

 Đề bài: https://codeforces.com/problemset/problem/608/A

Code:

  1. #include<bits/stdc++.h>
  2. using namespace std;
  3. #define ll long long
  4. struct cap{
  5. ll tang,tg;
  6. };
  7. // bool tmp(cap a, cap b){
  8. // if(a.tang==b.tang) return a.tg<b.tg;
  9. // else return a.tang>b.tang;
  10. // }
  11. bool operator < (const cap& a, const cap& b){
  12. if(a.tang==b.tang) return a.tg<b.tg;
  13. return a.tang>b.tang;
  14. }
  15. int main(){
  16. // freopen("input.txt","r",stdin);
  17. // freopen("output.txt","w",stdout);
  18. ll n,s;
  19. set<cap> ss;
  20. cin>>n>>s;
  21. cap arr[n];
  22. ll i;
  23. for(i=0;i<n;i++){
  24. cin>>arr[i].tang>>arr[i].tg;
  25. ss.insert(arr[i]);
  26. }
  27. // for(auto pp: ss){
  28. // cout<<pp.tang<<" "<<pp.tg<<'\n';
  29. // }
  30. sort(arr,arr+n);
  31. // for(i=0;i<n;i++){
  32. // cout<<arr[i].tang<<" "<<arr[i].tg<<'\n';
  33. // }
  34. ll tructhoigian = 0;
  35. ll vt = s;
  36. for(i=0;i<n;i++){
  37. tructhoigian = tructhoigian + (vt-arr[i].tang);
  38. vt=arr[i].tang;
  39. if(arr[i].tg>tructhoigian) tructhoigian = arr[i].tg;
  40. }
  41. if(vt>0){
  42. tructhoigian+=vt;
  43. }
  44. cout<<tructhoigian;
  45. }

Nhận xét

Đăng nhận xét

Bài đăng phổ biến từ blog này

Sinh Test trong Python va code AC

P1: #file = "C:/New folder/aka/1.inp" #with open(file) as f: # a,b=[int(x) for x in next(f).split()] #print(a) #print(b) def gg(id): file= "C:/New folder/aka/" +id+ ".inp" with open (file) as f: a,b=[ int (x) for x in next (f).split()] products = set () for pair in [(x,y) for x in range ( 2 ,a+ 1 ) for y in range ( 2 ,b+ 1 )]: products.add(pair[ 0 ]**pair[ 1 ]) return len (products) x= range ( 1 , 101 ) for i in x: id= str (i) file1 = "C:/New folder/aka/" +id+ ".out" f= open (file1, "w" ) f.write( str (gg(id))) f.close() P2: a,b=[ int (x) for x in input ().split()] product = set () for pair in [(x,y) for x in range ( 2 ,a+ 1 ) for y in range ( 2 ,b+ 1 )]: product.add(pair[ 0 ]**pair[ 1 ]) print ( len (product))
Đọc thêm

Cách tính a*b mod m , a^b mod m , a^(-1) mod m với m không phải là số nguyên tố (inversion có nghĩa khi (a,m)=1)

#include <bits/stdc++.h> using namespace std ; #define ll long long #define MOD (ll)(1000000000000000009) ll inv ( ll a , ll mod ){ ll r = mod ; ll nr = a ; ll t = 0 ; ll nt = 1 ; ll tmp ; while ( nr != 0 ){ ll q = r / nr ; tmp = nt ; nt = t - q * nt ; t = tmp ; tmp = nr ; nr = r - q * nr ; r = tmp ; } if ( r > 1 ) return - 1 ; // no inverse if ( t < 0 ) t += mod ; return t ; } ll f ( ll a , ll n , ll mod ){ ll res = a , ans = 0 ; while ( n ){ if ( n % 2 ) ans = ( ans + res ) % mod ; res = ( res + res ) % mod ; n /= 2 ; } return ans ; } ll po ( ll a , ll n , ll mod ){ ll res = a , ans = 1 ; while ( n ){ if ( n % 2 ) ans = f ( ans , res , mod ); res = f ( res , res , mod ); n /= 2 ; } return ans ; } int main (){ ll x , y , z , m , dem = 0 , res1 , res2 , res , tmp
Đọc thêm

Python - Liệt kê tất các các chu trình trong đồ thị

graph = [[1, 2], [1, 3], [1, 4], [2, 3], [3, 4], [2, 6], [4, 6], [8, 7], [8, 9], [9, 7]] cycles = [] def main(): global graph global cycles for edge in graph: for node in edge: findNewCycles([node]) for cy in cycles: path = [str(node) for node in cy] s = ",".join(path) print(s) def findNewCycles(path): start_node = path[0] next_node= None sub = [] #visit each edge and each node of each edge for edge in graph: node1, node2 = edge if start_node in edge: if node1 == start_node: next_node = node2 else: next_node = node1 if not visited(next_node, path): # neighbor node not on path yet sub = [next_node] sub.extend(path) # explore extended path findNewCycles(sub); e
Đọc thêm