oj.uz

답안 #889648

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
889648 2023-12-20T04:26:37 Z vjudge1 Council (JOI23_council) C++17
22 / 100
 388 ms 26380 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimize("Ofast,unroll-loops")
#define pii pair<int,int>
using namespace __gnu_pbds;
using namespace std;
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define int long long
#define f first
#define s second
#define pii pair<int,int>
template<class T>bool umax(T &a,T b){if(a<b){a=b;return true;}return false;}
template<class T>bool umin(T &a,T b){if(b<a){a=b;return true;}return false;}
typedef tree<int, null_type, less_equal<int>, rb_tree_tag,
	tree_order_statistics_node_update> ordered_set;
const int mod= 1e9 +7;
const int N=1e5*4;

int binpow (int a, int n) {
	if (n == 0)
		return 1;
	if (n % 2 == 1)
		return binpow (a, n-1) * a;
	else {
		int b = binpow (a, n/2);
		return b * b;
	}
}

void solve(){
	int n,m,k;
	
	cin>>n>>m;
	int arr[n+1][m+1];
	vector<int>vis(m+1);
	map<pii,int>mp;
	map<int,int>cont;
	for(int i = 1;i<=n;i++){
		for(int j = 1;j<=m;j++){
			cin>>arr[i][j];
			if(arr[i][j])vis[j]+=1;
			
		}
		if(m==2)mp[{arr[i][1],arr[i][2]}]++;
		if(m==1)cont[arr[i][1]]++;
	}
	if(n<=3000){
		for(int i = 1;i<=n;i++){
			int mx = 0;
			vector<int>vis1(m+1);
			for(int j = 1;j<=m;j++){
				if(arr[i][j])
					vis1[j]++;
			}
			
			for(int j = 1;j<=n;j++){
				if(j==i)continue;
				vector<int>vis2(m+1);
				int cnt = 0 ;
				for(int k = 1;k<=m;k++){
					if(arr[j][k])vis2[k]++;
				}
				for(int k = 1;k<=m;k++){
					if((vis[k]-vis1[k]-vis2[k])>((n-2)/2))cnt++;
					//cout<<vis[k]-vis1[k]-vis2[k]<<" ";
				}
				//cout<<"\n";
				umax(mx,cnt);
			}
			cout<<mx<<"\n";
		}
	}
	else{
		if(m>=3){
			cout<<24<<"\n";
			return;
		}
		if(m==2){
			for(int i = 1;i<=n;i++){
				for(int j = 1;j<=m;j++)
						if(arr[i][j])vis[j]--;
				
				mp[{arr[i][1],arr[i][2]}]--;
				int mx = 0;
				
				if(mp[{1,0}]>0){
					vis[1]--;
					int cnt = 0;
					for(int k = 1;k<=m;k++){
						if((vis[k])>((n-2)/2))cnt++;
					}
					umax(mx,cnt);
					vis[1]++;
				}
				//---2--
				if(mp[{0,1}]>0){
					vis[2]--;
					int cnt = 0;
					for(int k = 1;k<=m;k++){
						if((vis[k])>((n-2)/2))cnt++;
					}
					umax(mx,cnt);
					vis[2]++;
				}
				//---3---
				if(mp[{1,1}]>0){
					vis[1]--;vis[2]--;
					int cnt = 0;
					for(int k = 1;k<=m;k++){
						if((vis[k])>((n-2)/2))cnt++;
					}
					umax(mx,cnt);
					vis[1]++;vis[2]++;
				}
				//----4----
				if(mp[{0,0}]>0){
					int cnt = 0;
					for(int k = 1;k<=m;k++){
						if((vis[k])>((n-2)/2))cnt++;
					}
					umax(mx,cnt);
				}
				
				for(int j = 1;j<=m;j++){
					if(arr[i][j])vis[j]++;
				}
				cout<<mx<<"\n";
				mp[{arr[i][1],arr[i][2]}]++;
			}
		}
		else{
			for(int i = 1;i<=n;i++){
				cont[arr[i][1]]--;
				if(arr[i][1]==1)vis[1]--;
				int mx = 0;
				if(cont[1]>0){
					vis[1]--;
					if(vis[1]>(n-2)/2)mx = 1;
					vis[1]++;
				}
				if(cont[0]>0){
					if(vis[1]>(n-2)/2)mx = 1;
				}
				cout<<mx<<"\n";
				cont[arr[i][1]]++;
				if(arr[i][1]==1)vis[1]++;
			}
			
		}
		
	}








}

 signed main()
{
//	freopen("seq.in", "r", stdin);
//  freopen("seq.out", "w", stdout);
	ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
	int cnt=0;
	int tt=1;//cin>>tt;
	while(tt--)solve();

}

Compilation message

council.cpp: In function 'void solve()':
council.cpp:35:10: warning: unused variable 'k' [-Wunused-variable]
   35 |  int n,m,k;
      |          ^
council.cpp: In function 'int main()':
council.cpp:171:6: warning: unused variable 'cnt' [-Wunused-variable]
  171 |  int cnt=0;
      |      ^~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 4 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 4 ms 500 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 4 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 3 ms 452 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 3 ms 456 KB Output is correct
22 Correct 0 ms 416 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 600 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 4 ms 344 KB Output is correct
32 Correct 1 ms 600 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 2 ms 348 KB Output is correct
36 Correct 0 ms 344 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 4 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 1 ms 348 KB Output is correct
50 Correct 0 ms 348 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 4 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 4 ms 500 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 4 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 3 ms 452 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 3 ms 456 KB Output is correct
22 Correct 0 ms 416 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 600 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 4 ms 344 KB Output is correct
32 Correct 1 ms 600 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 2 ms 348 KB Output is correct
36 Correct 0 ms 344 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 4 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 1 ms 348 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 373 ms 940 KB Output is correct
52 Correct 282 ms 860 KB Output is correct
53 Correct 388 ms 936 KB Output is correct
54 Correct 378 ms 916 KB Output is correct
55 Correct 272 ms 496 KB Output is correct
56 Correct 376 ms 860 KB Output is correct

Subtask #3
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 53 ms 8084 KB Output is correct
3 Correct 58 ms 8260 KB Output is correct
4 Correct 36 ms 5720 KB Output is correct
5 Correct 65 ms 8020 KB Output is correct
6 Correct 38 ms 5724 KB Output is correct
7 Correct 66 ms 8020 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 3 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 348 KB Output is correct
17 Correct 264 ms 348 KB Output is correct

Subtask #4
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 53 ms 8084 KB Output is correct
3 Correct 58 ms 8260 KB Output is correct
4 Correct 36 ms 5720 KB Output is correct
5 Correct 65 ms 8020 KB Output is correct
6 Correct 38 ms 5724 KB Output is correct
7 Correct 66 ms 8020 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 3 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 348 KB Output is correct
17 Correct 264 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Incorrect 142 ms 26380 KB Output isn't correct
21 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 53 ms 8084 KB Output is correct
3 Correct 58 ms 8260 KB Output is correct
4 Correct 36 ms 5720 KB Output is correct
5 Correct 65 ms 8020 KB Output is correct
6 Correct 38 ms 5724 KB Output is correct
7 Correct 66 ms 8020 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 3 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 348 KB Output is correct
17 Correct 264 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Incorrect 142 ms 26380 KB Output isn't correct
21 Halted 0 ms 0 KB -

Subtask #6
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 53 ms 8084 KB Output is correct
3 Correct 58 ms 8260 KB Output is correct
4 Correct 36 ms 5720 KB Output is correct
5 Correct 65 ms 8020 KB Output is correct
6 Correct 38 ms 5724 KB Output is correct
7 Correct 66 ms 8020 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 3 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 348 KB Output is correct
17 Correct 264 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Incorrect 142 ms 26380 KB Output isn't correct
21 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 4 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 4 ms 500 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 4 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 3 ms 452 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 3 ms 456 KB Output is correct
22 Correct 0 ms 416 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 600 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 4 ms 344 KB Output is correct
32 Correct 1 ms 600 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 2 ms 348 KB Output is correct
36 Correct 0 ms 344 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 4 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 1 ms 348 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 373 ms 940 KB Output is correct
52 Correct 282 ms 860 KB Output is correct
53 Correct 388 ms 936 KB Output is correct
54 Correct 378 ms 916 KB Output is correct
55 Correct 272 ms 496 KB Output is correct
56 Correct 376 ms 860 KB Output is correct
57 Correct 0 ms 348 KB Output is correct
58 Correct 53 ms 8084 KB Output is correct
59 Correct 58 ms 8260 KB Output is correct
60 Correct 36 ms 5720 KB Output is correct
61 Correct 65 ms 8020 KB Output is correct
62 Correct 38 ms 5724 KB Output is correct
63 Correct 66 ms 8020 KB Output is correct
64 Correct 0 ms 348 KB Output is correct
65 Correct 0 ms 348 KB Output is correct
66 Correct 0 ms 348 KB Output is correct
67 Correct 0 ms 348 KB Output is correct
68 Correct 3 ms 348 KB Output is correct
69 Correct 0 ms 348 KB Output is correct
70 Correct 1 ms 348 KB Output is correct
71 Correct 0 ms 348 KB Output is correct
72 Correct 3 ms 348 KB Output is correct
73 Correct 264 ms 348 KB Output is correct
74 Correct 0 ms 348 KB Output is correct
75 Correct 0 ms 344 KB Output is correct
76 Incorrect 142 ms 26380 KB Output isn't correct
77 Halted 0 ms 0 KB -