oj.uz

답안 #289218

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
289218 2020-09-02T13:13:48 Z NaimSS 수열 (APIO14_sequence) C++14
11 / 100
 81 ms 131076 KB 
#include <bits/stdc++.h>
#define ld long double
#define endl "\n"
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define pb(x) push_back(x)
#define mp(a,b) make_pair(a,b)
#define ms(v,x) memset(v,x,sizeof(v))
#define all(v) v.begin(),v.end()
#define ff first
#define ss second
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define per(i, a, b) for(int i = b-1; i>=a ; i--)
#define trav(a, x) for(auto& a : x)
#define allin(a , x) for(auto a : x)
#define Unique(v) sort(all(v));v.erase(unique(all(v)),v.end());
#define sz(v) (int)v.size()
//#define int long long
using namespace std;
typedef vector<int> vi;
#define y1 abacaba
#define left sefude
#define db(x) cerr << #x <<" == "<<x << endl;
#define db2(x,y) cerr<<#x <<" == "<<x<<", "<<#y<<" == "<<y<<endl;
#define db3(x,y,z) cerr << #x<<" == "<<x<<", "<<#y<<" == "<<y<<", "<<#z<<" == "<<z<<endl; 
typedef long long ll;
typedef pair<int,int> pii;
inline ll mod(ll n, ll m ){ ll ret = n%m; if(ret < 0) ret += m; return ret; }
ll gcd(ll a, ll b){return (b == 0LL ? a : gcd(b, a%b));}
ll exp(ll a,ll b,ll m){
    if(b==0LL) return 1LL;
    if(b==1LL) return mod(a,m);
    ll k = mod(exp(a,b/2,m),m);
    if(b&1LL){
        return mod(a*mod(k*k,m),m);
    }
    else return mod(k*k,m);
}

const int N = 100100;
ll pre[N],a[N];
ll dp[N][201];
int go[N][201];

ll cost(int id,int k,int pr){
  
  return dp[id][k-1] - pre[id]*pre[id] + pre[id]*pr;
}

bool bad(int id1,int id2,int pr,int k){
  return cost(id2,k,pr) >= cost(id1,k,pr);
}

int32_t main(){
  fastio;
  int n,K;
  cin >> n >> K;
  for(int i=1;i<=n;i++){
    cin >> a[i];
    pre[i] = a[i] + pre[i-1];
  }

  for(int k=1;k<=K;k++){
    int curline = 0;
    for(int i=1;i<=n;i++){
      while(curline < i and bad(curline,curline+1,pre[i],k)){
        curline++;
      }
      go[i][k] = curline;
      dp[i][k] = cost(curline,k,pre[i]);  
      
    }
  }
  cout << dp[n][K] << endl;
  vi res;
  int cur = n;
  for(int i=K;i>=1;i--){
    res.pb(go[cur][i]);
    cur = go[cur][i];
  }
  for(int x : res)cout << x<<" ";
  cout<<endl;

  // math -> gcd it all
  // Did u check N=1? Did you switch N,M?
}

Subtask #1
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 Incorrect 1 ms 384 KB Integer 2 violates the range [1, 1]
4 Halted 0 ms 0 KB -

Subtask #2
11.0 / 11.0

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

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 768 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 1 ms 768 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 1 ms 896 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 1 ms 896 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 1 ms 896 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Incorrect 1 ms 896 KB Integer 200 violates the range [1, 199]
7 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2688 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 2 ms 2688 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 4 ms 2688 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 2 ms 2688 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 4 ms 2688 KB contestant found the optimal answer: 679388326 == 679388326
6 Incorrect 4 ms 2688 KB contestant didn't find the optimal answer: 4699022112 < 4699030287
7 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 24192 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 14 ms 24192 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 35 ms 24192 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 14 ms 24192 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 36 ms 24192 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Incorrect 36 ms 24192 KB contestant didn't find the optimal answer: 514785562499 < 514790755404
7 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 81 ms 131076 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -