oj.uz

Submission #239040

# Submission time Handle Problem Language Result Execution time Memory
239040 2020-06-14T08:00:30 Z kartel Cover (COCI18_cover) C++14
12 / 120
 6 ms 512 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;

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

bool cmp(int i, int j)
{
    return abs(x[i] * y[i]) > abs(x[j] * y[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;

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

    ans = 0;

    i = 1;

    while (i <= n)
    {
        if (mp[i]) {i++; continue;}

        X = 0;
        Y = 0;

        j = i;
        while (j <= n && (mp[j] || X * Y + abs(x[nm[j]] * y[nm[j]]) >= max(abs(x[nm[j]]), X) * max(abs(y[nm[j]]), Y)))
        {
            if (!mp[j])
            {
                X = max(abs(x[nm[j]]), X);
                Y = max(abs(y[nm[j]]), Y);
            }
            j++;
        }

        ans += X * Y;


        i = j;

        for (j = i; j <= n; j++)
            if (abs(x[nm[j]]) <= X && abs(y[nm[j]]) <= Y)
               mp[j] = 1;
    }

    cout << ans * 4;
}

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

Subtask #1
12.0 / 120.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Incorrect 4 ms 384 KB Output isn't correct
3 Incorrect 4 ms 384 KB Output isn't correct
4 Incorrect 4 ms 384 KB Output isn't correct
5 Incorrect 5 ms 384 KB Output isn't correct
6 Incorrect 5 ms 432 KB Output isn't correct
7 Incorrect 5 ms 384 KB Output isn't correct
8 Incorrect 5 ms 384 KB Output isn't correct
9 Incorrect 6 ms 384 KB Output isn't correct
10 Incorrect 6 ms 512 KB Output isn't correct