oj.uz

답안 #93509

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
93509 2019-01-09T06:04:34 Z dimash241 Stove (JOI18_stove) C++17
100 / 100
 116 ms 11128 KB 
# include <stdio.h>
# include <bits/stdc++.h>


#define _USE_MATH_DEFINES_
#define ll long long
#define ld long double
#define Accepted 0
#define pb push_back
#define mp make_pair
#define sz(x) (int)(x.size())
#define every(x) x.begin(),x.end()
#define F first
#define S second
#define For(i,x,y)  for (int i = x; i <= y; i ++) 
#define FOr(i,x,y)  for (int i = x; i >= y; i --)
#define SpeedForce ios_base::sync_with_stdio(0), cin.tie(0)
// ROAD to...                                                                                                                                                                                                                Red

using namespace std;

inline bool isvowel (char c) {
	c = tolower(c);
    if (c == 'a' || c == 'e' || c == 'i' || c == 'y' || c == 'o' || c == 'u') return 1;
    return 0;
}

const double eps = 0.000001;
const ld pi = acos(-1);
const int maxn = 1e7 + 9;
const int mod = 1e9 + 7;
const ll MOD = 1e18 + 9;
const ll INF = 1e18 + 123;
const int inf = 2e9 + 11;
const int mxn = 1e6 + 9;
const int N = 6e5 + 123;                                          
const int M = 22;
const int pri = 997;
const int Magic = 2101;

const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, -1, 0, 1};
 
int n, m, k;
int a[N];

int main () {
	SpeedForce;             
    cin >> n >> k;
    multiset < int > s, raz;
    for (int i = 1; i <= n; i ++) {
    	cin >> a[i];
    	if (i > 1) raz.insert(a[i] - a[i - 1]);
    	if (s.size() < k) s.insert(1);
    	else {
    		int v = *raz.begin();
    		raz.erase(raz.find(v));
    		v += *s.begin();
    		s.erase(s.find(*s.begin()));
    		s.insert(v);  	
    	}
    
    }

    int ans = 0;
    for (auto it : s) ans += it;
    cout << ans;

    return Accepted;
}

// Coded By OB

Compilation message

stove.cpp: In function 'int main()':
stove.cpp:54:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
      if (s.size() < k) s.insert(1);
          ~~~~~~~~~^~~

Subtask #1
20.0 / 20.0

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

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 3 ms 504 KB Output is correct
13 Correct 3 ms 504 KB Output is correct
14 Correct 4 ms 632 KB Output is correct
15 Correct 3 ms 632 KB Output is correct

Subtask #3
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 3 ms 504 KB Output is correct
13 Correct 3 ms 504 KB Output is correct
14 Correct 4 ms 632 KB Output is correct
15 Correct 3 ms 632 KB Output is correct
16 Correct 28 ms 1828 KB Output is correct
17 Correct 34 ms 1656 KB Output is correct
18 Correct 39 ms 1784 KB Output is correct
19 Correct 60 ms 2680 KB Output is correct
20 Correct 97 ms 6316 KB Output is correct
21 Correct 116 ms 10156 KB Output is correct
22 Correct 104 ms 11004 KB Output is correct
23 Correct 113 ms 11128 KB Output is correct
24 Correct 107 ms 11128 KB Output is correct