# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
56215 | fallingstar | Wiring (IOI17_wiring) | C++14 | 96 ms | 94848 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 "wiring.h"
#include <algorithm>
#include <vector>
#include <queue>
#define long long long
using namespace std;
typedef pair<int, int> pii;
const int N = 2e5 + 2;
const long INF = 1LL << 60;
int n;
long f[N], pref[N], suff[N];
pair<int, bool> a[N];
long Solve()
{
sort(a + 1, a + 1 + n);
int lastL = 0, lastR = 0, gap = 0;
long rsum = 0;
for (int i = 1; i <= n; ++i)
{
if (i > 1 && a[i].second != a[i - 1].second)
{
lastL = lastR + 1;
lastR = i - 1;
gap = a[i].first - a[i - 1].first;
# | 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... |