oj.uz

Submission #589633

# Submission time Handle Problem Language Result Execution time Memory
589633 2022-07-05T01:38:16 Z nguyen31hoang08minh2003 Unija (COCI17_unija) C++14
100 / 100
 299 ms 31132 KB 
/*
+------+------+------+------+------+------+------+------+------+------+------+------+------+------+------+------+------+
|:\/\/:|:\/\/:|:\/\/:|:\/\/:|:\/\/:|:\/\/:|:\/\/:|:\/\/:|:\/\/:|:\/\/:|:\/\/:|:\/\/:|:\/\/:|:\/\/:|:\/\/:|:\/\/:|:\/\/:|
|\/\/\/|\/\/\/|\/\/\/|\/\/\/|\/\/\/|\/\/\/|\/\/\/|\/\/\/|\/\/\/|\/\/\/|\/\/\/|\/\/\/|\/\/\/|\/\/\/|\/\/\/|\/\/\/|\/\/\/|
|/:/\:\|/:/\:\|/:/\:\|/:/\:\|/:/\:\|/:/\:\|/:/\:\|/:/\:\|/:/\:\|/:/\:\|/:/\:\|/:/\:\|/:/\:\|/:/\:\|/:/\:\|/:/\:\|/:/\:\|
+------+------+------+------+------+------+------+------+------+------+------+------+------+------+------+------+------+
|\:\/:/|\:\/:/|\:\/:/|\:\/:/|\:\/:/|\:\/:/|\:\/:/|\:\/:/|\:\/:/|\:\/:/|\:\/:/|\:\/:/|\:\/:/|\:\/:/|\:\/:/|\:\/:/|\:\/:/|
|/\/\/\|/\/\/\|/\/\/\|/\/\/\|/\/\/\|/\/\/\|/\/\/\|/\/\/\|/\/\/\|/\/\/\|/\/\/\|/\/\/\|/\/\/\|/\/\/\|/\/\/\|/\/\/\|/\/\/\|
|:/\/\:|:/\/\:|:/\/\:|:/\/\:|:/\/\:|:/\/\:|:/\/\:|:/\/\:|:/\/\:|:/\/\:|:/\/\:|:/\/\:|:/\/\:|:/\/\:|:/\/\:|:/\/\:|:/\/\:|
+------+------+------+------+------+------+------+------+------+------+------+------+------+------+------+------+------+
*/
#include <bits/stdc++.h>
#define fore(i, a, b) for (signed i = (a), i##_last = (b); i < i##_last; ++i)
#define fort(i, a, b) for (signed i = (a), i##_last = (b); i <= i##_last; ++i)
#define ford(i, a, b) for (signed i = (a), i##_last = (b); i >= i##_last; --i)
#define fi first
#define se second
#define pb push_back
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
using ll = long long;
using ld = long double;

template<class A, class B> bool maxi(A &a, const B &b) {return (a < b) ? (a = b, true):false;};
template<class A, class B> bool mini(A &a, const B &b) {return (a > b) ? (a = b, true):false;};

typedef unsigned long long ull;
typedef pair<int, int> ii;
typedef vector<ll> vi;
typedef vector<ii> vii;
typedef vector<vi> vvi;
typedef vector<vii> vvii;

const int maxN = 1e6 + 5;

int n;
vii p;
ll res;
array<int, maxN> x, y;

int main() {
    ll mxy;
    #ifdef LOCAL
        freopen("input.INP", "r", stdin);
    #endif // LOCAL
    cin.tie(0) -> sync_with_stdio(0);
    cout.tie(0);
    cin >> n;
    fort(i, 1, n) {
        cin >> x[i] >> y[i];
        p.emplace_back(-(x[i] >> 1), y[i] >> 1);
    }
    sort(all(p));
    mxy = p.front().se;
    fore(i, 1, n) {
        res += mxy * (p[i].fi - p[i - 1].fi);
        maxi(mxy, p[i].se);
    }
    (res += (-p.back().fi) * mxy) <<= 2;
    cout << res << '\n';
    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 328 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 464 KB Output is correct
2 Correct 2 ms 468 KB Output is correct
3 Correct 2 ms 468 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 268 ms 31112 KB Output is correct
2 Correct 299 ms 31032 KB Output is correct
3 Correct 261 ms 31132 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 324 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 1236 KB Output is correct
2 Correct 7 ms 1240 KB Output is correct
3 Correct 7 ms 1240 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 3252 KB Output is correct
2 Correct 25 ms 3244 KB Output is correct
3 Correct 26 ms 3344 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 78 ms 10392 KB Output is correct
2 Correct 77 ms 10304 KB Output is correct
3 Correct 86 ms 10308 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 272 ms 31056 KB Output is correct
2 Correct 285 ms 31116 KB Output is correct
3 Correct 265 ms 31096 KB Output is correct