oj.uz

답안 #538237

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
538237 2022-03-16T11:31:19 Z AdamGS Peru (RMI20_peru) C++17
0 / 100
 1 ms 340 KB 
#include "peru.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(a, b) for(int a = 0; a < (b); ++a)
#define st first
#define nd second
#define pb push_back
#define all(a) a.begin(), a.end()
const ll MOD=1e9+7, LIM=25e5+7, INF=1e18+7;
ll dp[LIM], odw[LIM], tr[4*LIM], trm[4*LIM], N=1, li, li2;
vector<pair<ll,int>>V, P;
ll cnt(int l, int r) {
  l+=N; r+=N;
  ll ans=max(tr[l], tr[r]);
  while(l/2!=r/2) {
    if(l%2==0) ans=max(ans, tr[l+1]);
    if(r%2==1) ans=max(ans, tr[r-1]);
    l/=2; r/=2;
  }
  return ans;
}
void dodaj(ll x, int i) {
  while(V.size() && x>=V.back().st) {
    odw[V.back().nd]=1;
    V.pop_back();
    li=min(li, (long long)V.size());
  }
  if(V.size()) {
    while(P.size() && x+dp[V.back().nd]>=P.back().st) {
      P.pop_back();
      li2=min(li2, (long long)V.size());
    }
    P.pb({x+dp[V.back().nd], i});
  }
  V.pb({x, i});
}
int solve(int n, int k, int* v){
  while(N<n) N*=2;
  rep(i, n) tr[N+i]=v[i];
  for(int i=N-1; i>=0; --i) tr[i]=max(tr[2*i], tr[2*i+1]);
  rep(i, k) {
    dp[i]=cnt(0, i);
    dodaj(v[i], i);
  }
  for(int i=k; i<n; ++i) {
    dodaj(v[i], i);
    dp[i]=dp[i-k]+cnt(i-k+1, i);
    while(li<V.size() && V[li].nd<=i-k) ++li;
    if(li==V.size()) li2=P.size();
    while(li2<P.size() && (P[li2].nd<V[li+1].nd || odw[P[li2].nd])) ++li2;
    if(li2<P.size()) dp[i]=min(dp[i], P[li2].st);
  }
  ll ans=0;
  rep(i, n) ans=(ans*23+dp[i])%MOD;
  return ans;
}

Compilation message

peru.cpp: In function 'int solve(int, int, int*)':
peru.cpp:49:13: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::pair<long long int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   49 |     while(li<V.size() && V[li].nd<=i-k) ++li;
      |           ~~^~~~~~~~~
peru.cpp:50:10: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::pair<long long int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   50 |     if(li==V.size()) li2=P.size();
      |        ~~^~~~~~~~~~
peru.cpp:51:14: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::pair<long long int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   51 |     while(li2<P.size() && (P[li2].nd<V[li+1].nd || odw[P[li2].nd])) ++li2;
      |           ~~~^~~~~~~~~
peru.cpp:52:11: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::pair<long long int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   52 |     if(li2<P.size()) dp[i]=min(dp[i], P[li2].st);
      |        ~~~^~~~~~~~~

Subtask #1
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -