From db091866d5834837a02a4a392705e81ed283c249 Mon Sep 17 00:00:00 2001
From: Darren Ha <nberserk@gmail.com>
Date: Mon, 11 May 2015 13:36:47 +0900
Subject: [PATCH] ramces ... ; HosukRastaurnat done;

---
 .../xcshareddata/codejam.xccheckout           |   4 +-
 cpp/codejam/sotong/HosukRestaurant.cpp        | 167 ++++++++++++++++++
 cpp/codejam/sotong/HosukRestaurant.txt        |  18 ++
 cpp/codejam/sotong/ramcesGarden.cpp           | 132 ++++++++------
 cpp/codejam/sotong/ramcesGarden.txt           |  32 ++--
 5 files changed, 280 insertions(+), 73 deletions(-)
 create mode 100644 cpp/codejam/sotong/HosukRestaurant.cpp
 create mode 100644 cpp/codejam/sotong/HosukRestaurant.txt

diff --git a/cpp/codejam.xcodeproj/project.xcworkspace/xcshareddata/codejam.xccheckout b/cpp/codejam.xcodeproj/project.xcworkspace/xcshareddata/codejam.xccheckout
index 32d52af..3e80418 100644
--- a/cpp/codejam.xcodeproj/project.xcworkspace/xcshareddata/codejam.xccheckout
+++ b/cpp/codejam.xcodeproj/project.xcworkspace/xcshareddata/codejam.xccheckout
@@ -7,14 +7,14 @@
 	<key>IDESourceControlProjectIdentifier</key>
 	<string>FCD35A5D-6DCF-4089-BEC9-F01A76C27723</string>
 	<key>IDESourceControlProjectName</key>
-	<string>project</string>
+	<string>codejam</string>
 	<key>IDESourceControlProjectOriginsDictionary</key>
 	<dict>
 		<key>2D0A34A56895B8218D331D945207F18F09C45FEF</key>
 		<string>https://github.com/nberserk/codejam.git</string>
 	</dict>
 	<key>IDESourceControlProjectPath</key>
-	<string>cpp/codejam.xcodeproj/project.xcworkspace</string>
+	<string>cpp/codejam.xcodeproj</string>
 	<key>IDESourceControlProjectRelativeInstallPathDictionary</key>
 	<dict>
 		<key>2D0A34A56895B8218D331D945207F18F09C45FEF</key>
diff --git a/cpp/codejam/sotong/HosukRestaurant.cpp b/cpp/codejam/sotong/HosukRestaurant.cpp
new file mode 100644
index 0000000..2a8a91a
--- /dev/null
+++ b/cpp/codejam/sotong/HosukRestaurant.cpp
@@ -0,0 +1,167 @@
+#include <algorithm>
+#ifdef _MSC_VER
+#include <io.h>
+#define F_OK 0
+#else
+#include <unistd.h>
+#endif
+#include <stdio.h>
+#include <math.h>
+#include <vector>
+#include <map>
+#include <queue>
+#include <time.h>
+#include <string>
+#include <sstream>
+#include <string.h>
+#include <stack>
+#include <list>
+#include <limits>
+#include <set>
+#include <iostream>
+//#include "../myutil.h"
+
+
+using namespace std;
+#define H_MAX 987654321
+#define H_MIN -987654321
+#define H_EPSILON 0.000001
+#define MOD 100000 
+typedef long long ll;
+
+
+void check(bool ret){
+    if (ret==false) {
+        printf("failed\n");
+    }
+}
+void check(int expected, int actual){
+    if (expected!=actual) {
+        printf("failed expected=%d, actual=%d\n", expected, actual);
+    }
+}
+void check(char expected, char actual){
+    if (expected!=actual) {
+        printf("failed expected=%c, actual=%c\n", expected, actual);
+    }
+}
+
+//#define MAX_N 1000001
+#define MAX_N 500000
+bool gDebug;
+int gN;
+struct Price{
+	int a,b;	
+};
+
+Price price[MAX_N];
+int gMinAFromBack[MAX_N];
+int gMinAMinusB[MAX_N];
+long long gSumB[MAX_N];
+
+void swap(int i,int j){
+	Price t = price[i];
+	price[i]= price[j];
+	price[j]=t;
+}
+
+int partition(int s, int e){
+	int p = price[e].b;
+
+	int j=s-1;
+	for(int i=s;i<e;i++){
+		if(price[i].b < p){
+			j++;
+			swap(i,j);
+		}
+	}
+	swap(e, j+1);
+	return j+1;
+}
+
+void qsort(int s, int e){
+	if (s<e){
+		int m = partition(s,e);
+		qsort(s,m-1);
+		qsort(m+1,e);
+	}
+}
+
+// case 1: sum(1-k) min(-Bt+At)
+// case 2: sum(1-(k-1)) + minA(k-N)
+void solve(){	
+	qsort(0, gN-1);
+
+    gSumB[0] = price[0].b;    
+    int m=price[0].a-price[0].b;
+    gMinAMinusB[0] = m;
+    for (int i = 1; i < gN; i++){
+        gSumB[i]= (gSumB[i-1] + price[i].b);
+        int d = price[i].a-price[i].b;
+        if (d<m){
+            m=d;            
+        }
+        gMinAMinusB[i]=m;
+    }
+    
+    m =price[gN-1].a;
+    gMinAFromBack[gN-1]=m;
+    for (int i = gN-2; i >= 0; i--){
+        if (price[i].a < m){
+            m=price[i].a;
+        }
+        gMinAFromBack[i]=m;
+    }    
+
+    ll r=gMinAFromBack[0]; // K=1
+    r+=gSumB[gN-1]+gMinAMinusB[gN-1] ;//K=N
+    ll a,b,d;
+    for (int i = 1; i < gN-1; i++){
+        a = gSumB[i]+gMinAMinusB[i];
+        b = gSumB[i-1] + gMinAFromBack[i+1];
+        d = a>b ? b:a;        
+        r += d;
+        r %=MOD;
+    }    
+    printf("%d\n", r);
+}
+
+void test(){
+  
+}
+
+int main(){
+    string fn = __FILE__;
+    size_t pos = fn.find(".cpp");
+    fn = fn.substr(0,pos) + ".txt";
+    if (access(fn.c_str(), F_OK)!=-1) {
+        gDebug = true;
+    }
+
+    FILE *fp;
+    if (gDebug) {
+        fp = freopen(fn.c_str(), "r", stdin);
+    }
+
+    //h_generateRandomMap(100);
+        //test();
+    //precalc();
+    
+    // handling input
+    int count, p,j,k, i,n;
+    scanf("%d", &count);
+    for (p=0; p<count; p++) {    
+		scanf("%d", &gN);
+		for(int i=0;i<gN;i++){
+			scanf("%d %d", &price[i].a, &price[i].b);			
+		}       
+        solve();
+    }
+    
+    if (gDebug) {
+        fclose(fp);
+    }
+    return 0;
+    
+}
+
diff --git a/cpp/codejam/sotong/HosukRestaurant.txt b/cpp/codejam/sotong/HosukRestaurant.txt
new file mode 100644
index 0000000..e536ed9
--- /dev/null
+++ b/cpp/codejam/sotong/HosukRestaurant.txt
@@ -0,0 +1,18 @@
+3
+3
+10 5
+9 3
+10 5
+2
+100 1
+1 100
+5
+1000000000 1000000000
+1000000000 1000000000
+1000000000 1000000000
+1000000000 1000000000
+1000000000 1000000000
+3
+1 5
+1 10
+7 4
diff --git a/cpp/codejam/sotong/ramcesGarden.cpp b/cpp/codejam/sotong/ramcesGarden.cpp
index 0a5031f..1fa5403 100644
--- a/cpp/codejam/sotong/ramcesGarden.cpp
+++ b/cpp/codejam/sotong/ramcesGarden.cpp
@@ -49,6 +49,8 @@ void check(char expected, char actual){
     }
 }
 
+//#define MAX_N 1000001
+#define MAX_N 20
 bool gDebug;
 int gN, gM; 
 int gCount[5][5][1000000];
@@ -56,26 +58,33 @@ int gCount[5][5][1000000];
 // L_N : ends L, 
 // L_L : ends L, LL showed up before
 // L_P : ends L, PP showed up before
-int L_N[1000001];
-int L_L[1000001];
-int L_P[1000001];
-int P_N[1000001];
-int P_L[1000001];
-int P_P[1000001];
+int L_N[MAX_N];
+int L_L[MAX_N];
+int L_P[MAX_N];
+int P_N[MAX_N];
+int P_L[MAX_N];
+int P_P[MAX_N];
 
 char gS[1000001];
 
 
 void precalc(){
-    L_N[1]=2;
-    L_L[1]=1;
-    L_P[1]=2;
+    L_N[0]=1;
+    L_L[0]=0;
+    L_P[0]=1;
+    P_N[0]=1;    
+    P_L[0]=1;
+    P_P[0]=0;    
     
-    P_N[1]=2;
-    P_L[1]=2;
-    P_P[1]=1;
+//    L_N[1]=2;
+//    L_L[1]=1;
+//    L_P[1]=2;
+//    
+//    P_N[1]=2;
+//    P_L[1]=2;
+//    P_P[1]=1;
     
-    for (int i = 2; i <= gN; i++){
+    for (int i = 1; i <= gN; i++){
         L_N[i]= (L_L[i-1]+P_N[i-1])%gM;
         L_L[i]= P_L[i-1];
         L_P[i]= (L_N[i-1]+P_P[i-1])%gM;
@@ -83,13 +92,10 @@ void precalc(){
         P_N[i]= (L_N[i-1]+ P_P[i-1])%gM;
         P_L[i]= (L_L[i-1]+ P_N[i-1])%gM;
         P_P[i]= L_P[i-1];
-
-        printf("L_N-%d=%d\n", i, L_N[i]);
-    }
-    
-    
+        //printf("L_N-%d=%d\n", i, L_N[i]);
+    }    
 }
-
+    
 // acc,  0:LL , 1:PP, 2:none
 // prev, 0:L  , 1:P  2:none
 int count(int acc,int prev, int remainingN){
@@ -151,12 +157,22 @@ int count(int acc,int prev, int remainingN){
             r += count(acc, 1, nextN);
         }
     }    
+
     
     //printf("%d,%d,%d=%d\n", acc, prev, remainingN, r);
+    r= r%gM;
     return r;
 }
 
-void solve(){    
+void solve(){
+    for (int i=0; i<5; i++) {
+        for (int j=0; j<5; j++) {
+            for (int k=0; k<=gN; k++) {
+                gCount[i][j][k]=-1;
+            }
+        }
+    }
+    
     int acc=2;
     int prev=2;
     int r=1;
@@ -165,25 +181,30 @@ void solve(){
             int d=0;
             int n = gN-i-1;
             if (acc==0) {
-                //skip
-            }else if(acc==1)
-                d=
-            int na=acc;
-            if (prev==0){
-                // L+L
-                if (na!=0){
-                    na = na==1 ? 2 : 0;
-                    d += count(na, 0, gN-i-1);
+                if (prev==0){
+                    //nope
+                }else if (prev==1){
+                    d=count(acc,0,n);
+                }else{
+                    printf("strange\n");
                 }                
-            }else if (prev==1){
-                // P+L
-                d+=count(na,0,gN-i-1);
-            }else {
-                //
-                d+=count(na,0, gN-i-1);
-            }
-            
-            printf(" %d, %d %d %d=%d\n",i, na, 0, gN-i-1,d );
+            }else if(acc==1){
+                if (prev==0){
+                    d=count(2,0,n);
+                }else if (prev==1){
+                    d=count(1,0,n);
+                }else{
+                    printf("strange\n");
+                }
+            }else{
+                if (prev==0){
+                    d=count(0,0,n);
+                }else if (prev==1){
+                    d=count(2,0,n);
+                }else
+                    d=count(2,0,n);
+            }            
+            printf(" %d, %d %d %d=%d\n",i, 100, 0, n,d );
             r+= d;
             r %=gM;            
         }
@@ -210,30 +231,34 @@ void solve2(){
             int d=0;
             if (acc==0){
                 if (prev==0) {
-                    // LL LL
+                    // LL L + L                    
                 }else if (prev==1) {
                     // LL PL
                     d=L_L[n];
                 }else{
-                    d=L_N[n];
+                    printf("strange\n");
                 }
             }else if (acc==1){
                 if (prev==0) {
-                    // LL LL
+                    // PP LL
+                    d=L_N[n];
                 }else if (prev==1) {
-                    // LL PL
-                    d=L_L[n];
+                    // PP PL
+                    d=L_P[n];
                 }else{
-                    d=L_N[n];
+                    printf("strange\n");
                 }
             }else if (acc==2){
                 if (prev==0) {
                     d=L_L[n];
                 }else if(prev==1)
                     d=L_N[n];
+                else
+                    d=L_N[n];
             }
             r+=d;
-            printf(" %d=%d\n", i, d);
+            r%=gM;
+            //printf(" %d=%d\n", i, d);
         }
         if (gS[i]=='L' && prev==0){
             acc = acc==1 ? 2 : 0;
@@ -241,6 +266,7 @@ void solve2(){
             acc = acc==0 ? 2 : 1;
         }
         prev = gS[i]=='L' ? 0:1;
+        //printf("%d, %d %d\n", i, acc, prev);
     }
     printf("%d\n", r);
 }
@@ -270,7 +296,7 @@ void test(){
 int main(){
     string fn = __FILE__;
     size_t pos = fn.find(".cpp");
-    fn = fn.substr(0,pos) + ".txt";    
+    fn = fn.substr(0,pos) + ".txt";
     if (access(fn.c_str(), F_OK)!=-1) {
         gDebug = true;
     }
@@ -281,22 +307,16 @@ int main(){
     }
 
     //h_generateRandomMap(100);
-    for (int i=0; i<5; i++) {
-        for (int j=0; j<5; j++) {
-            for (int k=0; k<1000000; k++) {
-                gCount[i][j][k]=-1;
-            }
-        }
-    }
-    //test();
+        //test();
     //precalc();
     
     // handling input
     int count, p,j,k, i,n;
     scanf("%d", &count);
     for (p=0; p<count; p++) {        
-        scanf("%d%d", &gN, &gM);
-        scanf("%s", gS);        
+        scanf("%d %d", &gN, &gM);
+        scanf("%s", gS);
+        //solve();
         solve2();
     }
     
diff --git a/cpp/codejam/sotong/ramcesGarden.txt b/cpp/codejam/sotong/ramcesGarden.txt
index 305ec4f..128d038 100644
--- a/cpp/codejam/sotong/ramcesGarden.txt
+++ b/cpp/codejam/sotong/ramcesGarden.txt
@@ -1,19 +1,21 @@
 6
-5
-7
+3 100
+LPP
+3 100
+LPL
+3 100
+PPL
+5 7
 PLPPL
-2
-100
-LL
-2
-100
-PP
-2
-100
-PL
-4
-100
+4 100
 PLPL
-12
-10000
+12 10000
 LPLLPLPPLPLL
+1 100
+L
+1 100
+P
+2 100
+LL
+2 100
+PP
\ No newline at end of file