oj.uz

Submission #638423

# Submission time Handle Problem Language Result Execution time Memory
638423 2022-09-05T22:48:34 Z pere_gil Stove (JOI18_stove) C++14
100 / 100
 20 ms 3196 KB 
#include "bits/stdc++.h"
using namespace std;

typedef long long ll;

int main(){
	ll n,k; scanf("%lld %lld",&n,&k);
	vector<ll> v(n);
	for(int i=0;i<n;i++) scanf("%lld",&v[i]);

	ll res=n;
	ll used=n;
	vector<ll> a;
	for(int i=0;i<n-1;i++)
		if(v[i]+1==v[i+1]) used--;
		else a.push_back(v[i+1]-v[i]-1);
   	sort(a.begin(),a.end());

	for(int i=0;i<a.size() && used>k;i++,used--)
		res+=a[i];

	printf("%lld\n",res);
	
	return 0;
}

Compilation message

stove.cpp: In function 'int main()':
stove.cpp:19:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   19 |  for(int i=0;i<a.size() && used>k;i++,used--)
      |              ~^~~~~~~~~
stove.cpp:7:15: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    7 |  ll n,k; scanf("%lld %lld",&n,&k);
      |          ~~~~~^~~~~~~~~~~~~~~~~~~
stove.cpp:9:28: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    9 |  for(int i=0;i<n;i++) scanf("%lld",&v[i]);
      |                       ~~~~~^~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

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

Subtask #2
30.0 / 30.0

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

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 304 KB Output is correct
3 Correct 0 ms 296 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 312 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 312 KB Output is correct
16 Correct 17 ms 3104 KB Output is correct
17 Correct 17 ms 3120 KB Output is correct
18 Correct 20 ms 3196 KB Output is correct
19 Correct 19 ms 3148 KB Output is correct
20 Correct 17 ms 3140 KB Output is correct
21 Correct 17 ms 3116 KB Output is correct
22 Correct 19 ms 3148 KB Output is correct
23 Correct 18 ms 3112 KB Output is correct
24 Correct 18 ms 3116 KB Output is correct