oj.uz

Submission #729293

# Submission time Handle Problem Language Result Execution time Memory
729293 2023-04-23T18:19:31 Z shadow_sami Council (JOI23_council) C++17
25 / 100
 4000 ms 2488 KB 
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef int ll;
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
typedef pair<ll,ll> pi;
typedef map<ll,ll> mi;
typedef long double ld;
typedef vector<ld> vd;
typedef vector<vector<ld>> vvd;
typedef pair<ld,ld> pd;
#define ff first
#define ss second
#define srt(a) sort(a.begin(),a.end());
#define fip(k, n) for (ll i = k; i < n; i++)
#define fjp(k, n) for (ll j = k; j < n; j++)
#define fin(k, n) for (ll i = k; i >= n; i--)
#define fjn(k, n) for (ll j = k; j >= n; j--)
#define fp(k, n, m) for (ll k = n; k < m; k++)
#define fn(k, n, m) for (ll k = n; k >= m; k--)
#define ordered_set tree<pi, null_type,less< pi >, rb_tree_tag,tree_order_statistics_node_update>
#define totalOne(n) __builtin_popcount(n)
#define backZero(n) __builtin_ctzll(n)
#define frontZero(n) __builtin_clzll(n)
#define fx(k) for ( auto x : k )
#define test ll t;cin >> t;while (t--)
#define nli "\n"

ll n,m,tp,tp2,res,cnt,sum,tptp,ans;
const ll mx = 3e5+5;
const ll mod = 1e9+7;

bool f = false;
set<ll> st;
ll a[mx];
ll tnc[25];
ll bits[(1 << 15)];
ll na[(1 << 15)];
ll one,zero;
vi v;

int main(){
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    // #ifndef ONLINE_JUDGE
    //     freopen("input1.txt", "r", stdin);
    //     freopen("output1.txt", "w", stdout);
    //     freopen("error1.txt", "w", stderr);
    // #endif // ONLINE_JUDGE

        cin>>n>>m;
        ll cnst = (1 << m) - 1;
        fip(0,n){
        	cnt = 0;
        	fjp(0,m){
        		cin>>tp;
        		cnt |= (tp<<j);
        		if(tp)
        			tnc[j]++;
        	}
        	a[i] = cnt;
        	bits[cnt]++;
        	st.insert(cnt);
        }
        res = 0,one = 0,zero = 0;
        fjp(0,m){
        	if(tnc[j]==(n/2))
        		zero |= (1<<j);
        	else if(tnc[j]==(n/2)+1)
        		one |= (1<<j);
        	else if(tnc[j]>=(n/2)+2)
        		res++;
        }
        fx(st)
        	v.push_back(x);
        fip(0,(long long)v.size()){
        	bits[v[i]]--;
        	if(bits[v[i]]==0)
        		st.erase(st.find(v[i]));
        	ans = 0;
        	fx(st){
        		tp = totalOne((one & (cnst ^ (x&v[i]))) | (zero & (cnst ^ (x|v[i]))));
        		ans = max(ans,tp+res);
        	}
        	na[v[i]] = ans;
        	if(bits[v[i]]==0)
        		st.insert(v[i]);
        	bits[v[i]]++;
        }
        fip(0,n)
        	cout<<na[a[i]]<<nli;
        
    // cerr << "Time elapsed: " << setprecision(6) << 1000.0 * clock() / CLOCKS_PER_SEC << "ms\n";
    return 0;
}

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Runtime error 1 ms 468 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Runtime error 1 ms 468 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -

Subtask #3
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 52 ms 1992 KB Output is correct
3 Correct 56 ms 2044 KB Output is correct
4 Correct 52 ms 2068 KB Output is correct
5 Correct 57 ms 2048 KB Output is correct
6 Correct 36 ms 2048 KB Output is correct
7 Correct 59 ms 2084 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 340 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 52 ms 1992 KB Output is correct
3 Correct 56 ms 2044 KB Output is correct
4 Correct 52 ms 2068 KB Output is correct
5 Correct 57 ms 2048 KB Output is correct
6 Correct 36 ms 2048 KB Output is correct
7 Correct 59 ms 2084 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 202 ms 2076 KB Output is correct
21 Correct 181 ms 2108 KB Output is correct
22 Correct 182 ms 1996 KB Output is correct
23 Correct 152 ms 2320 KB Output is correct
24 Correct 167 ms 2028 KB Output is correct
25 Correct 208 ms 2168 KB Output is correct
26 Correct 202 ms 2144 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 212 KB Output is correct
44 Correct 1 ms 340 KB Output is correct
45 Correct 1 ms 340 KB Output is correct

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 52 ms 1992 KB Output is correct
3 Correct 56 ms 2044 KB Output is correct
4 Correct 52 ms 2068 KB Output is correct
5 Correct 57 ms 2048 KB Output is correct
6 Correct 36 ms 2048 KB Output is correct
7 Correct 59 ms 2084 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 202 ms 2076 KB Output is correct
21 Correct 181 ms 2108 KB Output is correct
22 Correct 182 ms 1996 KB Output is correct
23 Correct 152 ms 2320 KB Output is correct
24 Correct 167 ms 2028 KB Output is correct
25 Correct 208 ms 2168 KB Output is correct
26 Correct 202 ms 2144 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 212 KB Output is correct
44 Correct 1 ms 340 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 444 ms 2488 KB Output is correct
48 Correct 337 ms 2160 KB Output is correct
49 Correct 344 ms 2244 KB Output is correct
50 Correct 199 ms 2284 KB Output is correct
51 Correct 257 ms 2064 KB Output is correct
52 Execution timed out 4083 ms 2404 KB Time limit exceeded
53 Halted 0 ms 0 KB -

Subtask #6
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 52 ms 1992 KB Output is correct
3 Correct 56 ms 2044 KB Output is correct
4 Correct 52 ms 2068 KB Output is correct
5 Correct 57 ms 2048 KB Output is correct
6 Correct 36 ms 2048 KB Output is correct
7 Correct 59 ms 2084 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 202 ms 2076 KB Output is correct
21 Correct 181 ms 2108 KB Output is correct
22 Correct 182 ms 1996 KB Output is correct
23 Correct 152 ms 2320 KB Output is correct
24 Correct 167 ms 2028 KB Output is correct
25 Correct 208 ms 2168 KB Output is correct
26 Correct 202 ms 2144 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 212 KB Output is correct
44 Correct 1 ms 340 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 444 ms 2488 KB Output is correct
48 Correct 337 ms 2160 KB Output is correct
49 Correct 344 ms 2244 KB Output is correct
50 Correct 199 ms 2284 KB Output is correct
51 Correct 257 ms 2064 KB Output is correct
52 Execution timed out 4083 ms 2404 KB Time limit exceeded
53 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Runtime error 1 ms 468 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -