QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#754779 | #9629. 小 C 的神秘图形 | Rosmontis_L# | WA | 1ms | 3812kb | C++20 | 727b | 2024-11-16 15:47:04 | 2024-11-16 15:47:06 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> PLL;
void solve(){
ll n;
cin >> n;
string s1, s2;
cin >> s1 >> s2;
string l1, r1;
while(l1.size() < n){
l1 += '0';
r1 += '0';
}
l1[0] = 1;
r1[0] = 2;
if(s1[0] != '1' && s2[0] != '1'){
cout << 0 << '\n';
return;
}
ll x1 = (s1.back() - '0'), y1 = (s2.back() - '0');
if(x1 == 1 || y1 == 1){
cout << 1 << '\n';
}
else
cout << 0 << '\n';
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int t = 1;
//cin >> t;
while(t --){
solve();
}
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3648kb
input:
96 122100012110202022211102020101110122101010001012220001000222210100222112111020002212000222012022 010112102102202201211121022102211110211010101020001021100101110202100010112221022001101222101102
output:
0
result:
ok single line: '0'
Test #2:
score: 0
Accepted
time: 0ms
memory: 3780kb
input:
100 2101120010010021010112120010111111212001120112101221211001111101012021111111211111110120002210111111 1010111101111111121211011101011101111111011201111110112110001211101110200102102020021011111121221102
output:
1
result:
ok single line: '1'
Test #3:
score: 0
Accepted
time: 0ms
memory: 3812kb
input:
99964 101002101200222202100122011200221000211122121100220122120000211012222202201100020022111022100011102001110202020022221021121112222001000000222111110122022101020102020201020220110010111110212211102001211220111201120022022100121110122112202222122121210221211011100112021210022011100222220001021120...
output:
0
result:
ok single line: '0'
Test #4:
score: 0
Accepted
time: 1ms
memory: 3728kb
input:
99951 210210010000101201101221221111222021121110110111211121000221100101112021101122111212111111221211211111110020101222110220011121002221000101112210111111211101012112001111111022111210112111101222121112021110101121011122120022111101110100010121000001112102211211211110111101122121110011112111220101...
output:
1
result:
ok single line: '1'
Test #5:
score: 0
Accepted
time: 1ms
memory: 3804kb
input:
99943 011221000000210101021220102000020221110121222200111110000002210121002112122010100110200120110110202201201212021102101201112202210100000202011011220010210101201000012222122200021122022222120212112222111122211210120101120200212101022112221210210202202102020110101111010100010011002222212101111112...
output:
0
result:
ok single line: '0'
Test #6:
score: 0
Accepted
time: 1ms
memory: 3748kb
input:
99930 221111110121110102000211111010111112111111021120112221200101010100111001100012111011021221001101112110221111112010110001011112011121021122202012110100112111111121111212011111111121121010101120011101111212002111120110101101010111111110011121011201112112001201211121102112121121200110111010022200...
output:
1
result:
ok single line: '1'
Test #7:
score: -100
Wrong Answer
time: 1ms
memory: 3792kb
input:
99933 211012211021101111200221100201211222210221210010001122002021120120022011002122210200011200020121111200011000212101220112100220222011212212112010001112212100100222201002020022020202111001121011112212220201011110212222202201200010020122202002110011122221202221100200021011202000221020202022001111...
output:
1
result:
wrong answer 1st lines differ - expected: '0', found: '1'