# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1063968 | MOUF_MAHMALAT | Council (JOI23_council) | C++14 | 512 ms | 35172 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>
#define all(v) v.begin(),v.end()
#define F first
#define S second
using namespace std;
typedef int ll;
typedef pair<ll,ll>pll;
const ll oo=3e5+9;
ll n,m,c[20];
bool b[20][oo];
pll dp[2][1<<20];
void solve()
{
cin>>n>>m;
for(ll i=0; i<(1<<m); i++)
dp[0][i]=dp[1][i]= {-1,-1};
for(ll i=0; i<n; i++)
{
ll mask=0;
for(ll j=0; j<m; j++)
{
cin>>b[j][i];
if(!b[j][i])
mask|=(1<<j);
c[j]+=b[j][i];
}
if(dp[0][mask].F== -1)
dp[0][mask]= {1,i};
else
dp[1][mask]= {1,i};
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |