# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
806851 | oscar1f | Maze (JOI23_ho_t3) | C++17 | 667 ms | 422176 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;
int nbLig,nbCol,tailleMouv,ligDeb,colDeb,ligFin,colFin,dist;
vector<pair<int,int>> adja;
vector<bool> temp;
vector<string> val;
vector<vector<bool>> dv,dejaMur;
vector<pair<int,int>> frontiere,nouv,mur;
string mot;
void propage(int lig,int col,int gratos) {
if (lig>=1 and lig<=nbLig and col>=1 and col<=nbCol and (gratos==1 or (val[lig][col]=='.' and dv[lig][col]==false))) {
dv[lig][col]=true;
nouv.push_back({lig,col});
for (auto a:adja) {
propage(lig+a.first,col+a.second,0);
}
}
}
void testMur(int lig,int col) {
if (lig>=1 and lig<=nbLig and col>=1 and col<=nbCol and dv[lig][col]==false and dejaMur[lig][col]==false) {
dejaMur[lig][col]=true;
mur.push_back({lig,col});
}
}
void etend(int lig,int col,int direc,int rest) {
if (lig>=1 and lig<=nbLig and col>=1 and col<=nbCol and dv[lig][col]==false and rest>0) {
# | 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... |
# | 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... |