# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
541194 | Jomnoi | Crossing (JOI21_crossing) | C++17 | 222 ms | 14288 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define DEBUG 0
using namespace std;
const int N = 2e5 + 10;
const int P = 31;
const int MOD = 1e9 + 7;
string pat = "JOI";
long long bn[N], qs[N];
long long get_hash(string s) {
long long H = 0;
int n = s.length();
for(int i = 0; i < n; i++) {
H = (H * P + s[i]) % MOD;
}
return H;
}
string crossing(string s, string t) {
string res = "";
int n = s.length();
for(int i = 0; i < n; i++) {
if(s[i] == t[i]) {
res += s[i];
continue;
}
for(int j = 0; j < 3; j++) {
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |