# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
311145 | quocnguyen1012 | Wiring (IOI17_wiring) | C++14 | 122 ms | 34536 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 fi first
#define se second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define ar array
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
const int maxn = 2e5 + 5;
vector<int> seg[maxn];
vector<ll> last[maxn], first[maxn], f[maxn];
int N;
long long min_total_length(vector<int> r,vector<int> b) {
vector<ii> coor;
for (auto & it : r) {
coor.eb(it, 0);
}
for (auto & it : b) {
coor.eb(it, 1);
}
sort(coor.begin(), coor.end());
int now = -1;
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |