sdasd

Author: kumar80

209d.cpp

@@ -76,6 +76,7 @@ void dfs(int u, int p){
         e.push_back(u);
       }    
 }
+
 void build(int i, int l , int r){
     if(l==r){
        seg[i] = e[l];

a.out

@@ -1,21 +1,21 @@
 #!/bin/bash
 # A sample Bash script, by Ryan
 
-g++ tgen.cpp
-./a.out > in.txt
-cat in.txt
+# g++ tgen.cpp
+# ./a.out > in.txt
+# cat in.txt
 
-g++ wo.cpp
-./a.out < in.txt  > sol.txt
+# g++ wo.cpp
+# ./a.out < in.txt  > sol.txt
 g++ $1
 ./a.out < in.txt > out.txt
 
-if [[ $(diff sol.txt out.txt ) ]]; then
-    echo ***********************DIFFERENT ANSWER***********************
-    cat sol.txt out.txt 
-else
-    echo "Match 100%"
-fi
+# if [[ $(diff sol.txt out.txt ) ]]; then
+#     echo ***********************DIFFERENT ANSWER***********************
+#     cat sol.txt out.txt 
+# else
+#     echo "Match 100%"
+# fi
 echo DONE!
 
 

check.sh

@@ -94,4 +94,23 @@ int main(){
         cout<<mx<<"\n";
     }
 }
-  
+1
+5 1
+1 2
+6 7
+9 12
+24 24
+41 50
+
+2
+5 4
+1 2
+6 7
+9 12
+24 24
+41 50
+14 24 24 4
+1 1
+42 42
+24
+5

fb3.cpp

@@ -0,0 +1,157 @@
+#include<bits/stdc++.h>
+using namespace std;
+ 
+#define fastio ios_base::sync_with_stdio(0); cin.tie(0)
+#define LL long long 
+#define mod 1000000007 
+#define all(v) v.begin()+1,v.end()
+#define FOR(i, j, k) for (auto i=j ; i<k ; i++)
+#define ROF(i, j, k) for (auto i=j ; i>=k ; i--) 
+#define debug(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
+#define time__(d) for(long blockTime = 0; (blockTime == 0 ? (blockTime=clock()) != 0 : false); debug("%s time : %.4fs", d, (double)(clock() - blockTime) / CLOCKS_PER_SEC))
+
+const long long INF = 1e18;
+const long long MAX = 1e5+10;
+
+struct pt{
+    LL l,r;
+    pt(LL x, LL y){
+      l=x; r=y;
+    }
+};
+
+struct node{
+  pt key;
+  node *left,*right;
+};
+
+node* newNode(pt key){
+  node* temp =  (struct node*)malloc(sizeof(struct node));
+  temp->key = key;
+  temp->left = temp->right = NULL;
+  return temp;
+}
+
+node* insert(node* root, pt key){
+  if(root==NULL)
+    return newNode(key);
+  if(key.r < root->key.l)
+    root->left = insert(root->left, key);
+  else
+    root->right = insert(root->right, key);
+
+  return root;
+}
+
+node* minNode(node* node){
+    struct node* current = node; 
+    while (current && current->left != NULL)
+        current = current->left;
+ 
+    return current;
+}
+
+node* deleteNode(node* root, pt key){
+  if(root==NULL) return root;
+
+  if(key.r  < root->key.l)
+    root->left = deleteNode(root->left, key);
+  else if( key.l > root->key.r)
+    root->right = deleteNode(root->right, key);
+  else {
+    if (root->left == NULL && root->right == NULL)        
+            return NULL;
+    else if(root->left == NULL){
+      node *temp  = root->right;
+      free(root);
+      return temp;
+    }else if(root->right == NULL){
+      node *temp  = root->left;
+      free(root);
+      return temp;
+    }
+      node* temp = minNode(root->right);
+      root->key = temp->key;
+      root->right = deleteNode(root->right, temp->key);
+  }
+    return root;
+}
+
+// node* search(node* root, pt key){
+//   if(root==NULL || (root->key.l == key.l && root->key.r==key.r))
+//     return root;
+//   if(root->key.r < key.l)
+//     return search(root->right,key);
+    
+//   return search(root->left,key);
+// }
+
+void inorder(struct node* root)
+{
+    if (root != NULL) {
+        inorder(root->left);
+        cout<<root->key.l<<" "<<root->key.r<<"\n"; 
+        inorder(root->right);
+    }
+}
+void search(node* root, pt &key, LL &d, LL x){
+    if(root==NULL) return;
+    if(root->key.l<=x && root->key.r>=x){
+        d=0; key.l=root->key.l;
+        key.r = root->key.r;
+    }
+    else if(root->key.l> x){
+        if(root->key.l-x <d || (root->key.l-x == d && key.l>root->key.r)){
+           d = root->key.l-x;
+           key.l = root->key.l;
+           key.r = root->key.r;
+        }
+        search(root->left,key,d,x);
+    }
+    else {
+        if(x-root->key.r <d || (x-root->key.r == d && key.l>root->key.r)){
+           d = x-root->key.r;
+           key.l = root->key.l;
+           key.r = root->key.r;
+        }
+        search(root->right,key,d,x);
+    }
+}
+int main(){
+  time__("TT:")
+{    fastio;
+    int t=1; cin>>t; int T=1;
+    while(t--){
+      node* root = NULL;
+      int n,m; cin>>n>>m;
+      FOR(i,0,n){
+        LL x,y; cin>>x>>y;
+        root = insert(root,pt(x,y));
+      }
+      cout<<"Case #"<<T++<<": ";
+      FOR(i,0,m){
+        LL x; cin>>x;
+        LL d = 1e18;
+        pt p = pt(INT_MAX, INT_MAX);
+        search(root,p,d,x);
+        root = deleteNode(root, pt(p.l,p.r));
+        int k=x-d>=p.l && x-d<=p.r?x-d:x+d;
+        
+        cout<<k<<" ";
+        if(p.l == p.r) continue;
+        if(p.l == k)
+          root = insert(root,pt(k+1,p.r));
+        else if(p.r==k)
+          root = insert(root,pt(p.l,k-1));
+        else {
+          root = insert(root,pt(p.l,k-1));
+          root = insert(root,pt(k+1,p.r));
+        }
+      //  cout<<i<<"= \n";        
+       // cout<<p.l<<" "<<p.r<<" "<<d<<" "<<k<<";; \n";
+
+       // inorder(root); cout<<"\n***\n";
+      }
+      cout<<"\n";
+    }}
+}