# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1168973 | sasde | Bitwise (BOI06_bitwise) | C++20 | 0 ms | 328 KiB |
#include<bits/stdc++.h>
#define int long long
#define task "strdel"
#define ii pair<int,int>
#define iii pair<int,ii>
#define iv pair<ii,ii>
#define se second
#define fi first
#define ffi fi.fi
#define sfi se.fi
#define sse se.se
#define fse fi.se
#define lt(i, c, d) for(int i = c; i <= d; ++i)
#define fl(i, c, d) for(int i = d; i >= c; --i)
#define pb push_back
#define emb emplace_back
#define emf emplace_front
#define em emplace
using namespace std;
const int N=1e2+5,lg=30,mod=1e9+7;
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
int Rand(int u,int v){
return u+rd()%(v-u+1);
}
int n,k,s[N],p[N];
ii a[N];
bool check[N];
void solve(){
cin >> n >> k;
s[1]=1;
for(int i=1;i<=k;++i){
cin >> p[i];
s[i+1]=s[i]+p[i];
}
for(int i=1;i<=n;++i){
cin >> a[i].fi >> a[i].se;
}
int mask=0;
for(int j=30;j>=0;--j){
bool ok=true;
int set=1<<j;
for(int i=1;i<=k;++i){
if(check[i])continue;
bool kk=0;
for(int z=s[i];z<s[i+1];++z){
if(set<=a[z].se)kk=1;
}
ok&=kk;
}
for(int i=1;i<=k;++i){
int q=0,q1=0;
for(int z=s[i];z<s[i+1];++z){
q+=a[z].se>=set;
q1+=a[z].se>=set&&set>a[z].fi;
}
if(q1&&(!ok||q>1))check[i]=true;
for(int z=s[i];z<s[i+1];++z){
if(a[z].se<set)continue;
a[z].fi-=set;
a[z].se-=set;
}
}
if(ok)mask^=(1<<j);
}
cout << mask;
}
main()
{
srand(time(0));
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
if(fopen(task".inp","r")){
freopen(task".inp","r",stdin);
freopen(task".out","w",stdout);
}
int t=1;
// cin >> t;
while(t--){
solve();
cout<<'\n';
}
}
컴파일 시 표준 에러 (stderr) 메시지
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |