# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
122448 | onjo0127 | Robots (APIO13_robots) | C++11 | 1200 ms | 125136 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 <cstdio>
#include <algorithm>
#include <queue>
#include <tuple>
#include <set>
#pragma GCC optimize ("Ofast")
using namespace std;
using pii = pair<int, int>;
struct node {
int x, y, s, e;
};
node QUE[250009];
struct QUEUE {
const int siz = 250000;
int h = 0, t = 0;
void push(node X) {QUE[h++] = X; if(h == siz) h = 0;}
void pop() {
t++;
if(t == siz) t = 0;
}
node front() {
return QUE[t];
}
int sz() {
if(h >= t) return h - t;
else return siz - t + h;
}
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... |