QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #127245 | #5409. Perotation | 1kri | 30 | 194ms | 9976kb | C++14 | 2.8kb | 2023-07-19 14:39:46 | 2023-07-19 14:39:49 |
Judging History
answer
#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
int n,q,a[100005],x,y;
struct BIT{
int tree[100005];
void add(int p,int v){
while(p<=n)tree[p]+=v,p+=(p&(-p));
return;
}
int ask(int p){
int ans=0;
while(p)ans+=tree[p],p-=(p&(-p));
return ans;
}
}T[325],_T;
const int B=320;
int B_tot,B_pos[1005],B_id[100005];
int f[100005],_f[100005];
void upd(int x){
int id=B_id[x]-1;
int cnt=T[id].ask(a[x]);
for (int i=B_pos[id]-1;i>x;i--)
if (a[i]<a[x])cnt++;
f[x]=(cnt&1);
return;
}
int len[325],val[325][325],ch[325][325];
int cnt[325];
void pushup(int id){
int l=B_pos[id],r=B_pos[id-1]-1;
len[id]=0;
for (int i=r;i>=l;i--){
f[i]=((T[id-1].ask(a[i])+_T.ask(a[i]))&1);
_T.add(a[i],1);
}
for (int i=r;i>=l;i--)_T.add(a[i],-1);
for (int i=l;i<=r;i++){
val[id][++len[id]]=a[i];
_f[a[i]]=f[i];
}
sort(val[id],val[id]+1+len[id]);
cnt[id]=0;
for (int i=1;i<=len[id];i++){
ch[id][i]=(_f[val[id][i]]^_f[val[id][i-1]]);
if (ch[id][i]==1)cnt[id]++;
}
for (int i=l;i<=r;i++)_f[a[i]]=0;
return;
}
void pushdown(int id){
int l=B_pos[id],r=B_pos[id-1]-1;
for (int i=1;i<=len[id];i++){
ch[id][i]^=ch[id][i-1];
_f[val[id][i]]=ch[id][i];
}
for (int i=l;i<=r;i++)f[i]=_f[a[i]];
cnt[id]=0;
for (int i=1;i<=len[id];i++){
_f[val[id][i]]=0;
ch[id][i]=0;
}
return;
}
int ge(int id,int x){
int l=1,r=len[id],ans=len[id]+1;
while(l<=r){
int mid=(l+r)/2;
if (val[id][mid]>=x)ans=mid,r=mid-1;
else l=mid+1;
}
return ans;
}
int le(int id,int x){
int l=1,r=len[id],ans=0;
while(l<=r){
int mid=(l+r)/2;
if (val[id][mid]<=x)ans=mid,l=mid+1;
else r=mid-1;
}
return ans;
}
void mdf(int id,int l,int r){
int pl=ge(id,l),pr=le(id,r);
if (pl<=len[id]&&pr>=1){
ch[id][pl]^=1;
if (ch[id][pl]==0)cnt[id]--;
else cnt[id]++;
ch[id][pr+1]^=1;
if (ch[id][pr+1]==0)cnt[id]--;
else cnt[id]++;
}
return;
}
int main(){
scanf("%d%d",&n,&q);
for (int i=1;i<=n;i++)scanf("%d",&a[i]);
B_pos[0]=n+1;
for (int i=n;i>=1;i--)
if (i==1||(n-i+1)%B==0)B_pos[++B_tot]=i;
for (int i=1;i<=B_tot;i++)
for (int j=B_pos[i];j<B_pos[i-1];j++)B_id[j]=i;
for (int i=1;i<=B_tot;i++){
int p=B_pos[i];
for (int j=n;j>=p;j--)T[i].add(a[j],1);
}
for (int i=1;i<=B_tot;i++)pushup(i);
while(q--){
scanf("%d%d",&x,&y);
if (x>y)swap(x,y);
int l=a[x],r=a[y];
if (l>r)swap(l,r);
swap(a[x],a[y]);
for (int i=1;i<=B_tot;i++){
int p=B_pos[i];
if (p>x&&p<=y)T[i].add(a[y],-1),T[i].add(a[x],1);
}
for (int i=B_id[y]+1;i<=B_id[x]-1;i++)mdf(i,l,r);
pushup(B_id[x]);
if (B_id[x]!=B_id[y])pushup(B_id[y]);
int ans=n;
for (int i=1;i<=B_tot;i++){
if (cnt[i]>0)break;
ans=B_pos[i];
}
if (ans>1)pushdown(B_id[ans]-1);
while(ans>1&&f[ans-1]==0)ans--;
printf("%d\n",ans);
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Subtask #1:
score: 10
Accepted
Test #1:
score: 10
Accepted
time: 0ms
memory: 3652kb
input:
2 1 1 2 2 1
output:
2
result:
ok 1 number(s): "2"
Test #2:
score: 0
Accepted
time: 1ms
memory: 3896kb
input:
9 7 3 5 8 2 4 9 1 6 7 2 8 3 1 2 1 1 5 3 8 1 3 9 1
output:
7 7 7 7 7 7 7
result:
ok 7 numbers
Test #3:
score: 0
Accepted
time: 1ms
memory: 7792kb
input:
7 7 6 7 2 1 5 3 4 3 1 3 1 7 5 1 6 6 5 6 1 1 7
output:
3 4 6 7 4 4 4
result:
ok 7 numbers
Test #4:
score: 0
Accepted
time: 1ms
memory: 3684kb
input:
7 7 2 4 3 1 5 6 7 7 6 6 3 3 1 1 4 3 4 2 5 4 1
output:
7 6 6 6 6 6 6
result:
ok 7 numbers
Test #5:
score: 0
Accepted
time: 2ms
memory: 7992kb
input:
6 6 5 3 1 4 2 6 5 4 5 2 4 3 6 5 1 5 6 4
output:
1 3 4 6 6 6
result:
ok 6 numbers
Test #6:
score: 0
Accepted
time: 0ms
memory: 3772kb
input:
10 9 7 9 2 5 1 6 8 3 4 10 4 5 2 9 10 6 6 1 5 3 10 1 5 7 1 7 8 3
output:
4 8 10 10 10 8 6 8 8
result:
ok 9 numbers
Test #7:
score: 0
Accepted
time: 1ms
memory: 3692kb
input:
8 8 4 2 6 5 8 3 7 1 5 6 2 4 6 5 6 1 4 6 1 2 2 8 8 6
output:
8 8 8 8 8 8 8 8
result:
ok 8 numbers
Test #8:
score: 0
Accepted
time: 0ms
memory: 3896kb
input:
8 8 6 8 4 7 1 3 5 2 1 4 3 8 3 8 8 3 6 2 1 5 1 6 7 4
output:
8 8 8 8 8 8 8 8
result:
ok 8 numbers
Test #9:
score: 0
Accepted
time: 1ms
memory: 3860kb
input:
6 8 6 1 2 5 3 4 6 1 4 5 2 5 5 3 4 6 4 1 2 4 4 2
output:
5 2 5 5 3 2 3 2
result:
ok 8 numbers
Test #10:
score: 0
Accepted
time: 1ms
memory: 3688kb
input:
10 7 3 1 8 7 6 2 9 5 10 4 7 3 10 7 1 3 2 1 8 10 8 3 1 2
output:
10 10 10 10 10 10 10
result:
ok 7 numbers
Test #11:
score: 0
Accepted
time: 1ms
memory: 5708kb
input:
8 7 3 1 4 2 7 5 8 6 6 5 6 5 2 3 5 1 4 8 7 2 5 1
output:
8 8 8 8 8 8 8
result:
ok 7 numbers
Subtask #2:
score: 20
Accepted
Dependency #1:
100%
Accepted
Test #12:
score: 20
Accepted
time: 1ms
memory: 3668kb
input:
90 83 53 72 1 6 48 45 55 24 20 78 36 82 67 35 63 7 61 69 90 52 21 80 65 32 71 81 38 43 34 64 60 40 4 49 28 89 56 77 51 46 2 18 5 62 19 57 3 88 39 85 86 23 75 10 83 27 22 68 9 37 76 50 87 79 16 11 25 26 14 8 74 41 66 58 84 12 54 17 33 42 15 44 13 73 30 29 70 59 47 31 76 86 30 50 85 3 23 51 42 59 37 8...
output:
90 90 90 90 90 90 90 90 90 90 90 90 90 90 90 90 90 90 90 90 90 90 90 90 90 90 90 90 90 90 90 90 90 90 90 90 90 89 89 89 89 89 89 89 89 89 88 88 88 88 88 88 88 88 88 88 88 88 88 88 88 88 88 88 88 88 88 88 88 88 88 88 88 88 88 88 88 88 88 88 88 88 88
result:
ok 83 numbers
Test #13:
score: 0
Accepted
time: 0ms
memory: 3652kb
input:
87 95 69 48 22 37 65 67 72 78 59 85 74 26 25 28 53 51 23 56 50 52 81 76 57 30 10 49 21 87 34 16 15 80 43 47 2 20 86 13 29 36 58 71 83 35 40 46 38 54 14 18 84 39 27 3 61 77 64 8 6 68 11 31 7 73 1 9 4 79 55 63 82 75 33 32 24 5 19 45 41 60 44 66 70 17 42 62 12 53 8 8 34 49 54 16 33 64 78 11 2 73 85 51 ...
output:
87 87 87 87 87 87 87 87 87 87 87 87 87 87 87 87 87 87 87 87 87 87 87 87 87 87 87 87 87 87 87 87 87 85 85 85 85 85 85 85 85 85 85 83 83 83 83 83 83 83 83 83 83 83 83 85 85 85 85 87 87 87 87 87 87 87 87 87 87 87 87 87 87 87 87 87 87 87 87 87 87 87 87 87 87 87 87 87 87 87 87 87 87 87 87
result:
ok 95 numbers
Test #14:
score: 0
Accepted
time: 0ms
memory: 3908kb
input:
87 90 19 70 69 56 20 16 66 9 21 47 81 5 50 7 24 85 1 80 4 73 37 52 12 75 64 3 57 71 77 28 40 17 82 65 45 22 6 79 87 63 27 39 42 83 38 11 14 41 31 74 15 60 62 86 34 23 49 33 68 51 61 32 67 59 35 58 30 29 36 25 48 84 13 54 10 53 46 78 76 26 43 72 2 8 18 44 55 58 62 14 17 36 78 11 20 35 15 85 21 74 64 ...
output:
83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 83 86 86 86 86 86 86 86 86 86 86 86 86 86 86 86 86 86 86 86 86 86 86 86 86 86 86 86 86 86 86 86 86 86 86 86 86 86 86 86 86 86 86 86 84 84 84 84 84 84 84 84 84 84 84 84 84 84 86 86 86 86 86 86
result:
ok 90 numbers
Test #15:
score: 0
Accepted
time: 0ms
memory: 7776kb
input:
91 71 40 81 83 16 76 5 85 64 84 82 63 42 32 71 73 3 51 11 30 65 17 20 56 31 4 54 49 38 52 86 34 48 80 6 26 87 8 25 36 23 2 7 70 62 67 88 72 47 55 77 29 66 68 69 91 37 79 22 44 61 45 41 74 89 28 15 13 39 75 14 46 21 33 35 43 18 58 53 90 57 19 10 12 50 59 60 1 9 24 27 78 44 18 42 5 41 26 41 29 40 1 38...
output:
45 45 45 45 45 45 45 45 45 45 45 45 45 73 74 73 72 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80
result:
ok 71 numbers
Test #16:
score: 0
Accepted
time: 1ms
memory: 3736kb
input:
80 66 26 54 23 35 62 1 25 56 12 48 37 8 80 7 32 40 52 78 69 6 29 10 36 50 16 42 61 60 27 38 14 77 17 9 20 59 64 79 5 76 67 39 18 34 13 71 15 70 66 19 24 63 72 53 2 75 65 51 22 44 73 28 11 3 57 33 30 74 46 55 31 41 43 68 4 47 49 58 21 45 39 1 37 18 35 6 32 3 31 21 31 27 31 46 46 55 54 6 51 19 51 45 5...
output:
40 40 40 40 40 40 47 55 55 55 55 55 55 55 55 55 72 72 72 72 72 72 72 72 72 72 72 72 72 72 72 72 70 70 70 70 70 70 70 70 70 70 70 70 70 70 70 70 70 70 70 70 70 70 70 70 70 70 70 70 70 70 70 72 72 70
result:
ok 66 numbers
Test #17:
score: 0
Accepted
time: 1ms
memory: 3764kb
input:
100 100 15 10 37 71 30 22 78 12 33 13 29 26 27 11 3 24 42 18 21 28 73 23 53 57 91 32 20 6 4 5 82 16 95 80 14 17 76 25 9 8 31 7 99 19 96 49 59 2 65 93 70 58 60 43 44 50 74 92 35 86 98 84 90 52 67 72 83 62 56 100 46 89 69 36 45 38 77 61 81 63 41 55 87 79 39 88 54 85 64 75 48 97 68 94 40 66 1 51 34 47 ...
output:
68 64 68 68 68 85 85 85 85 85 85 85 85 85 85 85 85 85 85 85 85 85 85 85 85 85 85 85 85 85 85 85 85 85 85 85 85 85 85 85 85 85 85 85 85 85 85 85 85 85 85 85 85 85 85 85 85 85 85 85 85 85 85 85 85 85 85 85 85 85 85 85 85 85 85 85 85 85 85 85 85 85 85 85 85 85 85 85 90 90 90 90 90 90 90 90 90 90 90 90
result:
ok 100 numbers
Test #18:
score: 0
Accepted
time: 0ms
memory: 3696kb
input:
94 100 85 86 55 56 3 4 67 68 61 62 77 78 65 66 89 90 73 74 45 46 11 12 49 50 37 38 51 52 43 44 83 84 41 42 31 32 5 6 25 26 7 8 79 80 1 2 47 48 91 92 35 36 23 24 29 30 93 94 17 18 15 16 71 72 53 54 27 28 21 22 75 76 19 20 63 64 57 58 39 40 59 60 69 70 33 34 13 14 81 82 87 88 9 10 56 78 86 68 55 77 85...
output:
78 86 86 1 23 31 23 1 18 1 53 1 90 1 91 1 29 1 55 77 77 77 18 1 85 85 85 1 26 1 54 87 87 1 66 1 73 1 50 82 82 1 80 84 80 1 78 88 94 88 78 1 91 1 79 79 79 1 49 1 65 1 44 1 27 77 27 1 60 60 47 1 92 1 75 1 74 1 57 94 94 87 57 1 68 68 81 81 81 1 47 53 53 1 34 1 33 65 33 1
result:
ok 100 numbers
Test #19:
score: 0
Accepted
time: 0ms
memory: 3908kb
input:
100 100 43 44 77 78 75 76 99 100 1 2 5 6 19 20 89 90 47 48 41 42 65 66 67 68 25 26 91 92 95 96 71 72 97 98 49 50 23 24 17 18 81 82 55 56 45 46 27 28 21 22 29 30 15 16 51 52 11 12 31 32 61 62 87 88 57 58 35 36 73 74 9 10 59 60 7 8 85 86 83 84 33 34 39 40 53 54 37 38 69 70 13 14 93 94 79 80 63 64 3 4 ...
output:
96 96 96 1 36 1 56 1 88 1 81 1 68 1 37 1 90 1 28 1 98 98 98 1 55 86 86 1 93 1 84 84 69 69 65 1 99 1 55 1 61 61 42 1 88 1 30 1 38 1 49 49 44 1 96 96 85 85 85 1 50 1 60 60 60 1 45 45 26 1 27 1 42 78 78 1 53 53 100 100 100 1 94 94 64 88 88 1 87 96 96 1 98 98 98 97 97 1 83 1
result:
ok 100 numbers
Test #20:
score: 0
Accepted
time: 2ms
memory: 5672kb
input:
84 83 55 56 13 14 69 70 79 80 3 4 49 50 9 10 27 28 29 30 59 60 73 74 1 2 11 12 77 78 51 52 45 46 15 16 17 18 33 34 31 32 25 26 53 54 43 44 63 64 41 42 39 40 19 20 37 38 81 82 75 76 83 84 23 24 47 48 61 62 5 6 7 8 35 36 21 22 65 66 57 58 71 72 67 68 12 32 11 31 62 82 22 48 21 47 78 72 77 71 68 52 61 ...
output:
13 1 63 63 63 78 63 68 68 1 33 23 33 1 48 1 63 1 33 1 60 1 40 51 80 80 80 1 75 61 74 1 58 1 72 1 31 51 31 1 62 1 39 73 73 79 79 1 67 1 74 75 74 74 74 76 76 1 39 1 4 1 82 82 76 76 76 1 22 23 23 1 78 1 52 1 47 57 57 1 75 1 59
result:
ok 83 numbers
Test #21:
score: 0
Accepted
time: 1ms
memory: 3676kb
input:
100 100 79 80 63 64 23 24 41 42 87 88 33 34 99 100 65 66 73 74 11 12 69 70 71 72 19 20 59 60 75 76 35 36 15 16 3 4 67 68 17 18 93 94 39 40 9 10 81 82 13 14 89 90 49 50 31 32 43 44 97 98 95 96 77 78 57 58 55 56 29 30 51 52 61 62 27 28 53 54 47 48 25 26 91 92 5 6 83 84 7 8 37 38 45 46 1 2 21 22 85 86 ...
output:
75 1 33 1 59 1 80 98 98 98 98 98 17 1 80 80 80 80 80 80 80 89 89 1 75 75 75 54 74 74 54 1 48 1 87 87 84 88 88 1 62 1 61 1 95 1 86 86 86 86 30 1 47 1 86 86 39 1 83 1 10 1 90 90 90 1 26 1 41 66 66 1 67 1 94 1 46 1 71 71 70 1 82 1 96 96 96 1 14 68 68 68 40 1 79 79 79 1 48 1
result:
ok 100 numbers
Test #22:
score: 0
Accepted
time: 0ms
memory: 3904kb
input:
95 82 65 66 53 54 1 2 83 84 19 20 43 44 89 90 5 6 11 12 67 68 55 56 87 88 77 78 17 18 7 8 49 50 9 10 57 58 79 80 71 72 23 24 81 82 93 94 3 4 39 40 13 14 21 22 59 60 25 26 91 92 63 64 15 16 69 70 47 48 61 62 41 42 33 34 31 32 27 28 35 36 45 46 73 74 37 38 29 30 51 52 85 86 75 76 95 74 62 73 61 8 50 7...
output:
73 1 45 1 72 1 11 92 92 92 92 87 87 87 87 87 87 87 87 87 27 1 88 1 82 82 82 82 82 69 84 84 84 84 84 68 68 1 78 78 78 92 92 92 92 92 92 92 92 92 81 81 68 1 43 43 43 1 77 77 39 1 71 71 71 71 60 60 94 60 60 1 73 1 33 52 52 46 33 1 70 1
result:
ok 82 numbers
Test #23:
score: 0
Accepted
time: 1ms
memory: 7956kb
input:
100 100 55 56 49 50 81 82 37 38 51 52 35 36 89 90 57 58 7 8 27 28 99 100 65 66 5 6 87 88 83 84 53 54 91 92 77 78 13 14 29 30 41 42 9 10 45 46 63 64 93 94 59 60 23 24 1 2 3 4 97 98 69 70 85 86 21 22 25 26 31 32 11 12 39 40 95 96 19 20 73 74 79 80 47 48 71 72 43 44 15 16 67 68 61 62 75 76 17 18 33 34 ...
output:
47 55 69 55 55 64 64 64 64 64 84 84 84 84 84 1 96 96 96 96 72 1 31 89 91 91 31 38 38 55 38 94 38 1 26 26 96 96 96 96 96 96 96 96 96 96 90 90 90 1 65 92 92 92 92 92 92 92 92 92 92 92 27 1 68 68 57 66 73 73 57 57 62 62 62 62 62 89 89 97 97 1 78 1 57 91 91 59 91 91 82 1 86 1 69 1 75 1 46 1
result:
ok 100 numbers
Test #24:
score: 0
Accepted
time: 1ms
memory: 3632kb
input:
100 100 53 54 83 84 29 30 95 96 11 12 45 46 91 92 17 18 5 6 39 40 87 88 57 58 93 94 81 82 67 68 85 86 59 60 73 74 71 72 99 100 19 20 31 32 65 66 23 24 43 44 25 26 1 2 9 10 61 62 7 8 35 36 89 90 69 70 37 38 51 52 79 80 63 64 55 56 47 48 3 4 13 14 49 50 97 98 27 28 41 42 33 34 21 22 75 76 15 16 77 78 ...
output:
97 1 39 1 80 1 27 1 25 1 7 1 79 1 60 1 63 1 84 1 60 1 27 1 78 1 33 1 44 1 41 1 90 1 69 1 94 1 99 1 92 1 59 1 59 1 87 1 83 1 63 1 82 1 94 1 25 1 91 1 83 1 50 1 77 1 71 1 46 1 89 1 18 1 36 1 51 1 14 1 48 1 76 1 7 1 42 1 57 1 17 1 68 1 98 1 52 1 49 1
result:
ok 100 numbers
Test #25:
score: 0
Accepted
time: 1ms
memory: 3904kb
input:
100 100 3 4 63 64 21 22 49 50 35 36 99 100 65 66 85 86 25 26 17 18 23 24 69 70 33 34 13 14 41 42 81 82 11 12 67 68 57 58 29 30 15 16 1 2 55 56 31 32 83 84 37 38 91 92 45 46 43 44 79 80 93 94 9 10 73 74 95 96 61 62 39 40 7 8 53 54 87 88 5 6 59 60 47 48 75 76 89 90 27 28 19 20 71 72 97 98 51 52 77 78 ...
output:
7 7 7 7 7 7 10 10 10 10 46 46 99 46 89 46 77 46 100 46 92 46 82 46 46 46 59 66 99 66 100 66 66 66 83 66 66 66 65 66 95 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 99 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 100 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96 96
result:
ok 100 numbers
Test #26:
score: 0
Accepted
time: 2ms
memory: 5816kb
input:
100 100 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 ...
output:
100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1
result:
ok 100 numbers
Subtask #3:
score: 0
Wrong Answer
Dependency #1:
100%
Accepted
Dependency #2:
100%
Accepted
Test #27:
score: 30
Accepted
time: 150ms
memory: 8092kb
input:
3695 3785 270 3225 1936 1747 2487 1557 2343 3313 2544 1941 1095 1919 3206 901 327 3076 557 29 112 2617 201 53 2643 678 1666 680 1523 3380 1353 2059 2566 1743 523 1131 168 509 2138 3577 109 2930 1114 3563 3395 2075 2271 1228 3462 1952 1535 1087 2548 653 2713 1749 336 1658 2470 466 958 639 3184 2451 1...
output:
3694 3694 3694 3694 3694 3694 3694 3694 3694 3694 3694 3694 3694 3694 3694 3694 3694 3694 3694 3694 3694 3694 3694 3694 3694 3694 3694 3694 3694 3694 3694 3694 3694 3694 3694 3694 3694 3694 3694 3694 3694 3694 3694 3694 3694 3694 3694 3694 3694 3694 3694 3694 3694 3694 3694 3694 3694 3694 3694 3694 ...
result:
ok 3785 numbers
Test #28:
score: 0
Accepted
time: 164ms
memory: 9924kb
input:
3723 4095 328 2762 1127 671 588 1400 462 1610 480 2418 498 754 1996 3542 2366 1926 2523 2763 3334 1001 2644 206 3129 27 1969 2135 1957 2051 3593 627 1002 1464 436 1399 362 964 1318 3486 3367 1705 591 574 2303 1039 1157 1719 640 1749 779 2570 2322 2050 75 288 1795 2313 369 1479 1364 1543 1380 587 347...
output:
3721 3721 3721 3721 3721 3721 3721 3721 3721 3721 3721 3721 3721 3721 3721 3721 3721 3721 3721 3721 3721 3721 3721 3721 3721 3721 3721 3721 3721 3721 3721 3721 3721 3721 3721 3721 3721 3721 3721 3721 3721 3721 3721 3721 3721 3721 3721 3721 3721 3721 3721 3721 3721 3721 3721 3721 3721 3721 3721 3721 ...
result:
ok 4095 numbers
Test #29:
score: 0
Accepted
time: 194ms
memory: 8172kb
input:
3751 4991 1413 3000 2568 849 2640 2080 2991 1124 965 897 1156 505 3393 62 2470 2855 441 1964 1102 3686 1608 1096 3152 2109 815 3301 303 2549 1265 304 1829 486 69 1460 2279 1641 1395 3669 2276 1118 3299 3480 1889 3130 2502 3288 1984 1895 2775 1044 3545 732 2333 512 3733 2511 3448 693 1344 1798 25 261...
output:
3748 3748 3748 3748 3748 3748 3748 3748 3748 3748 3748 3748 3748 3748 3748 3748 3748 3748 3748 3748 3748 3748 3748 3748 3748 3748 3748 3748 3748 3748 3748 3748 3748 3748 3748 3748 3748 3748 3748 3748 3748 3748 3748 3748 3748 3748 3748 3748 3748 3748 3748 3748 3748 3748 3748 3748 3748 3748 3748 3748 ...
result:
ok 4991 numbers
Test #30:
score: 0
Accepted
time: 155ms
memory: 9944kb
input:
4365 4219 4170 1729 419 37 3601 3093 3961 4198 1090 2353 3745 1042 2374 1571 1280 1406 2361 4349 2275 2759 591 743 3036 2147 794 2598 1875 1058 1682 1877 3460 3678 2048 2101 2459 89 2437 3713 4307 1543 1668 3547 3600 1011 4193 2262 827 606 3990 217 283 3701 3383 3964 3052 906 1038 3764 157 1276 3690...
output:
2181 3256 3256 3982 3995 3999 4001 4001 4001 4001 4001 4001 3999 3999 3999 4001 4001 3999 3999 3999 3998 3999 3999 3999 3993 3998 3998 4001 4001 4001 3999 3999 4001 4001 4001 3995 3999 3999 3999 3999 3995 3999 3999 3999 3995 3995 3995 3998 4000 4000 4000 4000 3998 3998 3998 3998 4001 4001 4001 4001 ...
result:
ok 4219 numbers
Test #31:
score: 0
Accepted
time: 188ms
memory: 9912kb
input:
4394 4906 3424 864 2175 3494 610 4297 4057 2341 1132 125 2504 1923 1080 628 2011 3599 579 2541 1652 1643 1919 2268 2668 3577 3151 4153 1658 2630 656 2458 1430 4053 463 4199 2770 1345 859 3061 2249 1023 2413 3132 1809 1978 2712 961 2593 2947 3512 2580 2247 114 1611 3291 1776 3995 3261 2270 2771 2340 ...
output:
3025 3024 3197 3166 3182 3182 3197 3198 3201 3460 3460 4000 4001 4000 4000 3996 4001 3996 3999 3999 3999 3999 3998 3998 4001 3998 3998 3998 4001 4001 4001 4001 4001 4001 4001 3999 3999 4000 4000 4000 4000 3999 3999 4000 4000 3998 4000 3998 3998 3998 3998 3998 3998 3998 3999 3999 3999 3999 3995 3995 ...
result:
ok 4906 numbers
Test #32:
score: 0
Accepted
time: 191ms
memory: 9976kb
input:
5000 5000 963 4459 3471 3824 3201 1969 2194 4708 4445 3506 2258 1126 1769 4333 2746 3148 1410 762 849 3007 590 2259 477 1644 3827 4589 286 3930 2147 2436 818 1200 4218 3036 2165 1180 4050 1538 1296 2790 186 2014 1274 891 4613 3583 4714 3457 1312 888 4616 3505 577 310 1060 4397 1188 1303 1250 1226 30...
output:
2497 3197 3197 3197 3197 4206 4206 4799 4799 4799 4801 4801 4801 4801 4801 4801 4801 4801 4801 4801 4801 4801 4801 4798 4798 4799 4798 4789 4798 4798 4798 4801 4798 4798 4798 4798 4798 4798 4798 4798 4801 4801 4801 4798 4798 4799 4801 4801 4798 4798 4798 4799 4799 4799 4799 4799 4801 4801 4801 4801 ...
result:
ok 5000 numbers
Test #33:
score: -30
Wrong Answer
time: 110ms
memory: 7880kb
input:
3820 3878 843 844 1569 1570 1659 1660 3585 3586 201 202 3093 3094 1691 1692 2705 2706 1437 1438 839 840 3267 3268 521 522 2961 2962 3101 3102 3649 3650 1947 1948 229 230 1645 1646 1121 1122 2407 2408 1253 1254 1383 1384 1597 1598 3341 3342 1535 1536 897 898 441 442 1061 1062 569 570 3499 3500 585 58...
output:
1739 1 2315 2315 2315 1901 1901 1 3814 3814 1901 1 3208 1 2387 1 914 1 1872 1872 3507 3507 1577 1 3564 3722 3564 1 1874 1 2608 1 2370 2528 2528 1 2727 1 2064 1 2502 1 2773 1 3185 1 3165 1 2573 1 3680 1 3050 1 994 1457 1457 1 2186 1 2366 3163 3163 1 2960 1 1323 1 2083 1 979 1 2418 1 3634 3634 2778 1 ...
result:
wrong answer 6th numbers differ - expected: '1611', found: '1901'
Subtask #4:
score: 0
Skipped
Dependency #1:
100%
Accepted
Dependency #2:
100%
Accepted
Dependency #3:
0%