oj.uz

Submission #232108

# Submission time Handle Problem Language Result Execution time Memory
232108 2020-05-16T04:12:13 Z SorahISA Sure Bet (CEOI17_sure) C++17
0 / 100
 5 ms 384 KB 
// #pragma GCC target("avx2")
#pragma GCC optimize("O3", "unroll-loops")

// #include <bits/extc++.h>
// using namespace __gnu_pbds;

#include <bits/stdc++.h>
using namespace std;

#define int long long
#define double long double
// template <typename T>
// using pbds_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
using pii = pair<int, int>;
template<typename T>
using prior = priority_queue<T, vector<T>, greater<T>>;
template<typename T>
using Prior = priority_queue<T>;

#define X first
#define Y second
#define ALL(x) (x).begin(), (x).end()
#define eb emplace_back
#define pb push_back

#define fastIO() ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define RANDOM() random_device __rd; \
                 mt19937 __gen = mt19937(__rd()); \
                 uniform_int_distribution<int> __dis(1, 1E5); \
                 auto rnd = bind(__dis, __gen);

const int INF = 1E18;
const int mod = 1E9 + 7;
const double eps = 1e-8;

int32_t main() {
    fastIO();
    
    int n;
    double dx, dy;
    cin >> n;
    
    vector<int> x(n), y(n);
    for (int i = 0; i < n; ++i) {
        cin >> dx >> dy;
        x[i] = floor(10000 * dx + eps);
        y[i] = floor(10000 * dy + eps);
    }
    
    sort(ALL(x), [](auto a, auto b) {return a > b;});
    sort(ALL(y), [](auto a, auto b) {return a > b;});
    
    int profL = 0, profR = 0, maxProf = 0;
    int tokL = 0, tokR = 0;
    while (tokL < n and tokR < n) {
        if (profL < profR) profL += x[tokL++] - 10000, profR -= 10000;
        else               profR += y[tokR++] - 10000, profL -= 10000;
        maxProf = max(maxProf, min(profL, profR));
    }
    
    cout << maxProf/10000 << ".";
    cout << setw(4) << setfill('0') << maxProf%10000 << "\n";
    
    return 0;
}

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Incorrect 4 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Incorrect 4 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Incorrect 4 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -