oj.uz

Submission #564319

# Submission time Handle Problem Language Result Execution time Memory
564319 2022-05-18T22:29:00 Z arayi Split the sequence (APIO14_sequence) C++17
100 / 100
 1475 ms 89656 KB 
// Arayi
#include <bits/stdc++.h>
#define fr first
#define sc second
#define MP make_pair
#define ad push_back
#define PB push_back
#define fastio                        \
    ios_base::sync_with_stdio(false); \
    cin.tie(0);                       \
    cout.tie(0);
#define lli long long int
#define y1 arayikhalatyan
#define j1 jigglypuff
#define ld long double
#define itn int
#define pir pair<int, int>
#define all(x) (x).begin(), (x).end()
#define str string
#define enl endl
#define en endl
#define cd complex<long double>
#define vcd vector<cd>
#define vii vector<int>
#define vlli vector<lli>
using namespace std;

lli gcd(lli a, lli b) { return (b == 0LL ? a : gcd(b, a % b)); }
ld dist(ld x, ld y1, ld x2, ld y2)
{
    return sqrt((x - x2) * (x - x2) + (y1 - y2) * (y1 - y2));
}
lli S(lli a)
{
    return (a * (a + 1LL)) / 2;
}
mt19937 rnd(363542);
char vow[] = {'a', 'e', 'i', 'o', 'u'};
int dx[] = {0, -1, 0, 1, -1, -1, 1, 1, 0};
int dy[] = {-1, 0, 1, 0, -1, 1, -1, 1, 0};
char dc[] = {'R', 'D', 'L', 'U'};

const int N = 1e5;
const lli mod = 1e9 + 7;
const ld pi = acos(-1);
const int T = 200;

lli bp(lli a, lli b = mod - 2LL)
{
    lli ret = 1;
    while (b)
    {
        if (b & 1)
            ret *= a, ret %= mod;
        a *= a;
        a %= mod;
        b >>= 1;
    }
    return ret;
}
ostream &operator<<(ostream &c, pir a)
{
    c << a.fr << " " << a.sc;
    return c;
}
template <class T>
void maxi(T &a, T b)
{
    a = max(a, b);
}
template <class T>
void mini(T &a, T b)
{
    a = min(a, b);
}

int n, k;
int p[N][201];
lli nx[N], nw[N];
lli a[N], pr[N];
ld f(int i, int i1)
{
    ld x1;
    ld a = pr[i1] - pr[i];
    if (a != 0)
        x1 = ((ld)(nx[i1] - nx[i])) / a;
    else if (nx[i1] > nx[i])
        x1 = 1e10;
    else
        x1 = -1;
    return x1;
}
bool col[N];
int main()
{
    fastio;
    cin >> n >> k;
    for (int i = 0; i < n; i++)
    {
        cin >> a[i];
        pr[i] = a[i];
        if (i)
            pr[i] += pr[i - 1];
    }
    for (int i = 0; i < n; i++)
        nx[i] = pr[i] * (pr[n - 1] - pr[i]); //, cout << dp[i][1] << " ";
    // cout << endl;
    int ii = 0;
    if (k == 1)
    {
        for (int i = 0; i < n; i++)
            if (nx[i] > nx[ii])
                ii = i;
        cout << nx[ii] << endl;
        cout << ii + 1 << endl;
        return 0;
    }
    for (int x = 2; x <= k; x++)
    {
        vector<pair<ld, int>> fp;
        fp.ad(MP(1e10, 0));
        for (int i = 1; i < n; i++)
        {
            while ((int)fp.size() > 1 && f(fp.back().sc, i) > fp.back().fr)
                fp.pop_back();
            fp.ad(MP(f(fp.back().sc, i), i));
        }
        int i1 = 0;
        for (int i = 0; i < n - 1; i++)
        {
            nw[i] = pr[i] * (pr[n - 1] - pr[i]);
            ld x1 = pr[n - 1] - pr[i];
            while (i1 + 1 < (int)fp.size() && x1 <= fp[i1 + 1].fr && fp[i1 + 1].sc < i)
                i1++;
            // cout << fp[i1].sc << "-";
            p[i][x] = fp[i1].sc;
            nw[i] += nx[fp[i1].sc];
            nw[i] -= pr[fp[i1].sc] * x1;
            // cout << dp[i][x] << " ";
            if (x == k && nw[i] >= nw[ii])
                ii = i;
        }
        swap(nx, nw);
    }
    cout << nx[ii] << endl;
    for (int i = 0; i < k; i++)
    {
        col[ii] = 1;
        cout << ii + 1 << " ";
        ii = p[ii][k - i];
        while (ii < n - 2 && a[ii + 1] == 0 && col[ii + 1] == 0)
            ii++;
    }
    return 0;
}

/*
    __
  *(><)*
    \/ /
    ||/
  --||
    ||
    /\
   /  \
  /    \

*/

Subtask #1
11.0 / 11.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2004 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 2 ms 2004 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 18 ms 2004 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 2 ms 2004 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 16 ms 2004 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Correct 19 ms 2088 KB contestant found the optimal answer: 107630884 == 107630884
7 Correct 22 ms 2076 KB contestant found the optimal answer: 475357671774 == 475357671774
8 Correct 5 ms 2004 KB contestant found the optimal answer: 193556962 == 193556962
9 Correct 4 ms 2004 KB contestant found the optimal answer: 482389919803 == 482389919803
10 Correct 6 ms 2004 KB contestant found the optimal answer: 490686959791 == 490686959791

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2772 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 2 ms 2644 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 32 ms 2772 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 2 ms 2772 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 25 ms 2772 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 27 ms 2772 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 26 ms 2780 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 22 ms 2772 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 6 ms 2776 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 10 ms 2772 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 10460 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 7 ms 10332 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 156 ms 10788 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 6 ms 10776 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 83 ms 10448 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 81 ms 10396 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 112 ms 10768 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 85 ms 10812 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 107 ms 10900 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 119 ms 10940 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 88676 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 44 ms 88560 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 1440 ms 89656 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 47 ms 89260 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 1475 ms 88968 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 691 ms 86196 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 1159 ms 89464 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 901 ms 89220 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 960 ms 89096 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 1259 ms 89192 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845