# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
420015 | Runtime_error_ | Crossing (JOI21_crossing) | C++14 | 950 ms | 28520 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.
//JOIOC 2021 p1 crossing
#include <bits/stdc++.h>
#define pb push_back
#define le node+node
#define ri node+node+1
#define mid (l+r)/2
#define all(v) v.begin(),v.end()
using namespace std;
const int inf = 2e5+2,lg = 10;
int n,k,q;
bool ans;
string s;
vector<string> v;
int pre[lg][3][inf];
char ss[inf];
int mp[99];
string in(){
scanf("%s",ss);
return string(ss);
}
string cross(string &a,string &b){
string ret = a;
for(int i=0;i<n;i++){
if(a[i] == b[i])
continue;
else if(a[i] != 'J' && b[i] != 'J')
ret[i]= 'J';
else if(a[i] != 'O' && b[i] != 'O')
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... |