Submission #93507

#TimeUsernameProblemLanguageResultExecution timeMemory
93507PancakeStove (JOI18_stove)C++14
0 / 100
2 ms376 KiB
#pragma GCC optimize("Ofast") #pragma GCC target("sse,sse2,sse3,sse3,sse4,popcnt,abm,mmx") #include <bits/stdc++.h> #include <stdio.h> using namespace std; #define F first #define S second #define lb lower_bound #define ub upper_bound #define pb push_back #define pf push_front #define ppb pop_back #define mp make_pair #define bpp __builtin_popcount #define sqr(x) ((x) * (x)) #define al 0x3F3F3F3F #define sz(x) (int)x.size() #define all(x) x.begin(), x.end() #define in insert #define ppf pop_front #define endl '\n' #define int long long typedef unsigned long long ull; typedef long long ll; typedef long double ld; typedef pair <int, int> pii; const int mod = (int)1e9 + 7; const int N = (int)2e5 + 123; const ll inf = (ll)3e18 + 1; const double pi = acos(-1.0); const double eps = 1e-7; const int dx[] = {0, 0, 1, 0, -1}; const int dy[] = {0, 1, 0, -1, 0}; int n, k, res, a[N]; vector <int> ans; inline void boost () { ios_base :: sync_with_stdio (NULL); cin.tie (NULL), cout.tie (NULL); } inline void Solve () { cin >> n >> k; for (int i = 1; i <= n; i ++) cin >> a[i]; for (int i = 1; i < n; i ++) ans.pb (a[i + 1] - a[i] + 1); sort (all (ans)); int l = 0; for (int i = 0; i < sz (ans); i ++) { if (n - l > k + 1) res += ans[i]; else { res += 2; } l ++; } cout << res; } main () { // freopen (".in", "r", stdin); // freopen (".out", "w", stdout); boost (); int tt = 1; // cin >> tt; while (tt --) { Solve (); } return 0; }

Compilation message (stderr)

stove.cpp:65:7: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main () {                                       
       ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...