# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
731605 | jasen_penchev | Aliens (IOI16_aliens) | C++14 | 2040 ms | 9916 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.
/// Convex Hull Trick Optimization
#include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
#include <deque>
#define endl '\n'
using namespace std;
const long long INF = (long long)(1e18);
struct line
{
long long a, b;
long long calc(long long x)
{
return (a * x + b);
}
long double intersect(line l)
{
return (long double)(l.b - b) / (a - l.a);
}
};
long long take_photos(int n, int m, int k, vector<int> row, vector<int> col)
{
vector< pair<int, int> > temp;
for (int i = 0; i < n; ++ i)
{
temp.push_back({max(row[i], col[i]), min(row[i], col[i])});
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |