| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 50829 | longcqt | Candies (JOI18_candies) | C++11 | 219 ms | 65988 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 X first
#define Y second
using namespace std;
const int N = 2e5 + 3;
typedef long long ll;
typedef pair<int,int> ii;
struct cmp
{
bool operator() (pair<ii, ll> a, pair <ii, ll> b)
{
return a.Y < b.Y;
}
};
int n;
int a[N];
int r[N], l[N];
priority_queue <pair<ii, ll>, vector<pair<ii, ll> > , cmp > q;
ll c[N];
void home()
{
ios_base::sync_with_stdio(0);
//freopen("a.inp", "r", stdin);
//freopen("a.out", "w", stdout);
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||