# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
979136 | vjudge1 | Council (JOI23_council) | C11 | 1531 ms | 23384 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<stdio.h>
#include<assert.h>
#include<string.h>
#define N 300000
#define M 20
int a[N], b[N], n, m, cc[M], f[1<<M][2];
int count(int x) { return x ? 1 + count(x&x-1) : 0; }
int gt(int i,int j,int s){if(i==-1)return 0;if(j==-1)return 1;return count(b[i]&s)>count(b[j]&s);}
void put_(int i, int v)
{
if (gt(v, f[i][0], i))
f[i][1]=f[i][0],f[i][0]=v;
else if (v != f[i][0] && gt(v, f[i][1], i))
f[i][1]=v;
}
int main()
{
memset(f,-1,sizeof f);
scanf("%d%d",&n,&m);
for(int i=0;i<n;++i)
{
for(int x,j=0;j<m;++j)
scanf("%d",&x),a[i]|=x<<j, cc[j]+=x;
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... |
# | 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... |