# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
815088 | 79brue | Arranging Tickets (JOI17_arranging_tickets) | C++17 | 3 ms | 4948 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>
using namespace std;
typedef long long ll;
int n, k;
int ex[200002], ey[200002]; ll ew[200002];
ll arr[200002], tarr[200002];
ll lim[200002];
ll flipCnt[200002];
vector<int> toSee[200002];
struct dat{
int r, idx; ll cnt;
dat(){}
dat(int r, int idx, ll cnt): r(r), idx(idx), cnt(cnt){}
bool operator<(const dat &nxt)const{
return r<nxt.r;
}
};
bool able(int x, ll MX, ll flip){
if(flip < 0) return false;
lim[0] = MX + flip;
for(int i=1; i<n; i++) lim[i] = MX + flip - arr[i];
for(int i=2; i<x; i++) lim[i] = min(lim[i], lim[i-1]);
for(int i=n-2; i>x; i--) lim[i] = min(lim[i], lim[i+1]);
for(int i=0; i<n; i++) lim[i] /= 2;
Compilation message (stderr)
# | 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... |