Submission #406781

# Submission time Handle Problem Language Result Execution time Memory
406781 2021-05-18T04:58:40 Z JerryLiu06 Split the sequence (APIO14_sequence) C++17
33 / 100
76 ms 131076 KB
#include <bits/stdc++.h>
 
using namespace std;
 
using ll = long long;
using db = long double;
using str = string;
 
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using pd = pair<db, db>;
 
using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<ll>;
using vd = vector<db>;
using vs = vector<str>;
using vpi = vector<pi>;
using vpl = vector<pl>;
using vpd = vector<pd>;
 
#define mp make_pair
#define f first
#define s second
 
#define sz(x) (int)(x).size()
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define sor(x) sort(all(x))
#define ft front()
#define bk back()
#define pb push_back
#define pf push_front
 
#define lb lower_bound
#define ub upper_bound
 
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define F0R(i, a) FOR(i, 0, a)
#define ROF(i, a, b) for (int i = (b) - 1; i >= (a); i--)
#define R0F(i, a) ROF(i, 0, a)
#define EACH(a, x) for (auto& a : x)
 
const int MOD = 1e9 + 7;
const int MXN = 1e5 + 10;
const int MXK = 210;
const ll INF = 1e18;
 
using ld = long double;
 
int N, K; ll S[MXN], DP[MXN][2], ans[MXN][MXK];
 
ld isect(int A, int B, int i) {
    return (ld) (S[A] * S[A] + DP[A][i] - S[B] * S[B] - DP[B][i]) / (ld) (2 * S[A] - 2 * S[B]); 
}

bool check1(int A, int B, int i, int j) {
    return S[A] * S[A] + DP[A][j] - S[B] * S[B] - DP[B][j] >= S[i] * (2 * S[A] - 2 * S[B]);
}
bool check2(int A, int B, int i, int j) {
    return (S[A] * S[A] + DP[A][j] - S[B] * S[B] - DP[B][j]) * (2 * S[B] - 2 * S[i]) >
           (S[B] * S[B] + DP[B][j] - S[i] * S[i] - DP[i][j]) * (2 * S[A] - 2 * S[B]);
}
 
int main() {
    ios_base::sync_with_stdio(false); cin.tie(0);
 
    cin >> N >> K; FOR(i, 1, N + 1) { int A; cin >> A; S[i] = A + S[i - 1]; }
 
    FOR(i, 1, N + 1) DP[i][1] = S[i] * S[i];
 
    FOR(j, 2, K + 2) {
        deque<int> Q; Q.pb(0); FOR(i, 1, N + 1) {
          //  if (sz(Q) > 1) cout << isect(Q[0], Q[1], (j - 1) % 2) << endl; 
            
            while (sz(Q) > 1 && check1(Q[0], Q[1], i, (j - 1) % 2)) Q.pop_front();
 
            int cur = Q.front(); DP[i][j % 2] = DP[cur][(j - 1) % 2] + (S[i] - S[cur]) * (S[i] - S[cur]); ans[i][j] = cur;
            
     //       cout << cur << " " << DP[i][j % 2] << "\n";
 
            while (sz(Q) > 1 && check2(Q[sz(Q) - 2], Q.back(), i, (j - 1) % 2)) Q.pop_back(); Q.pb(i);
        }
    }
    //FOR(i, 1, N + 1) cout << DP[i][1] << endl;
    
    cout << (S[N] * S[N] - DP[N][(K + 1) % 2]) / 2 << "\n"; int ind = N;
 
    ROF(i, 2, K + 2) { ind = ans[ind][i]; cout << (!ind ? 1 : ind) << " "; }
}

Compilation message

sequence.cpp: In function 'int main()':
sequence.cpp:82:13: warning: this 'while' clause does not guard... [-Wmisleading-indentation]
   82 |             while (sz(Q) > 1 && check2(Q[sz(Q) - 2], Q.back(), i, (j - 1) % 2)) Q.pop_back(); Q.pb(i);
      |             ^~~~~
sequence.cpp:82:95: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'while'
   82 |             while (sz(Q) > 1 && check2(Q[sz(Q) - 2], Q.back(), i, (j - 1) % 2)) Q.pop_back(); Q.pb(i);
      |                                                                                               ^
# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB contestant found the optimal answer: 108 == 108
2 Correct 1 ms 332 KB contestant found the optimal answer: 999 == 999
3 Correct 1 ms 320 KB contestant found the optimal answer: 0 == 0
4 Correct 1 ms 332 KB contestant found the optimal answer: 1542524 == 1542524
5 Correct 1 ms 332 KB contestant found the optimal answer: 4500000000 == 4500000000
6 Correct 1 ms 332 KB contestant found the optimal answer: 1 == 1
7 Correct 1 ms 332 KB contestant found the optimal answer: 1 == 1
8 Correct 1 ms 332 KB contestant found the optimal answer: 1 == 1
9 Correct 1 ms 332 KB contestant found the optimal answer: 100400096 == 100400096
10 Correct 1 ms 332 KB contestant found the optimal answer: 900320000 == 900320000
11 Correct 1 ms 332 KB contestant found the optimal answer: 3698080248 == 3698080248
12 Correct 1 ms 320 KB contestant found the optimal answer: 3200320000 == 3200320000
13 Correct 1 ms 332 KB contestant found the optimal answer: 140072 == 140072
14 Correct 1 ms 320 KB contestant found the optimal answer: 376041456 == 376041456
15 Correct 1 ms 332 KB contestant found the optimal answer: 805 == 805
16 Correct 1 ms 332 KB contestant found the optimal answer: 900189994 == 900189994
17 Correct 1 ms 320 KB contestant found the optimal answer: 999919994 == 999919994
# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB contestant found the optimal answer: 1093956 == 1093956
2 Correct 1 ms 332 KB contestant found the optimal answer: 302460000 == 302460000
3 Correct 1 ms 332 KB contestant found the optimal answer: 122453454361 == 122453454361
4 Correct 1 ms 332 KB contestant found the optimal answer: 93663683509 == 93663683509
5 Correct 1 ms 332 KB contestant found the optimal answer: 1005304678 == 1005304678
6 Correct 1 ms 332 KB contestant found the optimal answer: 933702 == 933702
7 Correct 1 ms 332 KB contestant found the optimal answer: 25082842857 == 25082842857
8 Correct 1 ms 332 KB contestant found the optimal answer: 687136 == 687136
9 Correct 1 ms 332 KB contestant found the optimal answer: 27295930079 == 27295930079
10 Correct 1 ms 332 KB contestant found the optimal answer: 29000419931 == 29000419931
# Verdict Execution time Memory Grader output
1 Correct 1 ms 588 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 1 ms 588 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 2 ms 588 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 1 ms 588 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 2 ms 588 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Correct 2 ms 588 KB contestant found the optimal answer: 107630884 == 107630884
7 Correct 2 ms 588 KB contestant found the optimal answer: 475357671774 == 475357671774
8 Correct 1 ms 588 KB contestant found the optimal answer: 193556962 == 193556962
9 Correct 1 ms 588 KB contestant found the optimal answer: 482389919803 == 482389919803
10 Correct 1 ms 588 KB contestant found the optimal answer: 490686959791 == 490686959791
# Verdict Execution time Memory Grader output
1 Correct 2 ms 1996 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 2 ms 1996 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 10 ms 1996 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 2 ms 1988 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 9 ms 1996 KB contestant found the optimal answer: 679388326 == 679388326
6 Incorrect 7 ms 1996 KB contestant didn't find the optimal answer: 4699030135 < 4699030287
7 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 9 ms 16996 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 9 ms 16972 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 75 ms 17076 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 9 ms 17024 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 58 ms 17072 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Incorrect 76 ms 16972 KB contestant didn't find the optimal answer: 514786325281 < 514790755404
7 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 67 ms 131076 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -