# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
818603 | vjudge1 | Crossing (JOI21_crossing) | C++17 | 7063 ms | 4208 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;
using ll = long long;
int n;
string T = "JOI";
string get(string a, string b) {
string res;
for(int i = 0; i < n; i++)
if(a[i] == b[i]) res += a[i];
else {
int k = 0;
while(T[k] == a[i] || T[k] == b[i]) k++;
res += T[k];
}
return res;
}
vector<string> st;
bool check(string s) {
for(string cur : st)
if(cur == s) return 1;
return 0;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
cin >> n;
string s[3];
# | 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... |