# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1033554 | Duongkobeo | Stove (JOI18_stove) | C++17 | 0 ms | 344 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#define endl "\n"
#define pb push_back
#define rs resize
#define gcd __gcd
using namespace std;
void solve() {
int n, k; cin >> n >> k;
vector<int> a(n), s(n);
for (int i = 0; i < n; ++i) cin >> a[i];
long long ans = a[n - 1] - a[0] + 1;
for (int i = 0; i < n - 1; ++i) s[i] = a[i + 1] + a[i] - 1;
sort(s.begin(), s.end());
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
// int t; cin >> t;
// while (t--)
solve();
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |