oj.uz

Submission #232109

# Submission time Handle Problem Language Result Execution time Memory
232109 2020-05-16T04:14:10 Z SorahISA Sure Bet (CEOI17_sure) C++17
100 / 100
 112 ms 4584 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;});
    x.eb(10000), y.eb(10000);
    
    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
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 344 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 6 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 6 ms 384 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 344 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 6 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 6 ms 384 KB Output is correct
17 Correct 105 ms 4088 KB Output is correct
18 Correct 96 ms 4064 KB Output is correct
19 Correct 96 ms 4088 KB Output is correct
20 Correct 103 ms 4088 KB Output is correct
21 Correct 112 ms 4472 KB Output is correct
22 Correct 100 ms 4088 KB Output is correct
23 Correct 94 ms 4112 KB Output is correct
24 Correct 92 ms 4088 KB Output is correct
25 Correct 98 ms 4088 KB Output is correct
26 Correct 107 ms 4584 KB Output is correct