# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
68159 | Crown | Robots (IOI13_robots) | C++14 | 2277 ms | 52948 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 "robots.h"
#include <bits/stdc++.h>
using namespace std;
#define X first
#define Y second
#define pb push_back
typedef pair<int, int> ii;
typedef long long ll;
const int maxn = 5e4+5;
const int maxt = 1e6+5;
int n, m, t;
int x[maxn], y[maxn];
int w[maxt], s[maxt];
vector< ii > vec;
priority_queue<int> pq;
bool works(int lim)
{
while(!pq.empty()) pq.pop();
vector<int> rem;
if(n == 0)
{
for(int i = 0; i< t; i++) rem.pb(vec[i].Y);
}
else
# | 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... |