oj.uz

Submission #713979

# Submission time Handle Problem Language Result Execution time Memory
713979 2023-03-23T11:55:59 Z epicci23 Stove (JOI18_stove) C++17
100 / 100
 59 ms 9080 KB 
#include "bits/stdc++.h"
#pragma optimize ("Bismillahirrahmanirrahim")
using namespace std;
#define pb push_back
#define ff first
#define ss second
#define endl "\n" 
#define int long long
#define double long double
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define what_is(x) cerr << #x << " is " << x << endl;
//#define m (l+r)/2
constexpr int N=200005;
constexpr int MOD=1000000007;
constexpr int  INF2 = LLONG_MAX;
constexpr int INF=(int)1e18;
constexpr int LOG=30;
typedef pair<int,int> pii;
typedef tuple<int,int,int> tp;
typedef priority_queue<pii,vector<pii>,greater<pii>> min_pq;
typedef priority_queue<pii> max_pq;
typedef long long ll;
//to think//
/*
 * graph approach
 * dp
 * dividing the problem to smaller statements
 * finding the real constraint
 * sqrt decomposition
 * greedy approach
 * pigeonhole principle
 * rewriting the problem/equality 
 * bitwise approaches
 * binary search if monotonic
 * divide and conquer
 * combinatorics
 * inclusion - exclusion
 * think like bfs
*/



inline int in()
{
  int x;cin >> x;
  return x;
}

inline string in2()
{
  string x;cin >> x;
  return x;
}


void solve()
{
  int n=in(),k=in();

  set<pii> s;

  vector<int> mark(n+2,0);

  int arr[n+1];
  for(int i=1;i<=n;i++) arr[i]=in();

  for(int i=1;i<n;i++)
  {
    if(arr[i]+1<arr[i+1]) s.insert({arr[i+1]-arr[i]-1,i});
  }
  int kac=k-1;
  while(!s.empty() && kac)
  {
    mark[(*s.rbegin()).ss]=1;
    s.erase(*s.rbegin());
    kac--;
  }
  int last=arr[1],ans=0;
  for(int i=1;i<n;i++)
  {
    if(mark[i]==1)
    {
      ans+=arr[i]+1-last;
      last=arr[i+1];
    }
  }
  ans+=arr[n]+1-last;
  cout << ans << endl;
}

int32_t main(){
   

     cin.tie(0); ios::sync_with_stdio(0);
     cout << fixed <<  setprecision(15);
   
   int t=1;//cin>> t;
 
 for(int i=1;i<=t;i++)
 {
  //  cout << "Case #" << i << ": ";
    solve();
 }
 
 return 0;
}

Compilation message

stove.cpp:2: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    2 | #pragma optimize ("Bismillahirrahmanirrahim")
      |

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 316 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 316 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 0 ms 320 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 316 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 316 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 0 ms 320 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 2 ms 460 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 2 ms 456 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 316 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 316 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 0 ms 320 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 2 ms 460 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 2 ms 456 KB Output is correct
16 Correct 48 ms 9036 KB Output is correct
17 Correct 55 ms 9040 KB Output is correct
18 Correct 47 ms 9068 KB Output is correct
19 Correct 47 ms 9036 KB Output is correct
20 Correct 46 ms 9048 KB Output is correct
21 Correct 49 ms 8992 KB Output is correct
22 Correct 50 ms 9080 KB Output is correct
23 Correct 56 ms 9024 KB Output is correct
24 Correct 59 ms 9036 KB Output is correct