Submission #441895

#	Time	Username	Problem	Language	Result	Execution time	Memory
441895		parsabahrami	Birthday gift (IZhO18_treearray)	C++17	0 / 100	117 ms	262148 KiB

treearray

/* I do it for the glory */
#include <bits/stdc++.h>
 
using namespace std;

typedef long long int ll;
typedef pair<int, int> pii;
 
#define SZ(x)                       (int) x.size()
#define F                           first
#define S                           second

const int N = 2e5 + 10, MOD = 1e9 + 7, SQ = 450;
int H[N], P[19][N], M[SQ][N], n, m, q;

int main() {
    memset(M, -1, sizeof M);
    return 0;
}

• Subtask 1: 0 / 12
• Subtask 2: 0 / 18
• Subtask 3: 0 / 26
• Subtask 4: 0 / 44