| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 639323 | NotLinux | Dijamant (COCI22_dijamant) | C++14 | 1086 ms | 340 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.
/**
* author: NotLinux
* created: 09.09.2022 ~ 14:09:50
**/
#include <bits/stdc++.h>
using namespace std;
#define int long long
#ifdef LOCAL
#include "/home/notlinux/debug.h"
#else
#define debug(x...) void(37)
#endif
int n,m;
vector < string > grid;
vector < vector < int > > vis1;
int cnt = 1e12;
int func(int x , int y){
set < int > ret;
vis1.assign(n , vector < int > (m , 0LL));
queue < pair < int , pair < int , int > > > bfs;
bfs.push({0,{x,y}});
while(bfs.size()){
int x = bfs.front().second.first;
int y = bfs.front().second.second;
int w = bfs.front().first;
bfs.pop();
if(x<0 or x>=n or y<0 or y>=m){
ret.insert(cnt);
cnt++;
continue;
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||