Submission #39866749

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef tree <int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> oset;
#define fir first
#define sec second
#define sz size
#define mp make_pair
#define ll long long
#define pb push_back
#define en "\n"
#define ld long double
vector<ld> a, b, d, e;
ll get(ld x)
{
    vector<pair<ld, ll> > c;
    for (int i = 0; i < d.sz(); i++)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef tree <int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> oset;
#define fir first
#define sec second
#define sz size
#define mp make_pair
#define ll long long
#define pb push_back
#define en "\n"
#define ld long double
vector<ld> a, b, d, e;
ll get(ld x)
{
    vector<pair<ld, ll> > c;
    for (int i = 0; i < d.sz(); i++)
        c.pb(mp((x-(d[i] / (d[i]+e[i])))*(e[i]+d[i]), i));
    sort(c.begin(), c.end());
    reverse(c.begin(), c.end());
    ll res = 0;
    for (int i = 0; i < a.sz(); i++)
    {
        ll l = 0, r = c.sz()-1;
        while (l < r)
        {
            int mid = (l+r) / 2;
            mid++;
            if ((a[i]+d[c[mid].sec]) / (a[i]+d[c[mid].sec]+b[i]+e[c[mid].sec]) < x)
                l = mid;
            else
                r = mid-1;
        }
        if ((a[i]+d[c[l].sec]) / (a[i]+d[c[l].sec]+b[i]+e[c[l].sec]) < x)
            res += l+1;
//        if (a[i] / b[i] < x)
//            res--;
    }
    return res;
}
int main()
{
//    freopen("input.txt", "r", stdin);
//    freopen("output.txt", "w", stdout);
//    cin.tie(0);cout.tie(0);
    ios::sync_with_stdio(0);
    ll n, m, k;
    cin >> n >> m >> k;
    k = (n*m+1)-k;
    a.resize(n);
    b.resize(n);
    d.resize(m);
    e.resize(m);
    for (int i = 0; i < n; i++)
        cin >> a[i] >> b[i];
    for (int i = 0; i < m; i++)
        cin >> d[i] >> e[i];
    ld l = 0, r = 3e5;
    cout << fixed << setprecision(20);
    while (double(clock()) / double(CLOCKS_PER_SEC) < 3.75)
    {
        ld mid = (l+r) / 2;
        if (get(mid) >= k)
            r = mid;
        else
            l = mid;
    }
    l *= 100;
    cout << l << en;
}

Submission Info

Compile Error

./Main.cpp: In function ‘long long int get(long double)’:
./Main.cpp:21:23: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::vector<long double>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
   21 |     for (int i = 0; i < d.sz(); i++)
      |                     ~~^~~~~~~~
./Main.cpp:26:23: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::vector<long double>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
   26 |     for (int i = 0; i < a.sz(); i++)
      |                     ~~^~~~~~~~

Judge Result