oj.uz

답안 #270570

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
270570 2020-08-17T18:37:38 Z aymane7 Stove (JOI18_stove) C++17
100 / 100
 21 ms 1152 KB 
#include<bits/stdc++.h>
#pragma GCC optimize("O2")
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define all(c) c.begin(), c.end()
#define endl "\n"
#define sz(u) (int)(u.size())
#define L(x)(2*x)
#define R(x)(2*x+1)
#define M(x,y)((x+y)/2)
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
   	cout.tie(0);
	int n,k;
	cin>>n>>k;
	int t[n+1],diff[n+1];
	for(int i=1;i<=n;i++)
		cin>>t[i];
	for(int i=2;i<=n;i++)
		diff[i]=t[i]-t[i-1];
	sort(diff+2,diff+n+1);
	int cnt=0;
	for(int i=2;i<=n;i++){	
		if(i>n-k+1)
			cnt+=1;
		else
			cnt+=diff[i];
	}	
	cout<<cnt+1;
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 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 0 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 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 0 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 0 ms 384 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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 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 0 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 0 ms 384 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 20 ms 1152 KB Output is correct
17 Correct 19 ms 1152 KB Output is correct
18 Correct 19 ms 1152 KB Output is correct
19 Correct 19 ms 1152 KB Output is correct
20 Correct 19 ms 1152 KB Output is correct
21 Correct 19 ms 1152 KB Output is correct
22 Correct 21 ms 1152 KB Output is correct
23 Correct 19 ms 1152 KB Output is correct
24 Correct 20 ms 1152 KB Output is correct