QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#363282 | #8509. Expanding STACKS! | Days_of_Future_Past# | WA | 1ms | 3812kb | C++23 | 1.4kb | 2024-03-23 20:34:21 | 2024-03-23 20:34:21 |
Judging History
answer
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx")
#include <bits/stdc++.h>
#define rep(i,n) for(int i=1;i<=n;++i)
#define pb push_back
#define mp make_pair
using namespace std;
int a[2][1100],top[2],v[1100],q[1100],tot;
int n;
int main()
{
cin>>n;
memset(v,255,sizeof(v)); getchar();
rep(i,2*n)
{
if (i!=1)getchar();
char c=getchar();
int x; scanf("%d",&x);
//cout<<c<<" "<<x<<":"<<endl;
if (c=='+')
{
v[x]=2;
q[++tot]=x;
continue;
}
if (c=='-')
{
if (v[x]==-1){ puts("*"); return 0; }
if (v[x]==2)
{
int p=tot;
while (q[p]!=x)p--;
v[x]=0;
a[0][++top[0]]=x;
q[p]=0;
for(int j=p+1;j<=tot;j++)
{
v[q[j]]=1;
a[1][++top[1]]=q[j];
q[j]=0;
}
tot=p-1;
}
if (a[v[x]][top[v[x]]]!=x){ puts("*"); return 0; }
a[v[x]][top[v[x]]]=0;
top[v[x]]--;
//cout<<v[x]<<endl;
}
}
rep(i,n)if (v[i]==0)putchar('G'); else putchar('S'); puts("");
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 1ms
memory: 3688kb
input:
2 +2 +1 -1 -2
output:
GG
result:
ok correct
Test #2:
score: 0
Accepted
time: 0ms
memory: 3772kb
input:
2 +1 +2 -1 -2
output:
GS
result:
ok correct
Test #3:
score: 0
Accepted
time: 0ms
memory: 3776kb
input:
3 +1 +2 +3 -1 -2 -3
output:
*
result:
ok correct
Test #4:
score: 0
Accepted
time: 0ms
memory: 3808kb
input:
10 +3 -3 +4 -4 +6 +2 -2 -6 +7 -7 +5 -5 +10 +1 +9 +8 -8 -9 -1 -10
output:
GGGGGGGGGG
result:
ok correct
Test #5:
score: 0
Accepted
time: 1ms
memory: 3776kb
input:
10 +8 -8 +2 +10 -2 -10 +7 -7 +1 -1 +6 -6 +5 +3 +4 +9 -9 -4 -3 -5
output:
GGGGGGGGGS
result:
ok correct
Test #6:
score: 0
Accepted
time: 1ms
memory: 3812kb
input:
42 +26 -26 +12 +8 -12 -8 +30 +5 +22 +3 -3 +2 -30 +10 -10 -2 -22 +23 +39 -39 +17 -17 -23 +38 +24 -24 +27 +29 -29 -27 -38 -5 +37 -37 +21 +16 +28 -28 +6 +40 +14 +19 -19 -14 +11 +35 -35 -11 +4 +25 -25 -4 -40 -6 +13 +20 +1 -1 +33 +34 +7 -7 -34 +41 -41 +36 +31 -31 -36 +42 +32 -32 +15 +18 -18 -15 +9 -9 -42...
output:
GSGGSGGSGGGGGGGGGGGGGSGGGGGGGGGGGGGGGGGGGG
result:
ok correct
Test #7:
score: -100
Wrong Answer
time: 1ms
memory: 3612kb
input:
42 +40 +18 +42 +2 +1 +21 +33 -2 +8 -33 -8 +14 -40 +34 +30 +31 -31 -30 +5 -5 +4 -34 +13 +3 -13 -3 -4 +28 -28 +17 -17 +35 +10 -10 +16 +39 +36 +37 -37 -36 -39 +25 +6 +41 -41 +20 +12 +32 -32 -25 -12 -16 -35 +38 -20 -38 -14 +15 -15 +9 +26 +23 -21 -1 +7 -23 +22 +24 -7 -24 -42 -18 -22 -26 -9 -6 +27 +29 -29...
output:
*
result:
wrong answer team and jury output doesn't agree on whether there's an assignment