QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#368337 | #8509. Expanding STACKS! | ucup-team134# | WA | 1ms | 3948kb | C++17 | 1.3kb | 2024-03-27 01:01:41 | 2024-03-27 01:01:50 |
Judging History
answer
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define f first
#define s second
#define sz(x) (int)(x).size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define ios ios_base::sync_with_stdio(false);cin.tie(NULL)
#define ld long double
#define li __int128
using namespace std;
int main()
{
int n;
cin >> n;
vector<int> in(n,-1),out(n);
vector<int> ord;
for(int i=0;i<2*n;i++){
string s;
cin >> s;
s=s.substr(1);
int x=stoi(s)-1;
if(in[x]==-1){
in[x]=i;
ord.pb(x);
}
else{
out[x]=i;
}
}
vector<int> ans(n);
vector<int> a,b;
for(auto i:ord){
int tr=in[i];
while(sz(a)&&a.back()<tr)a.pop_back();
while(sz(b)&&b.back()<tr)b.pop_back();
//printf("%i %i\n",in[i],out[i]);
bool canA=sz(a)==0||a.back()>out[i];
bool canB=sz(b)==0||b.back()>out[i];
//cout << i << " " << canA << " " << canB << endl;
if(!canA&&!canB){
printf("*\n");
return 0;
}
if(canA&&canB){
if(sz(b)==0||(sz(a)!=0&&a.back()<b.back())){
a.pb(out[i]);
ans[i]=0;
}
else{
b.pb(out[i]);
ans[i]=1;
}
continue;
}
if(canA){
a.pb(out[i]);
ans[i]=0;
}
else{
b.pb(out[i]);
ans[i]=1;
}
}
for(int i=0;i<n;i++){
if(ans[i])printf("G");
else printf("S");
}
printf("\n");
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3880kb
input:
2 +2 +1 -1 -2
output:
SS
result:
ok correct
Test #2:
score: 0
Accepted
time: 0ms
memory: 3672kb
input:
2 +1 +2 -1 -2
output:
SG
result:
ok correct
Test #3:
score: 0
Accepted
time: 0ms
memory: 3736kb
input:
3 +1 +2 +3 -1 -2 -3
output:
*
result:
ok correct
Test #4:
score: 0
Accepted
time: 1ms
memory: 3596kb
input:
10 +3 -3 +4 -4 +6 +2 -2 -6 +7 -7 +5 -5 +10 +1 +9 +8 -8 -9 -1 -10
output:
SSSSSSSSSS
result:
ok correct
Test #5:
score: 0
Accepted
time: 0ms
memory: 3588kb
input:
10 +8 -8 +2 +10 -2 -10 +7 -7 +1 -1 +6 -6 +5 +3 +4 +9 -9 -4 -3 -5
output:
SSSSSSSSSG
result:
ok correct
Test #6:
score: 0
Accepted
time: 0ms
memory: 3532kb
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:
SGSSGSSGSGSSSSSSGSSSSGGGSSGSGSSSSSSSSGGSSS
result:
ok correct
Test #7:
score: 0
Accepted
time: 0ms
memory: 3944kb
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:
GSGSGSGSSGSSSGGGGGSSGSSSGSSGSGGGGGGGGGGSGG
result:
ok correct
Test #8:
score: 0
Accepted
time: 0ms
memory: 3676kb
input:
42 +29 +6 +7 +2 -7 -2 +23 -23 -6 -29 +19 -19 +16 +8 -16 -8 +32 -32 +3 +37 +17 -17 -37 -3 +22 -22 +18 +1 +40 +36 -1 -36 -40 -18 +9 -9 +30 +25 -25 +14 +39 +5 +20 -5 +12 -39 +28 +10 -14 +24 -24 +35 +15 -15 +41 -30 +33 -33 -41 -35 -10 -28 -12 +21 +38 -38 -21 +11 +13 -13 +4 +42 +27 +34 -34 +31 -31 +26 -2...
output:
SGSGSSSGSGGGGSSSSSSGGSSSSGGGSSGSGGGGSGSGGG
result:
ok correct
Test #9:
score: 0
Accepted
time: 0ms
memory: 3696kb
input:
100 +39 -39 +4 +71 -71 +53 -53 +46 -46 -4 +91 -91 +97 -97 +6 -6 +54 -54 +76 +35 -35 +50 +89 -89 +98 -50 -76 -98 +34 +55 +95 -34 +36 -36 +73 -95 -55 +18 +47 +20 +30 +33 -30 -33 +80 -73 +51 -51 -80 -20 +69 +77 -69 +85 +62 +84 -84 -77 +48 +49 -49 +1 -1 -48 +19 -19 -62 -85 +41 +16 -16 -41 +63 +2 -2 +65 ...
output:
GGSSSSGGSGSGSGSGSGGGSGSGSGSSSSSGGSSGGSSSGSSSSSGGGSGSSSGGGSSSSGGSGGSSGSSSSSGSSSGGSSGSGSSSSSSSSSGSSGGS
result:
ok correct
Test #10:
score: 0
Accepted
time: 0ms
memory: 3868kb
input:
100 +5 -5 +61 +48 +60 +69 +7 -7 -69 -60 +45 -45 -48 -61 +68 +4 +82 +57 -57 +12 -12 +22 +46 -46 -22 +14 +30 -30 +47 -47 -14 +94 -94 -82 +44 +27 -27 -44 +86 -86 -4 +50 +15 -15 -50 -68 +58 -58 +28 +83 -83 -28 +53 +1 +56 -56 +67 +13 +73 +87 +19 +65 +18 -18 +17 -17 +89 +62 -62 -89 +72 -72 +25 -25 -65 +98...
output:
SSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSS
result:
ok correct
Test #11:
score: 0
Accepted
time: 1ms
memory: 3948kb
input:
100 +96 +64 -64 +41 +11 +62 +18 +25 +3 +26 -26 -3 +22 +61 +59 +73 -59 -73 -61 -62 +20 -41 -20 +46 -46 -22 +2 +10 -10 -2 -25 -18 +9 -9 -11 +60 +33 +97 +38 -38 +5 -5 -97 +81 +29 -29 -81 +92 +1 +52 -52 +87 +19 -19 +90 -90 -87 -1 -92 -33 -60 -96 +47 +6 +72 -72 +79 +98 +45 -45 +23 -23 -98 +35 -35 +27 -27...
output:
SGSSSSSSGGGSSSSSSGSGSGSSGSSSSSSSSSSSSSSSSSSSSGSSSSSSSSSSSSSSSSSSSSSSSSSSGSSSSSSSSSSSSSSSSSSSSSSSSSSS
result:
ok correct
Test #12:
score: -100
Wrong Answer
time: 0ms
memory: 3644kb
input:
171 +118 +125 +156 +76 +123 +61 +107 +15 +160 -15 -107 -160 +98 +127 -127 +152 -61 -123 +48 +139 +86 -86 +43 +129 +164 +167 +6 +9 +137 +20 +16 -20 -16 +11 +12 +133 +24 -24 -137 -133 +81 +71 +88 +142 -142 +105 -88 +93 +33 -33 -105 +85 +64 -64 +150 +5 -150 +121 -85 +1 -121 +41 -5 +53 +67 +3 -3 +72 +10...
output:
*
result:
wrong answer team and jury output doesn't agree on whether there's an assignment