QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #128143 | #6632. Minimize Median | yy_zq | Compile Error | / | / | C++14 | 1.5kb | 2023-07-20 16:40:34 | 2023-07-20 16:40:38 |
Judging History
你现在查看的是最新测评结果
- [2023-08-10 23:21:45]
- System Update: QOJ starts to keep a history of the judgings of all the submissions.
- [2023-07-20 16:40:38]
- 评测
- 测评结果：Compile Error
- 用时：0ms
- 内存：0kb
- [2023-07-20 16:40:34]
- 提交
answer
#include<bits/stdc++.h>
using namespace std;
#define FOR(i,j,k) for(int i=j;i<=k;++i)
#define For(i,j,k) for(int i=j;i>=k;--i)
#define mid ((l+r)>>1)
const int MAX = 1e6 +111;
int cost[MAX],g[MAX],h[MAX];
int a[MAX];
int ok(int M,int n,int k){
int md = (n+1)>>1;
int div = 1;
FOR(i,1,md){
if(a[i]>M){
while((a[i]/div)>M) ++div;
k-=h[div];
}
}
return k>=0;
}
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
// freopen("1.in","r",stdin);
int t;
cin>>t;
int mx = 1e6;
int yss = 0;
int g = 0;
if(t>=100000) yss =1;
while(t--){
int n,m,k;
cin>>n>>m>>k;
++g;
// if(yss)
// if(t>=99900){
// cout<<n<<' '<<m<<' '<<k<<' '<<endl;
// }
// else break;
FOR(i,1,n) cin>>a[i];
FOR(i,1,m) cin>>cost[i],g[i] = cost[i];
sort(a+1,a+1+n);
FOR(i,1,m){
FOR(j,1,i){
if(i*j>m) break;
g[i*j] = min(g[i*j],g[i]+g[j]);
}
}
if(g==31){
cout<<n<<' '<<m<<' '<<k<<endl;
FOR(i,1,n) cout<<a[i]<<' ';cout<<endl;
FOR(i,j,m) cout<<cost[i]<<' ';cout<<endl;
break;
}
int pos = m;
int cst_min = g[m];
FOR(i,1,m){
while(i*(pos-1)>=m) --pos,cst_min = min(cst_min,g[pos]);
g[m] = min(g[m],g[i]+cst_min);
}
h[m] = g[m];
For(i,m-1,1) h[i] = min(g[i],h[i+1]);
int l = 0, r = m;
while(l<r){
if(ok(mid,n,k)) r = mid;
else l = mid+1;
}
FOR(i,0,m) h[i]=g[i]=cost[i]=0;
if(!yss) cout<<l<<endl;
}
return 0;
}
/*
3
3 5 0
2 5 2
3 2 4 6 13
3 5 3
2 5 3
3 2 4 6 13
3 5 6
2 5 2
3 2 4 6 13
*/
Details
answer.code: In function ‘int main()’:
answer.code:41:42: error: invalid types ‘int[int]’ for array subscript
41 | FOR(i,1,m) cin>>cost[i],g[i] = cost[i];
| ^
answer.code:46:34: error: invalid types ‘int[int]’ for array subscript
46 | g[i*j] = min(g[i*j],g[i]+g[j]);
| ^
answer.code:46:47: error: invalid types ‘int[int]’ for array subscript
46 | g[i*j] = min(g[i*j],g[i]+g[j]);
| ^
answer.code:46:54: error: invalid types ‘int[int]’ for array subscript
46 | g[i*j] = min(g[i*j],g[i]+g[j]);
| ^
answer.code:46:59: error: invalid types ‘int[int]’ for array subscript
46 | g[i*j] = min(g[i*j],g[i]+g[j]);
| ^
answer.code:52:31: error: ‘j’ was not declared in this scope
52 | FOR(i,j,m) cout<<cost[i]<<' ';cout<<endl;
| ^
answer.code:3:30: note: in definition of macro ‘FOR’
3 | #define FOR(i,j,k) for(int i=j;i<=k;++i)
| ^
answer.code:56:32: error: invalid types ‘int[int]’ for array subscript
56 | int cst_min = g[m];
| ^
answer.code:58:74: error: invalid types ‘int[int]’ for array subscript
58 | while(i*(pos-1)>=m) --pos,cst_min = min(cst_min,g[pos]);
| ^
answer.code:59:26: error: invalid types ‘int[int]’ for array subscript
59 | g[m] = min(g[m],g[i]+cst_min);
| ^
answer.code:59:37: error: invalid types ‘int[int]’ for array subscript
59 | g[m] = min(g[m],g[i]+cst_min);
| ^
answer.code:59:42: error: invalid types ‘int[int]’ for array subscript
59 | g[m] = min(g[m],g[i]+cst_min);
| ^
answer.code:61:25: error: invalid types ‘int[int]’ for array subscript
61 | h[m] = g[m];
| ^
answer.code:62:42: error: invalid types ‘int[int]’ for array subscript
62 | For(i,m-1,1) h[i] = min(g[i],h[i+1]);
| ^
answer.code:68:34: error: invalid types ‘int[int]’ for array subscript
68 | FOR(i,0,m) h[i]=g[i]=cost[i]=0;
| ^