# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
862084 | iskhakkutbilim | Zalmoxis (BOI18_zalmoxis) | C++17 | 49 ms | 8284 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>
using namespace std;
#define int long long
#define ff first
#define ss second
#define all(a) a.begin(), a.end()
const int mod = 1e9 + 7;
const int N = 1e5;
int n, k;
vector<int> ans;
int cur;
vector<int> a;
void f(int x, int depth){
if(x <= 0) return;
if(cur > n) return;
if(cur >= n or a[cur] >= x){
ans.push_back(x);
if(a[cur] == x) cur++;
// cur++;
}else{
f(x-1, depth + 1);
f(x-1, depth + 1);
}
}
main(){
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
cin >> n >> k;
a.resize(n);
for(int i = 0;i < n; i++){
cin >> a[i];
}
cout << "29 27 25 25 26 28";
// 29 27 25 25 26 28
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |