# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1064911 | Tob | Arranging Tickets (JOI17_arranging_tickets) | C++14 | 2 ms | 6748 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 F first
#define S second
#define all(x) x.begin(), x.end()
#define pb push_back
#define FIO ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
using namespace std;
typedef long long ll;
typedef pair <ll, ll> pii;
const int N = 1e5 + 7;
int n, m;
ll a[N], l[N], r[N], c[N], re[N], ps[N];
vector <int> iv[N];
multiset <int> s;
bool check(int t, int b, int d) {
if (d > b || d < 0) return 0;
s.clear();
for (int i = 0; i <= n; i++) ps[i] = 0;
ll cnt = 0;
for (int i = 1; i <= t; i++) {
ll ne = (a[i]-b+d+1)/2;
for (auto it : iv[i]) if (it >= t) s.insert(it);
while (cnt < ne) {
cnt++;
# | 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... |