# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
575376 | d4xn | Mountains (IOI17_mountains) | C++17 | 1 ms | 212 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.
#pragma GCC optimize ("Ofast")
#include "mountains.h"
#include <bits/stdc++.h>
using namespace std;
#define ld long double
#define ll long long
const int N = 2002;
ll n, ans;
vector<pair<ll, ll>> v, taken;
int maximum_deevs(vector<int> y) {
n = y.size();
ans = 0;
v.resize(n);
for(ll i = 0; i < n; i++) {
v[i] = make_pair(y[i], i);
}
sort(v.begin(), v.end());
for(ll i = 0; i < n; i++) {
bool ok = 1;
for (ll j = 0; j < taken.size(); j++) {
// comprobar si se puede coger
}
if (ok) taken.push_back(make_pair(v[i].second, v[i].first));
}
ll sz = taken.size();
return max(sz, 1ll);
}
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |