# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1174476 | Pacybwoah | DEL13 (info1cup18_del13) | C++20 | 66 ms | 1860 KiB |
#include<iostream>
#include<vector>
#include<algorithm>
#include<utility>
#include<cmath>
using namespace std;
typedef long long ll;
const ll inf = 1e18;
int dp[(1 << 18) + 3], lst[(1 << 18) + 3], lstans[(1 << 18) + 3];
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int t;
cin >> t;
bool flag = 0;
while(t--){
int n, q;
cin >> n >> q;
if(!flag){
flag = 1;
dp[(1 << n) - 1] = 1;
for(int i = (1 << n) - 2; i >= 0; i--){
vector<int> pre(n + 1);
for(int j = 0; j < n; j++){
pre[j + 1] = pre[j];
if(i & (1 << j)){
pre[j + 1]++;
}
}
bool flag2 = 0;
# | 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... |