text stringlengths 49 983k |
|---|
#include <bits/stdc++.h>
#define fi first
#define se second
#define sz(x) ((int)x.size())
using namespace std;
typedef long long lli;
typedef pair<int,int> pii;
const int inf=1e9;
int n,k,q,arr[2000];
pii a[2000];
int get(int val) {
int mx=0;
priority_queue<int,vector<int>,greater<int>> aq,qq;
for(int i=0;i<n;i++) if(arr[i]>=val) {
int j=i;
while(!aq.empty()) aq.pop();
for(;j<n && arr[j]>=val;j++) aq.push(arr[j]);
int s=sz(aq)-k+1;
while(s>0) {
qq.push(aq.top()); aq.pop();
s--;
}
i=j-1;
}
if(sz(qq)<q) return inf;
for(int i=0;i<q;i++) {
mx=qq.top(); qq.pop();
}
return mx-val;
}
int main() {
scanf("%d%d%d",&n,&k,&q);
for(int i=0;i<n;i++) {
scanf("%d",arr+i);
a[i].fi=arr[i]; a[i].se=i;
}
sort(a,a+n);
int ans=inf;
for(int i=0;i<n;i++) if(i==0 || a[i].fi!=a[i-1].fi)
ans=min(ans,get(a[i].fi));
printf("%d\n",ans);
return 0;
}
|
#include<bits/stdc++.h>
#define MN 5005
#define inf 0x7fffffff
int n,k,q;
int ans=inf;
int s[MN],c[MN],v[MN];
inline int Min(int a,int b){return a<b?a:b;}
inline void work(int x){
memset(c,sizeof(c),0);memset(v,sizeof(v),0);
int l=1,r=1,cnt=0;
while(l<=n){
while(l<=n&&s[l]<x) l++;r=l;
while(r<=n&&s[r]>=x) r++;r--;
if(r-l+1>=k){
int tie=0;
for(int i=l;i<=r;i++) v[++tie]=s[i];
std::sort(v+1,v+1+tie);
tie=1;
for(int i=cnt+1;tie<=r-l-k+2;i++,tie++) c[i]=v[tie];
cnt=cnt+r-l-k+2;
}l=++r;
}
if(cnt>=q) {
std::sort(c+1,c+cnt+1);
if(c[1]==x) ans=Min(ans,c[q]-x);
}
}
int main(){
scanf("%d%d%d",&n,&k,&q);
for(int i=1;i<=n;i++) scanf("%d",&s[i]);
for(int i=1;i<=n;i++) work(s[i]);
printf("%d",ans);
} |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
const ll MOD = 1000000007LL;
int A[2000];
int main() {
ll N, K, Q;
cin >> N >> K >> Q;
for (int i = 0; i < N; i++) cin >> A[i];
int ans = 1 << 30;
for (int i = 0; i < N; i++) {
vector<vector<int>> vec;
vector<int> v;
vector<int> m;
for (int j = 0; j < N; j++) {
if (A[i] <= A[j]) {
v.push_back(A[j]);
}
else {
if (!v.empty()) vec.push_back(v);
v.clear();
}
}
if (!v.empty()) vec.push_back(v);
for (int j = 0; j < vec.size(); j++) {
if (vec[j].size() < K) continue;
sort(vec[j].begin(), vec[j].end());
for (int k = 0; k + K <= vec[j].size(); k++) m.push_back(vec[j][k]);
}
sort(m.begin(), m.end());
if (m.size() >= Q) ans = min(ans, m[Q - 1] - A[i]);
}
cout << ans << endl;
} |
#include <bits/stdc++.h>
#define r(i,n) for(int i=0;i<n;i++)
using namespace std;
int n,k,Q,a[100009];
int sol(int X){
priority_queue<int,vector<int>,greater<int> >q,ANS;
for(int i=0;i<n;i++){
if(a[i]<X){L:;
while(q.size()>=k)ANS.push(q.top()),q.pop();
while(!q.empty())q.pop();
}
else q.push(a[i]);
if(q.size()&&i==n-1)goto L;
}
if(ANS.size()<Q)return 1e9;
int MIN=ANS.top(),cnt=1;
while(cnt++!=Q)ANS.pop();
return ANS.top()-MIN;
}
int main(){
cin>>n>>k>>Q;
r(i,n)cin>>a[i];
int ans=1e9;
r(i,n)ans=min(ans,sol(a[i]));
cout<<ans<<endl;
} |
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
int n,k,q,a[2005],ans=0x7fffffff,b[2005],c[2005],d[2005],t,l,r;
inline int min(int x,int y){
return x<y?x:y;
}
int main(){
scanf("%d%d%d",&n,&k,&q);
for(int i=1;i<=n;i++){
scanf("%d",&a[i]);
b[i]=a[i];
}
sort(b+1,b+n+1);
for(int i=1;i<=n;i++){
t=b[i],l=1,r=1;
c[0]=0;
while(l<=n){
while(a[l]<t&&l<=n) l++;
d[0]=0,r=l;
while(a[r]>=t&&r<=n) r++;
for(int i=l;i<r&&i<=n;i++) d[++d[0]]=a[i];
if(d[0]>=k){
sort(d+1,d+d[0]+1);
for(int i=1;i<=d[0]-k+1;i++) c[++c[0]]=d[i];
}
l=r;
}
sort(c+1,c+c[0]+1);
if(c[0]>=q) ans=min(ans,c[q]-c[1]);
}
printf("%d\n",ans);
return 0;
} |
#include<bits/stdc++.h>
//#include<string>
using namespace std;
int n,k,q,y,a[2001],b[2001],t,ll,s[2001],ss,ans=2e9;
bool cmp(int a,int b){
return a<b;
}
int main(){
scanf("%d %d %d",&n,&k,&q);
for(register int i=1;i<=n;i++)
scanf("%d",&a[i]);
for(register int j=1;j<=n;j++){
y=a[j];//枚举能被删除的最小元素y
memset(s,0,sizeof(s));
ss=0;
t=0;
for(register int i=1;i<=n+1;i++){
if(i==n+1||a[i]<y){//如果a[i]为一段的边界
sort(b+1,b+t+1,cmp);
ll=t-k+1;//当前这段能删的数的个数
for(register int l=1;l<=ll;l++)
s[++ss]=b[l];//把能删的数存在s数组里
memset(b,0,sizeof(b));
t=0;//清空b数组
}
else{
b[++t]=a[i];//不是边界就加入到当前这段
}
}
if(ss<q){//如果能被删的数不足q个，就直接枚举下个y
continue;
}
sort(s+1,s+ss+1,cmp);
//printf("%d %d\n",s[q],y);
ans=min(ans,s[q]-y);//s[q]就是x,这里是更新ans
}
printf("%d\n",ans);
return 0;
} |
#define FILEIO(a) freopen(a".in","r",stdin);freopen(a".out","w",stdout);
#include <stdio.h>
#include <queue>
#include <algorithm>
#define N 10005
using namespace std;
int n,k,q,a[N],b[N],c[N];
inline void smin(int &a,int b){b<a?a=b:0;}
inline int read() {
char c=getchar();int x=0;
while(c<48||c>57) c=getchar();
while(c>47&&c<58) x=(x<<3)+(x<<1)+(c^48),c=getchar();
return x;
}
int solve(int x) {
static int i,j,ans,m,t,p;
ans=0;m=0;
for(i=0;i<n;++i) {
for(j=i;j<n&&a[j]>=x;++j);
if(j-i>=k) {
p=j-i-k;
for(t=0;i<j;) b[t++]=a[i++];
sort(b,b+t);
while(~p) c[m++]=b[p--];
}
}
if(m<q) return 1<<30;
sort(c,c+m);
return c[q-1]-x;
}
int main() {
// FILEIO("operation");
int i,ans=1<<30;
n=read();k=read();q=read();
for(i=0;i<n;++i) a[i]=read();
for(i=0;i<n;++i) smin(ans,solve(a[i]));
printf("%d",ans);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
const int N=2000;
int a[N+1];
int main(){
int n,k,q;
scanf("%d%d%d",&n,&k,&q);
for (int i=0;i<n;i++)
scanf("%d",&a[i]);
int ans=1e9;
for (int& bound:a) {
vector<int>t;
vector<int>s;
for (int i=0;i<=n;i++){
if (i==n||a[i]<bound){
sort(t.begin(),t.end());
for (int i=0;i<=(int)t.size()-k;i++)
s.push_back(t[i]);
t.clear();
}else t.push_back(a[i]);
}
if ((int)s.size()<q) continue;
sort(s.begin(),s.end());
ans=min(ans,s[q-1]-bound);
}
printf("%d\n",ans);
return 0;
} |
// by Balloons
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#define mpr make_pair
#define debug() puts("okkkkkkkk")
#define rep(i,a,b) for(int (i)=(a);(i)<=(b);(i)++)
using namespace std;
typedef long long LL;
const int inf = 1e9,maxn=3e5+5;
int n,m,q,a[maxn],b[maxn],ta[maxn];
int work(int x){
int r=inf,st=0,pos=0;
for(int i=1;i<=n+1;i++){
if(a[i] >= a[x]){
if(st == 0)st = i;
}else{
if(st && i-st>=m){
int bc = 0;
for(int j=st;j<=i-1;j++){
b[++ bc]=a[j];
}
sort(b+1,b+bc+1);
for(int j=1;j+m-1<=bc;j++)
ta[++pos]=b[j];
}
st = 0;
}
}
if(pos < q)return inf;
sort(ta+1,ta+pos+1);
return ta[q]-a[x];
}
int main(){
scanf("%d%d%d",&n,&m,&q);
for(int i=1;i<=n;i++)scanf("%d",&a[i]);
int ans = inf;
for(int i=n;i>=1;i--){
ans = min(ans,work(i));
}
printf("%d\n",ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n, k, q;
cin>>n>>k>>q;
vector<int> a(n);
for(auto& e: a) cin>>e;
a.push_back(0);
int res=INT_MAX;
for(int i=0; i<n; ++i) {
int y=a[i];
vector<int> v;
priority_queue<int, vector<int>, greater<int>> q2;
for(int j=0; j<=n; ++j) {
if (a[j]>=y) {
q2.push(a[j]);
}
else {
while (q2.size()>=k) {
v.push_back(q2.top());
q2.pop();
}
while (q2.size()) q2.pop();
}
}
if (v.size()>=q) {
sort(begin(v), end(v));
res=min(res, v[q-1]-y);
}
}
cout<<res<<endl;
} |
#include <bits/stdc++.h>
using namespace std;
const int N = 2005;
int a[N], b[N], c[N];
int main(){
int n, k, q, last, cnt, ans;
scanf("%d %d %d",&n,&k,&q);
for (int i = 1; i <= n; i++) scanf("%d",&a[i]);
ans = 2e9;
for (int i = 1; i <= n; i++){
for (int j = 1; j <= n; j++) b[j] = a[j];
cnt = 0; last = 0;
for (int j = 1; j <= n; j++){
if (b[j] < a[i]){
if (j - last - 1 >= k){
sort(b + last + 1, b + j);
for (int p = last + 1; p <= j - k; p++) c[++cnt] = b[p];
}
last = j;
}
}
if (n - last >= k){
sort(b + last + 1, b + n + 1);
for (int p = last + 1; p <= n + 1 - k; p++) c[++cnt] = b[p];
}
if (cnt >= q){
sort(c + 1, c + cnt + 1);
ans = min(ans, c[q] - a[i]);
}
}
printf("%d\n", ans);
return 0;
} |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<queue>
using namespace std;
int a[2010];bool used[2010];int ans=1e9;
priority_queue<int,vector<int>,greater<int> > pq,pq2;
int main()
{
int n,k,q;scanf("%d%d%d",&n,&k,&q);
for(int i=1;i<=n;i++)scanf("%d",&a[i]);
for(int i=1;i<=n;i++)
{
memset(used,0,sizeof(used));
while(!pq2.empty())pq2.pop();
for(int j=1;j<=n;j++)if(a[j]<a[i])used[j]=1;
int st=0;used[n+1]=1;
for(int j=1;j<=n+1;j++)
{
if(used[j]==1)
{
for(int l=st+1;l<j;l++)
{
pq.push(a[l]);
}
for(int l=1;l<=j-st-k;l++)pq2.push(pq.top()),pq.pop();
st=j;
}
while(!pq.empty())pq.pop();
}
int now=0;
while(!pq2.empty())
{
if(now==q-1)break;pq2.pop();now++;
}
if(pq2.empty())continue;
ans=min(ans,pq2.top()-a[i]);
}
printf("%d",ans);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
const int N = 2001;
int n,k,q,a[N],ans = 1e9 + 9;
vector<int>temp,b;
void add(){
sort(temp.rbegin(),temp.rend());
while(temp.size() >= k)b.push_back(temp.back()),temp.pop_back();
temp.clear();
}
int main(){
//freopen("readin.txt","r",stdin);
scanf("%d%d%d",&n,&k,&q);
for(int i = 0;i < n;i++)scanf("%d",a + i);
for(int i = 0;i < n;i++){
b.clear();temp.clear();
for(int j = 0;j < n;j++)
if(a[j] < a[i])add();
else temp.push_back(a[j]);
add();
sort(b.begin(),b.end());
if(b.size() >= q)ans = min(ans,b[q - 1] - b[0]);
}
printf("%d\n",ans);
} |
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<queue>
using namespace std;
int a[2010],b[2010],n,k,Q,ans=1e9,c[2010],tot;
bool vis[2010];
priority_queue<int,vector<int>,greater<int> >q;
void solve(int w)
{
tot=0;
for (int i=1;i<=n;i++) if (b[i]<w) vis[i]=1;
for (int i=1;i<=n;i++)
{
if (vis[i]==1)
{
while (q.size()>=k) c[++tot]=q.top(),q.pop();
while (!q.empty()) q.pop();
}
else q.push(b[i]);
}
while (q.size()>=k) c[++tot]=q.top(),q.pop();
while (!q.empty()) q.pop();
sort(c+1,c+1+tot);if (tot<Q) return;
ans=min(ans,c[Q]-c[1]);
}
int main()
{
scanf("%d%d%d",&n,&k,&Q);
for (int i=1;i<=n;i++) scanf("%d",&a[i]),b[i]=a[i];
sort(a+1,a+1+n);
for (int i=1;i<=n;i++) solve(a[i]);
printf("%d",ans);
} |
#include<bits/stdc++.h>
using namespace std;
#define x first
#define y second
int n, k, q, a[2055], ans = 1023456789;
int solve(int x) {
vector<int> cur, num;
for (int i = 0; i < n; i++) {
if (a[i] < x) {
if (cur.size() >= k) {
sort(cur.begin(), cur.end());
for (int j = 0; j < cur.size() - k + 1; j++)
num.push_back(cur[j]);
}
cur.clear();
} else {
cur.push_back(a[i]);
}
}
if (cur.size() >= k) {
sort(cur.begin(), cur.end());
for (int j = 0; j < cur.size() - k + 1; j++)
num.push_back(cur[j]);
}
if (num.size() >= q) {
sort(num.begin(), num.end());
return num[q - 1] - num[0];
} else
return 1023456789;
}
int main () {
scanf("%d%d%d", &n, &k, &q);
for (int i = 0; i < n; i++)
scanf("%d", a + i);
for (int i = 0; i < n; i++)
ans = min(ans, solve(a[i]));
printf("%d\n", ans);
return 0;
} |
#include<bits/stdc++.h>
#define For(i,j,k)for(int i=j;i<=k;++i)
using namespace std;
const int N=2010;
int A[N];
bool cmp(int x,int y){
return A[x]<A[y];
}
int bel[N],cnt[N],rk[N],n,k,q;
int main(){
scanf("%d%d%d",&n,&k,&q);
For(i,1,n)scanf("%d",&A[i]),rk[i]=i;
sort(rk+1,rk+n+1,cmp);
int ans=1e9;
For(i,1,n-q+1){
For(j,0,n)cnt[j]=0;
For(j,0,n){
bel[j]=A[j]<A[rk[i]]?j:bel[j-1];
if(bel[j]!=j)++cnt[bel[j]];
}
int ret=0;
For(j,i,n){
if(cnt[bel[rk[j]]]>=k){
++ret,--cnt[bel[rk[j]]];
if(ret>=q){
ans=min(ans,A[rk[j]]-A[rk[i]]);
break;
}
}
}
}
printf("%d\n",ans);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define modulo 1000000007
#define mod(mod_x) ((((long long)mod_x+modulo))%modulo)
#define Inf 1000000005
int main(){
int N,K,Q;
cin>>N>>K>>Q;
vector<pair<int,int>> P;
vector<int> A(N);
for(int i=0;i<N;i++){
cin>>A[i];
P.emplace_back(A[i],i);
}
sort(P.begin(),P.end());
int ans = Inf;
for(int i=0;i<=N;i++){
priority_queue<int,vector<int>,greater<int>> QQ;
int now = 0;
while(true){
if(now>=N)break;
priority_queue<int,vector<int>,greater<int>> q;
while(now!=N&&A[now]!=Inf){
q.push(A[now]);
now++;
}
while(q.size()>=K){
QQ.push(q.top());
q.pop();
}
now++;
}
if(QQ.size()<Q)break;
int Y = QQ.top();
for(int j=0;j<Q-1;j++)QQ.pop();
int X = QQ.top();
ans = min(ans,X-Y);
if(i!=N){
A[P[i].second]=Inf;
}
}
cout<<ans<<endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int a[2005],b[2005],c[2005];
int n,k,q,ans;
int main(){
cin>>n>>k>>q;
for (int i=1;i<=n;i++) scanf("%d",&a[i]);
ans=1e9+1;
for (int i=1;i<=n;i++){
int l=0;
int cnt=0;
for (int j=1;j<=n+1;j++)
if (a[j]<a[i]){
if (!l) continue;
int r=j-1;
for (int p=l;p<=r;p++)
b[p]=a[p];
sort(b+l,b+r+1);
for (int p=l;p+k-1<=r;p++)
c[++cnt]=b[p];
l=0;
}
else if (!l) l=j;
if (cnt<q) continue;
sort(c+1,c+cnt+1);
ans=min(ans,c[q]-a[i]);
}
printf("%d\n",ans);
} |
#include<cstdio>
#include<queue>
#include<algorithm>
using namespace std;
const int MAXN = 2000;
const int INF = (1<<30);
int A[MAXN + 5];
priority_queue<int, vector<int>, greater<int> >q1, q2;
int main() {
int N, K, Q, ans = INF;
scanf("%d%d%d", &N, &K, &Q);
for(int i=1;i<=N;i++)
scanf("%d", &A[i]);
for(int i=1;i<=N;i++) {
int le = 1;
for(int j=1;j<=N+1;j++) {
if( A[j] < A[i] ) {
int len = j - le;
for(int k=K;k<=len;k++) {
q2.push(q1.top());
q1.pop();
}
le = j+1;
while( !q1.empty() )
q1.pop();
}
else q1.push(A[j]);
}
if( q2.size() >= Q ) {
for(int j=1;j<Q;j++)
q2.pop();
ans = min(ans, q2.top() - A[i]);
}
while( !q2.empty() )
q2.pop();
}
printf("%d\n", ans);
} |
#include<bits/stdc++.h>
using namespace std;
const int N=2e3+5;
struct node{int w,id;}a[N];
bool cmp(node a,node b){
return (a.w==b.w)?a.id<b.id:a.w<b.w;
}
int n,k,q,b[N],c[N],d[N],ans,vis[N];
int main(){
ans=1e9+5;
scanf("%d%d%d",&n,&k,&q);
for (int i=1;i<=n;++i){
scanf("%d",&a[i].w);
b[i]=a[i].w;
a[i].id=i;
}
sort(a+1,a+n+1,cmp);
for (int i=1;i<=n;++i){
int l=1,r=0,cnt=0;
while (r<=n){
while (vis[l]) ++l;
r=l;
while (!vis[r]&&r<=n) ++r;
int tot=0;
for (int j=l;j<r;++j)
c[++tot]=b[j];
sort(c+1,c+tot+1);
for (int j=1;j<=tot-k+1;++j)
d[++cnt]=c[j];
l=r;
}
if (cnt<q) break;
sort(d+1,d+cnt+1);
ans=min(ans,d[q]-a[i].w);
vis[a[i].id]=1;
}
printf("%d\n",ans);
} |
#include <bits/stdc++.h>
using namespace std;
template<typename T>
inline T read(T&x){
x=0;int f=0;char ch=getchar();
while (ch<'0'||ch>'9') f|=(ch=='-'),ch=getchar();
while (ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
return x=f?-x:x;
}
const int N=2000+10;
int n,K,q,i,j,k,cnt,a[N],b[N],res[N];
int main(){
read(n),read(K),read(q);
for (i=1;i<=n;i++) read(a[i]);
int ans=1000000000+7;
for (i=1;i<=n;i++){
int l=0;
for (cnt=0,j=1;j<=n+1;j++){
if (a[j]<a[i]){
if (!l) continue;
int r=j-1;
for (k=l;k<=r;k++) b[k]=a[k];
sort(b+l,b+r+1);
for (k=l;k+K-1<=r;k++) res[++cnt]=b[k];
l=0;
}
else if (!l) l=j;
}
if (cnt<q) continue;
sort(res+1,res+cnt+1);
ans=min(ans,res[q]-a[i]);
}
printf("%d\n",ans);
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
const int N=2050;
int n,k,q;
int a[N],b[N],c[N];
int main()
{
scanf("%d%d%d",&n,&k,&q);
for(int i=1;i<=n;i++) scanf("%d",&a[i]);
int mini=0x3f3f3f3f;
for(int i=1;i<=n;i++)
{
int size=0;
for(int j=1;j<=n;j++)
{
if(a[j]<a[i]) continue;
int now=j;
while(now<=n&&a[now+1]>=a[i]) now++;
int num=now-j+1-k+1;
if(num<=0) continue;
int cnt=0;
for(int l=j;l<=now;l++) b[++cnt]=a[l];
sort(b+1,b+cnt+1);
for(int l=1;l<=num;l++) c[++size]=b[l];
j=now;
}
if(size<q) continue;
sort(c+1,c+size+1);
mini=min(mini,c[q]-a[i]);
}
printf("%d\n",mini);
return 0;
} |
#include<bits/stdc++.h>
#define o 3005
using namespace std;
int a[o],b[o];
int n,K,Q,ans;
bool check(int l,int r)
{
int x=1,y,num=0,zm=0;
while(x<=n)
{
if(a[x]<l)
{
x++;
continue;
}
y=x;
while(y<n&&a[y+1]>=l) y++;
zm=0;
for(int k=x; k<=y; k++) if(a[k]<=r) zm++;
num+=min(zm,max((y-x+1)-(K-1),0));
x=y+1;
}
return num>=Q;
}
int main()
{
scanf("%d%d%d",&n,&K,&Q);
for(int i=1; i<=n; i++) scanf("%d",&a[i]),b[i]=a[i];
sort(b+1,b+n+1);
ans=b[Q]-b[1];
int sz=1;
for(int i=2; i<=n; i++) if(b[i]!=b[i-1]) b[++sz]=b[i];
for(int i=1; i<=sz; i++)
{
int l=i,r=sz,mid,as=0;
while(l<=r)
{
mid=(l+r)>>1;
if(check(b[i],b[mid])) as=mid,r=mid-1;
else l=mid+1;
}
if(as) ans=min(ans,b[as]-b[i]);
}
cout<<ans<<endl;
} |
#include<iostream>
#include<algorithm>
using namespace std;
const int N = 2005;
int n, k, q, a[N], ans = 1e9 + 5, t[N], b[N], c[N];
void cal(int mn) {
int l = 1, r = 1;
b[0] = 0;
while (l <= n) {
c[0] = 0;
while (a[l] < mn && l <= n) l++;
r = l;
while (a[r] >= mn && r <= n) r++;
for (int i = l; i < r && i <= n; i++)
c[++c[0]] = a[i];
if (c[0] >= k) {
sort(c + 1, c + c[0] + 1);
for (int i = 1; i <= c[0] - k + 1; i++)
b[++b[0]] = c[i];
}
l = r;
}
sort(b + 1, b + b[0] + 1);
if (b[0] >= q) ans = min(ans, b[q] - b[1]);
}
int main() {
cin >> n >> k >> q;
for (int i = 1; i <= n; i++) {
cin >> a[i];
t[i] = a[i];
}
sort(t + 1, t + n + 1);
for (int i = 1; i <= n; i++)
cal(t[i]);
cout << ans << endl;
return 0;
} |
#include<cstdio>
#include<algorithm>
#include<queue>
#define min(a,b) (a<b?a:b)
using std::sort;
int n,k,q,a[2050],tul[2050],ab[2050],num,ans=0x3f3f3f3f;
void work(int x){
int beg=0; num=0;
for(int i=1;i<=n;i++){
if(a[i]>=a[x]) if(!beg) beg=i;
if(a[i+1]<a[x]&&beg){
if(i-beg+1<k){beg=0;continue;}
for(int j=beg;j<=i;j++) ab[j]=a[j];
sort(ab+beg,ab+i+1);
for(int j=beg;j<=i-k+1;j++)
tul[++num]=ab[j];
beg=0;
}
}
if(num<q) return ;
sort(tul+1,tul+num+1);
ans=min(ans,tul[q]-a[x]);
return ;
}
int main(){
scanf("%d%d%d",&n,&k,&q);
for(int i=1;i<=n;i++) scanf("%d",&a[i]);
for(int i=1;i<=n;i++)
work(i);
printf("%d\n",ans);
return 0;
} |
#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
using namespace std;
typedef int32_t i32;
typedef uint32_t u32;
typedef int64_t i64;
typedef uint64_t u64;
typedef pair<int,int> pii;
typedef vector<int> vi;
const int MAX_N = 2000;
int n, k, q;
int a[MAX_N];
int b[MAX_N];
int c[MAX_N];
int main()
{
cin >> n >> k >> q;
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
int m = INT_MAX;
for (int i = 0; i < n; i++) {
int ai = 0, ci = 0;
while (ai < n) {
int bi = 0;
while (ai < n && a[i] <= a[ai]) {
b[bi++] = a[ai++];
}
ai++;
sort(b,b+bi);
for (int l = 0; l < bi - k + 1; l++) {
c[ci++] = b[l];
}
}
if (ci >= q) {
sort(c,c+ci);
m = min(m, c[q-1] - c[0]);
}
}
cout << m << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define fr first
#define sc second
const int INF = 1000000000;
int main(){
int n,k,q;
int a[2002];
scanf("%d%d%d",&n,&k,&q);
for(int i = 1 ; i <= n ; i ++){
scanf("%d",&a[i]);
}
int ret = INF;
set<int> S; S.insert(0); S.insert(n+1);
vector<P> vec;
for(int i = 1 ; i <= n ; i ++){
vec.push_back(P(a[i],i));
}
sort(vec.begin(),vec.end());
for(int i = 0 ; i < n ; i ++){
P p = vec[i];
int cnt = 0;
int r;
map<int,int> T;
for(int j = i ; j < n && cnt < q ; j ++){
P q = vec[j];
auto itr = S.lower_bound(q.sc);
int x = *itr;
--itr;
int y = *itr;
if(x-y >= k+1+T[x]){
T[x] ++;
cnt ++;
r = q.fr;
}
}
if(cnt == q)ret = min( ret , r-p.fr );
S.insert(p.sc);
}
cout << ret << endl;
}
|
#include <algorithm>
#include <iostream>
#include <cstdio>
using namespace std;
const int Maxn = 2010;
const int Inf = 0x7fffffff;
int n , k , q , ans = Inf;
int a[Maxn];
int tmp[Maxn] , Q[Maxn];
int main() {
scanf("%d%d%d",&n,&k,&q);
for(register int i=1; i<=n; i++)
scanf("%d",&a[i]);
for(register int i=1; i<=n; i++) {
Q[0] = 0;
for(register int j=1; j<=n+1; j++) {
if(a[j] < a[i]) {
sort(tmp+1,tmp+tmp[0]+1);
for(register int x=1; x<=tmp[0]-k+1; x++)
Q[++Q[0]] = tmp[x];
tmp[0] = 0;
}
else tmp[++tmp[0]] = a[j];
}
sort(tmp+1,tmp+tmp[0]+1);
for(register int x=1; x<=tmp[0]-k+1; x++)
Q[++Q[0]] = tmp[x];
tmp[0] = 0;
if(Q[0] < q) continue;
sort(Q+1,Q+Q[0]+1);
ans = min(ans,Q[q]-a[i]);
}
printf("%d\n",ans);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e3 + 5;
int N, K, Q;
int a[MAXN];
void load() {
scanf("%d%d%d", &N, &K, &Q);
for (int i = 0; i < N; i++)
scanf("%d", a + i);
}
bool check(int diff) {
for (int i = 0; i < N; i++) {
int block = 0, cnt = 0, taken = 0;
for (int j = 0; j <= N; j++)
if (a[j] < a[i]) {
taken += min(cnt, max(block - K + 1, 0));
block = cnt = 0;
}
else {
block++;
cnt += a[j] <= a[i] + diff;
}
if (taken >= Q)
return true;
}
return false;
}
int solve() {
int lo = 0, hi = 1e9;
while (lo < hi) {
int mid = (lo + hi) / 2;
if (check(mid))
hi = mid;
else
lo = mid + 1;
}
return lo;
}
int main() {
load();
printf("%d\n", solve());
return 0;
} |
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
using namespace std;
int a[2020];
int t[2020],tt[2020],nt;
int aa[2020],an;
bool ch[2020],in[2020];
bool cmp(int x,int y)
{
return a[x]<a[y];
}
int main()
{
int n,k,q;
int ans=2147483647;
scanf("%d%d%d",&n,&k,&q);
for(int i=1;i<=n;i++)
scanf("%d",&a[i]);
memset(in,0,sizeof(in));
for(int i=1;i<=n;i++)
t[i]=i;
sort(t+1,t+1+n,cmp);
an=0;
for(int i=n;i>=1;i--)
{
ch[t[i]]=true;
nt=0;
an=0;
for(int j=1;j<=n+1;j++)
{
if(ch[j])
tt[++nt]=j;
else
{
sort(tt+1,tt+1+nt,cmp);
for(int kk=1;kk<=nt-k+1;kk++)
aa[++an]=a[tt[kk]];
nt=0;
}
}
sort(aa+1,aa+an+1);
if(an>=q)
ans=min(ans,aa[q]-aa[1]);
}
printf("%d\n",ans);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
const int N=2e3+5;
int n,k,Q,a[N];
priority_queue<int> q;
vector<int> v;
void update()
{
while(!q.empty())
{
if(q.size()>=k)
v.push_back(-q.top());
q.pop();
}
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cin>>n>>k>>Q;
for(int i=1;i<=n;i++) cin>>a[i];
int res=2e9;
for(int i=1;i<=n;i++)
{
int mn=a[i];
for(int j=1;j<=n;j++)
{
if(a[j]>=mn)
q.push(-a[j]);
else
update();
}
update();
if(v.size()>=1)
sort(v.begin(),v.end());
if(v.size()>=Q&&v[0]==mn)
res=min(res,v[Q-1]-mn);
v.clear();
}
cout<<res<<'\n';
return 0;
} |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
int main(){
int n,k,q; scanf("%d%d%d",&n,&k,&q);
vector<int> a(n);
rep(i,n) scanf("%d",&a[i]);
a.emplace_back(0);
int ans=INT_MAX;
rep(i,n){
vector<int> b,tmp;
rep(j,n+1) if(a[j]>=a[i]) {
tmp.emplace_back(a[j]);
if(j==n-1 || a[j+1]<a[i]){
int width=tmp.size();
if(width>=k){
partial_sort(tmp.begin(),tmp.begin()+width-k+1,tmp.end());
b.insert(b.end(),tmp.begin(),tmp.begin()+width-k+1);
}
tmp.clear();
}
}
if(b.size()>=q){
nth_element(b.begin(),b.begin()+q-1,b.end());
ans=min(ans,b[q-1]-a[i]);
}
}
printf("%d\n",ans);
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int n,k,q;
int a[2005];
int p;
int t[2005];
int b[2005];
int c[2005];
int pp,ppp;
int s;
int ans;
int sum;
int r;
int main(){
cin>>n>>k>>q;
ans=0x3f3f3f3f;
for(int i=1;i<=n;i++)cin>>a[i];
for(int i=1;i<=n;i++){
p=0,s=0,sum=0;
pp=0;ppp=0;
for(int j=1;j<=n;j++)if(a[j]>=a[i])t[++p]=j;
if(p<q)continue;
// for(int j=1;j<=p;j++)cout<<t[j]<<" ";
// cout<<endl;
for(int j=1;j<=p+1;j++){
if(t[j]==t[j-1]+1){
s++;
}
else{
pp=0;
if(s>=k){
for(int l=j-s;l<j;l++)b[++pp]=a[t[l]];
sort(b+1,b+pp+1);
for(int l=1;l<=s-k+1;l++)c[++ppp]=b[l];
}
s=1;
}
}
// cout<<ppp<<endl;
// for(int j=1;j<=ppp;j++)cout<<c[j]<<" ";
// cout<<endl;
sort(c+1,c+ppp+1);
if(ppp>=q)ans=min(ans,c[q]-a[i]);
}
cout<<ans;
}
|
#include<bits/stdc++.h>
#define INF 0x7fffffff
using namespace std;
int n,k,q,a[2005],b[2005],ans=INF,c[2005],d[2005],t;
inline int read(){
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=(x<<3)+(x<<1)+ch-'0';ch=getchar();}
return x*f;
}
int check(int x){
for(int i=1;i<=n;++i) c[i]=a[i];
int l=0; t=0;
for(int r=1;r<=n;++r){
if(c[r]>=x) continue;
if(r-l-k>0){
sort(c+l+1,c+r);
for(int i=l+1;i<=r-k;++i) d[++t]=c[i];
}
l=r;
}
sort(c+l+1,c+n+1);
if(n-l-k+1>0) for(int i=l+1;i<=n-k+1;++i) d[++t]=c[i];
if(t>=q){
sort(d+1,d+t+1);
return d[q]-x;
}
else return INF;
}
int main(){
n=read(),k=read(),q=read();
for(int i=1;i<=n;++i) b[i]=a[i]=read();
sort(b+1,b+n+1);
for(int i=1;i<=n;++i) ans=min(check(b[i]),ans);
printf("%d",ans);
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ios_base::sync_with_stdio(false);
ll INF = 1LL<<60;
ll n,k,q;
cin>>n>>k>>q;
vector<ll> a(n);
for(int i=0;i<n;i++)
cin>>a[i];
auto check = [&](ll m)
{
vector<vector<ll> > v;
v.push_back(vector<ll>());
for(int i=0;i<n;i++)
{
if(a[i]>m)
v[v.size()-1].push_back(a[i]);
else
v.push_back(vector<ll>());
}
ll c = 0;
for(auto u:v)
c+=max((ll)(u.size()-k+1),0LL);
if(c<q)
return INF;
vector<ll> w;
for(auto u:v)
{
if(u.size()<k)
continue;
sort(u.begin(),u.end());
for(int j=0;j<u.size() - k+1;j++)
w.push_back(u[j]);
}
sort(w.begin(),w.end());
return w[q-1] - w[0];
};
ll ans = check(0);
for(int i=0;i<n;i++)
ans = min(ans,check(a[i]));
cout<<ans;
} |
#include<iostream>
#include<queue>
#include<vector>
#include<algorithm>
using namespace std;
int n,k,q,a[2005],b[2005],tmp[2005],lt,lc,vis[2005],c[2005],ans=1e9;
signed main(){
cin>>n>>k>>q;
for(int i=1;i<=n;i++){
cin>>a[i];
b[i]=a[i];
}
sort(b+1,b+n+1);
vis[n+1]=1;
for(int i=1;i<=n;++i){
for(int j=1;j<=n;++j) if(a[j]<b[i]) vis[j]=1;
lt=lc=0;
for(int j=1;j<=n+1;++j){
if(vis[j]){
if(lt>=k){
sort(tmp+1,tmp+lt+1);
for(int m=1;m<=lt-k+1;++m){
c[++lc]=tmp[m];
}
}
lt=0;
}
else tmp[++lt]=a[j];
}
if(lc>=q){
sort(c+1,c+lc+1);
ans=min(ans,c[q]-b[i]);
}
}
cout<<ans;
} |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 2005;
int n, q, k;
ll a[N], b[N], c[N], cnt, tot;
int main() {
scanf("%d%d%d", &n, &k, &q);
for (int i = 1; i <= n; ++i)
scanf("%lld", &a[i]);
ll ans = 1ll << 60;
for (int i = 1; i <= n; ++i) {
tot = 0;
a[n + 1] = -(1ll << 60);
for (int j = 1; j <= n + 1; ++j)
if (a[j] >= a[i])
b[++cnt] = a[j];
else {
sort(b + 1, b + 1 + cnt);
for (int i = 1; i <= cnt - k + 1; ++i)
c[++tot] = b[i];
cnt = 0;
}
sort(c + 1, c + 1 + tot);
if (tot >= q)
ans = min(ans, c[q] - a[i]);
}
cout << ans;
} |
#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <queue>
using namespace std;
typedef long long int ll;
int main(){
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n,k,q; cin >> n >> k >> q;
vector<int> a(n);
for(int i=0;i<n;i++){
cin >> a[i];
}
int ans=1e9;
for(int p:a){
vector<int> c;
multiset<int> s;
for(int i=0;i<=n;i++){
if(i==n||p>a[i]){
sort(c.begin(),c.end());
for(int j=0;j<=(int)c.size()-k;j++){
s.insert(c[j]);
}
c.clear();
}
else{
c.push_back(a[i]);
}
}
if(s.size()<q)continue;
auto it=s.begin();
for(int j=0;j<q-1;j++){
it++;
}
ans=min(ans,*it-p);
}
cout << ans << endl;
} |
#include<bits/stdc++.h>
using namespace std;
int a[2005],b[2005],c[2005];
int n,k,q,ans;
int main(){
scanf("%d%d%d",&n,&k,&q);
for (int i=1;i<=n;i++) scanf("%d",&a[i]);
ans=1e9+1;
for (int i=1;i<=n;i++){
int l=0;
int cnt=0;
for (int j=1;j<=n+1;j++)
if (a[j]<a[i]){
if (!l) continue;
int r=j-1;
for (int p=l;p<=r;p++)
b[p]=a[p];
sort(b+l,b+r+1);
for (int p=l;p+k-1<=r;p++)
c[++cnt]=b[p];
l=0;
}
else if (!l) l=j;
if (cnt<q) continue;
sort(c+1,c+cnt+1);
//printf("%d\n",c[q]);
ans=min(ans,c[q]-a[i]);
}
printf("%d\n",ans);
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, k, q;
cin >> n >> k >> q;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int ans = 2e9;
for (int least : a) {
vector<int> s;
vector<int> b;
for (int i = 0; i <= n; i++) {
if (i == n || a[i] < least) {
sort(b.begin(), b.end());
for (int j = 0; j <= (int) b.size() - k; j++) {
s.push_back(b[j]);
}
b.clear();
} else {
b.push_back(a[i]);
}
}
if ((int) s.size() < q) {
continue;
}
sort(s.begin(), s.end());
ans = min(ans, s[q - 1] - least);
}
cout << ans << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n,k,q; cin >> n >> k >> q;
vector<int> a(n);
for(int i=0;i<n;i++){
cin >> a[i];
}
n++;
a.push_back(-1);
int ans=INT_MAX;
for(int i=0;i<n-1;i++){
vector<int> tot,la;
for(int j=0;j<n;j++){
if(a[j]<a[i]){
sort(la.begin(),la.end());
for(int r=0;r<int(la.size())-k+1;r++){
tot.push_back(la[r]);
}
la.clear();
}
else{
la.push_back(a[j]);
}
}
sort(tot.begin(),tot.end());
if(tot.size()>=q)
ans=min(ans,tot[q-1]-tot[0]);
}
cout << ans << endl;
return 0;
} |
#include<iostream>
#include<cstdio>
using namespace std;
int main() {
int n,m,q,a[2005];
scanf("%d%d%d",&n,&m,&q);
for (register int i=1;i<=n;++i) {
scanf("%d",a+i);
}
int l=0,r=2000000000;
while (l<r) {
int mid=(l+r)>>1;
bool ok=0;
for (register int i=1;i<=n;++i) {
int p=a[i],k=0,tmp=0,cnt=0;
for (register int j=1;j<=n+1;++j) {
if (a[j]<p||j==n+1) {
tmp+=j-k-1<m?0:min(j-k-1-m+1,j-k-1-cnt);
k=j;
cnt=0;
}
else if (a[j]>p+mid) {
++cnt;
}
}
if (tmp>=q) {
ok=1;
break;
}
}
ok?r=mid:l=mid+1;
}
printf("%d",l);
return 0;
}
|
#include <iostream>
#include <algorithm>
using namespace std;
int n, k, q;
int a[1000006], b[1000006];
bool check(int l, int r){
int ans = 0, cnt = 0, cnt2 = 0;
for (int i = 1; i <= n; ++ i)
if (a[i] < l){
if (cnt >= k)
ans += min(cnt2, cnt - k + 1);
cnt = cnt2 = 0;
}
else{
++ cnt;
if (a[i] <= r)
++ cnt2;
}
if (cnt >= k)
ans += min(cnt2, cnt - k + 1);
return ans >= q;
}
int bs(int lower, int l, int r){
int ans = 2000000000;
while (l <= r){
int m = l + r >> 1;
if (check(lower, b[m])){
ans = b[m];
r = m - 1;
}
else
l = m + 1;
}
return ans;
}
int main(){
cin >> n >> k >> q;
for (int i = 1; i <= n; ++ i){
cin >> a[i];
b[i] = a[i];
}
sort(b + 1, b + 1 + n);
int ans = 2000000000;
for (int i = 1; i <= n; ++ i)
ans = min(ans, bs(b[i], i, n) - b[i]);
cout << ans << endl;
}
|
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
using namespace std;
const int MAXN=2000;
const int INF=(int)1e9+5;
int n,k,q,A[MAXN+5],ans=INF;
void SOLVE(int x)
{
vector<int> pri;
int i=0;
while(i<n)
{
vector<int> que;
while(A[i]<x && i<n) i++;
while(A[i]>=x && i<n) que.push_back(A[i++]);
if(que.size()>=k)
{
sort(que.begin(),que.end());
for(int j=0;j<(int)que.size()-k+1;j++)
pri.push_back(que[j]);
}
}
sort(pri.begin(),pri.end());
if((int)pri.size()>=q)
ans=min(ans,pri[q-1]-pri[0]);
}
int main()
{
scanf("%d%d%d",&n,&k,&q);
for(int i=0;i<n;i++)
scanf("%d",&A[i]);
for(int i=0;i<n;i++)
SOLVE(A[i]);
printf("%d\n",ans);
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int n,k,q;
pair<int,int> a[2022];
int b[2022],c[2022],lc,d[2022],ld;
bool f[2022];
int main(){
scanf("%d%d%d",&n,&k,&q);
for(int i=0; i<n; i++){
scanf("%d",&a[i].first);
a[i].second = i;
b[i] = a[i].first;
}
sort(a,a+n);
int res = 2000000000;
for(int i=0; i<n; i++){
memset(f,0,sizeof(f));
for(int j=0; j<i; j++)
f[a[j].second] = true;
ld = 0;
for(int j=0; j<=n; j++)if(j==n || f[j]){
sort(c,c+lc);
for(int t=0; t<=lc-k; t++){
d[ld++] = c[t];
}
lc = 0;
}else
c[lc++] = b[j];
sort(d,d+ld);
if(ld >= q)
res = min(res, d[q-1]-d[0]);
}
printf("%d\n",res);
return 0;
}
|
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
using namespace std;
typedef long long Int;
Int n, k, q;
Int a[2160];
Int res = 1LL << 40;
Int go(Int x){
int cnt = 0;
vector<int> nums;
vector<int> tmp;
for(int i = 0;i < n;i++){
if(a[i] < x)continue;
int from = i;
while(i < n && a[i] >= x)i++;
if(i - from > k-1){
cnt += i-from-k+1;
tmp.clear();
for(int j = from;j < i;j++)tmp.push_back(a[j]);
sort(tmp.begin(), tmp.end());
for(int j = 0;j < i - from - k + 1;j++){
nums.push_back(tmp[j]);
}
}
i--;
}
if(cnt < q)return 1LL<<40;
sort(nums.begin(), nums.end());
return nums[q-1] - x;
}
int main(){
cin >> n >> k >> q;
for(int i = 0;i < n;i++)cin >> a[i];
for(int i = 0;i < n;i++){
res = min(res, go(a[i]));
}
cout << res << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, k, q;
cin >> n >> k >> q;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int ans = 2e9;
for (int& bound : a) {
vector<int> t;
vector<int> s;
for (int i = 0; i <= n; i++) {
if (i == n || a[i] < bound) {
sort(t.begin(), t.end());
for (int i = 0; i <= (int) t.size() - k; i++) {
s.push_back(t[i]);
}
t.clear();
} else {
t.push_back(a[i]);
}
}
if ((int) s.size() < q) {
continue;
}
sort(s.begin(), s.end());
ans = min(ans, s[q - 1] - bound);
}
cout << ans << endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int n,k,q;
int a[2009],b[2009];
int main(){
cin >> n>>k>>q;
for(int i = 1; i <= n; i++){
cin >> a[i];
}
int ans = 1e9;
for(int i = 1; i <= n; i++){
int l = 0, x = a[i];
vector<int> VV;
for(int j = 1; j <= n+1; j++){
if(a[j] < x || j == n+1){
vector<int> V;
for(int i = l +1; i < j; i ++) {
V.push_back(a[i]);
}
l = j;
if(!V.size()) continue;
sort(V.begin(),V.end());
for(int i = 0; i < (int)V.size() - k + 1; i++)
VV.push_back(V[i]);
}
}
sort(VV.begin(), VV.end());
if(VV.size() < q) continue;
ans = min(ans , VV[q-1]-VV[0]);
}
cout<<ans<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll,ll> pll;
const ll mod=1e9+7;
//const ll mod=998244353;
const ll inf=1LL<<61;
const ll N=2e3+10;
vec a(N);
ll c[N];
ll n,k,q;
ll check(ll l, ll r) {
ll p=-1,s=0;
for(ll i=0;i<=n;i++) {
if(a[i]<c[l]) {
ll t=0;
for(ll j=p+1;j<i;j++) {
if(a[j]<=c[r]) t++;
}
s+=max(0LL,min(t,i-p-k));
p=i;
}
}
return s>=q;
}
int main() {
cin >> n >> k >> q;
for(ll i=0;i<n;i++) {
cin >> a[i];
c[i]=a[i];
}
sort(c,c+n);
ll ans=inf;
for(ll i=0,j=0;i<n;i++) {
while(j<n&&!check(i,j)) j++;
if(j<n) ans=min(ans,c[j]-c[i]);
}
cout << ans << endl;
} |
#define FILEIO(a) freopen(a".in","r",stdin);freopen(a".out","w",stdout);
#include <stdio.h>
#include <queue>
#include <algorithm>
#define N 10005
using namespace std;
int n,k,q,a[N],b[N],c[N];
inline int min(int a,int b){return a<b?a:b;}
int solve(int x) {
int i,j,ans=0,m=0,t,p;
for(i=0;i<n;++i) {
for(j=i;j<n&&a[j]>=x;++j);
if(j-i>=k) {
p=j-i-k;
for(t=0;i<j;) b[t++]=a[i++];
sort(b,b+t);
while(~p) c[m++]=b[p--];
}
}
if(m<q) return 1<<30;
sort(c,c+m);
return c[q-1]-x;
}
int main() {
// FILEIO("operation");
int i,ans=1<<30;
scanf("%d%d%d",&n,&k,&q);
for(i=0;i<n;++i) scanf("%d",a+i);
for(i=0;i<n;++i) ans=min(ans,solve(a[i]));
printf("%d",ans);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define N 2010
int n,K,Q,ans=2e9;
int a[N],b[N],c[N];
int main()
{
scanf("%d%d%d",&n,&K,&Q);
for (int i=1;i<=n;i++) scanf("%d",&a[i]);
for (int i=1;i<=n;i++) {
int tot=0;
for (int j=1,nex;j<=n;j=nex+1) {
nex=j; while (a[nex]>=a[i]) nex++;
if (nex-j>=K) {
for (int k=j;k<nex;k++) b[k]=a[k];
sort(b+j,b+nex);
for (int k=j;k<=nex-K;k++) c[++tot]=b[k];
}
}
sort(c+1,c+tot+1);
if (tot>=Q) ans=min(ans,c[Q]-a[i]);
}
printf("%d\n",ans);
return 0;
} |
#include<bits/stdc++.h>
#define to edge[i].v
#define mp make_pair
#define rint register int
#define debug(x) cerr<<#x<<"="<<x<<endl
#define fgx cerr<<"-------------"<<endl
#define N 1000000
#define pb push_back
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
int a[N]; vector<int> v,b;
int main()
{ int n,k,q,ans=1e9; cin>>n>>k>>q;
for(rint i=1;i<=n;i++) scanf("%d",&a[i]);
for(rint i=1;i<=n;i++)
{ b.clear(); int p=1;
while(p<=n)
{ if(a[p]<a[i]){p++;continue;}
v.clear();
while(a[p]>=a[i]&&p<=n) v.pb(a[p]),p++;
if(v.size()<k) continue;
sort(v.begin(),v.end());
for(rint j=0;j<=(int)v.size()-k;j++) b.pb(v[j]);
}
// debug(a[i]);debug(b.size());if(a[i]==1) debug(b[0]),debug(b[1]),debug(b[2]);
if(b.size()<q) continue;
sort(b.begin(),b.end()); ans=min(ans,b[q-1]-b[0]);
}
cout<<ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
int n, k, q, a[2005];
int main(){
scanf("%d%d%d", &n, &k, &q);
for(int i = 0; i < n; i++)
scanf("%d", &a[i]);
int res = INF;
for(int i = 0; i < n; i++){
//fix smallest = a[i]
vector <int> tmp, best;
for(int j = 0; j < n; j++){
if(a[j] >= a[i])
tmp.push_back(a[j]);
else{
if((int)tmp.size() >= k){
sort(tmp.begin(), tmp.end());
for(int ii = 0; ii < (int)tmp.size() - k + 1; ii++)
best.push_back(tmp[ii]);
}
tmp.clear();
}
}
if((int)tmp.size() >= k){
sort(tmp.begin(), tmp.end());
for(int ii = 0; ii < (int)tmp.size() - k + 1; ii++)
best.push_back(tmp[ii]);
}
tmp.clear();
sort(best.begin(), best.end());
if((int)best.size() >= q)
res = min(res, best[q - 1] - a[i]);
}
printf("%d\n", res);
}
|
#include<bits/stdc++.h>
#define rep(i,x,y) for (int i=(x);i<=(y);i++)
#define ll long long
#define inf 1000000001
using namespace std;
#define N 2005
int n,k,Q,a[N],mi,top,b[N],ans;
int main(){
scanf("%d%d%d",&n,&k,&Q);
rep (i,1,n) scanf("%d",&a[i]);
ans=inf;
rep (i,1,n){
mi=a[i];top=0;
int st=1,ed=0;
rep (j,1,n){
// cerr<<st<<' '<<ed<<'\n';
if (a[j]>=mi) ed++;
if (a[j]<mi||j==n){
// cerr<<st<<' '<<ed<<'\n';
if (ed-st+1>=k){
// cerr<<st<<' '<<ed<<'\n';
int last=top;
rep (l,st,ed) b[++top]=a[l];
sort(&b[last+1],&b[top+1]);
rep (x,1,k-1) top--;
}
st=j+1,ed=j;
}
}
// rep (j,1,top) cerr<<b[j]<<' ';cerr<<'\n';
if (top>=Q){
sort(&b[1],&b[top+1]);
int mx=b[Q];
ans=min(ans,mx-mi);
}
}
cout<<ans<<'\n';
return 0;
} |
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
#define N 2050
int n,a[N];
int K,Q,b[N],c[N],ans=1<<30,tot;
void add(int l,int r) {
int i;
for(i=l;i<=r;i++) b[i]=a[i];
sort(b+l,b+r+1);
for(i=l;i<=r-K+1;i++) c[++tot]=b[i];
}
void solve(int x) {
int i,lst=1; tot=0;
for(i=1;i<=n;i++) {
if(a[i]<x) {
if(lst<=i-1) add(lst,i-1);
lst=i+1;
}
}
if(lst<=n) add(lst,n);
sort(c+1,c+tot+1);
if(tot<Q) return ;
ans=min(ans,c[Q]-c[1]);
}
int main() {
int i;
scanf("%d%d%d",&n,&K,&Q);
for(i=1;i<=n;i++) scanf("%d",&a[i]);
for(i=1;i<=n;i++) {
solve(a[i]);
}
printf("%d\n",ans);
} |
// C - Shopping Street
#include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
#define rp(i,s,e) for(int i=(int)(s);i<(int)(e);++i)
int main(){
int n; cin>>n;
vvi F(n, vi(10));
rp(i, 0, n) rp(j, 0, 10) cin>>F[i][j];
vvi P(n, vi(10+1));
rp(i, 0, n) rp(j, 0, 10+1) cin>>P[i][j];
int64_t ans = -10000000*100;
rp(i, 1, 1<<10){
int64_t s = 0;
rp(j, 0, n){
int cj = 0;
rp(k, 0, 10) if(i>>k & 1 && F[j][k]) cj++;
s += P[j][cj];
}
ans = max(ans, s);
}
cout<< ans <<endl;
}
|
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
cin.tie(0)->sync_with_stdio(false);
int N; cin >> N;
vector<vector<int> > F(N, vector<int> (10));
REP(i, N) REP(j, 10) cin >> F[i][j];
vector<vector<int> > P(N, vector<int> (11));
REP(i, N) REP(j, 11) cin >> P[i][j];
ll res = -1e18;
for (int bit = 1; bit < 1 << 10; bit++) {
ll sum = 0;
REP(i, N) {
int cnt = 0;
REP(j, 10) {
if (((bit >> j) & 1) && F[i][j])
cnt++;
}
sum += P[i][cnt];
}
res = max(res, sum);
}
cout << res << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0;i<N;i++)
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef long long ll;
int main(){
int N; cin>>N;
vvi F(N,vi(10)),P(N,vi(11));
rep(i,N) rep(j,10) cin>>F[i][j];
rep(i,N) rep(j,11) cin>>P[i][j];
ll ans = -1e9;
for(int i=1;i<(1<<10);i++){
ll bene = 0;
rep(j,N){
int cnt = 0;
rep(k,10) if(i & (1<<k) && F[j][k]) cnt++;
bene += P[j][cnt];
}
ans = max(ans,bene);
}
cout<<ans<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i,f,n) for(int i=f;i<(n);i++)
int n,t,ans=-1000000001,f[101],p[101][11];
int main() {
int n;
cin>>n;
REP(i,0,n)
REP(j,0,10) {
cin>>t;
f[i]|=t<<j;
}
REP(i,0,n) REP(j,0,11) cin>>p[i][j];
REP(i,1,1<<10) {
t=0;
REP(j,0,n) t+=p[j][__builtin_popcount(f[j]&i)];
if(ans<t) ans=t;
}
cout<<ans<<endl;
return 0;
}
|
#include <iostream>
#include <algorithm>
#define int long long
#define rep(i, n) for(i = 0; i < n; i++)
using namespace std;
int n;
int f[100][10];
int p[100][11];
signed main() {
int i, j, k;
cin >> n;
rep(i, n) rep(j, 10) cin >> f[i][j];
rep(i, n) rep(j, 11) cin >> p[i][j];
int ans = -1e+15;
rep(i, (1 << 10)) {
if (i == 0) continue;
int sumP = 0;
rep(j, n) {
int cnt = 0;
rep(k, 10) {
if ((i >> k) % 2 == 1 && f[j][k] == 1) {
cnt++;
}
}
sumP += p[j][cnt];
}
ans = max(ans, sumP);
}
cout << ans << endl;
return 0;
} |
#include<cstdio>
int N;
int opened[100][14];
int profit[100][15];
int main() {
scanf("%d", &N);
for (int i=0;i<N;i++)
for (int j=0;j<10;j++) scanf("%d", &opened[i][j]);
for (int i=0;i<N;i++)
for (int j=0;j<11;j++) scanf("%d", &profit[i][j]);
int res=-(1<<30);
for (int b=1;b<(1<<10);b++) {
int maxi=0;
for (int i=0;i<N;i++) {
int c=0;
for (int j=0;j<10;j++) if((b>>j&1)&&opened[i][j]) c++;
maxi+=profit[i][c];
}
if (maxi>res) res=maxi;
}
printf("%d\n", res);
} |
#include <bits/stdc++.h>
#include<stdlib.h>
using namespace std;
const int N=2e3+5;
int n,f[N][12],p[N][12];
int main()
{
cin>>n;
for(int i=1;i<=n;i++)
for(int j=0;j<10;j++)
cin>>f[i][j];
for(int i=1;i<=n;i++)
for(int j=0;j<=10;j++)
cin>>p[i][j];
int ans=-1e9;
for(int i=1;i<(1<<10);i++)
{
int res=0;
for(int j=1;j<=n;j++)
{
int cnt=0;
for(int k=0;k<10;k++)
{
if(f[j][k]==0)
continue;
if(i&(1<<k))
cnt++;
}
res+=p[j][cnt];
}
ans=max(ans,res);
}
cout<<ans<<endl;
return 0;
} |
#include<bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
using namespace std;
typedef long long ll;
const ll INF=1e9;
int main(){
ll n;
cin>>n;
vector<vector<ll>> f(n,vector<ll>(10)),p(n,vector<ll>(11));
rep(i,n)rep(j,10) cin>>f[i][j];
rep(i,n)rep(j,11) cin>>p[i][j];
ll mx=-INF;
for(ll t=1;t<(1<<10);t++){
ll sum=0;
rep(i,n){
ll cnt=0;
rep(j,10){
if((t>>j)&f[i][j]) cnt++;
}
sum+=p[i][cnt];
}
mx=max(mx,sum);
}
cout<<mx<<endl;
return 0;
} |
#include <cstdio>
using namespace std;
int N;
int F [100][14];
int P [100][15];
int main ()
{
scanf ("%d",&N);
for ( int i=0;i<N;i++)
for ( int j =0;j<10;j++)
scanf ("%d",&F[i][j]);
for ( int i =0; i <N;i++)
for ( int j =0; j <11; j ++)
scanf ("%d",&P[i][j]);
int res = -(1<<30);
for ( int b =1; b <(1<<10); b ++)
{
int cc =0;
for ( int i =0; i <N;i ++)
{
int c =0;
for ( int j =0; j <10; j ++)
if ((b >>j &1)&& F[i ][ j ])
c ++;
cc += P[i ][ c ];
}
if ( res < cc )
res = cc ;
}
printf ("%d\n", res );
} |
#include <iostream>
using namespace std;
int main(void){
// Your code here!
int N;
scanf("%d",&N);
int F[N];
for(int i=0;i<N;i++)F[i]=0;
for(int i=0;i<N;i++)for(int j=0;j<10;j++){int kari;scanf("%d",&kari);F[i]*=2;F[i]+=kari;}
int P[N][11];
for(int i=0;i<N;i++)for(int j=0;j<11;j++)scanf("%d",&P[i][j]);
int ans=-1000000007;
for(int i=1;i<(1<<10);i++){
int karians=0;
for(int j=0;j<N;j++){
karians+=P[j][__builtin_popcount(i&F[j])];
}
if(ans<karians)ans=karians;
}
printf("%d",ans);
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
bitset<10> f[n];
int p[n][10];
rep(i, n) {
string s;
char c;
rep(j, 10) cin >> c, s += c;
f[i] = bitset<10>(s);
}
rep(i, n) rep(j, 11) cin >> p[i][j];
ll ans = -1e9;
for (int bit = 1; bit < (1 << 10); bit++) {
bitset<10> b(bit);
ll now = 0;
rep(i, n) {
now += p[i][(b & f[i]).count()];
}
ans = max(ans, now);
}
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main(){
int N;
int F[100][10];
int P[100][10];
cin >> N;
for(int i = 0; i < N; i++){
for(int j = 0; j < 10; j++){
cin >> F[i][j];
}
}
for(int i = 0; i < N; i++){
for(int j = 0; j <= 10; j++){
cin >> P[i][j];
}
}
int ans = -(1 << 30);
for(int i = 1; i < (1 << 10); i++){
int sum = 0;
for(int j = 0; j < N; j++){
int num = 0;
for(int k = 0; k < 10; k++){
if(i & (1 << k) && F[j][k]) num++;
}
sum += P[j][num];
}
if(sum > ans){
ans = sum;
}
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <cstdio>
using namespace std;
int n, a, s, d, mx=-1e9, f[105], p[105][15];
int main() {
int i, j, t;
cin>>n;
for(i=1; i<=n; i++) for(j=0; j<10; j++) cin>>a, f[i] = f[i]<<1|a;
for(i=1; i<=n; i++) for(j=0; j<=10; j++) cin>>p[i][j];
for(j=1; j<1024; j++) {
for(i=1, s=0; i<=n; i++) {
t = j & f[i];
for(d=0; t; t>>=1) d += t&1;
s += p[i][d];
}
mx = max(mx, s);
}
cout<<mx;
return 0;
} |
#include<cstdio>
int n;
int f[100][14];
int p[100][15];
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++)for (int j = 0; j < 10; j++)scanf("%d", &f[i][j]);
for (int i = 0; i < n; i++)for (int j = 0; j < 11; j++) scanf("%d", &p[i][j]);
int res = -(1 << 30);
for (int b = 1; b < (1 << 10); b++) {
int cc = 0;
for (int i = 0; i < n; i++) {
int c = 0;
for (int j = 0; j < 10; j++)if ((b >> j & 1) && f[i][j])c++;
cc += p[i][c];
}
if (res < cc)res = cc;
}
printf("%d\n", res);
return 0;
} |
#include <cstdio>
int N;
int F[100][14];
int P[100][15];
int main(){
scanf("%d", &N);
for(int i=0; i<N; i++){
for(int j=0; j<10; j++) scanf("%d", &F[i][j]);
}
for(int i=0; i<N; i++)for(int j=0; j<11; j++)scanf("%d", &P[i][j]);
int res = -(1<<30);
for(int b = 1; b<(1<<10); b++){
int cc = 0;
for(int i = 0; i<N; i++){
int c = 0;
for(int j=0; j<10; j++) if((b>>j&1) && F[i][j]) c++;
cc += P[i][c];
}
if(res < cc) res = cc;
}
printf("%d\n", res);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
const int N=2e3+5;
int n,f[N][12],p[N][12];
int main()
{
cin>>n;
for(int i=1;i<=n;i++)
for(int j=0;j<10;j++)
cin>>f[i][j];
for(int i=1;i<=n;i++)
for(int j=0;j<=10;j++)
cin>>p[i][j];
//O(2^10 * n*10)
int ans=-1e9;
for(int i=1;i<(1<<10);i++)
{
int res=0;
for(int j=1;j<=n;j++)
{
int cnt=0;
for(int k=0;k<10;k++)
{
if(f[j][k]==0)
continue;
if(i&(1<<k))
cnt++;
}
res+=p[j][cnt];
}
ans=max(ans,res);
}
cout<<ans<<endl;
return 0;
} |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define INF (1<<30)
int main(void){
int n,i,j,f[110],p[110][11],k,cnt,tmp,ans=-INF;
fill(f,f+110,0);
cin >> n;
for(i=0; i<n; i++){
for(j=0; j<10; j++){
f[i] *= 2;
cin >> k;
f[i] += k;
}
}
for(i=0; i<n; i++){
for(j=0; j<11; j++){
cin >> p[i][j];
}
}
for(i=1; i<1024; i++){
tmp = 0;
for(j=0; j<n; j++){
cnt = 0;
for(k=0; k<10; k++){
if( (f[j]&(1<<k))>0 && (i&(1<<k))>0 ){
cnt++;
}
}
tmp += p[j][cnt];
}
ans = max(tmp,ans);
}
cout << ans << endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,t;
cin>>n;
t=10;
vector<vector<int>> f(n,vector<int>(t));
for(int i=0;i<n;i++)
for(int j=0;j<t;j++)
cin>>f.at(i).at(j);
vector<vector<int>> p(n,vector<int>(t+1));
for(int i=0;i<n;i++)
for(int j=0;j<=t;j++)
cin>>p.at(i).at(j);
int m;
for(int b=1;b<(1<<t);b++){
vector<int> c(n,0);
int x=b;
for(int i=0;i<t;i++){
for(int j=0;j<n;j++)
c.at(j)+=f.at(j).at(i)*x%2;
x/=2;
}
int s=0;
for(int i=0;i<n;i++)
s+=p.at(i).at(c.at(i));
m=(b==1?s:max(m,s));
}
cout<<m<<endl;
} |
#include <iostream>
using namespace std;
#define llong long long
int main(){
int N; cin >> N;
int A[N][10], B[N][11], C[N];
for (int i=0; i<N; i++){
for (int j=0; j<10; j++){
cin >> A[i][j];
}
}
for (int i=0; i<N; i++){
for (int j=0; j<=10; j++){
cin >> B[i][j];
}
}
llong ans = -(1<<30);
for (int bit = 1; bit < (1<<10); bit++){
llong x = 0;
for (int i=0; i<N; i++){
int cnt=0;
for (int j=0; j<10; j++){
if((bit>>j&1) && A[i][j]) cnt++;
}
x += B[i][cnt];
}
if(ans<x) ans = x;
}
cout << ans << endl;
return 0;
} |
#include<iostream>
#include<bitset>
using namespace std;typedef bitset<12> bit;const int N=107;
int n,i,j,m,mp[N][12],x,ans=-2e9,res;bit s[N],tmp;
int main(){
ios::sync_with_stdio(false);cin.tie(0);
for(cin>>n,i=1;i<=n;++i)for(j=0;j<10;++j)cin>>x,s[i][j]=x;
for(i=1;i<=n;++i)for(j=0;j<=10;++j)cin>>mp[i][j];
for(m=(1<<10)-1,i=1;i<=m;++i){
tmp=bit(i);
for(res=0,j=1;j<=n;++j)res+=mp[j][(tmp&s[j]).count()];
ans=max(ans,res);
}
cout<<ans<<endl;
return 0;
} |
#include<iostream>
#include<cstdio>
using namespace std;
int n;
bool f[105][11];
int p[105][12];
int main(){
cin >> n;
for(int i = 0; i < n; ++i){
for(int j = 0; j < 10; ++j){
cin >> f[i][j];
}
}
for(int i = 0; i < n; ++i){
for(int j = 0; j < 11; ++j){
cin >> p[i][j];
}
}
int res = -(1 << 30);
for ( int b =1; b <(1 <<10); b ++){
int cc = 0;
for(int i = 0; i < n; ++i){
int c = 0;
for ( int j =0; j <10; ++j){
if (( b >> j&1)&& f[i][j]) c ++;
}
cc += p[i][c];
}
if(res < cc) res = cc;
}
cout << res << endl;
} |
#include <iostream>
#include <algorithm>
using namespace std;
int n;
int f[100][10],joi[10];
int p[100][11];
int ans=-1000000000;
int main(){
cin>>n;
for(int i=0;i<n;i++)
for(int j=0;j<10;j++)
cin>>f[i][j];
for(int i=0;i<n;i++)
for(int j=0;j<=10;j++)
cin>>p[i][j];
for(int i=1;i<1024;i++){
int tmp=0;
for(int j=0;j<n;j++){
int cnt=0;
for(int k=0;k<10;k++) if(i>>k&1&&f[j][k]) cnt++;
tmp+=p[j][cnt];
}
ans=max(ans,tmp);
}
cout<<ans;
} |
#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < (int)(n); i++)
#define FOR(i, k, n) for(int i = (k); i < (int)(n); i++)
using namespace std;
using ll = long long;
int N, F[101][11], P[101][11];
int main(){
cin >> N;
REP(i, N) REP(j, 10) cin >> F[i][j];
REP(i, N) REP(j, 11) cin >> P[i][j];
int ans = (-1) * INT_MAX/2;
for(int msk = 1; msk < 1 << 10; msk++){
int sm = 0;
REP(i, N){
int c = 0;
REP(j, 10) if(msk & (1 << j)) if(F[i][j]) c++;
sm += P[i][c];
}
ans = max(ans, sm);
}
cout << ans << endl;
return 0;
} |
#include<iostream>
#include<algorithm>
#include<vector>
#include <string>
#include<math.h>
typedef long long int ll;
using namespace std;
int f[110][10];
int p[110][11];
int main(){
int n; cin >>n;
for(int i=0;i<n;i++){
for(int j=0;j<10;j++){
cin >> f[i][j];
}
}
for(int i=0;i<n;i++){
for(int j=0;j<11;j++){
cin >> p[i][j];
}
}
ll ans=-1e9;
for(int i=1;i<(1<<10);i++){
ll sum=0;
for(int j=0;j<n;j++){
int cnt=0;
for(int k=0;k<10;k++){
if((i>>k)&1 &&f[j][k]==1){
cnt++;
}
}
sum+=p[j][cnt];
}
ans=max(ans,sum);
}
cout << ans << endl;
} |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1001001001;
int main(){
int n;
cin >> n;
int f[n][10];
for(int i=0; i<n; ++i) for(int j=0; j<10; ++j){
cin >> f[i][j];
}
int p[n][11];
for(int i=0; i<n; ++i) for(int j=0; j<11; ++j){
cin >> p[i][j];
}
int ans = -INF;
for(int i=1; i<(1<<10); ++i){
int score = 0;
for(int j=0; j<n; ++j){
int cnt = 0;
for(int k=0; k<10; ++k){
if((i>>k & 1) && f[j][k]) ++cnt;
}
score += p[j][cnt];
}
ans = max(score, ans);
}
cout << ans << endl;
} |
#include<bits/stdc++.h>
using namespace std;
int F[101][11],P[101][11];
int main(){
int N;
cin>>N;
for(int i=0;i<N;i++){
for(int j=0;j<5;j++){
int f,g;
cin>>f>>g;
F[i][2*j]=f;
F[i][2*j+1]=g;
}
}
for(int i=0;i<N;i++){
for(int j=0;j<11;j++){
int p;
cin>>p;
P[i][j]=p;
}
}
long ans=LONG_MIN;
for(int i=1;i<1<<10;i++){
long cost=0;
for(int k=0;k<N;k++){
long cnt=0;
for(int j=0;j<10;j++)if((i&1<<j)&&F[k][j])cnt++;
cost+=P[k][cnt];
}
ans=max(ans,cost);
}
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(int)(n); i++)
using namespace std;
typedef long long LL;
typedef pair<int,int> P;
const int INF=2e9;
int main(){
int N;
cin >> N;
bool F[110][5][2];
rep(i,N){
rep(j,5){
rep(k,2) cin >> F[i][j][k];
}
}
int P[110][15];
rep(i,N){
rep(j,11) cin >> P[i][j];
}
int ans=-1*INF;
for(int bit=1; bit<(1<<10); bit++){
int pro=0;
rep(i,N){
int c=0;
rep(j,10){
if(!(bit&(1<<j))) continue;
int day=j%5, time=j%2;
if(F[i][day][time]) c++;
}
pro+=P[i][c];
}
ans=max(ans,pro);
}
cout << ans << endl;
return 0;
} |
#include<iostream>
using namespace std;
int main(){
int n,i,j,f[100][10],p[100][11],a[100]={0},l,k,max=-2000000000,s=0;
cin>>n;
for(i=0;i<n;i++){
for(j=0;j<10;j++){
cin>>f[i][j];
}}
for(i=0;i<n;i++){
for(j=0;j<=10;j++){
cin>>p[i][j];
}}
for(k=1;k<1024;k++){
j=k;
for(i=0;i<10;i++){
if(j%2==1){for(l=0;l<n;l++){if(f[l][i]==1)a[l]++;}}
j=j>>1;
}
for(i=0;i<n;i++){s+=p[i][a[i]];a[i]=0;}
if(s>max)max=s;
s=0;
}
cout<<max<<endl;
return 0;
}
|
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int N;
int F[101][15];
int P[101][14];
ll one( ll b){
ll sum=0;
for (int i=0;i<N;i++){
ll c = 0;
for(int j=0;j<10;j++)if((b>>j&1)&&F[i][j])c++;
sum+=P[i][c];
}
return sum;
}
int main(){
cin >> N;
for(int i=0;i<N;i++){
for(int j=0;j<10;j++){
cin >> F[i][j];
}
}
for(int i=0;i<N;i++){
for(int j=0;j<11;j++){
cin >> P[i][j];
}
}
ll ans=-2000000000;
for(int b=1;b<(1 << 10);b++){
ans = max(ans,one(b));
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
vector<bitset<10>> F(N);
for(bitset<10> &i:F)
for(int j=0;j<10;j++){
int k;
cin>>k;
i[j]=k;
}
vector<vector<int>> P(N,vector<int>(11));
for(vector<int> &i:P)
for(int &j:i)
cin>>j;
int k=-1000000000;
for(int tmp=1;tmp<(1<<10);tmp++){
bitset<10> S(tmp);
int j=0;
for(int i=0;i<N;i++)
j+=P[i][(S&F[i]).count()];
k=max(k,j);
}
cout<<k<<endl;
} |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int i, j, k, n, m, x, y, maxm=-1000000000;
cin >> n;
int a[n][10], b[n][11], p[10];
for(i=0; i<n; i+=1)
for(j=0; j<10; j+=1)
cin >> a[i][j];
for(i=0; i<n; i+=1)
for(j=0; j<11; j+=1)
cin >> b[i][j];
m=pow(2, 10);
memset(p, 0, sizeof(p));
for(i=1; i<m; i+=1)
{
x=i;
y=0;
while(x>0)
{
p[y]=x%2;
y+=1;
x/=2;
}
int temp=0;
for(j=0; j<n; j+=1)
{
int count=0;
for(k=0; k<10; k+=1)
if((p[k]==1) && (a[j][k]==1))
count+=1;
temp+=b[j][count];
}
maxm=max(maxm, temp);
}
cout << maxm << endl;
} |
#include<bits/stdc++.h>
using namespace std;
int f[110][15],p[110][15];
int sum=-INT_MAX;
int n;
void dfs(string s)
{
if(s.size()==10)
{
if(s.find('1')==string::npos)
return;
int cnt=0;
for(int i=0;i<n;i++)
{
int ans=0;
for(int j=0;j<10;j++)
{
if(f[i][j] && s[j]=='1')
{
ans++;
}
}
cnt+=p[i][ans];
}
sum=max(cnt,sum);
return;
}
dfs(s+'0');
dfs(s+'1');
}
int main()
{
cin>>n;
for(int i=0;i<n;i++)
{
for(int j=0;j<10;j++)
{
cin>>f[i][j];
}
}
for(int i=0;i<n;i++)
{
for(int j=0;j<11;j++)
{
cin>>p[i][j];
}
}
dfs("");
cout<<sum<<'\n';
return 0;
} |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n);i++)
#define ll long long
using namespace std;
int main(){
int n;
int f[100][14];
int p[100][15];
cin>>n;
rep(i,n){
rep(j,10){
cin>>f[i][j];
}
}
rep(i,n){
rep(j,11){
cin>>p[i][j];
}
}
int ans = -1e9;
rep(bit,(1<<10)){
if(bit==0){
continue;
}
int sum=0;
rep(i,n){
int c=0;
rep(j,10){
if(bit&(1<<j)){
if(f[i][j]){
c++;
}
}
}
sum+=p[i][c];
}
ans=max(ans,sum);
}
cout<<ans<<endl;
} |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
int N, F[101][11], P[101][11];
#define INF INT_MAX/2
int main(){
cin >> N;
rep(i, 0, N) rep(j, 0, 10) cin >> F[i][j];
rep(i, 0, N) rep(j, 0, 11) cin >> P[i][j];
int ans = -INF;
rep(msk, 1, 1 << 10) {
int sm = 0;
rep(i, 0, N) {
int c = 0;
rep(j, 0, 10) if (msk & (1 << j)) if (F[i][j]) c++;
sm += P[i][c];
}
ans = max(ans, sm);
}
cout << ans << endl;
} |
#include <iostream>
using namespace std;
int main() {
int n;
bool f[100][10];
int p[100][11];
int res = -(1 << 30);
cin >> n;
for (int i = 0; i < n * 10;i++) {
cin >> f[0][i];
}
for (int i = 0; i < n * 11;i++) {
cin >> p[0][i];
}
for (int b = 1; b < (1 << 10);b++) {
int cc = 0;
for (int i = 0; i < n;i++) {
int c = 0;
for (int j = 0; j <10; j++) if ((b >> j & 1) && f[i][j]) c++;
cc += p[i][c];
}
if (res < cc) {
res = cc;
}
}
cout << res;
} |
#include <iostream>
using namespace std;
int main() {
int N;
int F[100][10];
int P[100][11];
cin >> N;
for(int i=0; i<N; ++i) {
for(int j=0; j<10; ++j) {
cin >> F[i][j];
}
}
for(int i=0; i<N; ++i) {
for(int j=0; j<11; ++j) {
cin >> P[i][j];
}
}
long long ans = -(1LL << 60);
for(int s=1; s<(1<<10); ++s) {
int C[100] = {0};
for(int i=0; i<N; ++i) {
for(int j=0; j<10; ++j) {
if((s >> j) & F[i][j]) ++C[i];
}
}
long long tmp = 0;
for(int i=0; i<N; ++i) {
tmp += P[i][C[i]];
}
ans = max(ans,tmp);
}
cout << ans << endl;
} |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
const int INF=1e9;
int main(){
int n,f[100][10],p[100][11];
cin>>n;
rep(i,n) rep(j,10) cin>>f[i][j];
rep(i,n) rep(j,11) cin>>p[i][j];
int ans=-INF;
for(int S=1;S<1024;S++){
int sum=0;
rep(i,n){
int cnt=0;
rep(j,10) if((S>>j&1) && f[i][j]==1) cnt++;
sum+=p[i][cnt];
}
ans=max(ans,sum);
}
cout<<ans<<endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main(){
int i,n;
scanf("%d",&n);
int f[n+1][11];
int p[n+1][11];
for(i=0;i<n;i++){
for(int j=0;j<10;j++){
scanf(" %d",&f[i][j]);
}
}
for(i=0;i<n;i++){
for(int j=0;j<=10;j++){
scanf(" %d",&p[i][j]);
}
}
int res=-(1<<30);
for(i=1;i<(1<<10);i++){
int tmp=0;
for(int j=0;j<n;j++){
int c=0;
for(int k=0;k<10;k++){
if((i>>k&1)&&f[j][k]) c++;
}
tmp+=p[j][c];
}
if(res<tmp) res=tmp;
}
printf("%d",res);
return 0;
}
|
#include<bits/stdc++.h>
#define REP(i,n) for(int i=0;i<(n);i++)
#define ALL(v) (v).begin(),(v).end()
#define int long long
using namespace std;
typedef vector<int> vint;
typedef pair<int,int> pint;
int F[110];
int P[110][20];
signed main()
{
int N; cin>>N;
REP(i,N) REP(j,10){
int t; cin>>t;
F[i]|=t<<j;
}
REP(i,N) REP(j,11){
cin>>P[i][j];
}
int ans=-1e18;
for(int S=1;S<(1<<10);S++){
int sum=0;
REP(i,N){
int c=__builtin_popcount(S&F[i]);
sum+=P[i][c];
}
ans=max(ans,sum);
}
cout<<ans<<endl;
}
|
#include <iostream>
using namespace std;
int main() {
int F[100][10], P[100][11], p[100] = { 0 }, N;
long long int sum = 0, max = 0;
cin >> N;
for (int i = 0; i<N; i++)for (int j = 0; j<10; j++) cin >> F[i][j];
for (int i = 0; i<N; i++)for (int j = 0; j<11; j++) cin >> P[i][j];
for (int i = 1; i<1024; i++) {
for (int j = 0; j<N; j++)p[j] = 0;
for (int j = 0; j<11; j++)
if ((i>>j)%2)
for (int k = 0; k<N; k++)p[k] += F[k][j];
sum = 0;
for (int j = 0; j < N; j++) sum += P[j][p[j]];
if (i == 1 || sum > max)max = sum;
}
cout << max << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,a) for ( int i=0; i<int(a); i++ )
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<vector<int>> F(n, vector<int>(10));
vector<vector<int>> P(n, vector<int>(11));
rep(i,n) rep(j,10) cin >> F[i][j];
rep(i,n) rep(j,11) cin >> P[i][j];
ll mx=-1e18;
for ( int mask=1; mask<(1<<10); mask++ ) {
ll res=0;
for ( int i=0; i<n; i++ ) {
int c=0;
for ( int j=0; j<10; j++ ) {
if ( (mask>>j&1)&&F[i][j] ) c++;
}
res+=P[i][c];
}
mx=max(mx,res);
}
cout << mx << '\n';
return 0;
} |
#include <bits/stdc++.h>
#define int long long
using namespace std;
int n,f[105][15],p[105][15],cnt,ans=-(1<<30),c;
signed main(){
cin>>n;
for(int i=0;i<n;i++){
for(int j=0;j<10;j++)cin>>f[i][j];
}
for(int i=0;i<n;i++){
for(int j=0;j<11;j++)cin>>p[i][j];
}
for(int i=1;i<(1<<10);i++){
cnt=0;
for(int j=0;j<n;j++){
c=0;
for(int k=0;k<10;k++){
if((i>>k&1)&&f[j][k])c++;
}
cnt+=p[j][c];
}
ans=max(ans,cnt);
}
cout<<ans<<endl;
} |
#include <iostream>
#include <cmath>
using namespace std;
int main() {
int N; cin >> N;
int F[N][10]; for (int i=0; i<N; i++) for (int j=0; j<10; j++) cin >> F[i][j];
int P[N][11]; for (int i=0; i<N; i++) for (int j=0; j<11; j++) cin >> P[i][j];
int result = -1 * pow(2,31);
for (int bit=1; bit<(1<<10); bit++) {
int sum = 0;
for (int i=0; i<N; i++) {
int x = 0;
for (int j=0; j<10; j++) { if ( bit & (1<<j) && F[i][j] == 1 ) x += 1; }
sum += P[i][x];
}
if (result<sum) result = sum;
}
cout << result << endl;
return 0;
} |
#include <iostream>
#include <algorithm>
using namespace std;
int N;
int B[100];
int C[100][11];
int main() {
cin >> N;
for(int i = 0; i < N; ++i) {
for(int k = 0; k < 10; ++k) {
int z;
cin >> z;
B[i] += (z << k);
}
}
for(int i = 0; i < N; ++i) {
for(int k = 0; k < 11; ++k) {
int z;
cin >> z;
C[i][k] = z;
}
}
int mx = -1000000009;
for(int s = 1; s < 1024; ++s) {
int sum = 0;
for(int i = 0; i < N; ++i) {
sum += C[i][__builtin_popcount(s & B[i])];
}
mx = max(mx, sum);
}
cout << mx << endl;
return 0;
}
|
#include <iostream>
#include <cstdio>
using namespace std;
int n, s, s2, mx = -2e9, a[105][15], b[105][15];
int main()
{
int i, j, k, w;
cin >> n;
for (i = 0; i < n; i++) {
for (j =0; j < 10; j++) {
scanf ("%d", &a[i][j]);
}
}
for (i = 0; i < n; i++) {
for (j = 0; j <= 10; j++) {
scanf ("%d", &b[i][j]);
}
}
for (i = 1; i < 1024; i++) {
s = 0;
for (j = 0; j < n; j++) {
w = i;
s2 = 0;
for (k =9; k >= 0; k--) {
if (w % 2 == a[j][k] && w % 2 == 1) s2++;
w /= 2;
}
s += b[j][s2];
}
mx = max(mx, s);
}
cout << mx;
return 0;
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.