# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
850238 | Tai_xiu | Selotejp (COCI20_selotejp) | C++14 | 1026 ms | 11504 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;
int n,m;
char a[1003][11];
vector<int>lt[1003],lt1[1003];
int dp[1003][1<<10],gt[1024][1024],val[1024];
void init()
{
for (int i=0;i<(1<<m);i++){
int tam=i;
int cnt=0;
if (tam&1)
cnt++;
for (int j=1;j<m;j++){
if (((i>>j)&1) && (((i>>(j-1))&1)==0))
cnt++;
}
val[i]=cnt;
}
for (int i=0;i<(1<<m);i++){
for (int j=0;j<(1<<m);j++){
int tam=j,cnt=0;
for (int k=0;k<m;k++){
if (((i>>k)&1)==0 && ((j>>k)&1)==1){
cnt++;
tam^=(1<<k);
}
}
gt[i][j]=val[tam]+cnt;
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... |