oj.uz

Submission #729105

# Submission time Handle Problem Language Result Execution time Memory
729105 2023-04-23T14:02:16 Z shadow_sami Council (JOI23_council) C++17
6 / 100
 515 ms 53296 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 long long 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,ans,sum,tptp;
const ll mx = 300000+5;
const ll mod = 1e9+7;;
//void prime_sieve();
// ll gcd(ll a,ll b);
ll mod_power(ll aa,ll bb);

ll mod_add(ll aa,ll bb){
  aa%=mod;
  bb%=mod;
  return (aa+bb)%mod;
}
ll mod_minus(ll aa,ll bb){
  aa%=mod;
  bb%=mod;
  return ((aa-bb)+mod)%mod;
}
ll mod_mul(ll aa,ll bb){
  aa%=mod;
  bb%=mod;
  return (aa*bb)%mod; 
}
ll mod_divi(ll aa,ll bb){
  aa=mod_mul(aa,mod_power(bb,mod-2));
  return aa;
}
ll mod_power(ll aa,ll bb){
  aa%=mod;
  ll empowered = 1;
  bb%=mod-1;
  while(bb > 0){
    if(bb & 1)
      empowered = mod_mul(empowered,aa);
    bb = bb >> 1;
    aa = mod_mul(aa,aa);
  }
  return empowered;
}

bool f = false;
ll val[mx][20];
pi dp[20][2];
pi dp2[20][2];
ll tnc[20][2];
ll vote[20],score;
unordered_map<ll,pi> mp;

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;
        fip(0,20)
        	fjp(0,2)
        		dp[i][j] = {-1,-1},tnc[i][j]=0,dp2[i][j]={-1,-1};
        fip(0,n){
        	fjp(0,m)
        		cin>>val[i][j];
        	tp = 0;
        	fjp(0,m)
        		if(val[i][j])
        			tp |= (1<<j);
        	mp[tp].ff++;
        	mp[tp].ss = i;
        }
        fip(0,n)
        	fjp(0,m)
        		if(val[i][j])
        			vote[j]++;
        score = 0;
        fjp(0,m)
        	if(vote[j]>=(n/2))
        		score++;
        fip(0,n){
        	fjp(0,m)
        		if(val[i][j])
        			vote[j]--;
        	tp = 0;
        	fjp(0,20)
        		if(vote[j]>=(n/2))
	        		tp++;
        	fjp(0,m){
        		tnc[j][val[i][j]]++;
        		if(dp[j][val[i][j]].ff == -1)
        			dp[j][val[i][j]] = {i,tp};
        		else{
        			if(dp[j][val[i][j]].ss<tp){
        				dp2[j][val[i][j]] = {dp[j][val[i][j]].ff,dp[j][val[i][j]].ss};
        				dp[j][val[i][j]] = {i,tp}; 
        			}else if(dp2[j][val[i][j]].ff==-1)
        				dp2[j][val[i][j]] = {i,tp};
        			else if(dp2[j][val[i][j]].ss < tp)
        				dp2[j][val[i][j]] = {i,tp};
        		}
        	}
        	fjp(0,m)
        		if(val[i][j])
        			vote[j]++;
        }
        // fip(0,20)
        // 	fjp(0,2){
        // 		cout<<i<<" pos "<<j<<nli;
        // 		if(tnc[i][j])
        // 			cout<<dp[i][j].ff<<" "<<dp[i][j].ss<<" "<<dp2[i][j].ff<<nli;
        // 	}
        fip(0,n){
        	fjp(0,m)
        		if(val[i][j])
        			vote[j]--;
        	ll na = -INT_MAX;	        
        	ll temp;
        	pi pos;
        	fjp(0,20)
        		fp(x,0,2){
        			if(tnc[j][x]==1)
        				if(dp[j][x].ff==i)
        					continue;
        			if(tnc[j][x]){
        				tp = dp[j][x].ff;
        				if(tp==i)
        					tp = dp2[j][x].ff;
        				fp(y,0,m)
        					if(val[tp][y])
        						vote[y]--;
        				temp = 0;
        				fp(y,0,m)
        					if(vote[y]>=(n/2))
        						temp++;
        				if(temp>na){
        					na = temp;
        					pos = {j,x};
        				}        					
        				fp(y,0,m)
        					if(val[tp][y])
        						vote[y]++;
        			}
        		}
	        fjp(0,m)
        		if(val[i][j])
        			vote[j]++;
        	cout<<na<<nli;
        }
        	// fip(0,n)
        	// fjp(0,m)
        	// 	cout<<val[i][j]<<nli;
        
    // cerr << "Time elapsed: " << setprecision(6) << 1000.0 * clock() / CLOCKS_PER_SEC << "ms\n";
    return 0;
}

// void prime_sieve(){ 
//     for(ll i = 2; i*i<=mx;i++)  
//         if(dp[i])   
//             for(ll j = i*i; j<mx; j+=i) 
//                 dp[j] = false;  
//         dp[1] = dp[0] = false;  
//     return; 
// }

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Incorrect 1 ms 212 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Incorrect 1 ms 212 KB Output isn't correct
9 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 106 ms 49016 KB Output is correct
3 Correct 104 ms 48972 KB Output is correct
4 Correct 85 ms 48332 KB Output is correct
5 Correct 134 ms 48932 KB Output is correct
6 Correct 87 ms 48384 KB Output is correct
7 Correct 118 ms 48904 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 2 ms 724 KB Output is correct

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 106 ms 49016 KB Output is correct
3 Correct 104 ms 48972 KB Output is correct
4 Correct 85 ms 48332 KB Output is correct
5 Correct 134 ms 48932 KB Output is correct
6 Correct 87 ms 48384 KB Output is correct
7 Correct 118 ms 48904 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 2 ms 724 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 515 ms 53296 KB Output is correct
21 Correct 461 ms 52556 KB Output is correct
22 Incorrect 459 ms 52824 KB Output isn't correct
23 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 106 ms 49016 KB Output is correct
3 Correct 104 ms 48972 KB Output is correct
4 Correct 85 ms 48332 KB Output is correct
5 Correct 134 ms 48932 KB Output is correct
6 Correct 87 ms 48384 KB Output is correct
7 Correct 118 ms 48904 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 2 ms 724 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 515 ms 53296 KB Output is correct
21 Correct 461 ms 52556 KB Output is correct
22 Incorrect 459 ms 52824 KB Output isn't correct
23 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 106 ms 49016 KB Output is correct
3 Correct 104 ms 48972 KB Output is correct
4 Correct 85 ms 48332 KB Output is correct
5 Correct 134 ms 48932 KB Output is correct
6 Correct 87 ms 48384 KB Output is correct
7 Correct 118 ms 48904 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 2 ms 724 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 515 ms 53296 KB Output is correct
21 Correct 461 ms 52556 KB Output is correct
22 Incorrect 459 ms 52824 KB Output isn't correct
23 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Incorrect 1 ms 212 KB Output isn't correct
9 Halted 0 ms 0 KB -