# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1145118 | Robert_junior | Trampoline (info1cup20_trampoline) | C++17 | 1180 ms | 43612 KiB |
#include <bits/stdc++.h>
using namespace std;
#define ins insert
#define pb push_back
#define all(x) x.begin(), x.end()
#define F first
#define S second
const int N = 2e5 + 7;
int x[N], y[N], to1[N];
map<int, vector<int>>mp;
pair<int, int>to[N];
int up[N][17];
map<pair<int, int>, int>mp1;
int c, d;
pair<int, int>next(int a, int b){
if(mp[a + 1].size()){
auto it = lower_bound(all(mp[a + 1]), b);
if(it != mp[a + 1].end()){
return {a + 1, *it};
}
else{
return {-1, -1};
}
}
else{
return {-1, -1};
}
}
int check(int i, int m){
for(int j = 0; j < 17; j++){
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... |