oj.uz

Submission #553513

# Submission time Handle Problem Language Result Execution time Memory
553513 2022-04-26T05:01:12 Z Tien_Noob Split the sequence (APIO14_sequence) C++17
100 / 100
 1354 ms 83756 KB 
//Make CSP great again
//Vengeance
#include <bits/stdc++.h>
#define TASK "TESTCODE"
#define Log2(x) 31 - __builtin_clz(x)
using namespace std;
const int N = 1e5, K = 2e2;
long long f[N + 1], dp[N + 1][2];
int p[N + 1][K + 1];
int n, k;
struct Convex
{
    deque<long double> inter;
    deque<long long> A, B;
    deque<int> pos;
    void reset()
    {
        pos = {0};
        inter = {-1e18};
        A = {0};
        B = {0};
    }
    long double Intersect(int i, int j)
    {
        return (long double)(B[j] - B[i])/(A[i] - A[j]);
    }
    bool ok(long long a, long long b)
    {
        long double x1 = (long double)(B[A.size() - 2] - b)/(a - A[A.size() - 2]);
        return x1 > Intersect(A.size() - 2, A.size() - 1);
    }
    void add(int i, long long a, long long b)
    {
        if (A.back() == a)
        {
            if (b >= B.back())
            {
                pos.pop_back();
                A.pop_back();
                B.pop_back();
                inter.pop_back();
                if (inter.empty())
                {
                    pos = {i};
                    inter = {-1e18};
                    A = {a};
                    B = {b};
                }
                else
                {
                    pos.push_back(i);
                    A.push_back(a);
                    B.push_back(b);
                    inter.push_back(Intersect(A.size() - 2, A.size() - 1));
                }
            }
            return ;
        }
        while(inter.size() >= 2 && !ok(a, b))
        {
            inter.pop_back();
            A.pop_back();
            B.pop_back();
            pos.pop_back();
        }
        pos.push_back(i);
        A.push_back(a);
        B.push_back(b);
        inter.push_back(Intersect(A.size() - 2, A.size() - 1));
    }
    long long get(long long x)
    {
        while(inter.size() >= 2 && inter[1] <= x)
        {
            inter.pop_front();
            A.pop_front();
            B.pop_front();
            pos.pop_front();
        }
        return A.front() * x + B.front();
    }
} CHT;
void read()
{
    cin >> n >> k;
    for (int i = 1; i <= n; ++ i)
    {
        cin >> f[i];
        f[i] = f[i - 1] + f[i];
    }
}
void Traceback(int i, int j)
{
    if (j == 0)
    {
        return ;
    }
    cout << p[i][j] << ' ';
    Traceback(p[i][j], j - 1);
}
void solve()
{
    for (int j = 1; j <= k; ++ j)
    {
        CHT.reset();
        for (int i = 1; i <= n; ++ i)
        {
            int cur = j & 1;
            dp[i][cur] = CHT.get(f[i]);
            p[i][j] = CHT.pos.front();
            CHT.add(i, f[i], dp[i][cur ^ 1] - f[i] * f[i]);
        }
    }
    cout << dp[n][k & 1] << '\n';
    Traceback(n, k);
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    if (fopen(TASK".INP", "r"))
    {
        freopen(TASK".INP", "r", stdin);
        //freopen(TASK".OUT", "w", stdout);
    }
    int t = 1;
    bool typetest = false;
    if (typetest)
    {
        cin >> t;
    }
    for (int __ = 1; __ <= t; ++ __)
    {
        //cout << "Case " << __ << ": ";
        read();
        solve();
    }
}

Compilation message

sequence.cpp: In function 'int main()':
sequence.cpp:123:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  123 |         freopen(TASK".INP", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB contestant found the optimal answer: 108 == 108
2 Correct 1 ms 340 KB contestant found the optimal answer: 999 == 999
3 Correct 1 ms 328 KB contestant found the optimal answer: 0 == 0
4 Correct 1 ms 340 KB contestant found the optimal answer: 1542524 == 1542524
5 Correct 1 ms 340 KB contestant found the optimal answer: 4500000000 == 4500000000
6 Correct 1 ms 340 KB contestant found the optimal answer: 1 == 1
7 Correct 1 ms 340 KB contestant found the optimal answer: 1 == 1
8 Correct 1 ms 340 KB contestant found the optimal answer: 1 == 1
9 Correct 1 ms 340 KB contestant found the optimal answer: 100400096 == 100400096
10 Correct 1 ms 328 KB contestant found the optimal answer: 900320000 == 900320000
11 Correct 1 ms 340 KB contestant found the optimal answer: 3698080248 == 3698080248
12 Correct 1 ms 332 KB contestant found the optimal answer: 3200320000 == 3200320000
13 Correct 1 ms 244 KB contestant found the optimal answer: 140072 == 140072
14 Correct 1 ms 340 KB contestant found the optimal answer: 376041456 == 376041456
15 Correct 1 ms 340 KB contestant found the optimal answer: 805 == 805
16 Correct 1 ms 340 KB contestant found the optimal answer: 900189994 == 900189994
17 Correct 1 ms 340 KB contestant found the optimal answer: 999919994 == 999919994

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB contestant found the optimal answer: 1093956 == 1093956
2 Correct 1 ms 340 KB contestant found the optimal answer: 302460000 == 302460000
3 Correct 1 ms 340 KB contestant found the optimal answer: 122453454361 == 122453454361
4 Correct 1 ms 352 KB contestant found the optimal answer: 93663683509 == 93663683509
5 Correct 1 ms 340 KB contestant found the optimal answer: 1005304678 == 1005304678
6 Correct 1 ms 324 KB contestant found the optimal answer: 933702 == 933702
7 Correct 1 ms 340 KB contestant found the optimal answer: 25082842857 == 25082842857
8 Correct 1 ms 340 KB contestant found the optimal answer: 687136 == 687136
9 Correct 1 ms 328 KB contestant found the optimal answer: 27295930079 == 27295930079
10 Correct 1 ms 340 KB contestant found the optimal answer: 29000419931 == 29000419931

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 1 ms 468 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 3 ms 468 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 1 ms 468 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 2 ms 468 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Correct 3 ms 508 KB contestant found the optimal answer: 107630884 == 107630884
7 Correct 3 ms 456 KB contestant found the optimal answer: 475357671774 == 475357671774
8 Correct 1 ms 460 KB contestant found the optimal answer: 193556962 == 193556962
9 Correct 1 ms 468 KB contestant found the optimal answer: 482389919803 == 482389919803
10 Correct 2 ms 468 KB contestant found the optimal answer: 490686959791 == 490686959791

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1096 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 1 ms 1108 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 12 ms 1108 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 1 ms 1108 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 12 ms 1188 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 11 ms 1108 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 13 ms 1108 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 12 ms 1108 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 3 ms 1108 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 8 ms 1104 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 8580 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 8 ms 8668 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 132 ms 8720 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 7 ms 8660 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 81 ms 8660 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 98 ms 8604 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 113 ms 8664 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 79 ms 8660 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 87 ms 8632 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 127 ms 8532 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 58 ms 82868 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 58 ms 83208 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 1272 ms 83756 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 75 ms 83688 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 1354 ms 83424 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 947 ms 82920 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 1072 ms 83740 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 842 ms 83620 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 934 ms 83336 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 1149 ms 83260 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845