oj.uz

답안 #785992

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
785992 2023-07-17T21:39:57 Z Sputnik123 Stove (JOI18_stove) C++14
100 / 100
 48 ms 3200 KB 
#pragma comment(linker, "/STACK:100000000")
#include <bits/stdc++.h>
#include <string.h>
#include <stdio.h>
#include <algorithm>
#include <vector>
#define pb push_back
#define in insert
#define pll pair<ll,ll>
#define vpl vector<pll>
#define vll vector <ll>
#define vl vector<ll>
#define sl set<ll>
#define msl multiset<ll>
#define mll map<ll,ll>
#define mmll multimap<ll,ll>
#define mcl map<char,ll>
#define mp make_pair
#define F first
#define S second
#define all(v) v.begin(),v.end()
#define endl "\n"
#define speed ios_base::sync_with_stdio(false);cin.tie();cout.tie()
#define ll long long
#define ull unsigned long long
#define LMX LLONG_MAX
using namespace std;
#define REP(i, n) for (ll i=0;i<(n);i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define F0R(i, a) FOR(i, 0, a)
#define ROF(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i, a) ROF(i, 0, a)
#define rep(a) F0R(_, a)
#define each(a, x) for (auto &a : x)
/*
#pragma omp parallel for
#pragma GCC optimize("0fast")
#pragma GCC target ("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
*/
bool comp(pair <ll,ll> p1,pair <ll,ll> p2)
{
   if(p1.first==p2.first)
   {
      return p1.second>p2.second;
   }
   return p1.first<p2.first;
}
void solve()
{
   ll n,k;
   cin>>n>>k;
   vll v1(n);
   for(ll i=0;i<n;i++)  cin>>v1[i];
   priority_queue <ll> pq;
   for(ll i=1;i<n;i++)
   {
      pq.push(v1[i]-v1[i-1]-1);
   }
   ll ans=v1[n-1]-v1[0]+1;
   for(ll i=0;i<k-1;i++)
   {
      auto last=pq.top();
      pq.pop();
      ans-=last;
   }
   cout<<ans;
}
int main ()
{
   ll t=1;
   //cin>>t;
   while(t--)
   {
      solve();
   }
}

/*

string
length

*/
/*
    auto locate = [&](int x) -> int {
        for (int i = 0; i < N; i++)
            if (P[i] == x)
                return i;

        return -1;
    };
    function in funcition
*/

Compilation message

stove.cpp:1: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
    1 | #pragma comment(linker, "/STACK:100000000")
      |

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 296 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 304 KB Output is correct
6 Correct 1 ms 304 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 300 KB Output is correct
9 Correct 1 ms 212 KB Output is correct

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 296 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 304 KB Output is correct
6 Correct 1 ms 304 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 300 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 2 ms 340 KB Output is correct
13 Correct 2 ms 340 KB Output is correct
14 Correct 2 ms 340 KB Output is correct
15 Correct 2 ms 348 KB Output is correct

Subtask #3
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 296 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 304 KB Output is correct
6 Correct 1 ms 304 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 300 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 2 ms 340 KB Output is correct
13 Correct 2 ms 340 KB Output is correct
14 Correct 2 ms 340 KB Output is correct
15 Correct 2 ms 348 KB Output is correct
16 Correct 30 ms 3112 KB Output is correct
17 Correct 31 ms 3104 KB Output is correct
18 Correct 30 ms 3140 KB Output is correct
19 Correct 31 ms 3200 KB Output is correct
20 Correct 36 ms 3108 KB Output is correct
21 Correct 37 ms 3196 KB Output is correct
22 Correct 39 ms 3140 KB Output is correct
23 Correct 38 ms 3108 KB Output is correct
24 Correct 48 ms 3116 KB Output is correct