# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1126930 | fgdsa | Dungeons Game (IOI21_dungeons) | C++20 | 5144 ms | 2091724 KiB |
#include "dungeons.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define para pair<ll, ll>
const ll LOG = 22;
const ll LOG2 = 10;
const ll MAXN = 400000+10;
const ll INF = 1e18+7;
struct Str{
int v;
ll sum;
ll mn;
};
Str jump[MAXN][LOG][LOG2];
int n;
vector<ll> s;
vector<ll> p;
vector<int> w;
vector<int> l;
Str operacjaLacznia(const Str a, const Str b){
Str res;
res.v = b.v;
# | 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... |