Submission #307210

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
307210	2020-09-27T11:02:16 Z	cpp219	Stove (JOI18_stove)	C++14	100 / 100	22 ms	1312 KB

stove

// Solid <candgenesis>
#include <bits/stdc++.h>
#define ll int
#define ld long double
#define fs first
#define sc second
using namespace std;
const ll N = 3e5 + 4;
const ll inf = 1e9 + 7;
const ll base = 37;
typedef pair<ll,ll> LL;

ll n,k,a[N],i,b[N];
bool lf(ll x,ll y){
    return x > y;
}
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    #define task "tst"
    if (fopen(task".inp", "r")){
        freopen(task".inp", "r", stdin);
        //freopen(task".out", "w", stdout);
    }
    cin>>n>>k; k--;
    for (i = 1;i <= n;i++) cin>>a[i];
    for (i = 1;i < n;i++) b[i] = a[i + 1] - a[i] - 1;
    sort(b + 1,b + n,lf);
    ll ans = a[n] - a[1] + 1;
    for (i = 1;i < n;i++){
        if (k) ans -= b[i],k--;
        else break;
    }
    cout<<ans;
}

Compilation message

stove.cpp: In function 'int main()':
stove.cpp:22:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   22 |         freopen(task".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1

20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Correct	1 ms	384 KB	Output is correct
3	Correct	1 ms	384 KB	Output is correct
4	Correct	1 ms	384 KB	Output is correct
5	Correct	0 ms	384 KB	Output is correct
6	Correct	1 ms	384 KB	Output is correct
7	Correct	0 ms	384 KB	Output is correct
8	Correct	1 ms	408 KB	Output is correct
9	Correct	0 ms	384 KB	Output is correct

Subtask #2

30.0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Correct	1 ms	384 KB	Output is correct
3	Correct	1 ms	384 KB	Output is correct
4	Correct	1 ms	384 KB	Output is correct
5	Correct	0 ms	384 KB	Output is correct
6	Correct	1 ms	384 KB	Output is correct
7	Correct	0 ms	384 KB	Output is correct
8	Correct	1 ms	408 KB	Output is correct
9	Correct	0 ms	384 KB	Output is correct
10	Correct	1 ms	384 KB	Output is correct
11	Correct	1 ms	384 KB	Output is correct
12	Correct	1 ms	384 KB	Output is correct
13	Correct	1 ms	384 KB	Output is correct
14	Correct	1 ms	384 KB	Output is correct
15	Correct	1 ms	384 KB	Output is correct

Subtask #3

50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Correct	1 ms	384 KB	Output is correct
3	Correct	1 ms	384 KB	Output is correct
4	Correct	1 ms	384 KB	Output is correct
5	Correct	0 ms	384 KB	Output is correct
6	Correct	1 ms	384 KB	Output is correct
7	Correct	0 ms	384 KB	Output is correct
8	Correct	1 ms	408 KB	Output is correct
9	Correct	0 ms	384 KB	Output is correct
10	Correct	1 ms	384 KB	Output is correct
11	Correct	1 ms	384 KB	Output is correct
12	Correct	1 ms	384 KB	Output is correct
13	Correct	1 ms	384 KB	Output is correct
14	Correct	1 ms	384 KB	Output is correct
15	Correct	1 ms	384 KB	Output is correct
16	Correct	22 ms	1280 KB	Output is correct
17	Correct	22 ms	1280 KB	Output is correct
18	Correct	22 ms	1280 KB	Output is correct
19	Correct	22 ms	1280 KB	Output is correct
20	Correct	21 ms	1280 KB	Output is correct
21	Correct	22 ms	1280 KB	Output is correct
22	Correct	22 ms	1312 KB	Output is correct
23	Correct	22 ms	1280 KB	Output is correct
24	Correct	21 ms	1280 KB	Output is correct