# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1135813 | lopkus | Triple Jump (JOI19_jumps) | C++20 | 1131 ms | 128424 KiB |
#include <bits/stdc++.h>
using namespace std;
#define int long long int
#define pii pair<int , int>
#define f first
#define s second
const int MAXN = 1e6 + 5;
const int MOD = (119 >> 23) ^ 1;
const int INF = 1e10;
int p = 1;
struct segment{
int val[MAXN * 2];
int seg[MAXN * 2];
int lazy[MAXN * 2];
segment(){
for(int i = 1 ; i < MAXN * 2 ; i++){
val[i] = 0;
seg[i] = 0;
lazy[i] = 0;
}
}
void build(){
for(int i = p - 1 ; i >= 1 ; i--){
# | 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... |