| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 55227 | Kubin | Deda (COCI17_deda) | C++11 | 540 ms | 20276 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;
const size_t MAX = 2e5;
uint32_t answers[MAX];
tuple<bool, uint32_t, uint32_t> queries[MAX];
void solve(uint32_t ibegin, uint32_t iend)
{
if(ibegin == iend)
return;
uint32_t mid = (ibegin+iend)/2;
vector<pair<uint32_t, uint32_t>> M;
for(uint32_t i = ibegin; i <= mid; i++)
{
if(get<0>(queries[i]) == 0)
M.emplace_back(get<2>(queries[i]), get<1>(queries[i]));
}
sort(M.rbegin(), M.rend());
vector<pair<pair<uint32_t, uint32_t>, uint32_t>> D;
for(uint32_t i = mid+1; i <= iend; i++)
{
if(get<0>(queries[i]) == 1)
D.emplace_back(make_pair(get<2>(queries[i]), get<1>(queries[i])), i);
}
sort(D.rbegin(), D.rend());
deque<pair<uint32_t, uint32_t>> Q;
for(uint32_t i = 0, j = 0; i < D.size(); i++)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||