Submission #144771

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
144771	2019-08-17 16:27:18	mariadinca	Cover (COCI18_cover)	C++14	120 / 120	11 ms	760 KiB

cover

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <iostream>
#define x first
#define y second
#include <algorithm>
using namespace std;
long long n, m, i, j, k, ymin, ymax, verticala, verticalaanterioara, sol[20002], sum;
pair<long long, long long> v[20002], d[20002];
int main(){
    cin>>n;
    m = n;
    for(i=1;i<=n;i++){
        cin>>v[i].x>>v[i].y;
        v[++m].x =  v[i].x, v[m].y = -v[i].y;
        v[++m].x = -v[i].x, v[m].y = -v[i].y;
        v[++m].x = -v[i].x, v[m].y =  v[i].y;
    }
    sort(v+1, v+m+1);
    for(i=1;i<=m;i++){
        if(v[i].x > 0)
            break;
        ymax = 0;
        ymin = v[i].y;
        for(j=i;v[j].x == v[i].x;j++)
            if(v[j].y > 0)
                ymax = v[j].y;
        verticala = max(ymax, -ymin);
        /// deci dreptunghiul curent are aria egala cu -4*verticala*v[i].x
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 120 / 120