oj.uz

Submission #1077581

# Submission time Handle Problem Language Result Execution time Memory
1077581 2024-08-27T08:05:50 Z vjudge1 Council (JOI23_council) C++17
0 / 100
 318 ms 8536 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
map<int,int>ma;
int sum[2000000];
int p[2000000],pp[2000000];
int co[2000000];
int val[2000000];
 int main()
 {
	 ios_base::sync_with_stdio(0);
	 cin.tie(0);
	 cout.tie(0);
	 int n,m;
	 cin>>n>>m;
	 int ans=0;
	 int a[n][m];
	
	 for(int i=0;i<m;i++)
	 co[i]=0;
	
	 for(int i=0;i<n;i++)
	 {
	 //co[i]=0;
	 val[i]=0;
 }
 
	 for(int i=0;i<n;i++)
	 {
		 for(int y=0;y<m;y++)
		 {
		 cin>>a[i][y];
	if(a[i][y]==1)
		 co[y]++;
		 val[i]+=(1<<y)*a[i][y];
		
	     }
	      ma[val[i]]=1;
	 }
	 vector<int>v;
	 for(auto i:ma)
	 v.push_back(i.first);
	 int l=v.size();
	
	 int s1=0,s2=0;
	
	 for(int i=0;i<m;i++)
	 {
		 if(co[i]>=n/2)
		 ans++;
		 
		  if(co[i]<n/2)
		 continue;
		 else if(co[i]==n/2)
		 s1+=1<<i;
		 else if(co[i]==n/2+1)
		 s2+=1<<i;		 
	 }
	 int o[l];
	
//	cout<<s1<<' '<<s2<<endl;
	 for(int i=0;i<l;i++)
	 {
		 
		// cout<<i<<endl;
		 p[i]=v[i]&s1;
		 pp[i]=v[i]&s2;
		 o[i]=__builtin_popcount(p[i]);
		 int x=-1000000000;
		 //cout<<i<<' ';
		 for(int y=i-1;y>=0;y--)
		 {
			 //cout<<y<<endl;
			 int h=ans-__builtin_popcount(p[i]|p[y])-__builtin_popcount(pp[i]&pp[y]);
			 x=max(x,h);
			 sum[v[y]]=max(sum[v[y]],h);
		 }
		 sum[v[i]]=x;
		 
	 }
	 for(int i=0;i<n;i++)
	 cout<<sum[val[i]]<<endl;
	 
	
 }

Compilation message

council.cpp: In function 'int main()':
council.cpp:34:2: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   34 |  if(a[i][y]==1)
      |  ^~
council.cpp:36:4: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   36 |    val[i]+=(1<<y)*a[i][y];
      |    ^~~
council.cpp:60:7: warning: variable 'o' set but not used [-Wunused-but-set-variable]
   60 |   int o[l];
      |       ^

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 476 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Incorrect 1 ms 348 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 476 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Incorrect 1 ms 348 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Incorrect 318 ms 8536 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Incorrect 318 ms 8536 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Incorrect 318 ms 8536 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Incorrect 318 ms 8536 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 476 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Incorrect 1 ms 348 KB Output isn't correct
7 Halted 0 ms 0 KB -