# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
971438 | Acanikolic | Crossing (JOI21_crossing) | C++14 | 7102 ms | 13372 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 int long long
using namespace std;
const int P = 31;
const int mod = 1e9 + 7;
string resi(string a,string b) {
string res;
for(int i = 0; i < a.size(); i++) res += 'J';
for(int i = 1; i < a.size(); i++) {
if(a[i] == b[i]) res[i] = a[i];
else {
bool J = false,O = false,I = false;
if(a[i] == 'J' || b[i] == 'J') J = true;
if(a[i] == 'O' || b[i] == 'O') O = true;
if(a[i] == 'I' || b[i] == 'I') I = true;
if(!J) res[i] = 'J';
else if(!O) res[i] = 'O';
else res[i] = 'I';
}
}
return res;
}
int add(int a,int b) {
return (a + b) % mod;
Compilation message (stderr)
# | 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... |