| Task: | Tikut |
| Sender: | a256 |
| Submission time: | 2024-11-05 21:39:38 +0200 |
| Language: | C++ (C++11) |
| Status: | READY |
| Result: | 82 |
| group | verdict | score |
|---|---|---|
| #1 | ACCEPTED | 7 |
| #2 | ACCEPTED | 8 |
| #3 | ACCEPTED | 12 |
| #4 | ACCEPTED | 24 |
| #5 | ACCEPTED | 31 |
| #6 | TIME LIMIT EXCEEDED | 0 |
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | ACCEPTED | 0.00 s | 1, 3, 4, 5, 6 | details |
| #2 | ACCEPTED | 0.00 s | 1, 4, 5, 6 | details |
| #3 | ACCEPTED | 0.00 s | 1, 4, 5, 6 | details |
| #4 | ACCEPTED | 0.00 s | 1, 4, 5, 6 | details |
| #5 | ACCEPTED | 0.01 s | 2, 5, 6 | details |
| #6 | ACCEPTED | 0.01 s | 2, 5, 6 | details |
| #7 | ACCEPTED | 0.00 s | 3, 5, 6 | details |
| #8 | ACCEPTED | 0.00 s | 3, 5, 6 | details |
| #9 | ACCEPTED | 0.00 s | 3, 5, 6 | details |
| #10 | ACCEPTED | 0.00 s | 3, 5, 6 | details |
| #11 | ACCEPTED | 0.00 s | 3, 5, 6 | details |
| #12 | ACCEPTED | 0.00 s | 4, 5, 6 | details |
| #13 | ACCEPTED | 0.00 s | 4, 5, 6 | details |
| #14 | ACCEPTED | 0.00 s | 4, 5, 6 | details |
| #15 | ACCEPTED | 0.00 s | 4, 5, 6 | details |
| #16 | ACCEPTED | 0.12 s | 5, 6 | details |
| #17 | ACCEPTED | 0.10 s | 5, 6 | details |
| #18 | ACCEPTED | 0.05 s | 5, 6 | details |
| #19 | ACCEPTED | 0.10 s | 5, 6 | details |
| #20 | TIME LIMIT EXCEEDED | -- | 6 | details |
| #21 | TIME LIMIT EXCEEDED | -- | 6 | details |
| #22 | TIME LIMIT EXCEEDED | -- | 6 | details |
Compiler report
input/code.cpp: In function 'int main()':
input/code.cpp:32:22: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
32 | auto [l,u]=rn(1,mb-k);
| ^Code
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define N 112345
#define MS 212345
#define CD(a,b) (1+((a)-1)/(b))
int n,m,MM,r[MS],AA[MS];
array<int,N> t;
pair<ll,ll> rn(int a,int b){
ll L=0,U=0;
for(int i=0;i<n;++i){
int u=t[i]/a,l=CD(t[i],b);
if(a>t[i]||l>u) return {-123,-123};
U+=u-1;
L+=l-1;
}
return {L,U};
}
int main(){
cin.tie(0)->sync_with_stdio(0);
cin>>n>>m;
for(int i=0;i<n;++i) cin>>t[i];
for(int i=0;i<m;++i) r[i]=INT_MAX;
sort(t.begin(),t.begin()+n);
MM=t[n-1];
int mb=MM;
for(int k=1<<30;k;k/=2){
if(mb-k<1) continue;
auto [l,u]=rn(1,mb-k);
if(l<=m&&m<=u) mb-=k;
}
set<int> B;
for(int i=0;i<n;++i){
for(int k=1;k<=m+1;++k){
int e=CD(t[i],k);
if(e>=mb) B.insert(e);
else break;
}
}
for(auto it=B.begin();it!=B.end();++it){
int b=*it,a=MM,l=0,bc=0;
priority_queue<array<int,3>> q;
for(int i=0;i<n;++i){
int d=CD(t[i],b);
if(t[i]/(d+1)){
q.push({t[i]/(d+1),t[i],d+1});
}
if(CD(t[i],d)==b) ++bc;
l+=CD(t[i],b)-1;
a=min(a,t[i]/d);
}
if(l&&l<=m){
if(b-a<r[l-1]) AA[l-1]=a;
r[l-1]=min(r[l-1],b-a);
}
for(;l<m&&bc;++l){
auto z=q.top(); q.pop();
int d=z[2];
int e=z[1];
if(CD(e,(d-1))==b&&CD(e,d)!=b) --bc;
a=min(a,z[0]);
if(b-a<r[l]) AA[l]=a;
r[l]=min(r[l],b-a);
if(e/(d+1)) q.push({e/(d+1),e,d+1});
}
}
for(int i=0;i<m-1;++i){
if(AA[i+1]>AA[i]) return 1;
}
for(int i=0;i<m;++i) cout<<r[i]<<' ';
cout<<'\n';
}
Test details
Test 1
Group: 1, 3, 4, 5, 6
Verdict: ACCEPTED
| input |
|---|
| 1 1 6 |
| correct output |
|---|
| 0 |
| user output |
|---|
| 0 |
Test 2
Group: 1, 4, 5, 6
Verdict: ACCEPTED
| input |
|---|
| 5 10 4 8 6 2 7 |
| correct output |
|---|
| 5 4 2 2 2 1 1 1 1 1 |
| user output |
|---|
| 5 4 2 2 2 1 1 1 1 1 |
Test 3
Group: 1, 4, 5, 6
Verdict: ACCEPTED
| input |
|---|
| 5 10 5 5 8 6 7 |
| correct output |
|---|
| 3 3 2 3 2 2 1 1 1 2 |
| user output |
|---|
| 3 3 2 3 2 2 1 1 1 2 |
Test 4
Group: 1, 4, 5, 6
Verdict: ACCEPTED
| input |
|---|
| 5 10 8 7 9 6 10 |
| correct output |
|---|
| 4 4 3 3 2 2 1 2 2 1 |
| user output |
|---|
| 4 4 3 3 2 2 1 2 2 1 |
Test 5
Group: 2, 5, 6
Verdict: ACCEPTED
| input |
|---|
| 1000 1071 3 2 3 1 3 3 2 3 2 3 2 2 2 1 2 ... |
| correct output |
|---|
| 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 ... |
| user output |
|---|
| 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 ... |
Test 6
Group: 2, 5, 6
Verdict: ACCEPTED
| input |
|---|
| 1000 1500 3 2 2 3 2 3 2 2 2 3 2 2 3 3 3 ... |
| correct output |
|---|
| 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 ... |
| user output |
|---|
| 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 ... |
Test 7
Group: 3, 5, 6
Verdict: ACCEPTED
| input |
|---|
| 1000 2 15 710 210 347 398 66 318 277 ... |
| correct output |
|---|
| 994 994 |
| user output |
|---|
| 994 994 |
Test 8
Group: 3, 5, 6
Verdict: ACCEPTED
| input |
|---|
| 1000 2 743 890 592 942 736 969 616 50... |
| correct output |
|---|
| 498 496 |
| user output |
|---|
| 498 496 |
Test 9
Group: 3, 5, 6
Verdict: ACCEPTED
| input |
|---|
| 1000 2 987 968 920 994 988 918 914 95... |
| correct output |
|---|
| 500 500 |
| user output |
|---|
| 500 500 |
Test 10
Group: 3, 5, 6
Verdict: ACCEPTED
| input |
|---|
| 1000 2 996 1000 998 998 999 997 997 9... |
| correct output |
|---|
| 500 500 |
| user output |
|---|
| 500 500 |
Test 11
Group: 3, 5, 6
Verdict: ACCEPTED
| input |
|---|
| 1000 2 501 501 501 501 501 501 501 50... |
| correct output |
|---|
| 1 168 |
| user output |
|---|
| 1 168 |
Test 12
Group: 4, 5, 6
Verdict: ACCEPTED
| input |
|---|
| 100 200 145 136 74 83 73 36 196 115 11... |
| correct output |
|---|
| 194 190 189 183 182 181 181 17... |
| user output |
|---|
| 194 190 189 183 182 181 181 17... |
Test 13
Group: 4, 5, 6
Verdict: ACCEPTED
| input |
|---|
| 100 200 157 110 168 155 192 107 146 15... |
| correct output |
|---|
| 95 96 96 95 93 94 94 94 90 91 ... |
| user output |
|---|
| 95 96 96 95 93 94 94 94 90 91 ... |
Test 14
Group: 4, 5, 6
Verdict: ACCEPTED
| input |
|---|
| 50 200 137 118 160 118 146 160 140 18... |
| correct output |
|---|
| 98 98 98 96 90 91 88 88 84 86 ... |
| user output |
|---|
| 98 98 98 96 90 91 88 88 84 86 ... |
Test 15
Group: 4, 5, 6
Verdict: ACCEPTED
| input |
|---|
| 100 200 147 174 186 148 155 128 158 18... |
| correct output |
|---|
| 99 99 98 98 97 97 96 96 95 95 ... |
| user output |
|---|
| 99 99 98 98 97 97 96 96 95 95 ... |
Test 16
Group: 5, 6
Verdict: ACCEPTED
| input |
|---|
| 1000 2000 928772177 816188227 216592201 ... |
| correct output |
|---|
| 991676844 990940224 990685481 ... |
| user output |
|---|
| 991676844 990940224 990685481 ... |
Test 17
Group: 5, 6
Verdict: ACCEPTED
| input |
|---|
| 1000 2000 665759876 597950008 615453266 ... |
| correct output |
|---|
| 498801198 498681904 498504321 ... |
| user output |
|---|
| 498801198 498681904 498504321 ... |
Test 18
Group: 5, 6
Verdict: ACCEPTED
| input |
|---|
| 500 2000 683288817 784230412 626685186 ... |
| correct output |
|---|
| 497667621 498434895 495465990 ... |
| user output |
|---|
| 497667621 498434895 495465990 ... |
Test 19
Group: 5, 6
Verdict: ACCEPTED
| input |
|---|
| 1000 2000 666667000 809309500 571572000 ... |
| correct output |
|---|
| 499499500 499249250 498999000 ... |
| user output |
|---|
| 499499500 499249250 498999000 ... |
Test 20
Group: 6
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 100000 200000 861772559 734298084 983382252 ... |
| correct output |
|---|
| 499973914 499985299 499985141 ... |
| user output |
|---|
| (empty) |
Test 21
Group: 6
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 30000 200000 691834579 617419813 514778075 ... |
| correct output |
|---|
| 499967533 499976270 499969810 ... |
| user output |
|---|
| (empty) |
Test 22
Group: 6
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 100000 200000 820255000 960780000 741965000 ... |
| correct output |
|---|
| 499995000 499992500 499990000 ... |
| user output |
|---|
| (empty) |
