oj.uz

Submission #239046

# Submission time Handle Problem Language Result Execution time Memory
239046 2020-06-14T08:15:06 Z kartel Cover (COCI18_cover) C++14
120 / 120
 62 ms 632 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-O3")
#define F first
#define S second
#define pb push_back
#define N +100500
#define M ll(1e9 + 7)
#define sz(x) (int)x.size()
#define re return
#define oo ll(1e9)
#define el '\n'
#define pii pair <int, int>
using namespace std;
//using namespace __gnu_pbds;
//typedef tree <int, null_type, less_equal <int> , rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef long long ll;
typedef long double ld;

ll x[N], y[N], X, Y, nm[N], mask, i, j, ans, n, mp[N], f[N];

bool cmp(ll i, ll j)
{
    if (abs(x[i]) == abs(x[j])) return abs(y[i]) > abs(y[j]);
    return abs(x[i]) > abs(x[j]);
}

int main()
{
    srand(time(0));
    ios_base::sync_with_stdio(0);
    iostream::sync_with_stdio(0);
    ios::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);

//    in("input.txt");
//    out("output.txt");

    cin >> n;
    for (i = 1; i <= n; i++) cin >> x[i] >> y[i], nm[i] = i, f[i] = 1e18;

    sort(nm + 1, nm + 1 + n, cmp);

    ans = 0;
    f[0] = 0;

    for (i = 1; i <= n; i++)
    {
        X = abs(x[nm[i]]);
        Y = abs(y[nm[i]]);

        f[i] = min(f[i - 1] + X * Y, f[i]);

        for (j = i + 1; j <= n; j++)
        {
            X = max(X, abs(x[nm[j]]));
            Y = max(Y, abs(y[nm[j]]));
            f[j] = min(f[j], f[i - 1] + X * Y);
        }
    }

    cout << f[n] * 4;
}

/*
8 8
...).).*
*....)..
.)*(..).
(*)((...
.)).)(..
.)(.)..(
...).(.*
M.......
*/
//
//110000
//1100

Subtask #1
120.0 / 120.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 6 ms 384 KB Output is correct
9 Correct 22 ms 384 KB Output is correct
10 Correct 62 ms 632 KB Output is correct