oj.uz

답안 #305226

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
305226 2020-09-22T18:03:36 Z MarcoMeijer 수열 (APIO14_sequence) C++14
100 / 100
 1991 ms 81920 KB 
#include <bits/stdc++.h>
using namespace std;
 
// macros
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> lll;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
typedef vector<lll> vlll;
#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define RE(a,c) REP(a,0,c)
#define RE1(a,c) REP(a,1,c+1)
#define REI(a,b,c) REP(a,b,c+1)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define FOR(a,b) for(auto& a : b)
#define all(a) a.begin(), a.end()
#define INF 1e18
#define EPS 1e-9
#define pb push_back
#define popb pop_back
#define fi first
#define se second
#define sz size()
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
 
// input
template<class T> void IN(T& x) {cin >> x;}
template<class H, class... T> void IN(H& h, T&... t) {IN(h); IN(t...); }
 
// output
template<class T1, class T2> void OUT(const pair<T1,T2>& x);
template<class T> void OUT(const vector<T>& x);
template<class T> void OUT(const T& x) {cout << x;}
template<class H, class... T> void OUT(const H& h, const T&... t) {OUT(h); OUT(t...); }
template<class T1, class T2> void OUT(const pair<T1,T2>& x) {OUT(x.fi,' ',x.se);}
template<class T> void OUT(const vector<T>& x) {RE(i,x.size()) OUT(i==0?"":" ",x[i]);}
template<class... T> void OUTL(const T&... t) {OUT(t..., "\n"); }
template<class H> void OUTLS(const H& h) {OUTL(h); }
template<class H, class... T> void OUTLS(const H& h, const T&... t) {OUT(h,' '); OUTLS(t...); }
 
//===================//
//  Added libraries  //
//===================//
 
//===================//
//end added libraries//
//===================//
 
void program();
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    program();
}
 
 
//===================//
//   begin program   //
//===================//
 
const int MX = 1e5+2;
 
int n, k;
vi seq;
int a[MX];
ll sm[MX];
ll dpcur[MX], dpprev[MX];
int dpr[MX][201];
 
void fillSeq(int i, int j) {
    if(j < 0) return;
    seq.pb(dpr[i][j]);
    fillSeq(dpr[i][j]-1, j-1);
}
void daq(int j, int l, int r, int lopt, int ropt) {
    if(r<l) return;
 
    int m=(l+r)/2;
 
    ll res = -INF;
    int nropt = min(ropt,m);
    dpr[m][j] = 1;
    REP(i,lopt,nropt+1) {
        ll ndp = (sm[m+1]-sm[i])*sm[i] + dpprev[i-1];
        if(ndp > res) {
            res = ndp;
            dpr[m][j] = i;
        }
    }
    dpcur[m] = res;
 
    int opt = dpr[m][j];
    daq(j,l,m-1,lopt,opt);
    daq(j,m+1,r,opt,ropt);
}
 
void program() {
    IN(n,k);
    RE(i,n) IN(a[i]);
    
    sm[0]=0;
    RE(i,n) sm[i+1]=sm[i]+a[i];
 
    RE(i,n) dpprev[i] = 0;
    RE(j,k) {
        daq(j,0,n-1,1,n-1);
        RE(i,n) dpprev[i] = dpcur[i];
    }
 
    OUTL(dpcur[n-1]);
    fillSeq(n-1, k-1);
    OUTLS(seq);
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB contestant found the optimal answer: 108 == 108
2 Correct 0 ms 384 KB contestant found the optimal answer: 999 == 999
3 Correct 0 ms 384 KB contestant found the optimal answer: 0 == 0
4 Correct 1 ms 384 KB contestant found the optimal answer: 1542524 == 1542524
5 Correct 1 ms 384 KB contestant found the optimal answer: 4500000000 == 4500000000
6 Correct 0 ms 384 KB contestant found the optimal answer: 1 == 1
7 Correct 0 ms 384 KB contestant found the optimal answer: 1 == 1
8 Correct 0 ms 384 KB contestant found the optimal answer: 1 == 1
9 Correct 0 ms 384 KB contestant found the optimal answer: 100400096 == 100400096
10 Correct 1 ms 384 KB contestant found the optimal answer: 900320000 == 900320000
11 Correct 0 ms 384 KB contestant found the optimal answer: 3698080248 == 3698080248
12 Correct 0 ms 384 KB contestant found the optimal answer: 3200320000 == 3200320000
13 Correct 0 ms 384 KB contestant found the optimal answer: 140072 == 140072
14 Correct 1 ms 384 KB contestant found the optimal answer: 376041456 == 376041456
15 Correct 0 ms 384 KB contestant found the optimal answer: 805 == 805
16 Correct 1 ms 384 KB contestant found the optimal answer: 900189994 == 900189994
17 Correct 0 ms 384 KB contestant found the optimal answer: 999919994 == 999919994

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB contestant found the optimal answer: 1093956 == 1093956
2 Correct 1 ms 384 KB contestant found the optimal answer: 302460000 == 302460000
3 Correct 1 ms 384 KB contestant found the optimal answer: 122453454361 == 122453454361
4 Correct 1 ms 384 KB contestant found the optimal answer: 93663683509 == 93663683509
5 Correct 0 ms 384 KB contestant found the optimal answer: 1005304678 == 1005304678
6 Correct 1 ms 384 KB contestant found the optimal answer: 933702 == 933702
7 Correct 1 ms 384 KB contestant found the optimal answer: 25082842857 == 25082842857
8 Correct 1 ms 384 KB contestant found the optimal answer: 687136 == 687136
9 Correct 1 ms 384 KB contestant found the optimal answer: 27295930079 == 27295930079
10 Correct 0 ms 384 KB contestant found the optimal answer: 29000419931 == 29000419931

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 512 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 1 ms 512 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 1 ms 512 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 1 ms 512 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 1 ms 512 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Correct 2 ms 512 KB contestant found the optimal answer: 107630884 == 107630884
7 Correct 1 ms 512 KB contestant found the optimal answer: 475357671774 == 475357671774
8 Correct 1 ms 512 KB contestant found the optimal answer: 193556962 == 193556962
9 Correct 1 ms 512 KB contestant found the optimal answer: 482389919803 == 482389919803
10 Correct 1 ms 512 KB contestant found the optimal answer: 490686959791 == 490686959791

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1152 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 1 ms 1152 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 1152 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 9 ms 1152 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 9 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 6 ms 1152 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 3 ms 1152 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 4 ms 1152 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 8448 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 7 ms 8448 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 83 ms 8448 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 6 ms 8448 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 82 ms 8448 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 83 ms 8548 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 73 ms 8448 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 53 ms 8448 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 73 ms 8568 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 92 ms 8676 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 70 ms 81784 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 67 ms 81784 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 1607 ms 81920 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 66 ms 81784 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 1991 ms 81792 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 1368 ms 81796 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 1280 ms 81792 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 1012 ms 81784 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 1281 ms 81792 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 1609 ms 81912 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845