제출 #441896

#제출 시각아이디문제언어결과실행 시간메모리
441896parsabahramiBirthday gift (IZhO18_treearray)C++17
0 / 100
102 ms235024 KiB
/* 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 = 300; int H[N], P[19][N], M[SQ][N], n, m, q; int main() { memset(M, -1, sizeof M); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...