oj.uz

답안 #1077583

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1077583 2024-08-27T08:06:06 Z ntdaccode K개의 묶음 (IZhO14_blocks) C++17
0 / 100
 1 ms 456 KB 
#include<bits/stdc++.h>
#define fori(i,a,b) for(int i=a;i<=b;i++)
#define int long long
#define ii pair<int,int>
#define fi first
#define se second
#define pb push_back
using namespace std;
const int mod=1e9+7;
const int M=1e6+10;
const int N=1e3+10;
int n,k,f[100010][2],a[100010];
int32_t main()
{
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  #define task "1"
  if(fopen(task".inp","r"))
  {
    freopen(task".inp","r",stdin);
    freopen(task".out","w",stdout);
  }
  cin >> n >> k;
  fori(i,1,n) cin >> a[i];
  fori(i,2,n) f[i][0]=1e12;
  f[1][0]=0;
  fori(j,1,k)
  {
    multiset<int> s;
    stack<int> sk;
    fori(i,1,n)
    {
      f[i][j-1&1]+=a[i];
      while(!sk.empty()&&a[sk.top()]<=a[i])
      {
        f[i][j-1&1]=min(f[i][j-1&1],f[sk.top()][j-1&1]-a[sk.top()]+a[i]);
        s.erase(s.find(f[sk.top()][j-1&1]));
        sk.pop();
      }
      s.insert(f[i][j-1&1]);
      f[i][j&1]=*s.begin();
      //cout<< f[i][j&1] << " ";
      sk.push(i);
    }

  //  cout << endl;
  }
  cout << f[n][k&1] ;
}

Compilation message

blocks.cpp: In function 'int32_t main()':
blocks.cpp:34:13: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
   34 |       f[i][j-1&1]+=a[i];
      |            ~^~
blocks.cpp:37:15: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
   37 |         f[i][j-1&1]=min(f[i][j-1&1],f[sk.top()][j-1&1]-a[sk.top()]+a[i]);
      |              ~^~
blocks.cpp:37:31: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
   37 |         f[i][j-1&1]=min(f[i][j-1&1],f[sk.top()][j-1&1]-a[sk.top()]+a[i]);
      |                              ~^~
blocks.cpp:37:50: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
   37 |         f[i][j-1&1]=min(f[i][j-1&1],f[sk.top()][j-1&1]-a[sk.top()]+a[i]);
      |                                                 ~^~
blocks.cpp:38:37: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
   38 |         s.erase(s.find(f[sk.top()][j-1&1]));
      |                                    ~^~
blocks.cpp:41:22: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
   41 |       s.insert(f[i][j-1&1]);
      |                     ~^~
blocks.cpp:21:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   21 |     freopen(task".inp","r",stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
blocks.cpp:22:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   22 |     freopen(task".out","w",stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 456 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Incorrect 0 ms 348 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #2
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Incorrect 0 ms 344 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 456 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Incorrect 0 ms 348 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #4
0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 456 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Incorrect 0 ms 348 KB Output isn't correct
11 Halted 0 ms 0 KB -