# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
230628 | AlexLuchianov | Just Long Neckties (JOI20_ho_t1) | C++14 | 337 ms | 18680 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 <iostream>
#include <vector>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <set>
using namespace std;
using ll = long long;
int const nmax = 200000;
pair<int,int> v[5 + nmax];
int b[5 + nmax], sol[5 + nmax];
multiset<int> myset;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
for(int i = 1;i <= n + 1; i++) {
cin >> v[i].first;
v[i].second = i;
}
sort(v + 1, v + n + 1 + 1);
for(int i = 1;i <= n; i++)
cin >> b[i];
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |