QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#699263 | #9535. Arrow a Row | ucup-team3586# | AC ✓ | 20ms | 5328kb | C++23 | 1.3kb | 2024-11-02 08:07:17 | 2024-11-02 08:07:18 |
Judging History
answer
//Author: Kevin
#include<bits/stdc++.h>
//#pragma GCC optimize("O2")
using namespace std;
#define ll long long
#define ull unsigned ll
#define pb emplace_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
#define srt(x) sort(ALL(x))
#define rev(x) reverse(ALL(x))
#define rsrt(x) sort(rALL(x))
#define sz(x) (int)(x.size())
#define inf 0x3f3f3f3f
#define pii pair<int,int>
#define lb(v,x) (int)(lower_bound(ALL(v),x)-v.begin())
#define ub(v,x) (int)(upper_bound(ALL(v),x)-v.begin())
#define uni(v) v.resize(unique(ALL(v))-v.begin())
#define longer __int128_t
void die(string S){puts(S.c_str());exit(0);}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t;
cin>>t;
while(t--)
{
string s;
cin>>s;
int n=sz(s);
if(s[n-1]!='>'||s[n-2]!='>'||s[n-3]!='>'||s[0]!='>')
cout<<"No\n";
else
{
int p=-1;
for(int i=0;i<n;i++)
if(s[i]=='-')
p=i;
if(p==-1)
cout<<"No\n";
else
{
vector<pii> vec;
for(int i=n-1;i>=p+3;i--)
vec.pb(1,i+1);
for(int i=0;i<p;i++)
if(s[i]=='>')
vec.pb(i+1,p+4);
cout<<"Yes "<<sz(vec)<<'\n';
for(auto pr:vec)
cout<<pr.first<<" "<<pr.second-pr.first+1<<'\n';
}
}
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3836kb
input:
4 >>->>> >>>-> >>>>> >->>>>>>
output:
Yes 3 1 6 1 6 2 5 No No Yes 5 1 8 1 7 1 6 1 5 1 5
result:
ok ok (4 test cases)
Test #2:
score: 0
Accepted
time: 0ms
memory: 3868kb
input:
126 >->-->>>> >--->->>>> >--->-->>> >>-->->>> >>-->>>>> >>->->>>> >>->>->>>> >-->->->>> >->->>>>>> >->>> >->->>>>> >>>->->>> >>->>>>>>> >>>>>->>> >->>>->>> >>--->->>> >>->>>> >->>>>->>> >>>>-->>> >---->>> >>>---->>> >>>>->>>> >->>-->>> >-->-->>>> >>---->>> >>--->>> >->>>-->>> >>-->>>> >>---->>>> >>-...
output:
Yes 4 1 9 1 8 1 8 3 6 Yes 4 1 10 1 9 1 9 5 5 Yes 3 1 10 1 10 5 6 Yes 4 1 9 1 9 2 8 5 5 Yes 5 1 9 1 8 1 7 1 7 2 6 Yes 5 1 9 1 8 1 8 2 7 4 5 Yes 6 1 10 1 9 1 9 2 8 4 6 5 5 Yes 4 1 10 1 10 4 7 6 5 Yes 6 1 10 1 9 1 8 1 7 1 7 3 5 Yes 2 1 5 1 5 Yes 5 1 9 1 8 1 7 1 7 3 5 Yes 5 1 9 1 9 2 8 3 7 5 5 Yes 7 1 1...
result:
ok ok (126 test cases)
Test #3:
score: 0
Accepted
time: 4ms
memory: 3644kb
input:
4032 >>--->>>>>>>> >->>->->-->->>> >>--->>--->>> >>->->->>>>>>>> >->---->->>> >->>->>---->>>> >>>>>>>>->>>> >->>>--->>>->>> >->>->>-->>>>>> >->>-->---->>> >-->--->>>->>> >->---->>-->>>> >>------>>> >>>-->>--->>>>> >->->->>-->>>> >->->-->>->->>> >>->>>>-->->>>> >>>-->>->--->>> >->->>>>>->>>> >>-->->>...
output:
Yes 8 1 13 1 12 1 11 1 10 1 9 1 8 1 8 2 7 Yes 7 1 15 1 15 3 13 4 12 6 10 8 8 11 5 Yes 5 1 13 1 13 2 12 6 8 7 7 Yes 10 1 15 1 14 1 13 1 12 1 11 1 10 1 10 2 9 4 7 6 5 Yes 4 1 12 1 12 3 10 8 5 Yes 7 1 15 1 14 1 14 3 12 4 11 6 9 7 8 Yes 10 1 13 1 12 1 12 2 11 3 10 4 9 5 8 6 7 7 6 8 5 Yes 8 1 15 1 15 3 1...
result:
ok ok (4032 test cases)
Test #4:
score: 0
Accepted
time: 6ms
memory: 3880kb
input:
10000 >>>>->->>->>->>>> >->-->>->>->>>>>> >->->>-->--->>>>> >---->-->->>>>>>> >->-->>--->>->>>> >->>->>>>>>-->>> >>--->->-->>->>> >-->---->>>->>> >->----->->->>>>> >>--->---->-->>>> >>-->->->--->>> >----->>-->>->>>> >-->->->>>>>->>>> >>->>---->-->>> >>->>-->>>-->>> >------>->>>->>>> >->->-->->>>->>>...
output:
Yes 11 1 17 1 16 1 16 2 15 3 14 4 13 6 11 8 9 9 8 11 6 12 5 Yes 10 1 17 1 16 1 15 1 14 1 14 3 12 6 9 7 8 9 6 10 5 Yes 8 1 17 1 16 1 15 1 15 3 13 5 11 6 10 9 7 Yes 8 1 17 1 16 1 15 1 14 1 13 1 13 6 8 9 5 Yes 8 1 17 1 16 1 16 3 14 6 11 7 10 11 6 12 5 Yes 10 1 16 1 16 3 14 4 13 6 11 7 10 8 9 9 8 10 7 1...
result:
ok ok (10000 test cases)
Test #5:
score: 0
Accepted
time: 15ms
memory: 3548kb
input:
10000 >>>-->>>>-->---->->->-->>> >>-->>>>->-->>->>> >->-->--->--->->-->>--->>->->>-->->->>>>>>->>>>----->->--->>----->>-->>>----->->->>>--->>->>-->->->->---->>->>>-->>->->>>->->>>>->>->->>-->>>->>->>-->>>>-->>-->>>->>->->>>--->>>-->>>--->>->->>>>>->->---->>>>->>> ->->>>>--->>>>>>->>>->>>>->->-->-->>...
output:
Yes 12 1 26 1 26 2 25 3 24 6 21 7 20 8 19 9 18 12 15 17 10 19 8 21 6 Yes 10 1 18 1 18 2 17 5 14 6 13 7 12 8 11 10 9 13 6 14 5 Yes 111 1 211 1 211 3 209 6 206 10 202 14 198 16 196 19 193 20 192 24 188 25 187 27 185 29 183 30 182 33 179 35 177 37 175 38 174 39 173 40 172 41 171 42 170 44 168 45 167 46...
result:
ok ok (10000 test cases)
Test #6:
score: 0
Accepted
time: 15ms
memory: 3596kb
input:
9999 ->->--->>>>->->--->>-- ->>>--->>>-->>--->>--- -->>>>>>>- >>>->>>>>>>-- >>-->-->->----->->>>>->>->---->-> >-->->>>--->->->>->->- >->--->--->>>>->>>----->------>>-->->>> >>->>>->>>---->>>->>>>>>>>>->--->>->>>>>-->>>->->->>-->->--->->-->->>->->->>-->-->>>>>>>>--->>--->->>>-->->----->>-->->>--->-->...
output:
No No No No No No Yes 15 1 39 1 39 3 37 7 33 11 29 12 28 13 27 14 26 16 24 17 23 18 22 24 16 31 9 32 8 35 5 Yes 70 1 129 1 129 2 128 4 126 5 125 6 124 8 122 9 121 10 120 15 115 16 114 17 113 19 111 20 110 21 109 22 108 23 107 24 106 25 105 26 104 27 103 29 101 33 97 34 96 36 94 37 93 38 92 39 91 40 ...
result:
ok ok (9999 test cases)
Test #7:
score: 0
Accepted
time: 13ms
memory: 4524kb
input:
5 >-->>>>>--->->->>->>>>>->->-->-->->>>-->->--->>>------>->>-->>>------->>---->-->>>>>>-->>--->>-->->->>>>->-->------>>->>>>->>>-->---->--->>-->-->->--->->->->->>->-->->--->>>>->>->--->->>-->>>>>>->>>>->>--->->>-->>->->---->>>->->>->>->--->->->-->->>->->-->->------>>>->>>>>->>-->>->>>->>>>>----->---...
output:
No No Yes 48172 1 95948 1 95948 2 95947 3 95946 5 95944 6 95943 7 95942 9 95940 10 95939 12 95937 17 95932 18 95931 19 95930 20 95929 22 95927 23 95926 24 95925 26 95923 27 95922 28 95921 30 95919 33 95916 34 95915 36 95913 37 95912 39 95910 40 95909 41 95908 42 95907 44 95905 45 95904 46 95903 47 9...
result:
ok ok (5 test cases)
Test #8:
score: 0
Accepted
time: 20ms
memory: 5328kb
input:
5 >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>...
output:
No Yes 99997 1 100000 1 99999 1 99999 2 99998 3 99997 4 99996 5 99995 6 99994 7 99993 8 99992 9 99991 10 99990 11 99989 12 99988 13 99987 14 99986 15 99985 16 99984 17 99983 18 99982 19 99981 20 99980 21 99979 22 99978 23 99977 24 99976 25 99975 26 99974 27 99973 28 99972 29 99971 30 99970 31 99969 ...
result:
ok ok (5 test cases)
Test #9:
score: 0
Accepted
time: 18ms
memory: 3800kb
input:
20 >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>...
output:
Yes 24995 1 25000 1 24999 1 24998 1 24997 1 24996 1 24995 1 24994 1 24993 1 24992 1 24991 1 24990 1 24989 1 24988 1 24987 1 24986 1 24985 1 24984 1 24983 1 24982 1 24981 1 24980 1 24979 1 24978 1 24977 1 24976 1 24975 1 24974 1 24973 1 24972 1 24971 1 24970 1 24969 1 24968 1 24967 1 24966 1 24965 1 ...
result:
ok ok (20 test cases)
Test #10:
score: 0
Accepted
time: 15ms
memory: 4000kb
input:
20 >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>...
output:
Yes 24997 1 25000 1 24999 1 24998 1 24997 1 24996 1 24995 1 24994 1 24993 1 24992 1 24991 1 24990 1 24989 1 24988 1 24987 1 24986 1 24985 1 24984 1 24983 1 24982 1 24981 1 24980 1 24979 1 24978 1 24977 1 24976 1 24975 1 24974 1 24973 1 24972 1 24971 1 24970 1 24969 1 24968 1 24967 1 24966 1 24965 1 ...
result:
ok ok (20 test cases)
Extra Test:
score: 0
Extra Test Passed