# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
624797 | CSQ31 | Abduction 2 (JOI17_abduction2) | C++17 | 65 ms | 25992 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define owo ios_base::sync_with_stdio(0);cin.tie(0);
typedef pair<int,int> pii;
const int MAXN = 5e4+5;
vector<int>a,b;
int h,w,q;
typedef long long int ll;
map<ll,ll>dp[2][MAXN];
int lg[MAXN];
struct SPT
{
vector<int>lg;
vector<vector<int>> s;
//zero indexed
//modify s and a to whatever type works
SPT(){}
SPT(int n,int lim,vector<int>a)
{
s.resize(n);
lg.resize(n+1);
lg[1] = 0;
for(int i=2;i<=n;i++)lg[i] = lg[i/2]+1;
for(int i=0;i<n;i++){
s[i].resize(lim+1);
s[i][0] = a[i];
}
for(int k=1;k<=lim;k++){
# | 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... |