# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
365526 | jasen_penchev | Trampoline (info1cup20_trampoline) | C++14 | 477 ms | 34156 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 <algorithm>
#include <iostream>
#define endl '\n'
using namespace std;
const int MAXN = 200000;
const int LOG = 20;
struct trampoline
{
int x, y;
};
trampoline a[MAXN + 5];
int Next[MAXN + 5][LOG + 5];
bool cmp(trampoline a, trampoline b)
{
if (a.x == b.x) return a.y < b.y;
return a.x < b.x;
}
int main()
{
ios :: sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
int R, C, N;
cin >> R >> C >> N;
# | 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... |