| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 45441 | tjd229 | Last supper (IOI12_supper) | C++11 | 165 ms | 17312 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 "advisor.h"
int sz=1;
struct NUse{
int ix;
int nxt;
bool operator<(NUse &nu) const{
return nxt < nu.nxt;
}
}q[150001];
void swap(int &a, int &b){ a ^= b ^= a ^= b; }
void push(NUse nu){
q[sz] = nu;
int curr = sz++;
while (curr != 1){
if (q[curr>>1] < q[curr]){
swap(q[curr].ix, q[curr >> 1].ix);
swap(q[curr].nxt, q[curr >> 1].nxt);
}
else break;
curr >>= 1;
}
}
void pop(){
q[1] = q[--sz];
int curr = 1;
int nxt = 2;
while (nxt < sz){
if (nxt + 1 < sz && q[nxt] < q[1+nxt])
nxt++;
| # | 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... | ||||