QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #420985 | #8672. 排队 | yswn# | 0 | 40ms | 352816kb | C++14 | 843b | 2024-05-25 09:00:20 | 2024-05-28 16:41:02 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
const int MAX=2e5+10,N=460;
int n,q,K,B,l[MAX],r[MAX],x,y,mn,w[N][MAX];
inline int read(){
int x=0,f=1;char c=getchar();
while(c>'9'||c<'0'){if(c=='-')f=-1;c=getchar();}
while(c<='9'&&c>='0'){x=(x<<3)+(x<<1)+(c^48);c=getchar();}
return x*f;
}
inline int work(int x,int L,int R){
mn=1e9;
for(int i=L;i<=R;++i){
if(x<l[i]){
mn=min(l[i]-1-x,mn);continue;
}if(x<=r[i]) mn=min(r[i]-x,mn),++x;
}return x;
}
signed main(){
n=read();q=read();K=450;B=(n+K-1)/K;
for(int i=1;i<=n;++i) l[i]=read(),r[i]=read();
for(int i=1;i<=B;++i){
int L=(i-1)*K+1,R=min(i*K,n);
x=0;
while(x<L){
y=work(x,L,R);
for(int j=0;j<=mn;++j) w[i][x+j]=y;
x+=mn+1;
}
}
}
Details
Tip: Click on the bar to expand more detailed information
Subtask #1:
score: 0
Wrong Answer
Test #1:
score: 0
Wrong Answer
time: 1ms
memory: 3724kb
input:
3 3 0 0 1 2 0 2 1 1 1 3 2 3
output:
result:
wrong answer Answer contains longer sequence [length = 3], but output contains 0 elements
Subtask #2:
score: 0
Runtime Error
Test #12:
score: 0
Runtime Error
input:
200000 200000 3 6 3 3 6 10 1 7 2 7 6 9 4 6 3 4 0 8 0 6 3 5 3 4 1 8 7 8 4 5 0 3 1 5 2 9 1 2 1 2 3 4 5 7 6 10 3 9 4 7 1 6 2 6 1 7 2 5 1 7 6 8 1 1 0 7 7 8 0 9 1 7 3 8 3 7 1 2 4 8 5 6 0 6 5 6 2 7 2 6 0 6 0 6 1 7 2 5 0 3 0 3 7 10 3 8 0 2 3 4 3 7 4 9 0 6 4 7 2 6 8 10 2 10 4 10 3 3 2 6 4 5 3 9 1 8 1 2 2 9 ...
output:
result:
Subtask #3:
score: 0
Wrong Answer
Test #22:
score: 0
Wrong Answer
time: 0ms
memory: 180576kb
input:
200000 200000 0 1 0 2 0 3 0 4 0 5 0 6 0 7 0 0 0 9 0 10 0 0 0 0 0 13 0 14 0 0 0 16 0 17 0 18 0 19 0 0 0 21 0 22 0 23 0 0 0 0 0 0 0 0 0 28 0 0 0 30 0 31 0 32 0 33 0 34 0 35 0 0 0 0 0 38 0 39 0 40 0 41 0 42 0 43 0 44 0 45 0 46 0 0 0 48 0 49 0 50 0 51 0 52 0 53 0 54 0 55 0 56 0 57 0 0 0 59 0 60 0 0 0 0 ...
output:
result:
wrong answer Answer contains longer sequence [length = 200000], but output contains 0 elements
Subtask #4:
score: 0
Wrong Answer
Test #32:
score: 0
Wrong Answer
time: 40ms
memory: 352816kb
input:
200000 200000 0 200000 1 200000 1 200000 0 200000 0 200000 1 200000 1 200000 1 200000 0 200000 1 200000 0 200000 0 200000 1 200000 0 200000 0 200000 0 200000 0 200000 1 200000 0 200000 0 200000 1 200000 0 200000 1 200000 1 200000 1 200000 1 200000 0 200000 0 200000 1 200000 2 200000 1 200000 2 20000...
output:
result:
wrong answer Answer contains longer sequence [length = 200000], but output contains 0 elements
Subtask #5:
score: 0
Skipped
Dependency #1:
0%
Subtask #6:
score: 0
Skipped
Dependency #5:
0%