oj.uz

Submission #968467

# Submission time Handle Problem Language Result Execution time Memory
968467 2024-04-23T12:47:20 Z amine_aroua Aliens (IOI16_aliens) C++17
12 / 100
 143 ms 2400 KB 
#pragma once

#include <bits/stdc++.h>
using namespace std;
#define fore(i , n) for(int i = 0;i<n;i++)
#define forr(i , x , y) for(int i = x;i<=y;i++)
#define ll long long
#define pb push_back
const ll INF = 1e18;
bool cmp(const pair<ll , ll> &a , const pair<ll , ll> &b)
{
    if(a.first == b.first)
    {
        return a.second > b.second;
    }
    return (a.first < b.first);
}
long long take_photos(int n, int m, int g, std::vector<int> r, std::vector<int> c)
{
    vector<pair<ll ,ll>> range;
    range.pb({-1 ,-1});
    fore(i ,n)
    {
        range.pb({min(r[i] , c[i]) , max(r[i]  , c[i])});
    }
    sort(range.begin() , range.end());
    range.erase(unique(range.begin() , range.end()) , range.end());
    int N = (int)range.size() - 1;
    pair<ll , ll> last = range[1];
    vector<pair<ll,ll>> ranges;
    ranges.pb({-1 ,-1});
    ranges.pb(range[1]);
    forr(i , 2 , N)
    {
        if(range[i].second > last.second)
        {
            ranges.pb(range[i]);
            last = ranges[i];
        }
    }
    N = (int)ranges.size() - 1;
    g = min(g , N);
    ll dp[N + 1][g + 1];
    fore(i , N + 1)
        fore(j , g + 1)
            dp[i][j]= INF;
    dp[0][0] = 0;
    ranges[0] = {0 , INT_MIN};
    forr(i , 1 , N)
    {
        forr(j , 1 , g)
        {
            for(int l = 0 ; l < i ; l++)
            {
                dp[i][j] = min(dp[i][j] , dp[l][j - 1] + (ranges[i].second - ranges[l + 1].first + 1) * (ranges[i].second - ranges[l + 1].first + 1) - max(0ll , ranges[l].second - ranges[l + 1].first + 1)*max(0ll , ranges[l].second - ranges[l + 1].first + 1));
            }
        }
    }
    ll ans = INF;
    forr(j , 1 , g)
        ans = min(ans , dp[N][j]);
    return ans;
}

Compilation message

aliens.cpp:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Correct answer: answer = 4
2 Correct 0 ms 348 KB Correct answer: answer = 4
3 Correct 1 ms 348 KB Correct answer: answer = 4
4 Correct 0 ms 348 KB Correct answer: answer = 12
5 Correct 1 ms 344 KB Correct answer: answer = 52
6 Correct 0 ms 348 KB Correct answer: answer = 210
7 Correct 0 ms 344 KB Correct answer: answer = 88
8 Incorrect 0 ms 348 KB Wrong answer: output = 6709, expected = 7696
9 Halted 0 ms 0 KB -

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Correct answer: answer = 1
2 Correct 1 ms 604 KB Correct answer: answer = 4
3 Correct 0 ms 344 KB Correct answer: answer = 1
4 Correct 0 ms 348 KB Correct answer: answer = 5
5 Correct 0 ms 348 KB Correct answer: answer = 41
6 Correct 0 ms 348 KB Correct answer: answer = 71923
7 Correct 1 ms 348 KB Correct answer: answer = 77137
8 Correct 48 ms 1116 KB Correct answer: answer = 764
9 Correct 1 ms 600 KB Correct answer: answer = 250000
10 Correct 143 ms 2400 KB Correct answer: answer = 500
11 Correct 0 ms 344 KB Correct answer: answer = 32
12 Correct 1 ms 348 KB Correct answer: answer = 130050
13 Correct 12 ms 616 KB Correct answer: answer = 5110
14 Correct 2 ms 360 KB Correct answer: answer = 2626
15 Correct 7 ms 616 KB Correct answer: answer = 796
16 Correct 8 ms 360 KB Correct answer: answer = 7580
17 Correct 37 ms 972 KB Correct answer: answer = 1904
18 Correct 1 ms 360 KB Correct answer: answer = 996004
19 Correct 3 ms 360 KB Correct answer: answer = 38817
20 Correct 16 ms 780 KB Correct answer: answer = 4096
21 Correct 1 ms 360 KB Correct answer: answer = 1
22 Correct 1 ms 344 KB Correct answer: answer = 1
23 Correct 31 ms 856 KB Correct answer: answer = 2040
24 Correct 0 ms 348 KB Correct answer: answer = 2

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Correct answer: answer = 4
2 Correct 0 ms 348 KB Correct answer: answer = 4
3 Correct 1 ms 348 KB Correct answer: answer = 4
4 Correct 0 ms 348 KB Correct answer: answer = 12
5 Correct 1 ms 344 KB Correct answer: answer = 52
6 Correct 0 ms 348 KB Correct answer: answer = 210
7 Correct 0 ms 344 KB Correct answer: answer = 88
8 Incorrect 0 ms 348 KB Wrong answer: output = 6709, expected = 7696
9 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Correct answer: answer = 4
2 Correct 0 ms 348 KB Correct answer: answer = 4
3 Correct 1 ms 348 KB Correct answer: answer = 4
4 Correct 0 ms 348 KB Correct answer: answer = 12
5 Correct 1 ms 344 KB Correct answer: answer = 52
6 Correct 0 ms 348 KB Correct answer: answer = 210
7 Correct 0 ms 344 KB Correct answer: answer = 88
8 Incorrect 0 ms 348 KB Wrong answer: output = 6709, expected = 7696
9 Halted 0 ms 0 KB -

Subtask #5
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Correct answer: answer = 4
2 Correct 0 ms 348 KB Correct answer: answer = 4
3 Correct 1 ms 348 KB Correct answer: answer = 4
4 Correct 0 ms 348 KB Correct answer: answer = 12
5 Correct 1 ms 344 KB Correct answer: answer = 52
6 Correct 0 ms 348 KB Correct answer: answer = 210
7 Correct 0 ms 344 KB Correct answer: answer = 88
8 Incorrect 0 ms 348 KB Wrong answer: output = 6709, expected = 7696
9 Halted 0 ms 0 KB -

Subtask #6
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Correct answer: answer = 4
2 Correct 0 ms 348 KB Correct answer: answer = 4
3 Correct 1 ms 348 KB Correct answer: answer = 4
4 Correct 0 ms 348 KB Correct answer: answer = 12
5 Correct 1 ms 344 KB Correct answer: answer = 52
6 Correct 0 ms 348 KB Correct answer: answer = 210
7 Correct 0 ms 344 KB Correct answer: answer = 88
8 Incorrect 0 ms 348 KB Wrong answer: output = 6709, expected = 7696
9 Halted 0 ms 0 KB -