add a URAL problem

Author: oeddyo

ural/1178.cpp

@@ -0,0 +1,120 @@
+#include <iostream>
+#include <cstdlib>
+#include <string>
+#include <vector>
+#include <algorithm>
+#include <queue>
+#include <list>
+#include <stack>
+#include <map>
+#include <set>
+using namespace std;
+ 
+
+typedef long long ll;
+typedef struct my_node{
+    ll x, y;
+}point;
+
+const int MAXN = 10500;
+point points[MAXN];
+int N;
+
+vector< point > ans;
+
+
+void proc( int n_points, vector< ll > pp){
+    if(n_points == 0)return ;
+    if(n_points == 2){
+        point tmp;
+        tmp.x = pp[0];
+        tmp.y = pp[1];
+        ans.push_back(tmp); 
+        return ;
+    }
+
+    int sz = pp.size();
+   
+    vector<ll> left;
+    vector<ll> right;
+
+    int ls =0, rs = 0, a, b;
+    while(1){
+        a = rand()%sz;
+        b = rand()%sz;
+        if(a == b)b = (a+1)%sz;
+
+        left.clear(); right.clear();
+
+        //cout<<"a = "<<a<<" b = "<<b<<endl;
+        
+        ll x1 = points[pp[a]].x;
+        ll y1 = points[pp[a]].y;
+        ll x2 = points[pp[b]].x;
+        ll y2 = points[pp[b]].y;
+        ls = 0, rs = 0;
+
+        for(int i=0; i<sz; i++){
+            //cout<<"i = "<<i<<endl;
+            if(i==a || i==b)continue;
+
+            ll x = points[pp[i]].x;
+            ll y = points[pp[i]].y;
+
+            //cout<<(y-y1)<<" "<<(x2-x1)<<endl;
+            ll _tmp = (y-y1)*(x2-x1) - (y2-y1)*(x-x1);
+            if( _tmp > 0LL){
+                left.push_back(pp[i]);
+                ls += 1;
+            }else if(_tmp < 0LL) {
+                right.push_back(pp[i]);
+                rs += 1;
+            }
+        }
+        //cout<<ls<<" "<<rs<<endl;
+        if( rs%2 == 1 || ls%2 == 1)continue;
+        //cout<<"ok"<<endl;
+        break;
+    }
+    
+    point tmp;
+    tmp.x = pp[a];
+    tmp.y = pp[b];
+    
+    ans.push_back(tmp);
+    
+    proc(left.size(), left);
+    proc(right.size(), right);
+}
+
+
+void work(){
+    vector<ll> tmp;
+    for(int i=0; i<N; i++){
+        tmp.push_back(i);
+    }
+
+    proc(tmp.size(),  tmp ); 
+    for(int i=0; i<ans.size(); i++){
+        cout<<ans[i].x+1<<" "<<ans[i].y+1<<endl;
+    }
+    ans.clear();
+
+}
+
+
+
+
+int main(){
+
+    while(cin>>N){
+
+        for(int i=0; i<N; i++){
+            cin>>points[i].x>>points[i].y;
+        }
+        work(); 
+    }
+
+    return 0;
+}
+

ural/1749.cpp

@@ -0,0 +1,27 @@
+import numpy as np
+
+
+x1 = 150*100/(100+100+150+1.0/3)
+x2 = x1
+x3 = 150*150/(100+100+150+1.0/3)
+x4 = 1.0/3
+
+
+print x1, x2, x3, x4
+
+
+print (x1*1000 + x2*750 + x3*585 + x4*0)/(1000.0 * 150)
+42.81636536631779677009
+64.22454804947669515514
+42.81636536631779677009
+0.33333333333331144344
+
+print (42.81636536631779677009 + .585*64.22454804947669515514 + .750*42.81636536631779677009 )/150
+
+42.85714285714285409767
+64.28571428571429180465
+42.85714285714285409767
+0.00000000000000000000
+
+
+print (42.85714285714285409767 + .585*64.28571428571429180465 + .750*42.85714285714285409767 )/150

ural/1757.cpp

@@ -1,9 +1,11 @@
 #include <iostream>
 #include <string>
+#include <iomanip>
 #include <vector>
 #include <algorithm>
 #include <queue>
 #include <list>
+#include <cmath>
 #include <stack>
 #include <map>
 #include <set>
@@ -15,17 +17,107 @@ using namespace std;
 #define VE vector<int>
 #define SZ size()
 #define PB push_back
- 
-int main()
-#ifndef ONLINE_JUDEGE
-   freopen("input.txt","r",stdin);
-#endif
- 
-#ifdef DEBUG
-   // to write some values for debugging purposes, e.g.,
-   int i =5;
-   printf("%d",i);
-#endif
-   return 0;
+
+const int MAXN = 10001;
+int n, m;
+double p;
+
+const double eps = 1e-9;
+
+struct node{
+    int p;
+    int weight;
+    int idx;
+}L[MAXN];
+int cmp(const struct node &a, const struct node &b){
+    return a.p>b.p;
+}
+
+double ans[MAXN];
+int ans_idx = 0;
+void work(){
+    
+    std::cout.precision(15);
+    std::cout<<std::fixed;
+
+    sort(L, L+n, cmp);
+    
+    bool ok = true;
+    if(L[0].p<p || L[n-1].p > p){
+        ok = false;
+    }
+    
+    double cur_p = 0, pure;
+    int pos = -1, sum_weight = 0;
+
+    ans_idx = 0;
+    for(int i=0; i<n; i++){
+        int w_sum = sum_weight + L[i].weight;
+        pure = (sum_weight*cur_p + L[i].weight*L[i].p)*1.0/w_sum;
+        //cout<<"now pure = "<<pure<<endl;
+        if(pure - p < eps && sum_weight + L[i].weight>= m){
+            pos = i;
+            //cout<<"breaking "<<endl;
+            break;
+        }
+        //ans.push_back( L[i].weight );
+        ans[L[i].idx] = L[i].weight;
+        ans_idx += 1;
+        sum_weight += L[i].weight;
+        cur_p = pure;
+    }
+    if(pos == -1){
+        ok = false;
+    }
+    
+    double add;
+    if(fabs(p-L[pos].p) <= 0){
+        add = L[pos].weight;
+    }else{
+        add = (cur_p - p)*1.0*sum_weight/(p-L[pos].p);
+    }
+
+    /*
+    cout<<"sum_weight = "<<sum_weight<<endl;
+    cout<<"melt = "<<melt_sum<<endl;
+    */
+    if(add + sum_weight < m){
+        ok = false;
+    }
+    
+    if(ok==false){
+        cout<<"NO"<<endl;
+        return ;
+    }
+
+    double melt_sum =  add;
+    for(int i=0; i<ans_idx; i++){
+        melt_sum += ans[i];
+    }
+    cout<<"YES"<<endl;
+    for(int i=0; i<ans_idx; i++){
+        double tmp = ans[i]*m*1.0/melt_sum;
+         cout<<tmp<<endl;
+
+    }
+    cout<<add<<endl;
+}
+
+
+
+int main(){
+    
+    
+    cin>>n>>m>>p;
+
+        for(int i=0; i<n; i++){
+            cin>>L[i].weight;
+            cin>>L[i].p;
+            //L[i].p/= 1000.0;
+            p*= 1.0;
+            L[i].idx = i;
+        }
+        work();
+    return 0;
 }