# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1051789 | happy_node | Crossing (JOI21_crossing) | C++17 | 3057 ms | 20116 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>
using namespace std;
typedef long long ll;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
string JOI="JOI";
vector<ll> keys;
string merge(string a, string b) {
string c="";
for(int i=0;i<a.size();i++) {
if(a[i]==b[i]) c+=a[i];
else {
if(a[i]!='J' && b[i]!='J') c+='J';
if(a[i]!='O' && b[i]!='O') c+='O';
if(a[i]!='I' && b[i]!='I') c+='I';
}
}
return c;
}
const int MX=2e5+5, B=500, mod=998244353, P=1e9+7;
ll pw[MX], pf[MX];
ll getHash(string S) {
ll res=0;
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... |