# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
788096 | anton | Crossing (JOI21_crossing) | C++17 | 7044 ms | 3792 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;
const int MAX_N = 2*1e5;
int n, q, v[3][3], t[MAX_N][2];
bool is_set[3][3];
string s[3], r;
bool upd_val(int x, int y, int val){
if(!is_set[x][y]){
is_set[x][y] = true;
v[x][y] = val;
}
else{
if(v[x][y] != val){
return false;
}
}
return true;
}
signed main(){
cin>>n;
for(int i = 0; i<3; i++){
cin>>s[i];
}
# | 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... |