QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#725701 | #9535. Arrow a Row | 20225954# | AC ✓ | 21ms | 5248kb | C++20 | 1.5kb | 2024-11-08 19:27:21 | 2024-11-08 19:27:21 |
Judging History
answer
#include <bits/stdc++.h>
#define db(x) cerr<<#x<<(x)<<"\n"
#define db1(x) cerr<<#x<<(x)<<" "
#define ll long long
using namespace std;
#define IOS ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
const int Mod = 1e9+7;
const int N = 2.1e5;
int a,b,c;
void solve()
{
string str;
cin>>str;
str=" "+str;
int len=str.length()-1;
if(str[1]=='-'||str[len]=='-'||str[len-1]=='-'||str[len-2]=='-'){
cout<<"No"<<'\n';
return;
}
int num=0;
int las=1;
for(int i=1;i<=len;i++){
if(str[i]=='-'){
num++;
las=i;
}
}
if(num==0){
cout<<"No"<<'\n';
return;
}
int cnt=0;
vector<pair<int,int>> v;
int now=len-4;
while(now>=las){
v.push_back({now,5});
now-=3;
}
if(v.size()>0&&v.back().first!=1) v.push_back({1,5});
int pre=1;
int i=1;
while(i<=len){
if(str[i]=='-'){
int begin=i;
while(str[i]=='-'){
i++;
}
int end=i-1;
for(int j=pre;j<begin-1;j++){
v.push_back({j,5});
}
v.push_back({begin-1,end-begin+5});
pre=i;
continue;
}
i++;
}
cout<<"Yes"<<" "<<v.size()<<'\n';
for(auto x:v){
cout<<x.first<<" "<<x.second<<'\n';
}
}
int main()
{
// cout<<ceil(1.2);
int _ =1;
cin>>_;
while(_--)solve();
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3600kb
input:
4 >>->>> >>>-> >>>>> >->>>>>>
output:
Yes 2 1 5 2 5 No No Yes 3 4 5 1 5 1 5
result:
ok ok (4 test cases)
Test #2:
score: 0
Accepted
time: 0ms
memory: 3596kb
input:
126 >->-->>>> >--->->>>> >--->-->>> >>-->->>> >>-->>>>> >>->->>>> >>->>->>>> >-->->->>> >->->>>>>> >->>> >->->>>>> >>>->->>> >>->>>>>>> >>>>>->>> >->>>->>> >>--->->>> >>->>>> >->>>>->>> >>>>-->>> >---->>> >>>---->>> >>>>->>>> >->>-->>> >-->-->>>> >>---->>> >>--->>> >->>>-->>> >>-->>>> >>---->>>> >>-...
output:
Yes 4 5 5 1 5 1 5 3 6 Yes 4 6 5 1 5 1 7 5 5 Yes 2 1 7 5 6 Yes 3 1 5 2 6 5 5 Yes 4 5 5 1 5 1 5 2 6 Yes 5 5 5 1 5 1 5 2 5 4 5 Yes 6 6 5 1 5 1 5 2 5 4 5 5 5 Yes 3 1 6 4 5 6 5 Yes 4 6 5 1 5 1 5 3 5 Yes 1 1 5 Yes 4 5 5 1 5 1 5 3 5 Yes 4 1 5 2 5 3 5 5 5 Yes 5 6 5 3 5 1 5 1 5 2 5 Yes 5 1 5 2 5 3 5 4 5 5 5 ...
result:
ok ok (126 test cases)
Test #3:
score: 0
Accepted
time: 10ms
memory: 3632kb
input:
4032 >>--->>>>>>>> >->>->->-->->>> >>--->>--->>> >>->->->>>>>>>> >->---->->>> >->>->>---->>>> >>>>>>>>->>>> >->>>--->>>->>> >->>->>-->>>>>> >->>-->---->>> >-->--->>>->>> >->---->>-->>>> >>------>>> >>>-->>--->>>>> >->->->>-->>>> >->->-->>->->>> >>->>>>-->->>>> >>>-->>->--->>> >->->>>>>->>>> >>-->->>...
output:
Yes 5 9 5 6 5 1 5 1 5 2 7 Yes 6 1 5 3 5 4 5 6 5 8 6 11 5 Yes 4 1 5 2 7 6 5 7 7 Yes 7 11 5 8 5 1 5 1 5 2 5 4 5 6 5 Yes 3 1 5 3 8 8 5 Yes 7 11 5 1 5 1 5 3 5 4 5 6 5 7 8 Yes 10 9 5 1 5 1 5 2 5 3 5 4 5 5 5 6 5 7 5 8 5 Yes 7 1 5 3 5 4 5 5 7 9 5 10 5 11 5 Yes 7 11 5 1 5 1 5 3 5 4 5 6 5 7 6 Yes 4 1 5 3 5 4...
result:
ok ok (4032 test cases)
Test #4:
score: 0
Accepted
time: 17ms
memory: 3596kb
input:
10000 >>>>->->>->>->>>> >->-->>->>->>>>>> >->->>-->--->>>>> >---->-->->>>>>>> >->-->>--->>->>>> >->>->>>>>>-->>> >>--->->-->>->>> >-->---->>>->>> >->----->->->>>>> >>--->---->-->>>> >>-->->->--->>> >----->>-->>->>>> >-->->->>>>>->>>> >>->>---->-->>> >>->>-->>>-->>> >------>->>>->>>> >->->-->->>>->>>...
output:
Yes 11 13 5 1 5 1 5 2 5 3 5 4 5 6 5 8 5 9 5 11 5 12 5 Yes 8 13 5 1 5 1 5 3 6 6 5 7 5 9 5 10 5 Yes 7 13 5 1 5 1 5 3 5 5 5 6 6 9 7 Yes 6 13 5 10 5 1 5 1 8 6 6 9 5 Yes 8 13 5 1 5 1 5 3 6 6 5 7 7 11 5 12 5 Yes 9 1 5 3 5 4 5 6 5 7 5 8 5 9 5 10 5 11 6 Yes 6 1 5 2 7 6 5 8 6 11 5 12 5 Yes 5 1 6 4 8 9 5 10 5...
result:
ok ok (10000 test cases)
Test #5:
score: 0
Accepted
time: 21ms
memory: 3548kb
input:
10000 >>>-->>>>-->---->->->-->>> >>-->>>>->-->>->>> >->-->--->--->->-->>--->>->->>-->->->>>>>>->>>>----->->--->>----->>-->>>----->->->>>--->>->>-->->->->---->>->>>-->>->->>>->->>>>->>->->>-->>>->>->>-->>>>-->>-->>>->>->->>>--->>>-->>>--->>->->>>>>->->---->>>>->>> ->->>>>--->>>>>>->>>->>>>->->-->-->>...
output:
Yes 11 1 5 2 5 3 6 6 5 7 5 8 5 9 6 12 8 17 5 19 5 21 6 Yes 9 1 5 2 6 5 5 6 5 7 5 8 5 10 6 13 5 14 5 Yes 110 1 5 3 6 6 7 10 7 14 5 16 6 19 5 20 7 24 5 25 5 27 5 29 5 30 6 33 5 35 5 37 5 38 5 39 5 40 5 41 5 42 5 44 5 45 5 46 5 47 9 53 5 55 7 59 5 60 9 66 5 67 6 70 5 71 5 72 9 78 5 80 5 82 5 83 5 84 7 ...
result:
ok ok (10000 test cases)
Test #6:
score: 0
Accepted
time: 17ms
memory: 3488kb
input:
9999 ->->--->>>>->->--->>-- ->>>--->>>-->>--->>--- -->>>>>>>- >>>->>>>>>>-- >>-->-->->----->->>>>->>->---->-> >-->->>>--->->->>->->- >->--->--->>>>->>>----->------>>-->->>> >>->>>->>>---->>>->>>>>>>>>->--->>->>>>>-->>>->->->>-->->--->->-->->>->->->>-->-->>>>>>>>--->>--->->>>-->->----->>-->->>--->-->...
output:
No No No No No No Yes 14 1 5 3 7 7 7 11 5 12 5 13 5 14 5 16 5 17 5 18 9 24 10 31 5 32 6 35 5 Yes 69 1 5 2 5 4 5 5 5 6 5 8 5 9 5 10 8 15 5 16 5 17 5 19 5 20 5 21 5 22 5 23 5 24 5 25 5 26 5 27 5 29 7 33 5 34 5 36 5 37 5 38 5 39 5 40 6 43 5 44 5 45 5 47 5 49 5 51 5 52 6 55 5 57 7 61 5 63 6 66 5 68 5 69...
result:
ok ok (9999 test cases)
Test #7:
score: 0
Accepted
time: 13ms
memory: 4208kb
input:
5 >-->>>>>--->->->>->>>>>->->-->-->->>>-->->--->>>------>->>-->>>------->>---->-->>>>>>-->>--->>-->->->>>>->-->------>>->>>>->>>-->---->--->>-->-->->--->->->->->>->-->->--->>>>->>->--->->>-->>>>>>->>>>->>--->->>-->>->->---->>>->->>->>->--->->->-->->>->->-->->------>>>->>>>>->>-->>->>>->>>>>----->---...
output:
No No Yes 48171 1 5 2 5 3 5 5 5 6 5 7 5 9 5 10 5 12 8 17 5 18 5 19 5 20 5 22 5 23 5 24 5 26 5 27 5 28 5 30 6 33 5 34 5 36 5 37 5 39 5 40 5 41 5 42 5 44 5 45 5 46 5 47 7 51 6 54 9 60 5 61 5 62 5 63 5 64 5 66 5 67 5 68 6 71 5 72 5 73 5 75 5 76 5 77 7 81 5 82 5 83 7 87 5 88 6 91 5 93 5 94 8 99 5 100 8 ...
result:
ok ok (5 test cases)
Test #8:
score: 0
Accepted
time: 21ms
memory: 5248kb
input:
5 >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>...
output:
No Yes 99997 99996 5 1 5 1 5 2 5 3 5 4 5 5 5 6 5 7 5 8 5 9 5 10 5 11 5 12 5 13 5 14 5 15 5 16 5 17 5 18 5 19 5 20 5 21 5 22 5 23 5 24 5 25 5 26 5 27 5 28 5 29 5 30 5 31 5 32 5 33 5 34 5 35 5 36 5 37 5 38 5 39 5 40 5 41 5 42 5 43 5 44 5 45 5 46 5 47 5 48 5 49 5 50 5 51 5 52 5 53 5 54 5 55 5 56 5 57 5...
result:
ok ok (5 test cases)
Test #9:
score: 0
Accepted
time: 20ms
memory: 3856kb
input:
20 >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>...
output:
Yes 21000 24996 5 24993 5 24990 5 24987 5 24984 5 24981 5 24978 5 24975 5 24972 5 24969 5 24966 5 24963 5 24960 5 24957 5 24954 5 24951 5 24948 5 24945 5 24942 5 24939 5 24936 5 24933 5 24930 5 24927 5 24924 5 24921 5 24918 5 24915 5 24912 5 24909 5 24906 5 24903 5 24900 5 24897 5 24894 5 24891 5 24...
result:
ok ok (20 test cases)
Test #10:
score: 0
Accepted
time: 19ms
memory: 3916kb
input:
20 >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>...
output:
Yes 9852 24996 5 24993 5 24990 5 24987 5 24984 5 24981 5 24978 5 24975 5 24972 5 24969 5 24966 5 24963 5 24960 5 24957 5 24954 5 24951 5 24948 5 24945 5 24942 5 24939 5 24936 5 24933 5 24930 5 24927 5 24924 5 24921 5 24918 5 24915 5 24912 5 24909 5 24906 5 24903 5 24900 5 24897 5 24894 5 24891 5 248...
result:
ok ok (20 test cases)
Extra Test:
score: 0
Extra Test Passed