oj.uz

답안 #560103

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
560103 2022-05-11T04:14:37 Z khangal 수열 (APIO14_sequence) C++14
71 / 100
 624 ms 131072 KB 
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef double db;
typedef vector<long long> vl;
typedef pair<long long, long long > pl;
const int N = 1e6 + 1;
#define po pop_back
#define pb push_back
#define mk make_pair
#define lw lower_bound
#define up upper_bound
#define ff first
#define ss second
#define boost ios_base::sync_with_stdio(); cin.tie(0); cout.tie(0);
#define MOD 1000000007
#define MAX 1e18 
#define MIN -1e18
#define per(i,a,b) for(ll i=b;i>=a;i--)
#define con continue
#define freopen freopen("input.txt", "r", stdin);freopen("output.txt", "w", stdout);
#define PI 3.14159265358979323846264338327950288419716939937510582097494459230781640628
// typedef tree<ll , null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
// template< typename T>
// using indexed_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
ll n, m, mid, res,pos, mn, mx, sum, h1, h2, arr[3234567],arr1[1234567],k, i, j, h, a, x, y, z,par[1234567];
bool used[1234567];
ll tp[1234567];
ll dx[4]={-1,1,0,0},dy[4]={0,0,-1,1},c1[123][123];
//ll jump[22][223456];
//ll lvl[1234567];
//ll bit[1234567];
//ll timer;
//ll st[1234567],endd[1234567];
//ll dp[5005][5005];
ll f[2][100010],w[300][200000];
void solve(ll k,ll l,ll r,ll L,ll R){
    if(r < l)return;
    ll mid = (l+r)/2;
    f[k&1][mid] = MIN;
    for(int j=L;j<=min(mid,R);j++){
        if(f[k&1][mid] < f[k&1^1][j] + arr[j]*(arr[mid] - arr[j]))f[k&1][mid]=f[k&1^1][j] + arr[j]*(arr[mid] - arr[j]),w[k][mid]=j;
    }
    solve(k,l,mid-1 , L,w[k][mid]);
    solve(k,mid+1,r , w[k][mid],R);
    
}
class A {  
public :
    static void funcA() {
        cin>>n>>k;
        f[0][0]=MIN;
        for(int i=1;i<=n;i++)cin>>arr[i],arr[i]+=arr[i-1];
        for(int l=1;l<=k;l++){
            solve(l,l,n,l,n);
        }
        cout<<f[k&1][n]<<'\n';
        vl vec(k);
        for(int v=n,l=k ; v = w[l--][v];)vec[l]=v;
        for(auto u:vec)cout<<u<<" ";
    }
}lol;
void solve() {
    A::funcA();
}
int main() {
    ll T = 1;
    //cin>>T;
    boost;
    while (T--) {   
        solve();
    }
}

Compilation message

sequence.cpp: In function 'void solve(ll, ll, ll, ll, ll)':
sequence.cpp:45:29: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
   45 |         if(f[k&1][mid] < f[k&1^1][j] + arr[j]*(arr[mid] - arr[j]))f[k&1][mid]=f[k&1^1][j] + arr[j]*(arr[mid] - arr[j]),w[k][mid]=j;
      |                            ~^~
sequence.cpp:45:82: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
   45 |         if(f[k&1][mid] < f[k&1^1][j] + arr[j]*(arr[mid] - arr[j]))f[k&1][mid]=f[k&1^1][j] + arr[j]*(arr[mid] - arr[j]),w[k][mid]=j;
      |                                                                                 ~^~
sequence.cpp: In static member function 'static void A::funcA()':
sequence.cpp:62:29: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   62 |         for(int v=n,l=k ; v = w[l--][v];)vec[l]=v;
      |                           ~~^~~~~~~~~~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 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 308 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 0 ms 308 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 312 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 308 KB contestant found the optimal answer: 900320000 == 900320000
11 Correct 1 ms 340 KB contestant found the optimal answer: 3698080248 == 3698080248
12 Correct 0 ms 340 KB contestant found the optimal answer: 3200320000 == 3200320000
13 Correct 0 ms 340 KB contestant found the optimal answer: 140072 == 140072
14 Correct 1 ms 336 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 0 ms 340 KB contestant found the optimal answer: 999919994 == 999919994

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 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 696 KB contestant found the optimal answer: 122453454361 == 122453454361
4 Correct 1 ms 340 KB contestant found the optimal answer: 93663683509 == 93663683509
5 Correct 1 ms 292 KB contestant found the optimal answer: 1005304678 == 1005304678
6 Correct 1 ms 340 KB contestant found the optimal answer: 933702 == 933702
7 Correct 1 ms 468 KB contestant found the optimal answer: 25082842857 == 25082842857
8 Correct 1 ms 340 KB contestant found the optimal answer: 687136 == 687136
9 Correct 0 ms 308 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

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

Subtask #4
17.0 / 17.0

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

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 840 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 3 ms 780 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 71 ms 17460 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 4 ms 852 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 80 ms 10644 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 76 ms 12352 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 72 ms 13312 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 51 ms 10860 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 70 ms 12352 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 89 ms 15812 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 5196 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 29 ms 5196 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Runtime error 624 ms 131072 KB Execution killed with signal 9
4 Halted 0 ms 0 KB -