# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
123813 | MAMBA | Robots (IOI13_robots) | C++17 | 1906 ms | 18424 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>
#include "robots.h"
using namespace std;
#define rep(i , j , k) for (int i = j; i < (int)k; i++)
typedef pair<int , int> pii;
const int MAXN = 1e6 + 10;
int a[MAXN], w[MAXN], s[MAXN], x[MAXN], y[MAXN], fA , fB, t;
int arr[MAXN], rtp;
inline void push(int v) {
arr[++rtp] = v;
int id = rtp;
while (id > 1 && arr[id >> 1] < arr[id]) {
swap(arr[id] , arr[id >> 1]);
id >>= 1;
}
}
inline void pop() {
if (rtp == 1) return rtp = 0, void();
swap(arr[1] , arr[rtp--]);
int id = 1;
while (true) {
if ((id << 1) > rtp) return;
if ((id << 1) == rtp) {
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... |