QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #763502 | #9629. 小 C 的神秘图形 | YFffffff | WA | 1ms | 3832kb | C++11 | 599b | 2024-11-19 20:41:49 | 2024-11-19 20:41:50 |
Judging History
answer
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 2e5 + 10, INF = 1e18, MOD = 1e9 + 7;
typedef pair<int, int> PII;
typedef unsigned long long ull;
int dx[] = {0, 0, 1, -1}, dy[] = {1, -1, 0, 0};
int arr[N], brr[N];
bool st[N];
int n, m, k;
void solve()
{
cin >> n;
string a,b;
cin >> a >> b;
int ans[3][3] = {{0,1,0},{1,1,1},{0,1,0}};
int x = a[n - 1] - '0', y = b[n - 1] - '0';
cout << ans[x][y];
}
signed main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int T = 1;
// cin >> T;
while (T --) solve();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3832kb
input:
96 122100012110202022211102020101110122101010001012220001000222210100222112111020002212000222012022 010112102102202201211121022102211110211010101020001021100101110202100010112221022001101222101102
output:
0
result:
ok single line: '0'
Test #2:
score: 0
Accepted
time: 0ms
memory: 3624kb
input:
100 2101120010010021010112120010111111212001120112101221211001111101012021111111211111110120002210111111 1010111101111111121211011101011101111111011201111110112110001211101110200102102020021011111121221102
output:
1
result:
ok single line: '1'
Test #3:
score: 0
Accepted
time: 1ms
memory: 3752kb
input:
99964 101002101200222202100122011200221000211122121100220122120000211012222202201100020022111022100011102001110202020022221021121112222001000000222111110122022101020102020201020220110010111110212211102001211220111201120022022100121110122112202222122121210221211011100112021210022011100222220001021120...
output:
0
result:
ok single line: '0'
Test #4:
score: 0
Accepted
time: 0ms
memory: 3640kb
input:
99951 210210010000101201101221221111222021121110110111211121000221100101112021101122111212111111221211211111110020101222110220011121002221000101112210111111211101012112001111111022111210112111101222121112021110101121011122120022111101110100010121000001112102211211211110111101122121110011112111220101...
output:
1
result:
ok single line: '1'
Test #5:
score: -100
Wrong Answer
time: 0ms
memory: 3792kb
input:
99943 011221000000210101021220102000020221110121222200111110000002210121002112122010100110200120110110202201201212021102101201112202210100000202011011220010210101201000012222122200021122022222120212112222111122211210120101120200212101022112221210210202202102020110101111010100010011002222212101111112...
output:
1
result:
wrong answer 1st lines differ - expected: '0', found: '1'