oj.uz

답안 #760156

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
760156 2023-06-17T08:41:53 Z AryanReddy Aliens (IOI16_aliens) C++14
12 / 100
 76 ms 2292 KB 
#undef local
#include <bits/stdc++.h>
#define all(v) v.begin(),v.end()
#define allr(v) v.rbegin(),v.rend()
#define fori(i,n) for(int i=0;i<n;i++)
#define ford(i,n) for(int i = n-1;i >= 0;i--)
#define pb push_back
#define ll long long int
//#define mod 998244353
#define pi pair<int,int>
#define pll pair<ll,ll>
#define mp make_pair
#define fi first
#define se second
#define printVector(v) fori(;,v.size()) {cout << v[i] << " ";} cout << "\n";
#pragma GCC optimize("O3")
std::mt19937 rng((unsigned int) std::chrono::steady_clock::now().time_since_epoch().count());
using namespace std;
ll getAns(vector<ll> a,ll k){
    int n = a.size();
    vector<vector<ll>> dp(n+1,vector<ll> (k+1,1e18));
    for(int i = 0;i <= k;i++) dp[0][i] = 0;
    for(int i = 1;i <= n;i++){
        for(int j= k;j >= 1;j--){
            dp[i][j] = dp[i][j-1];
            for(int t = i;t >= 1;t--){
                ll d = a[i-1] - a[t-1]  + 1;
                d *= d;
                dp[i][j] = min(dp[i][j],dp[t-1][j-1] + d);
            }
        }
    }
    return dp[n][k];
}

long long take_photos(int n, int m, int k, vector<int> r, vector<int> c){
    vector<ll> a;
    for(int i = 0;i < n;i++){
        int x = r[i];
        int y = c[i];
        a.push_back(x);
        a.push_back(y);
    }
    sort(all(a));
    a.erase(unique(all(a)),a.end());
    ll ans = getAns(a,k);
    return ans;
}

Subtask #1
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Correct answer: answer = 4
2 Incorrect 0 ms 212 KB Wrong answer: output = 2, expected = 4
3 Halted 0 ms 0 KB -

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Correct answer: answer = 1
2 Correct 1 ms 212 KB Correct answer: answer = 4
3 Correct 0 ms 212 KB Correct answer: answer = 1
4 Correct 1 ms 212 KB Correct answer: answer = 5
5 Correct 1 ms 212 KB Correct answer: answer = 41
6 Correct 1 ms 304 KB Correct answer: answer = 71923
7 Correct 1 ms 212 KB Correct answer: answer = 77137
8 Correct 29 ms 1108 KB Correct answer: answer = 764
9 Correct 1 ms 340 KB Correct answer: answer = 250000
10 Correct 76 ms 2292 KB Correct answer: answer = 500
11 Correct 1 ms 212 KB Correct answer: answer = 32
12 Correct 1 ms 340 KB Correct answer: answer = 130050
13 Correct 8 ms 428 KB Correct answer: answer = 5110
14 Correct 2 ms 340 KB Correct answer: answer = 2626
15 Correct 3 ms 468 KB Correct answer: answer = 796
16 Correct 5 ms 468 KB Correct answer: answer = 7580
17 Correct 19 ms 852 KB Correct answer: answer = 1904
18 Correct 1 ms 340 KB Correct answer: answer = 996004
19 Correct 3 ms 340 KB Correct answer: answer = 38817
20 Correct 9 ms 596 KB Correct answer: answer = 4096
21 Correct 1 ms 212 KB Correct answer: answer = 1
22 Correct 1 ms 340 KB Correct answer: answer = 1
23 Correct 17 ms 832 KB Correct answer: answer = 2040
24 Correct 1 ms 340 KB Correct answer: answer = 2

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Correct answer: answer = 4
2 Incorrect 0 ms 212 KB Wrong answer: output = 2, expected = 4
3 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Correct answer: answer = 4
2 Incorrect 0 ms 212 KB Wrong answer: output = 2, expected = 4
3 Halted 0 ms 0 KB -

Subtask #5
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Correct answer: answer = 4
2 Incorrect 0 ms 212 KB Wrong answer: output = 2, expected = 4
3 Halted 0 ms 0 KB -

Subtask #6
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Correct answer: answer = 4
2 Incorrect 0 ms 212 KB Wrong answer: output = 2, expected = 4
3 Halted 0 ms 0 KB -