oj.uz

Submission #1088808

# Submission time Handle Problem Language Result Execution time Memory
1088808 2024-09-15T06:36:31 Z rayan_bd Stove (JOI18_stove) C++17
100 / 100
 22 ms 2524 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroint-loops")
#pragma GCC optimization("Ofast")

#define all(v) v.begin(), v.end()

const int mxN = 1e9+100;
 
signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    
 	int n,k;cin>>n>>k;
 	int ar[n+1];
 	for(int i=1;i<=n;++i) cin>>ar[i];
 	vector<int> vec;

 	for(int i=2;i<=n;++i){
 		vec.emplace_back(ar[i-1]-ar[i]+1);
 	}

 	sort(all(vec));

 	//4,4 totalOn-totalOf

 	int ans=ar[n]-ar[1]+1;
 	int lim=min(k-1,(int)vec.size());

 	for(int i=0;i<lim;++i){
 		ans+=vec[i];
 	}

 	cout<<ans;

    return 0;
}

Compilation message

stove.cpp:6: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    6 | #pragma GCC optimization ("O3")
      | 
stove.cpp:7: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    7 | #pragma GCC optimization ("unroint-loops")
      | 
stove.cpp:8: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    8 | #pragma GCC optimization("Ofast")
      |

Subtask #1
20.0 / 20.0

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

Subtask #2
30.0 / 30.0

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

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 22 ms 2272 KB Output is correct
17 Correct 13 ms 2268 KB Output is correct
18 Correct 21 ms 2368 KB Output is correct
19 Correct 20 ms 2272 KB Output is correct
20 Correct 22 ms 2272 KB Output is correct
21 Correct 14 ms 2272 KB Output is correct
22 Correct 14 ms 2524 KB Output is correct
23 Correct 13 ms 2448 KB Output is correct
24 Correct 15 ms 2432 KB Output is correct