# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1123350 | whoknow | Pinball (JOI14_pinball) | C++20 | 173 ms | 21196 KiB |
#include <bits/stdc++.h>
#define ll long long
#define F first
#define S second
#define MAXN 100005
#define ii pair<int,int>
#define bit(i,j) ((i>>j)&1)
#define sz(i) (int)i.size()
#define endl '\n'
using namespace std;
const ll INF = 1e18 + 7;
int n, m;
int a[MAXN], b[MAXN], c[MAXN], d[MAXN];
namespace sub1
{
int M;
ll left[MAXN], right[MAXN];
vector<int>v;
struct tree1
{
ll st[12 * MAXN];
void seg(int id, int l, int r)
{
if(l == r)
return st[id] = INF, void();
int mid = (l + r) / 2;
seg(id * 2, l, mid);
seg(id * 2 + 1, mid + 1, r);
st[id] = INF;
}
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... |