From 54467f78773f3a109cffc71ff37d80ab7ff15ae3 Mon Sep 17 00:00:00 2001
From: vinay <vinay@vinay.com>
Date: Sat, 16 Dec 2017 16:57:03 +0530
Subject: [PATCH 1/3] Checking

---
 nonogram.cpp | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/nonogram.cpp b/nonogram.cpp
index 4ecc547..e38fdf3 100644
--- a/nonogram.cpp
+++ b/nonogram.cpp
@@ -2,7 +2,7 @@
 
 using namespace std;
 
-
+// some predefined values
 #define pb push_back
 #define mp make_pair
 #define ii insert

From 07da553564ce9882ca71336d1ac361e8d6b04853 Mon Sep 17 00:00:00 2001
From: Vinay Aggarwal <vinagg9827@gmail.com>
Date: Sat, 10 Mar 2018 17:05:31 +0530
Subject: [PATCH 2/3] Add files via upload

---
 finalsover.cpp   | 314 +++++++++++++++++++++++++++++++++++++++++++++++
 map_function.cpp | 119 ++++++++++++++++++
 2 files changed, 433 insertions(+)
 create mode 100644 finalsover.cpp
 create mode 100644 map_function.cpp

diff --git a/finalsover.cpp b/finalsover.cpp
new file mode 100644
index 0000000..286a079
--- /dev/null
+++ b/finalsover.cpp
@@ -0,0 +1,314 @@
+
+// FINAL-LEFTMOST SOLVER PART-1 !!!
+
+#include<bits/stdc++.h>
+ 
+using namespace std;
+#define ll long long 
+#define ull unsigned long long 
+#define ld long double
+#define fi first
+#define se second
+#define pb push_back
+#define mp make_pair
+ 
+int a[100005];
+int n;
+int b[100005];
+vector<int> query;
+pair<int,int> start_end[1000];
+int q,flag=1;  
+
+
+
+void initial()
+{
+  for(int i=0;i<n;i++){
+      cin>>a[i];
+   }
+}
+
+void simplesol(int l1, int r1, int q1)
+{
+  vector<int> filled;
+   vector<int> empty;
+   
+   
+   for(int i=l1;i<r1;i++){
+    if(a[i]==4)empty.pb(i); // position of empty blocks
+    if(a[i]==1)filled.pb(i); // position of filled blocks
+   }
+
+   int k=l1;  // index of array 
+   int l=q1;  // index of the clues
+   int total=query.size();
+
+   while(k<r1&&l<total){  // while we reach the end of array of the or all the clues are used
+    int x=query[l];
+    int check=1;
+    //cout<<k<<endl;
+    for(int i=k;i<k+x;i++){
+        if(a[i]==1||b[i]==3){
+            check=0;
+            break;
+        }
+
+    }
+
+    if(k+x<r1){
+        if(a[k+x]==4)  // if the element just after the block is filled we can't place the block
+        check=0;
+    }
+    if(k>l1){
+        if(a[k-1]==4)check=0;   // if the element just before the bolck is filled we can't place the block
+    }
+    if(check==1){
+        //cout<<k<<endl;
+        for(int i=k;i<k+x;i++){
+            //if(b[i]!=4)
+            b[i]=3;  // it is the left most solution
+        }
+        k+=x;       // move to next of next cell
+
+    }
+    k++;
+    if(check==1)  // if check==1 we move to the next clue;
+    l++;            
+   }
+
+
+}
+
+void inputquery()
+{
+   for(int i=0;i<q;i++){
+    int x;
+    cin>>x;
+    query.pb(x);
+   }
+}
+
+vector<int> assign(int l1,int r1)
+{
+   vector<int> assigned;
+   for(int i=l1;i<r1;i++){
+    if(b[i]!=3&&a[i]==4){
+      assigned.pb(i);
+    }
+   }
+   return assigned;
+}
+
+
+void startend()
+{
+  int idx=0;
+  int i=0;
+  while(i<n){
+    if(b[i]==3){
+        start_end[idx].fi=i;
+        i++;
+        while(b[i]==3){
+            i++;
+        }
+        i--;
+        start_end[idx].se=i;
+        //cout<<start_end[idx].fi<<" "<<start_end[idx].se<<endl;
+        idx++;
+    }
+    i++;
+  }
+
+}
+
+
+void final_output()
+{
+  for(int i=0;i<n;i++){
+    cout<<b[i]<<" ";
+   }
+}
+
+int getblock(int pos,int j)
+{
+  for(int i=j;i>=0;i--)
+  {
+    if(start_end[i].second<pos)
+      return i;
+  }
+  return -1;
+}
+
+void reposition(int x, int s)
+{
+  
+}
+
+int firstpart(int pos,int x,int rep)
+{
+      int l,r;
+
+      l=start_end[x].fi;
+      r=start_end[x].se;
+
+      int tempx=l;
+      int tempy=r;
+      //cout<<tempx<<" "<<tempy<<endl;
+      int done=0;
+
+      // bolck just to the right of unassigned solid
+      
+
+        l+=pos-r;
+        r=pos;
+
+        // while the block overlaps the solid
+        while(l<=pos&&r>=pos){
+          
+          int chk=1;
+
+          // not a valid position if empty cell lies
+          for(int i=l;i<r;i++){
+            if(a[i]==1){
+              chk=0;
+              break;
+            }
+          }
+
+          // not a valid position if another block is adjacent
+          if(a[l-1]==3||a[l-1]==4||a[r+1]==3||a[r+1]==4){
+            chk=0;
+          }
+          // if invalid position then move the block
+          if(chk==0){
+            l++;
+            r++;
+            continue;
+          }
+          // if valid position the mark all the unassigned solids in this range as solid
+          if(chk==1)
+          {
+            done=1;
+
+            // removing the old block
+            for(int i=tempx;i<=tempy;i++)b[i]=0;
+
+            // removing the earlier assigned blocks
+            for(int i=tempx;i<=tempy;i++){
+              if(a[i]==4)assigned.pb(i);
+            }
+
+            
+           // for(int i=tempx;i<=tempy;i++){
+             // if(a[i]==4)assigned.pb();
+            //}
+
+            // adding the new block
+            for(int i=l;i<=r;i++)
+              b[i]=3;
+
+            if(r+1<n)
+              b[r+1]=1;
+
+            if(rep==1)
+              reposition(x,r+1);
+
+              break;
+          }
+
+        }
+  return done;
+}
+
+void checker()
+{
+    int y=query.size()-1;
+    while(assigned.size()!=0)
+    {
+
+
+     int pos=assigned[assigned.size()-1];
+     //cout<< pos<<endl;
+     assigned.pop_back();
+     //assigned.pop();
+
+      // block is already assigned
+      if(b[pos]==3){
+        continue;
+      }
+      // rightmost unassigned solid
+      int y=getblock(pos,y);
+      if(y==-1)
+      {
+        flag=0;
+        return;
+      }
+      int x=firstpart(pos,y,0);
+      
+      if(x==1)
+        {
+          y--;
+          break;
+         } 
+      else
+      {
+        int chk=0;
+        while(y>0&&x!=1)
+        {
+          y--;
+          x=firstpart(pos,y,1);
+          if(x==1)
+            {
+              chk=1;
+              break;
+            } 
+        }
+        if(chk)
+          continue;
+        else
+        {
+          flag=0;
+          break;
+        }
+
+      }
+   }
+   
+}
+
+void printsimplesol()
+{
+  for(int i=0;i<n;i++)
+    cout<<b[i]<<" ";
+  cout<<endl;
+}
+
+// 0 - dont know
+// 1 - empty
+// 3 - leftmost solution
+// 4 - filled
+
+int main() 
+{
+   ios_base::sync_with_stdio(false);
+   cin.tie(NULL);
+   freopen("input.txt","r",stdin);
+   
+   // run SIMPLE-LEFTMOST SOLVER
+   //vector<int> arr=sipleLeftSolver();
+
+   cin>>n;
+   cin>>q;
+
+   inputquery(); // l se r ki zaroorat shayad na ho
+   initial();   // l se r ki zaroorat shayad na ho
+   simplesol(l1,r1,q1); // starting from array index l1 upto r1 and q1 denotes the query from which it will start running
+   vector<int> assign_block;
+   assign_block = assign(l1,r1); // to get the assigned blocks in the range l1 to r1
+   printsimplesol();
+   startend();
+   checker();
+   final_output();
+
+   return 0;
+}
\ No newline at end of file
diff --git a/map_function.cpp b/map_function.cpp
new file mode 100644
index 0000000..a702cce
--- /dev/null
+++ b/map_function.cpp
@@ -0,0 +1,119 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+// x= horizonal y= going to bottom right z=going to bottom left
+
+int grid[201][201];
+int n=10;
+
+void map_func(vector<int> l, int x, int y, int z)
+{
+	if(x)
+	{
+		for(int i=100-x+1;i<=100+x-1;i++)
+			grid[x][i]=l[i+x-101];
+	}
+	else if(y)
+	{
+		int i=101-y, j=y;
+		int k=0,p=-1;
+		while(j<=n&&k<l.size())
+		{
+			grid[j][i]=l[k++];
+			if(p==-1)
+			{
+				j++;
+				p=1;
+			}	
+			else
+			{
+				i++;
+				p=-1;
+			}
+		}
+	}
+	else
+	{
+		int i=99+y, j=y;
+		int k=0,p=-1;
+		while(j<=n&&k<l.size())
+		{
+			grid[j][i]=l[k++];
+			if(p==-1)
+			{
+				j++;
+				p=1;
+			}	
+			else
+			{
+				i--;
+				p=-1;
+			}
+		}
+	}
+
+}
+
+void print_grid()
+{
+	for (int i=1;i<=n;i++)
+	{
+		for(int k=0;k<n-i;k++)
+		cout<<" ";
+		for(int j=100-i+1;j<=100+i-1;j++)
+		{
+			if(grid[i][j]==1)
+			cout<<"*";
+			else
+			cout<<"%";
+		}
+		for(int k=0;k<n-i;k++)
+		cout<<" ";
+		cout<<endl;
+	}
+	
+/*	for(int i=0;i<11;i++)
+		{
+			for(int j=50;j<150;j++)
+			{
+				if(grid[i][j]==2)
+				cout<<"$";
+				else if(grid[i][j]==1)
+					cout<<"*";
+				else if(grid[i][j]==0)
+					cout<<"#";
+			}	
+
+			cout<<endl;
+		}*/	
+}
+
+void initialize()
+{
+	for(int i=0;i<201;i++)
+		{
+			for(int j=0;j<201;j++)
+			grid[i][j]=2;
+		}	
+}
+
+int main()
+{
+	vector<int> l;
+
+	l.push_back(1);
+	l.push_back(1);
+	l.push_back(1);
+	l.push_back(1);
+	l.push_back(1);
+	l.push_back(1);
+	l.push_back(1);
+
+	initialize();
+
+	map_func(l,0,7,0);
+
+	print_grid();
+
+	return 0;
+}

From 6f84738978ae2793cdbcf10d1e5f1593b0979de8 Mon Sep 17 00:00:00 2001
From: Vinay Aggarwal <vinagg9827@gmail.com>
Date: Sat, 10 Mar 2018 17:09:46 +0530
Subject: [PATCH 3/3] Add files via upload

---
 finalsover(1).cpp | 278 ++++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 278 insertions(+)
 create mode 100644 finalsover(1).cpp

diff --git a/finalsover(1).cpp b/finalsover(1).cpp
new file mode 100644
index 0000000..5edf2b9
--- /dev/null
+++ b/finalsover(1).cpp
@@ -0,0 +1,278 @@
+
+// FINAL-LEFTMOST SOLVER PART-1 !!!
+
+#include<bits/stdc++.h>
+ 
+using namespace std;
+#define ll long long 
+#define ull unsigned long long 
+#define ld long double
+#define fi first
+#define se second
+#define pb push_back
+#define mp make_pair
+ 
+//vector<list<int>> v;
+//ll b[200005];
+//ll a[300005],b[300005],c[300005];
+//ll a[1001005];
+//pair<int,int> a[1000005];
+//vector<ll> l;
+//pair<int,int>p;
+//pair<ll,int> a[500005];
+//vector<int> adj[100005];
+//unordered_set<int> s;
+
+bool comp(const int a,const int b){
+    return a<b;
+}
+ 
+bool RelativelyPrime (int a, int b) { 
+   return (a<b) ? RelativelyPrime(b,a) : !(a%b) ? (b==1) : RelativelyPrime (b, a%b);
+}
+
+int a[100005];
+int n;
+int b[100005];
+vector<int> query;
+vector<int> assigned;
+pair<int,int> start_end[1000];
+int q;  
+
+
+void initial()
+{
+  for(int i=0;i<n;i++){
+      cin>>a[i];
+   }
+}
+
+void simplesol()
+{
+  vector<int> filled;
+   vector<int> empty;
+   
+   
+   for(int i=0;i<n;i++){
+    if(a[i]==4)empty.pb(i); // position of empty blocks
+    if(a[i]==1)filled.pb(i); // position of fillde blocks
+   }
+
+   int k=0;  // index of array 
+   int l=0;  // index of the clues
+   int total=query.size();
+
+   while(k<n&&l<total){  // while we reach the end of array of the or all the clues are used
+    int x=query[l];
+    int check=1;
+    //cout<<k<<endl;
+    for(int i=k;i<k+x;i++){
+        if(a[i]==1||b[i]==3){
+            check=0;
+            break;
+        }
+
+    }
+
+    if(k+x<n){
+        if(a[k+x]==4)  // if the element just after the block is filled we can't place the block
+        check=0;
+    }
+    if(k>0){
+        if(a[k-1]==4)check=0;   // if the element just before the bolck is filled we can't place the block
+    }
+    if(check==1){
+        //cout<<k<<endl;
+        for(int i=k;i<k+x;i++){
+            //if(b[i]!=4)
+            b[i]=3;  // it is the left most solution
+        }
+        k+=x;       // move to next of next cell
+
+    }
+    k++;
+    if(check==1)  // if check==1 we move to the next clue;
+    l++;            
+   }
+
+
+}
+
+void inputquery()
+{
+   for(int i=0;i<q;i++){
+    int x;
+    cin>>x;
+    query.pb(x);
+   }
+}
+
+void assign()
+{
+   for(int i=0;i<n;i++){
+    if(b[i]!=3&&a[i]==4){
+      assigned.pb(i);
+    }
+   }
+}
+
+
+void startend()
+{
+  int idx=0;
+  int i=0;
+  while(i<n){
+    if(b[i]==3){
+        start_end[idx].fi=i;
+        i++;
+        while(b[i]==3){
+            i++;
+        }
+        i--;
+        start_end[idx].se=i;
+        //cout<<start_end[idx].fi<<" "<<start_end[idx].se<<endl;
+        idx++;
+    }
+    i++;
+  }
+
+}
+
+
+void final_output()
+{
+  for(int i=0;i<n;i++){
+    cout<<b[i]<<" ";
+   }
+}
+
+void checker()
+{
+
+    while(assigned.size()!=0){
+
+
+     int pos=assigned[assigned.size()-1];
+     //cout<< pos<<endl;
+     assigned.pop_back();
+     //assigned.pop();
+
+      // block is already assigned
+      if(b[pos]==3){
+        continue;
+      }
+      // rightmost unassigned solid
+     
+      int l,r;
+      for(int i=q-1;i>=0;i--){
+
+     
+
+        l=start_end[i].fi;
+        r=start_end[i].se;
+
+        int tempx=l;
+        int tempy=r;
+        //cout<<tempx<<" "<<tempy<<endl;
+        int done=0;
+
+        // bolck just to the right of unassigned solid
+        if(r<pos){
+
+          l+=pos-r;
+          r=pos;
+
+          // while the block overlaps the solid
+          while(l<=pos&&r>=pos){
+            
+            int chk=1;
+
+            // not a valid position if empty cell lies
+            for(int i=l;i<r;i++){
+              if(a[i]==1){
+                chk=0;
+                break;
+              }
+            }
+
+            // not a valid position if another block is adjacent
+            if(a[l-1]==3||a[l-1]==4||a[r+1]==3||a[r+1]==4){
+              chk=0;
+            }
+            // if invalid position then move the block
+            if(chk==0){
+              l++;
+              r++;
+              continue;
+            }
+            // if valid position the mark all the unassigned solids in this range as solid
+            if(chk==1){
+              done=1;
+
+              // removing the old block
+              for(int i=tempx;i<=tempy;i++)b[i]=0;
+
+              // removing the earlier assigned blocks
+              for(int i=tempx;i<=tempy;i++){
+                if(a[i]==4)assigned.pb(i);
+              }
+
+              
+
+             // for(int i=tempx;i<=tempy;i++){
+               // if(a[i]==4)assigned.pb();
+              //}
+
+              // adding the new block
+              for(int i=l;i<=r;i++)b[i]=3;
+
+                break;
+            }
+
+          }
+          if(done==1){
+            break;
+
+          }
+        }
+      }
+
+   }
+   
+}
+
+void printsimplesol()
+{
+  for(int i=0;i<n;i++)
+    cout<<b[i]<<" ";
+  cout<<endl;
+}
+
+// 0 - dont know
+// 1 - empty
+// 3 - leftmost solution
+// 4 - filled
+
+int main() 
+{
+   ios_base::sync_with_stdio(false);
+   cin.tie(NULL);
+   freopen("input.txt","r",stdin);
+   
+   // run SIMPLE-LEFTMOST SOLVER
+   //vector<int> arr=sipleLeftSolver();
+
+   cin>>n;
+   cin>>q;
+
+   inputquery();
+   initial();
+   simplesol();
+   assign();
+   printsimplesol();
+   startend();
+   checker();
+   final_output();
+
+   return 0;
+}
\ No newline at end of file