QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #399510 | #2815. 组合数据结构问题 | ucup-team1251 | AC ✓ | 11ms | 3648kb | C++20 | 1.3kb | 2024-04-26 14:10:13 | 2024-04-26 14:10:14 |
Judging History
answer
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int mod = 998244353;
const int N = 1005;
int n,m;
queue<int> q1;
stack<int> q2;
priority_queue<int> q3;
priority_queue<int,vector<int>,greater<int>> q4;
// queue stack 大根堆 小根堆
void solve()
{
cin>>n;
vector<int> flag( 10 , 1ll );
for(int i=1;i<=n;i++)
{
int op , x;
cin>>op>>x;
if( op == 1ll )
{
q1.push(x) , q2.push(x) ;
q3.push(x) , q4.push(x) ;
}
else
{
if( !q1.size() )
{
for(int i=1;i<=4;i++)
flag[i] = 0;
continue ;
}
int num ;
num = q1.front();q1.pop();
if( num != x )
flag[1] = 0;
num = q2.top();q2.pop();
if( num != x )
flag[2] = 0;
num = q3.top();q3.pop();
if( num != x )
flag[3] = 0;
num = q4.top();q4.pop();
if( num != x )
flag[4] = 0;
}
}
for(int i=1;i<=4;i++)
{
if(flag[i]>0)
cout<<"Yes\n";
else
cout<<"No\n";
}
}
signed main()
{
ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
int T = 1;
//cin>>T;
while(T--)
solve();
return 0;
}
/*
6
1 1
1 2
1 3
2 1
2 2
2 3
6
1 3 1 2 1 5
2 5 2 3 2 2
6
1 3 1 2 1 5
2 3 2 2 2 5
4
1 1
1 1
2 1
2 1
3
1 1
1 1
2 1
2
1 1
2 1
4
1 -1
1 -2
2 -1
2 -2
*/
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3552kb
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: 10ms
memory: 3644kb
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: 11ms
memory: 3556kb
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: 7ms
memory: 3580kb
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: 10ms
memory: 3632kb
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: 11ms
memory: 3648kb
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: 7ms
memory: 3572kb
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