oj.uz

답안 #162027

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
162027 2019-11-06T00:26:04 Z Leonardo_Paes Cover (COCI18_cover) C++17
120 / 120
 65 ms 404 KB 
#include <bits/stdc++.h>

using namespace std;

#define x first
#define y second

const int maxn = 5e3+10;

const long long inf = 2e18+10;

typedef pair<int,int> pii;

pii points[maxn], useful_points[maxn];

int n;

long long dp[maxn];

bool mark[maxn];

int main(){
    cin >> n;

    for(int i=1; i<=n; i++){
        cin >> points[i].x >> points[i].y;

        points[i].x = abs(points[i].x);
        points[i].y = abs(points[i].y);
    }

    sort(points+1, points+n+1);

    int id = 0;

    for(int i=1; i<=n; i++){
        for(int j=1; j<=n; j++){
            if(!mark[j] and i!=j and points[i].x >= points[j].x and points[i].y >= points[j].y){
                mark[j] = 1;
            }
        }
    }

    for(int i=1; i<=n; i++){
        if(!mark[i]) useful_points[++id] = points[i];
    }

    for(int i=1; i<=id; i++) dp[i] = inf;

    dp[0] = 0;

    for(int i=1; i<=id; i++){
        for(int j=1; j<=id; j++){
            dp[i] = min(dp[i], dp[j-1] + 4LL*(useful_points[i].x)*(useful_points[j].y));
        }
    }

    cout << dp[id] << endl;

    return 0;
}

Subtask #1
120.0 / 120.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 380 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 19 ms 376 KB Output is correct
9 Correct 38 ms 376 KB Output is correct
10 Correct 65 ms 404 KB Output is correct