# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
466039 | mariowong | Crossing (JOI21_crossing) | C++14 | 1229 ms | 23876 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 hmod 1223334444555553LL
using namespace std;
int sz,n,nowl,nowr,l[200005],r[200005],q,blk;
long long val,sum[505],ttl,b[200005],sumb[505],indx[200005],all[505],nowindx;
char c[10]={'a','J','O','I'},ch;
string s,str;
vector <string> v;
map <string,bool> a;
map <long long,bool> hashing;
void makestring(){
for (int i=0;i<v.size();i++){
for (int j=i+1;j<v.size();j++){
str.clear();
for (int k=0;k<n;k++){
if (v[i][k] != v[j][k]){
for (int l=1;l<=3;l++){
if (c[l] != v[i][k] && c[l] != v[j][k])
str+=c[l];
}
}
else
str+=v[i][k];
}
if (!a[str]){
v.push_back(str);
a[str]=true;
}
}
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... |