QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#755805 | #9629. 小 C 的神秘图形 | proking# | AC ✓ | 1ms | 4036kb | C++14 | 1.5kb | 2024-11-16 18:04:13 | 2024-11-16 18:04:14 |
Judging History
answer
#include <bits/stdc++.h>
#define F(i, a, b) for (int i = a; i <= b; i ++)
#define G(i, a, b) for (int i = a; i >= b; i --)
#define max(a, b) ((a) > (b) ? (a) : (b))
#define min(a, b) ((a) < (b) ? (a) : (b))
#define mx(a, b) ((a) = max(a, b))
#define mn(a, b) ((a) = min(a, b))
#define get getchar()
#define putc putchar
#define outarr(a, L, R) { printf(#a"[%d..%d]", L, R); F(i, L, R) W(a[i]), putc(' ') ; putc('\n'); }
#define out1(x) { printf(#x" = "), W(x), putc('\n'); }
#define out2(x, y) { printf(#x" = "), W(x), printf(" "#y" = "), W(y), putc('\n'); }
#define out3(x, y, z) { printf(#x" = "), W(x), printf(" "#y" = "), W(y), printf(" "#z" = "), W(z), putc('\n'); }
using namespace std;
template <typename Int>
void R(Int &x) {
char c = get; x = 0; Int t = 1;
for (; !isdigit(c); c = get) t = (c == '-' ? -1 : t);
for (; isdigit(c); x = (x << 3) + (x << 1) + c - '0', c = get); x *= t;
}
template <typename Int>
void W(Int x) {
if (x < 0) { putc('-'); x = - x; }
if (x > 9) W(x / 10); putc(x % 10 + '0');
}
#define pb push_back
#define ll long long
const int N = 1e5 + 10;
char s1[N], s2[N];
int n;
int main() {
// freopen("data.in","r",stdin);
R(n);
scanf("%s", s1 + 1);
scanf("%s", s2 + 1);
G(i, n, 1) {
if (i == 1) {
if (s1[i] == '1' || s2[i] == '1')
puts("1");
else
puts("0");
return 0;
}
if (s1[i] == '1' || s2[i] == '1')
continue;
puts("0");
return 0;
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3584kb
input:
96 122100012110202022211102020101110122101010001012220001000222210100222112111020002212000222012022 010112102102202201211121022102211110211010101020001021100101110202100010112221022001101222101102
output:
0
result:
ok single line: '0'
Test #2:
score: 0
Accepted
time: 0ms
memory: 3556kb
input:
100 2101120010010021010112120010111111212001120112101221211001111101012021111111211111110120002210111111 1010111101111111121211011101011101111111011201111110112110001211101110200102102020021011111121221102
output:
1
result:
ok single line: '1'
Test #3:
score: 0
Accepted
time: 1ms
memory: 3828kb
input:
99964 101002101200222202100122011200221000211122121100220122120000211012222202201100020022111022100011102001110202020022221021121112222001000000222111110122022101020102020201020220110010111110212211102001211220111201120022022100121110122112202222122121210221211011100112021210022011100222220001021120...
output:
0
result:
ok single line: '0'
Test #4:
score: 0
Accepted
time: 1ms
memory: 3952kb
input:
99951 210210010000101201101221221111222021121110110111211121000221100101112021101122111212111111221211211111110020101222110220011121002221000101112210111111211101012112001111111022111210112111101222121112021110101121011122120022111101110100010121000001112102211211211110111101122121110011112111220101...
output:
1
result:
ok single line: '1'
Test #5:
score: 0
Accepted
time: 1ms
memory: 3820kb
input:
99943 011221000000210101021220102000020221110121222200111110000002210121002112122010100110200120110110202201201212021102101201112202210100000202011011220010210101201000012222122200021122022222120212112222111122211210120101120200212101022112221210210202202102020110101111010100010011002222212101111112...
output:
0
result:
ok single line: '0'
Test #6:
score: 0
Accepted
time: 1ms
memory: 3948kb
input:
99930 221111110121110102000211111010111112111111021120112221200101010100111001100012111011021221001101112110221111112010110001011112011121021122202012110100112111111121111212011111111121121010101120011101111212002111120110101101010111111110011121011201112112001201211121102112121121200110111010022200...
output:
1
result:
ok single line: '1'
Test #7:
score: 0
Accepted
time: 1ms
memory: 3956kb
input:
99933 211012211021101111200221100201211222210221210010001122002021120120022011002122210200011200020121111200011000212101220112100220222011212212112010001112212100100222201002020022020202111001121011112212220201011110212222202201200010020122202002110011122221202221100200021011202000221020202022001111...
output:
0
result:
ok single line: '0'
Test #8:
score: 0
Accepted
time: 1ms
memory: 4008kb
input:
99903 022011011111011110120222112111121110211221111110112122110020111012110211111210211001101100121110211111122011210110121112112021212100121011210111111101111111210111111000210021011112111111121112211220110201021102111121101022111121202011112111111110120211012111001111201011110201001102001001121200...
output:
1
result:
ok single line: '1'
Test #9:
score: 0
Accepted
time: 1ms
memory: 4028kb
input:
99997 121112102210010010010102011021011002020101110121220121101111110222111200001112212001112100001000222012112102001100012110221102101002000002220200211122011212102101010202011012010120001110121011201220202122200010020201222120021212222012222022001121012001121122010202201012100120001101020201201210...
output:
0
result:
ok single line: '0'
Test #10:
score: 0
Accepted
time: 1ms
memory: 4036kb
input:
99909 111111211121101011102000221111001100011111211111022102101111002111012201100002210112210012021012111102202212111111121221101211111121111121012021111111211112110011211211122121010112122110022111001110211201110110021002010112111111101211112211110112102111111121121101211102201112211121112122110211...
output:
1
result:
ok single line: '1'