# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
948132 | akkshaysr | Tracks in the Snow (BOI13_tracks) | C++17 | 685 ms | 174884 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 fr first
#define se second
#define rep(i,a,b) for(int i = a; i < (b); ++i)
#define repr(i,a,b) for(int i = a; i > (b); --i)
#define sz(x) (int)(x).size()
#define all(x) (x).begin(),(x).end()
#define IN(i,l,r) (l<i&&i<r)
#define pb push_back
#define dbg(v) \
cout << "Line(" << __LINE__ << ") -> " << #v << " = " << (v) << endl;
using namespace std;
typedef pair<int,int> pi;
typedef vector<int> vi;
typedef long long ll;
int h,w;
const int U = 4002;
int grid[U][U],dist[U][U];
int dx[4] = {0,0,-1,1};
int dy[4] = {-1,1,0,0};
bool valid(int x,int y){
return IN(x,-1,h) && IN(y,-1,w) && grid[x][y]!=1;
}
int main(){
cin.tie(0)->sync_with_stdio(false);
cin >> h >> w;
rep(i,0,h){
rep(j,0,w){
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |