View difference between Paste ID: urKwfB2x and Z8V0avnG

 #include<iostream>
 #include<map>
 #include<vector>
 #include<stack>
 #include<algorithm>
 #include<cmath>
 #include<set>
 #include<iomanip>
 #include<fstream>
 
 using namespace std;
 
-ifstream in("frog.in");
+int t = 0;
-ofstream out("frog.out");
+
 void dfs (vector<set<int>> &g, vector<bool> &used, vector<int> &tin, int v, bool &p) {
-bool check(vector<pair<long long, long long>> &v, long long w, long long h, long double k) {
+    used[v] = true;
-    long double x = 0;
+    tin[v] = t++;
-    long double y = 0;
+    for(auto u = g[v].begin(); u != g[v].end(); u++) {
-    long double wi = 0, hi = 0;
+        cout << v << ' ' << used.size() << ' ' << *u << endl;
-    long long prev_h = -1;
+        if(!used[*u])
-    int last = -1;
+            dfs(g, used, tin, *u, p);
         p = false;
-    for(int i = 0; i < v.size(); i++) {
+
-        wi = v[i].first * k;
+
-        hi = v[i].second * k;
+
-        if(prev_h == v[i].second) {
+
-            if(x + wi <= w)
+    ifstream in("fortification.in");
-                x += wi;
+    ofstream out("fortification.out");
-            else {
+
-                x = 0;
+    int n;
-                y += hi;
+    cin >> n;
     vector<string> inp(n);
-            last = 1;
+
     for(int i = 0; i < n; i++) {
-        else {
+        cin >> inp[i];
-            x = wi;
+        string s = "";
-            y += hi;
+        for(int j = 0; j < 10 - inp[i].length() + 1; j++)
-            last = 2;
+            s += 'x';
         s += inp[i];
-
+        inp[i] = s;
-        prev_h = v[i].second;
+
 
     vector<set<int>> g(10);
-    return x <= w && y <= h;
+
     for(int i = 0; i < n; i++) {
         for(int j = i + 1; j < n; j++) {
             int c = 0;
-    long long n, w, h;
+            while(c < 10 && inp[i][c] == inp[j][c])
-    cin >> n >> w >> h;
+                c++;
             if(c < 11) {
-    vector<pair<long long, long long>> v(n);
+                g[inp[j][c] - 'a'].insert(inp[i][c] - 'a');
-    for(int i = 0; i < n; i++)
+
-        cin >> v[i].first >> v[i].second;
+
     }
-    long double l = 0, r = 1e9;
+
-    for(int k = 0; k < 100; k++) {
+    vector<bool> used(10, false);
-        long double m = (l + r) / 2.0;
+    vector<int> tin(10);
-
+    bool p = true;
-        if(check(v, w, h, m))
+    for(int i = 0; i < 10; i++) {
-            l = m;
+        if(!used[i]) {
-        else
+            dfs(g, used, tin, i, p);
-            r = m;
+
     }
 
-    cout.precision(100);
+    if(p) {
-    cout << l << endl;
+        cout << "Yes" << endl;
         for(int k : tin)
             cout << k << ' ';
         cout << endl;
     }
     else
         cout << "No" << endl;
 
     return 0;
 }