QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #780969 | #9629. 小 C 的神秘图形 | _Strelitzia# | WA | 0ms | 3736kb | C++23 | 779b | 2024-11-25 14:12:18 | 2024-11-25 14:12:19 |
Judging History
answer
#include <bits/stdc++.h>
#define lowbit(x) (x & -x)
#define int long long
#define lc (p << 1)
#define rc (p << 1 | 1)
using namespace std;
typedef pair<int, int> PII;
mt19937_64 rnd(chrono::steady_clock::now().time_since_epoch().count());
const int N = 2e5 + 5, M = 1e6 + 5, INF = 0x3f3f3f3f, mod = 998244353;
int T = 1, n, m;
char s[N];
void solve() {
cin >> n;
int ans = 1;
for (int i = 1; i <= n; i++) {
cin >> s[i];
if (s[i] == '2' && i < n) ans = 0;
}
int x = s[n] - '0', y;
for (int i = 1; i <= n; i++) {
cin >> s[i];
if (s[i] == '2' && i < n) ans = 0;
}
y = s[n] - '0';
if (x != 1 && y != 1) ans = 0;
cout << ans << endl;
}
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
// cin >> T;
while (T--) solve();
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3732kb
input:
96 122100012110202022211102020101110122101010001012220001000222210100222112111020002212000222012022 010112102102202201211121022102211110211010101020001021100101110202100010112221022001101222101102
output:
0
result:
ok single line: '0'
Test #2:
score: -100
Wrong Answer
time: 0ms
memory: 3736kb
input:
100 2101120010010021010112120010111111212001120112101221211001111101012021111111211111110120002210111111 1010111101111111121211011101011101111111011201111110112110001211101110200102102020021011111121221102
output:
0
result:
wrong answer 1st lines differ - expected: '1', found: '0'