oj.uz

Submission #889640

# Submission time Handle Problem Language Result Execution time Memory
889640 2023-12-20T04:14:17 Z vjudge1 Council (JOI23_council) C++17
25 / 100
 1964 ms 131028 KB 
#include <bits/stdc++.h>
 
#define ff first
#define ss second
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define int long long
#define rnd(l, r) uniform_int_distribution<int>(l, r)(rng)
 
using namespace std;

void fp(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);} 
int pow(int a,int b,int m){int ans=1;while(b){if(b&1){ans=(ans*a)%m;}b>>=1;a=(a*a)%m;}return ans;}
int binpow(int a,int b){int ans=1;while(b){if(b&1){ans=(ans*a);}b>>=1;a=(a*a);}return ans;}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
 
const int N = 3e5 + 5, inf = 1e18, M = 4e3;

int a[N][25];
int cnt[25];
int ans[N];
int was[N], in[N], calc[M][M];
main(){
	iostream::sync_with_stdio(false);	
    cin.tie(nullptr);
    cout.tie(nullptr);
    int n, m;
    cin >> n >> m;
    for(int i = 1; i <= n; i++){
		int x = 0;
		for(int j = 1; j <= m; j++){
			cin >> a[i][j];
			x += (a[i][j] * (1ll << (j - 1)));
			cnt[j] += (a[i][j] == 1);
		}
		in[i] = x;
	}
	for(int bit2 = 0; bit2 < (1 << m); bit2++){
		for(int l = 1; l <= m; l++){
			cnt[l] -= min(1ll, (bit2 & (1 << (l - 1))));
		}
		for(int bit = 0; bit < (1 << m); bit++){
			int res = 0;
			for(int l = 1; l <= m; l++){
				cnt[l] -= min(1ll, (bit & (1 << (l - 1))));
				res += (cnt[l] >= n / 2);
			}
			calc[bit][bit2] = max(calc[bit][bit2], res);
			
			for(int l = 1; l <= m; l++){
				cnt[l] += min(1ll, (bit & (1 << (l - 1))));
			}
		}
		for(int l = 1; l <= m; l++){
			cnt[l] += min(1ll, (bit2 & (1 << (l - 1))));
		}
	}
	for(int i = 1 ; i <= n; i++){
		for(int bit = 0; bit < (1 << m); bit++){
			if(was[bit]){
				ans[i] = max(ans[i], calc[in[i]][bit]);
			}
		}
		was[in[i]] = 1;
	}
	for(int bit = 0; bit < (1 << m); bit++)was[bit] = 0;
	
	for(int i = n; i >= 1; i--){
		for(int bit = 0; bit < (1 << m); bit++){
			if(was[bit]){
				ans[i] = max(ans[i], calc[in[i]][bit]);
			}
		}
		was[in[i]] = 1;
	}
	for(int i = 1; i <= n; i++)
		cout << ans[i] <<"\n";
}

/*
 * Before implementing the problem:
	
	Do I understand the problem correctly?
	Which places are tricky? What do I need to remember to implement them correctly?
	Which place is the heaviest by implementation? Can I do it simpler?
	Which place is the slowest? Where do I need to be careful about constant factors and where I can choose slower but simpler implementation?
	----------------------------------
	If not AC:
 
	Did you remember to do everything to handle the tricky places you thought about before?
	Is the solution correct?
	Do I understand the problem correctly?
	----------------------------------
	If you have a test on which the solution gives wrong answer:
 
	Is the solution doing what it was supposed to do?
	Is the problem in the code or in the idea?
*/

Compilation message

council.cpp:24:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   24 | main(){
      | ^~~~
council.cpp: In function 'void fp(std::string)':
council.cpp:13:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 | void fp(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
council.cpp:13:70: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 | void fp(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                                                               ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Incorrect 839 ms 130644 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Incorrect 839 ms 130644 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 50 ms 68180 KB Output is correct
3 Correct 43 ms 68220 KB Output is correct
4 Correct 35 ms 68176 KB Output is correct
5 Correct 47 ms 68180 KB Output is correct
6 Correct 35 ms 68188 KB Output is correct
7 Correct 48 ms 68176 KB Output is correct
8 Correct 1 ms 4440 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4696 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4644 KB Output is correct
17 Correct 2 ms 4444 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 50 ms 68180 KB Output is correct
3 Correct 43 ms 68220 KB Output is correct
4 Correct 35 ms 68176 KB Output is correct
5 Correct 47 ms 68180 KB Output is correct
6 Correct 35 ms 68188 KB Output is correct
7 Correct 48 ms 68176 KB Output is correct
8 Correct 1 ms 4440 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4696 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4644 KB Output is correct
17 Correct 2 ms 4444 KB Output is correct
18 Correct 1 ms 4444 KB Output is correct
19 Correct 1 ms 4444 KB Output is correct
20 Correct 852 ms 80592 KB Output is correct
21 Correct 433 ms 72276 KB Output is correct
22 Correct 602 ms 72172 KB Output is correct
23 Correct 589 ms 80776 KB Output is correct
24 Correct 523 ms 80516 KB Output is correct
25 Correct 1463 ms 80520 KB Output is correct
26 Correct 1964 ms 80976 KB Output is correct
27 Correct 32 ms 16720 KB Output is correct
28 Correct 1 ms 4440 KB Output is correct
29 Correct 1 ms 4444 KB Output is correct
30 Correct 2 ms 4700 KB Output is correct
31 Correct 1 ms 4700 KB Output is correct
32 Correct 1 ms 5212 KB Output is correct
33 Correct 2 ms 5896 KB Output is correct
34 Correct 7 ms 8792 KB Output is correct
35 Correct 27 ms 16804 KB Output is correct
36 Correct 27 ms 16920 KB Output is correct
37 Correct 1 ms 4444 KB Output is correct
38 Correct 1 ms 4444 KB Output is correct
39 Correct 1 ms 4700 KB Output is correct
40 Correct 1 ms 4700 KB Output is correct
41 Correct 2 ms 5212 KB Output is correct
42 Correct 3 ms 5980 KB Output is correct
43 Correct 7 ms 8568 KB Output is correct
44 Correct 27 ms 16724 KB Output is correct
45 Correct 27 ms 16724 KB Output is correct

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 50 ms 68180 KB Output is correct
3 Correct 43 ms 68220 KB Output is correct
4 Correct 35 ms 68176 KB Output is correct
5 Correct 47 ms 68180 KB Output is correct
6 Correct 35 ms 68188 KB Output is correct
7 Correct 48 ms 68176 KB Output is correct
8 Correct 1 ms 4440 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4696 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4644 KB Output is correct
17 Correct 2 ms 4444 KB Output is correct
18 Correct 1 ms 4444 KB Output is correct
19 Correct 1 ms 4444 KB Output is correct
20 Correct 852 ms 80592 KB Output is correct
21 Correct 433 ms 72276 KB Output is correct
22 Correct 602 ms 72172 KB Output is correct
23 Correct 589 ms 80776 KB Output is correct
24 Correct 523 ms 80516 KB Output is correct
25 Correct 1463 ms 80520 KB Output is correct
26 Correct 1964 ms 80976 KB Output is correct
27 Correct 32 ms 16720 KB Output is correct
28 Correct 1 ms 4440 KB Output is correct
29 Correct 1 ms 4444 KB Output is correct
30 Correct 2 ms 4700 KB Output is correct
31 Correct 1 ms 4700 KB Output is correct
32 Correct 1 ms 5212 KB Output is correct
33 Correct 2 ms 5896 KB Output is correct
34 Correct 7 ms 8792 KB Output is correct
35 Correct 27 ms 16804 KB Output is correct
36 Correct 27 ms 16920 KB Output is correct
37 Correct 1 ms 4444 KB Output is correct
38 Correct 1 ms 4444 KB Output is correct
39 Correct 1 ms 4700 KB Output is correct
40 Correct 1 ms 4700 KB Output is correct
41 Correct 2 ms 5212 KB Output is correct
42 Correct 3 ms 5980 KB Output is correct
43 Correct 7 ms 8568 KB Output is correct
44 Correct 27 ms 16724 KB Output is correct
45 Correct 27 ms 16724 KB Output is correct
46 Incorrect 864 ms 131028 KB Output isn't correct
47 Halted 0 ms 0 KB -

Subtask #6
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 50 ms 68180 KB Output is correct
3 Correct 43 ms 68220 KB Output is correct
4 Correct 35 ms 68176 KB Output is correct
5 Correct 47 ms 68180 KB Output is correct
6 Correct 35 ms 68188 KB Output is correct
7 Correct 48 ms 68176 KB Output is correct
8 Correct 1 ms 4440 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4696 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4644 KB Output is correct
17 Correct 2 ms 4444 KB Output is correct
18 Correct 1 ms 4444 KB Output is correct
19 Correct 1 ms 4444 KB Output is correct
20 Correct 852 ms 80592 KB Output is correct
21 Correct 433 ms 72276 KB Output is correct
22 Correct 602 ms 72172 KB Output is correct
23 Correct 589 ms 80776 KB Output is correct
24 Correct 523 ms 80516 KB Output is correct
25 Correct 1463 ms 80520 KB Output is correct
26 Correct 1964 ms 80976 KB Output is correct
27 Correct 32 ms 16720 KB Output is correct
28 Correct 1 ms 4440 KB Output is correct
29 Correct 1 ms 4444 KB Output is correct
30 Correct 2 ms 4700 KB Output is correct
31 Correct 1 ms 4700 KB Output is correct
32 Correct 1 ms 5212 KB Output is correct
33 Correct 2 ms 5896 KB Output is correct
34 Correct 7 ms 8792 KB Output is correct
35 Correct 27 ms 16804 KB Output is correct
36 Correct 27 ms 16920 KB Output is correct
37 Correct 1 ms 4444 KB Output is correct
38 Correct 1 ms 4444 KB Output is correct
39 Correct 1 ms 4700 KB Output is correct
40 Correct 1 ms 4700 KB Output is correct
41 Correct 2 ms 5212 KB Output is correct
42 Correct 3 ms 5980 KB Output is correct
43 Correct 7 ms 8568 KB Output is correct
44 Correct 27 ms 16724 KB Output is correct
45 Correct 27 ms 16724 KB Output is correct
46 Incorrect 864 ms 131028 KB Output isn't correct
47 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Incorrect 839 ms 130644 KB Output isn't correct
3 Halted 0 ms 0 KB -