QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #21273 | #2815. 组合数据结构问题 | gogo# | AC ✓ | 26ms | 5800kb | C++14 | 1.1kb | 2022-03-04 14:21:59 | 2022-05-08 02:49:08 |
Judging History
answer
#include <bits/stdc++.h>
//#define int long long
#define ll long long
#define db double
#define fi first
#define se second
#define pii pair<int,int>
#define vi vector<int>
using namespace std;
const int maxn=1e6;
int n;
int que[maxn+5],he=1,ta=0;
int sta[maxn+5],top;
priority_queue<int> P;
priority_queue< int ,vector<int>,greater<int> > Q;
int main() {
scanf("%d",&n);
int a=1,b=1,c=1,d=1;
for (int i=1;i<=n;i++) {
int o,x;
scanf("%d %d",&o,&x);
if (o==1) {
que[++ta]=x;
sta[++top]=x;
P.push(x);
Q.push(x);
}
else {
if (he>ta) {
a=0;
}
else {
int t=que[he++];
if (t!=x) a=0;
}
if (top==0) {
b=0;
}
else {
int t=sta[top]; top--;
if (t!=x) b=0;
}
if (P.empty()) {
c=0;
}
else {
int t=P.top(); P.pop();
if (t!=x) c=0;
}
if (Q.empty()) {
d=0;
}
else {
int t=Q.top(); Q.pop();
if (t!=x) d=0;
}
}
}
if (a) puts("Yes"); else puts("No");
if (b) puts("Yes"); else puts("No");
if (c) puts("Yes"); else puts("No");
if (d) puts("Yes"); else puts("No");
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 3ms
memory: 5720kb
input:
6 1 1 1 2 1 3 2 1 2 2 2 3
output:
Yes No No Yes
result:
ok 4 lines
Test #2:
score: 0
Accepted
time: 18ms
memory: 5576kb
input:
100000 1 49 1 59 2 49 1 98 2 59 2 98 1 95 1 34 1 64 2 95 1 18 1 44 1 7 1 78 2 34 2 64 2 18 1 37 2 44 1 89 2 7 1 2 1 21 2 78 2 37 1 90 1 75 1 50 1 33 1 70 1 32 2 89 2 2 1 49 2 21 1 46 2 90 1 3 2 75 1 50 1 37 1 24 1 88 1 78 2 50 1 22 1 73 1 95 1 100 2 33 1 28 1 62 1 25 2 70 1 90 2 32 1 31 2 49 2 46 2 ...
output:
Yes No No No
result:
ok 4 lines
Test #3:
score: 0
Accepted
time: 24ms
memory: 5788kb
input:
100000 1 78 1 47 1 9 2 9 2 47 2 78 1 67 1 58 1 6 2 6 1 60 1 5 2 5 2 60 1 100 2 100 1 76 1 28 1 81 1 40 1 5 2 5 2 40 1 39 1 13 1 82 2 82 2 13 1 19 2 19 2 39 1 47 1 25 2 25 2 47 2 81 2 28 2 76 2 58 2 67 1 13 2 13 1 39 2 39 1 72 2 72 1 88 1 84 2 84 2 88 1 100 2 100 1 2 2 2 1 91 1 20 2 20 1 25 1 37 2 37...
output:
No Yes No No
result:
ok 4 lines
Test #4:
score: 0
Accepted
time: 15ms
memory: 5644kb
input:
100000 1 99 1 79 2 79 1 90 2 90 2 99 1 43 1 40 1 61 2 40 2 43 2 61 1 98 1 70 1 65 2 65 2 70 2 98 1 64 2 64 1 64 1 12 1 57 1 54 1 69 1 19 1 67 1 99 1 42 1 25 1 88 2 12 2 19 1 50 1 45 1 60 1 55 1 14 1 49 1 55 2 14 1 87 2 25 1 14 2 14 1 37 1 20 2 20 2 37 2 42 2 45 2 49 1 82 1 39 1 80 1 76 1 7 2 7 1 19 ...
output:
No No No Yes
result:
ok 4 lines
Test #5:
score: 0
Accepted
time: 23ms
memory: 5800kb
input:
100000 1 83 2 83 1 84 1 49 1 12 1 29 2 84 2 49 1 3 2 29 2 12 2 3 1 24 1 46 1 13 2 46 2 24 2 13 1 66 1 92 2 92 2 66 1 37 1 50 1 16 1 90 2 90 1 92 2 92 1 38 2 50 1 24 1 85 1 13 2 85 2 38 1 53 1 46 1 7 1 43 1 16 1 28 2 53 1 56 1 59 2 59 2 56 2 46 2 43 1 31 1 64 1 3 2 64 1 46 2 46 2 37 2 31 1 71 2 71 1 ...
output:
No No Yes No
result:
ok 4 lines
Test #6:
score: 0
Accepted
time: 26ms
memory: 5576kb
input:
100000 1 -2147483648 2 -2147483648 1 -2147483648 1 1 1 1 2 -2147483648 2 1 1 -2147483648 2 -2147483648 1 -1 1 1 2 -1 1 1 1 -2147483648 2 -2147483648 1 1 1 -2147483648 2 -2147483648 2 1 2 1 1 -1 2 -1 1 -1 2 -1 2 1 2 1 1 -2147483648 2 -2147483648 1 1 2 1 1 -1 2 -1 1 1 2 1 1 1 2 1 1 -2147483648 2 -2147...
output:
No No No Yes
result:
ok 4 lines
Test #7:
score: 0
Accepted
time: 19ms
memory: 5776kb
input:
100000 1 1 2 1 1 1 2 1 2 1 1 1 1 1 1 1 1 1 1 1 1 1 2 1 2 1 1 1 2 1 2 1 1 1 2 1 2 1 1 1 1 1 2 1 1 1 2 1 2 1 2 1 1 1 1 1 1 1 2 1 2 1 1 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 1 1 1 1 1 1 1 1 1 1 1 1 2 1 2 1 2 1 2 1 1 1 1 1 2 1 2 1 2 1 1 1 1 1 1 1 2 1 1 1 2 1 1 1 1 1 1 1 2 1 1 1 2 1 2 1 2 1 1 1 1 1 2 1 1 1 1 1 2...
output:
No No No No
result:
ok 4 lines