Submission #951229

#TimeUsernameProblemLanguageResultExecution timeMemory
951229PM1Bitwise (BOI06_bitwise)C++17
35 / 100
1 ms400 KiB
#include <bits/stdc++.h> using namespace std; #define fr first #define sc second #define ll long long int const ll mxn=105; ll n,p,cnt[mxn],ans=0,z=1; vector<pair<ll,ll>>v[mxn]; int main(){ cin>>n>>p; for(ll i=1;i<=p;i++) cin>>cnt[i]; for(ll i=1;i<=p;i++){ while(cnt[i]--){ ll a,b; cin>>a>>b; v[i].push_back({a,b}); } } for(ll k=31;k>=0;k--){ bool t=1; for(ll i=1;i<=p;i++){ ll g=0,gg=0; for(auto j:v[i]){ if(j.fr>=(z<<k) && j.sc>=(z<<k))g++; else if(j.sc>=(z<<k))gg++; } if(g+gg==0){ t=0; break; } } if(!t) continue; else{ ans+=(z<<k); for(ll i=1;i<=p;i++){ ll g=0,gg=0; for(auto j:v[i]){ if(j.fr>=(z<<k) && j.sc>=(z<<k))g++; else if(j.sc>=(z<<k))gg++; } if(g){ for(ll j=0;j<v[i].size();j++){ auto y=v[i][j]; if(y.fr>=(z<<k) && y.sc>=(z<<k)){ v[i][j].fr-=(z<<k); v[i][j].sc-=(z<<k); } } } else{ for(ll j=0;j<v[i].size();j++){ auto y=v[i][j]; if(y.fr<(z<<k) && y.sc>=(z<<k)){ v[i][j].fr-=(z<<k); v[i][j].sc-=(z<<k); break; } } } } } } cout<<ans; return 0; }

Compilation message (stderr)

bitwise.cpp: In function 'int main()':
bitwise.cpp:44:18: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   44 |      for(ll j=0;j<v[i].size();j++){
      |                 ~^~~~~~~~~~~~
bitwise.cpp:53:18: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   53 |      for(ll j=0;j<v[i].size();j++){
      |                 ~^~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...