QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#414521 | #2923. Code Guessing | TheSleepyDevil# | AC ✓ | 1ms | 3792kb | C++14 | 2.3kb | 2024-05-19 06:41:38 | 2024-05-19 06:41:39 |
Judging History
answer
/*
Hell, 'til I reach Hell, I ain't scared
Mama checkin' in my bedroom, I ain't there
*/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define Major ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define TxtIO freopen("input.txt","r",stdin); freopen("output.txt","w",stdout);
#define read(a,n) for(int i = 0 ; i<n ; i++) cin>>a[i];
#define write(a) for(auto x : a) cout<<x<<" ";
#define int long long
#define pb push_back
#define all(a) a.begin(),a.end()
#define el "\n"
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
const int inf=4e18;
int dx[]={1,0,-1,0,1,1,-1,-1};
int dy[]={0,1,0,-1,1,-1,1,-1};
const int mod=1e9+7;
const int MAX =1e6+7;
// ---------------------------Function----------------------------------//
void TestCake(){
int p,q;
cin>>p>>q;
string s;
cin>>s;
int st=0;
vector<int>ids;
for(int i=0;i<s.size();i++){
if(s[i]=='A'&&!st){
s[i]=p+'0';
st=1;
}
else if(s[i]=='A'){
s[i]=q+'0';
}
else{
ids.pb(i);
}
}
int ok=0,f=0,sz=0;
for(int i=1;i<=9;i++){
if(i==p ||i==q)continue;
string tmp=s;
tmp[ids[0]]=(i+'0');
for(int j=1;j<=9;j++){
if(j==p || j==q ||i==j)continue;
tmp[ids[1]]=(j+'0');
if(is_sorted(all(tmp))){
// cout<<tmp<<el;
f=i,sz=j;
ok++;
}
}
}
if(ok==1){
cout<<f<<" "<<sz;
}
else{
cout<<-1;
}
}
//------------------------------Main---------------------------//
signed main(){
Major
int T = 1;
// cin >> T;
while(T--){
TestCake();
// cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3572kb
input:
3 4 BBAA
output:
1 2
result:
ok single line: '1 2'
Test #2:
score: 0
Accepted
time: 0ms
memory: 3576kb
input:
3 7 BBAA
output:
1 2
result:
ok single line: '1 2'
Test #3:
score: 0
Accepted
time: 0ms
memory: 3576kb
input:
3 9 BBAA
output:
1 2
result:
ok single line: '1 2'
Test #4:
score: 0
Accepted
time: 0ms
memory: 3564kb
input:
5 6 BBAA
output:
-1
result:
ok single line: '-1'
Test #5:
score: 0
Accepted
time: 1ms
memory: 3460kb
input:
6 7 AABB
output:
8 9
result:
ok single line: '8 9'
Test #6:
score: 0
Accepted
time: 0ms
memory: 3664kb
input:
3 7 AABB
output:
8 9
result:
ok single line: '8 9'
Test #7:
score: 0
Accepted
time: 0ms
memory: 3516kb
input:
1 7 AABB
output:
8 9
result:
ok single line: '8 9'
Test #8:
score: 0
Accepted
time: 0ms
memory: 3572kb
input:
4 5 AABB
output:
-1
result:
ok single line: '-1'
Test #9:
score: 0
Accepted
time: 1ms
memory: 3516kb
input:
1 4 ABBA
output:
2 3
result:
ok single line: '2 3'
Test #10:
score: 0
Accepted
time: 1ms
memory: 3792kb
input:
3 6 ABBA
output:
4 5
result:
ok single line: '4 5'
Test #11:
score: 0
Accepted
time: 0ms
memory: 3580kb
input:
4 7 ABBA
output:
5 6
result:
ok single line: '5 6'
Test #12:
score: 0
Accepted
time: 0ms
memory: 3572kb
input:
5 9 ABBA
output:
-1
result:
ok single line: '-1'
Test #13:
score: 0
Accepted
time: 1ms
memory: 3508kb
input:
1 5 ABBA
output:
-1
result:
ok single line: '-1'
Test #14:
score: 0
Accepted
time: 0ms
memory: 3508kb
input:
2 7 ABBA
output:
-1
result:
ok single line: '-1'
Test #15:
score: 0
Accepted
time: 0ms
memory: 3508kb
input:
1 9 ABBA
output:
-1
result:
ok single line: '-1'
Test #16:
score: 0
Accepted
time: 0ms
memory: 3716kb
input:
2 8 BAAB
output:
1 9
result:
ok single line: '1 9'
Test #17:
score: 0
Accepted
time: 0ms
memory: 3580kb
input:
3 8 BAAB
output:
-1
result:
ok single line: '-1'
Test #18:
score: 0
Accepted
time: 0ms
memory: 3508kb
input:
2 6 BAAB
output:
-1
result:
ok single line: '-1'
Test #19:
score: 0
Accepted
time: 0ms
memory: 3576kb
input:
4 5 BAAB
output:
-1
result:
ok single line: '-1'
Test #20:
score: 0
Accepted
time: 0ms
memory: 3516kb
input:
6 8 ABAB
output:
7 9
result:
ok single line: '7 9'
Test #21:
score: 0
Accepted
time: 1ms
memory: 3512kb
input:
4 8 ABAB
output:
-1
result:
ok single line: '-1'
Test #22:
score: 0
Accepted
time: 0ms
memory: 3708kb
input:
3 7 ABAB
output:
-1
result:
ok single line: '-1'
Test #23:
score: 0
Accepted
time: 0ms
memory: 3788kb
input:
5 7 ABAB
output:
-1
result:
ok single line: '-1'
Test #24:
score: 0
Accepted
time: 1ms
memory: 3508kb
input:
1 3 ABAB
output:
-1
result:
ok single line: '-1'
Test #25:
score: 0
Accepted
time: 0ms
memory: 3576kb
input:
2 4 BABA
output:
1 3
result:
ok single line: '1 3'
Test #26:
score: 0
Accepted
time: 0ms
memory: 3732kb
input:
2 5 BABA
output:
-1
result:
ok single line: '-1'
Test #27:
score: 0
Accepted
time: 1ms
memory: 3512kb
input:
3 5 BABA
output:
-1
result:
ok single line: '-1'
Test #28:
score: 0
Accepted
time: 0ms
memory: 3704kb
input:
7 9 BABA
output:
-1
result:
ok single line: '-1'
Test #29:
score: 0
Accepted
time: 0ms
memory: 3480kb
input:
6 9 ABBA
output:
7 8
result:
ok single line: '7 8'
Test #30:
score: 0
Accepted
time: 0ms
memory: 3736kb
input:
2 5 BAAB
output:
-1
result:
ok single line: '-1'