oj.uz

답안 #406797

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
406797 2021-05-18T05:10:15 Z JerryLiu06 수열 (APIO14_sequence) C++17
100 / 100
 795 ms 82276 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 MX = 1e6 + 1;
const int MXN = 1e5 + 1;
const int MXK = 201;
const ll INF = 1e18;
 
int N, K; ll S[MXN], DP[MXN][2]; int ans[MXN][MXK]; int Q[MX], L = 1, R = 1;
 
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) {
        L = R = 1; Q[R++] = 0; FOR(i, 1, N + 1) {            
            while (R - L > 1 && check1(Q[L], Q[L + 1], i, (j - 1) % 2)) L++;
 
            int cur = Q[L]; DP[i][j % 2] = DP[cur][(j - 1) % 2] + (S[i] - S[cur]) * (S[i] - S[cur]); ans[i][j] = cur;
             
            while (R - L > 1 && check2(Q[R - 2], Q[R - 1], i, (j - 1) % 2)) R--; Q[R++] = i;
        }
    }    
    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:73:13: warning: this 'while' clause does not guard... [-Wmisleading-indentation]
   73 |             while (R - L > 1 && check2(Q[R - 2], Q[R - 1], i, (j - 1) % 2)) R--; Q[R++] = i;
      |             ^~~~~
sequence.cpp:73:82: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'while'
   73 |             while (R - L > 1 && check2(Q[R - 2], Q[R - 1], i, (j - 1) % 2)) R--; Q[R++] = i;
      |                                                                                  ^

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 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 332 KB contestant found the optimal answer: 0 == 0
4 Correct 2 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 332 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 332 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 332 KB contestant found the optimal answer: 999919994 == 999919994

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 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

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 460 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 1 ms 460 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 2 ms 460 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 1 ms 460 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 2 ms 460 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Correct 2 ms 460 KB contestant found the optimal answer: 107630884 == 107630884
7 Correct 2 ms 460 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 460 KB contestant found the optimal answer: 482389919803 == 482389919803
10 Correct 1 ms 460 KB contestant found the optimal answer: 490686959791 == 490686959791

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1100 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 1 ms 1100 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 6 ms 1152 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 1 ms 1100 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 8 ms 1152 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 7 ms 1152 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 7 ms 1152 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 7 ms 1100 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 3 ms 1100 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 4 ms 1100 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 8396 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 5 ms 8396 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 56 ms 8468 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 6 ms 8396 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 48 ms 8460 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 51 ms 8456 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 54 ms 8464 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 38 ms 8396 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 46 ms 8472 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 58 ms 8392 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 52 ms 81592 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 58 ms 81728 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 610 ms 82224 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 55 ms 82240 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 795 ms 81860 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 567 ms 81796 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 621 ms 82276 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 411 ms 82088 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 472 ms 82032 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 600 ms 82028 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845